Abstract

China,Phone:+86-02982334426,e-mail:dwhu@chd.edu.cn) Abstract: The Location Routing Problem is the integrated decision of the Location Allocation Problem and the Vehicle Routing Problem. This paper will describe the location routing problem, set up the mathematical model of the problem, and test the model by Lingo 10.0. In view of this model’s NP hard attribute, the paper designs two-stage tabu search algorithms to solve this problem, i.e. in the first phase, solve the location allocation to fix on the facility and customer allocation; in the second phase, solve the vehicle routing problem by tabu search algorithms; at last, by a large number of iterative from location to routing phases, the optimal solution of the location routing problem can be obtained. The computed result shows the validity of the designed algorithm by comparing it with related literature.

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 call

Disclaimer: 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.