| Article ID: | iaor199653 |
| Country: | Netherlands |
| Volume: | 76 |
| Issue: | 1 |
| Start Page Number: | 111 |
| End Page Number: | 127 |
| Publication Date: | Jul 1994 |
| Journal: | European Journal of Operational Research |
| Authors: | Hansen P.H., Hegedahl B., Hjortkjar S., Obel B. |
| Keywords: | vehicle routing & scheduling, heuristics |
This paper presents a method which efficiently solves the Modified Warehouse Location-Routing Problem. The heuristic method is based on Perl and Perl and Daskin 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 form 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 and Daskin. 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.