AN ALGORITHM FOR SOLVING LARGE CAPACITATED WAREHOUSE LOCATION-PROBLEMS

被引：84
|
作者：
BEASLEY, JE
机构：
[1] Imperial Coll, London, Engl, Imperial Coll, London, Engl
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1988年 / 33卷 / 03期
关键词：
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
相关论文
共 50 条
12345