COBRA:: a new formulation of the classic p-median location problem

被引:44
作者
Church, RL [1 ]
机构
[1] Univ Calif Santa Barbara, Dept Geog, Santa Barbara, CA 93106 USA
[2] Univ Calif Santa Barbara, Natl Ctr Geog Informat & Anal, Santa Barbara, CA 93106 USA
关键词
p-median problem; facility location; reformulation; integer optimization;
D O I
10.1023/A:1026142406234
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The p-median problem was first formulated as an integer-linear programming problem by ReVelle and Swain (1970) and further revised by Rosing, ReVelle and Rosing-Vogelaar (1979). These two forms have withstood the test of time, as they have been used by virtually everyone since then. We prove that a property associated with geographical proximity makes it possible to eliminate many of the model variables through a substitution process. This new substitution technique has resulted in the elimination of up to 60% of the variables needed in either of these classic model formulations.
引用
收藏
页码:103 / 120
页数:18
相关论文
共 28 条
[21]   Heuristic concentration: Two stage solution construction [J].
Rosing, KE ;
ReVelle, CS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 97 (01) :75-86
[22]  
RUGGLES A, 1994, ANTHR SPACE GEOGRAPH
[23]  
SORENSEN PA, 1996, GEOGRAPHICAL SYSTEMS, V3, P221
[24]   HEURISTIC METHODS FOR ESTIMATING GENERALIZED VERTEX MEDIAN OF A WEIGHTED GRAPH [J].
TEITZ, MB ;
BART, P .
OPERATIONS RESEARCH, 1968, 16 (05) :955-&
[25]  
WATERS N, 1996, COMMUNICATION
[26]   A MEDIAN LOCATION MODEL WITH NONCLOSEST FACILITY SERVICE [J].
WEAVER, JR ;
CHURCH, RL .
TRANSPORTATION SCIENCE, 1985, 19 (01) :58-74
[27]   A TIGHT BOUND DROP EXCHANGE ALGORITHM FOR SOLVING THE P-MEDIAN PROBLEM [J].
WHITAKER, RA .
ENVIRONMENT AND PLANNING A-ECONOMY AND SPACE, 1981, 13 (06) :669-680
[28]  
[No title captured]