A fixed routes location problem and its algorithm

被引:0
作者
Hao, ZF [1 ]
Feng, LG [1 ]
Xu, Y [1 ]
Yang, DG [1 ]
机构
[1] S China Univ Technol, Dept Appl Math, Canton 510640, Peoples R China
来源
TRAFFIC AND TRANSPORTATION STUDIES | 2000年
关键词
D O I
暂无
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
The problem of a fixed routes location with restricted conditions is very important in service of transport plan. This paper presents an improved quasi-physical model of location. The following object function is established max F(x, y) = (i=1)Sigma (n) g(1) (x, y).nu (l) = (i=1)Sigma (n)v(f)/1+(j=1)Sigma (m)(Di/d(if))(k) This model is more reasonable and more variable than former model. It can solve the situation when there exist more than one existing location. It supplies scientific foundation fur the location decision.
引用
收藏
页码:319 / 324
页数:6
相关论文
共 50 条
[11]   AN APPROXIMATIVE ALGORITHM FOR FIXED CHARGE PROBLEM [J].
DENZLER, DR .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1969, 16 (03) :411-&
[12]   A heuristic algorithm for the fixed charge problem [J].
Adlakha V. ;
Kowalski K. .
OPSEARCH, 2010, 47 (2) :166-175
[13]   Ant algorithm for constrained location problem [J].
Qiu, Mojie ;
Ma, Liang .
Shanghai Ligong Daxue Xuebao/Journal of University of Shanghai for Science and Technology, 2000, 22 (03) :217-220
[14]   A SIMPLIFIED ALGORITHM FOR THE DEPOT LOCATION PROBLEM [J].
GIZELIS, AG ;
SAMOUILIDIS, JE .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1980, 8 (04) :465-472
[15]   AN ALGORITHM FOR SOLVING THE WAREHOUSE LOCATION PROBLEM [J].
KRETSCHMER, KS .
OPERATIONS RESEARCH, 1958, 6 (04) :634-634
[16]   A fast algorithm for facility location problem [J].
Shu, Wenhao .
Journal of Software, 2013, 8 (09) :2360-2366
[17]   HEURISTIC ALGORITHM FOR TRANSPORTATION LOCATION PROBLEM [J].
COOPER, L .
OPERATIONS RESEARCH, 1975, 23 :B295-B295
[18]   A genetic algorithm for supermarket location problem [J].
Alnahhal, Mohammed ;
Noche, Bernd .
ASSEMBLY AUTOMATION, 2015, 35 (01) :122-127
[19]   FIXED ROUTES [J].
BEASLEY, JE .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1984, 35 (01) :49-55