Location of congested capacitated facilities with distance-sensitive demand

被引:34
作者
Berman, O
Drezner, Z
机构
[1] Univ Toronto, Joseph L Rotman Sch Management, Toronto, ON M5S 3E6, Canada
[2] Calif State Univ Fullerton, Dept Management Sci Informat Syst, Fullerton, CA 92834 USA
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1080/07408170500288190
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper we investigate the problem of locating a given number of facilities on a network. Demand generated at a node is distance dependent, i.e., it decreases with an increase in the distance. The facilities can serve no more than a given number of customers, thus they are capacitated and congested when they reach that limit. The objective function is to maximize the demand satisfied by the system given these constraints. An elegant solution is given for the location of one facility. The multiple facility problem is formulated and heuristic algorithms proposed for its solution. Computational experiments are reported.
引用
收藏
页码:213 / 221
页数:9
相关论文
共 24 条
[1]  
[Anonymous], 1997, Tabu Search
[2]   A new method for solving capacitated location problems based on a set partitioning approach [J].
Baldacci, R ;
Hadjiconstantinou, E ;
Maniezzo, V ;
Mingozzi, A .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (04) :365-386
[3]   OR-LIBRARY - DISTRIBUTING TEST PROBLEMS BY ELECTRONIC MAIL [J].
BEASLEY, JE .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1990, 41 (11) :1069-1072
[4]  
BERMAN O, 1987, INT J PROD RES, V25, P1773
[5]  
Berman O, 2002, FACILITY LOCATION APPLICATIONS AND THEORY, P329
[6]   Locating multiple competitive facilities: Spatial interaction models with variable expenditures [J].
Berman, O ;
Krass, D .
ANNALS OF OPERATIONS RESEARCH, 2002, 111 (1-4) :197-225
[7]  
Berman O., 1998, Location Science, V6, P41, DOI 10.1016/S0966-8349(98)00047-3
[8]  
BERMAN O, 2005, IN PRESS IIE T SCHED
[9]  
BERMAN O, 2005, IN PRESS J OPERATION
[10]  
BERMAN O, 1981, DECISION SCI, V12, P623