AN ALGORITHM FOR SOLVING LARGE CAPACITATED WAREHOUSE LOCATION-PROBLEMS

被引:86
作者
BEASLEY, JE
机构
[1] Imperial Coll, London, Engl, Imperial Coll, London, Engl
关键词
COMPUTER PROGRAMMING - Algorithms - INDUSTRIAL PLANTS - Location - MATHEMATICAL PROGRAMMING;
D O I
10.1016/0377-2217(88)90175-0
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we present a lower bound for the capacitated warehouse location problem based upon lagrangean relaxation of a mixed-integer formulation of the problem. Feasible solution exclusion constraints are used together with problem reduction tests derived from both the original problem and the lagrangean relaxation. By incorporating the lower bound and the reduction tests into a tree search procedure we are able to solve problems involving up to 500 potential warehouse locations and 1000 customers.
引用
收藏
页码:314 / 325
页数:12
相关论文
共 25 条
[1]   FACILITY LOCATION MODELS FOR DISTRIBUTION PLANNING [J].
AIKENS, CH .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (03) :263-279
[2]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[5]   A HEURISTIC LAGRANGEAN ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM [J].
BARCELO, J ;
CASANOVAS, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (02) :212-226
[6]  
BARCELO J, 1985, RR8506 U POL BARC DE
[7]   A SEARCH TREE ALGORITHM FOR PLANT LOCATION-PROBLEMS [J].
BARTEZZAGHI, E ;
COLORNI, A ;
PALERMO, PC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 7 (04) :371-379
[8]   INVERSE OPTIMIZATION - AN APPLICATION TO THE CAPACITATED PLANT LOCATION PROBLEM [J].
BITRAN, GR ;
CHANDRU, V ;
SEMPOLINSKI, DE ;
SHAPIRO, JF .
MANAGEMENT SCIENCE, 1981, 27 (10) :1120-1141
[9]   PIVOTING IN TRANSPORTATION CODES [J].
BRANMAN, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1978, 2 (05) :377-378
[10]   EXTENSIONS TO A LAGRANGEAN RELAXATION APPROACH FOR THE CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
CHRISTOFIDES, N ;
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (01) :19-28