A cellular heuristic for the multisource Weber problem

被引:25
作者
Gamal, MDH [1 ]
Salhi, S [1 ]
机构
[1] Univ Birmingham, Management Math Grp, Sch Math & Stat, Birmingham B15 2TT, W Midlands, England
关键词
heuristic; location; continuous space; discrete approximation;
D O I
10.1016/S0305-0548(02)00095-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The multisource location-allocation problem in the continuous space is investigated. A learning scheme which uses previous solutions to discretise the continuous space into well-defined cells is proposed. This cells-based technique takes into account frequency of occurrence of already found configurations as well as the compatibility of these configurations. Some results on existing test problems are presented.
引用
收藏
页码:1609 / 1624
页数:16
相关论文
共 14 条
[1]  
[Anonymous], EUROPEAN J OPERATION
[2]   A PROJECTION METHOD FOR L(P) NORM LOCATION-ALLOCATION PROBLEMS [J].
BONGARTZ, I ;
CALAMAI, PH ;
CONN, AR .
MATHEMATICAL PROGRAMMING, 1994, 66 (03) :283-312
[3]   Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem [J].
Brimberg, J ;
Hansen, P ;
Mladenovic, N ;
Taillard, ED .
OPERATIONS RESEARCH, 2000, 48 (03) :444-460
[4]  
Brimberg J., 1996, STUDIES LOCATIONAL A, V8, P23
[5]  
Brimberg J., 1996, STUD LOCATIONAL ANAL, V10, P1
[6]   LOCATION-ALLOCATION PROBLEMS [J].
COOPER, L .
OPERATIONS RESEARCH, 1963, 11 (03) :331-343
[7]   HEURISTIC METHODS FOR LOCATION-ALLOCATION PROBLEMS .1. INTRODUCTION [J].
COOPER, L .
SIAM REVIEW, 1964, 6 (01) :37-&
[8]  
Eilon S, 1971, Distribution management
[9]   Constructive heuristics for the uncapacitated continuous location-allocation problem [J].
Gamal, MDH ;
Salhi, S .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (07) :821-829
[10]   Heuristic solution of the multisource Weber problem as a p-median problem [J].
Hansen, P ;
Mladenovic, N ;
Taillard, E .
OPERATIONS RESEARCH LETTERS, 1998, 22 (2-3) :55-62