Abstract

The location routing problem combines location and routing decisions. Generally, the objective is to minimize the opening costs for the used depots, the fixed cost associated with the used vehicles and traveling costs spent in serving all customers. This paper presents a heuristic method permits to solve the capacitated location-routing problem (CLRP). A first phase executes a self-organizing map (SOM) to find the location of depots and assigning the customers to each depot. In a second phase, a Vehicle Routing Problem (VRP) is solved for each cluster using Sweep algorithm. Numerical results assess the higher performance of our method presented in this paper and demonstrate its efficiency in solving the instances with large size.

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.