Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
