A HEURISTIC SOLUTION TO THE WAREHOUSE LOCATION-ROUTING PROBLEM

被引：72

作者：

HANSEN, PH ^{[1
]}

HEGEDAHL, B ^{[1
]}

HJORTKJAER, S ^{[1
]}

OBEL, B ^{[1
]}

机构：

[1] ODENSE UNIV, DEPT MANAGEMENT, DK-5230 ODENSE, DENMARK

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 76卷 / 01期

关键词：

WAREHOUSE LOCATION; ROUTING; HEURISTIC ALGORITHM; MULTI-DEPOTS; ALLOCATION;

D O I：

10.1016/0377-2217(94)90010-8

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents a method which efficiently solves the Modified Warehouse Location-Routing Problem. The heuristic method is based on Perl (1983) and Perl and Daskin (1985) but is more efficient in two important ways. First, the method has been implemented on a PC and is very fast. Second, it presents solutions in a forms that can be accepted by the user. Considerable efforts have been made to make sure that no unrealistic solutions are presented even if their solution values seem acceptable. This work is based on Perl (1983) and Daskin (1985). Perl formulated the Modified Warehouse Location-Routing Problem (MWLRP) which introduced routing in the Multi Depot Location Problem. Perl also developed a heuristic approach to solve the complicated MWLRP problem.

引用

页码：111 / 127

页数：17

共 33 条

[11] HEURISTIC ALGORITHM FOR VEHICLE-DISPATCH PROBLEM [J].