A bi-level programming model for location of commodity exchange markets

被引:0
作者
Li, Ling-ying [1 ]
Qiao, Zhong [1 ]
机构
[1] China Agr Univ, Coll Econ & Management, Beijing 100083, Peoples R China
来源
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON GAME THEORY AND APPLICATIONS | 2007年
关键词
bi-level programming; commodity exchange markets; heuristic algorithm; location;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The objectives of commodity exchange market location problem and shortcomings of the available programming models are analyzed. In this paper, by considering benefits of customers and planning departments of commodity exchange markets, a bi-level programming model is presented to seek the optimal location for commodity exchange markets. The upper level problem is to maximize the gross benefit from the terms of decision makers by taking account of the relationships of the total cost for building commodity exchange markets and user demand. The lower level describes the users' choice behavior. The users choose commodity exchange markets corresponding to the biggest utility. Aiming at the model, a heuristic algorithm is designed; the feasibility of the model and algorithm is also verified by a calculation example.
引用
收藏
页码:101 / 105
页数:5
相关论文
共 23 条
[1]   FACILITY LOCATION MODELS FOR DISTRIBUTION PLANNING [J].
AIKENS, CH .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (03) :263-279
[2]   A GENERAL BILEVEL LINEAR-PROGRAMMING FORMULATION OF THE NETWORK DESIGN PROBLEM [J].
BENAYED, O ;
BOYCE, DE ;
BLAIR, CE .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1988, 22 (04) :311-318
[3]  
GAO Z, 2000, CONTINUOUS EQUILIBRI, P23
[4]  
Gao Z.Y., 2004, J TRANSPORTATION SYS, V4, P36
[5]   Solution algorithm for the bi-level discrete network design problem [J].
Gao, ZY ;
Wu, JJ ;
Sun, HJ .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (06) :479-495
[6]   Exact solution methods for uncapacitated location problems with convex transportation costs [J].
Holmberg, K .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (01) :127-140
[7]  
KLOSE A, 1996, USING CLUSTERING MET
[8]  
LI E, 2004, J SYSTEMS ENG, V19, P9
[9]  
LU ZQ, COMPUTERS OPERATIONS, V34, P299
[10]   Combined location-routing problems: A synthesis and future research directions [J].
Min, H ;
Jayaraman, V ;
Srivastava, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 108 (01) :1-15