Skip to Main content Skip to Navigation
Conference papers

Variable neighborhood search for the location routing problem with multiple routes

Abstract : We address a variant of the Location Routing Problem (LRP) where vehicles can perform several routes in the same planning period and both depots and vehicles have capacities. This problem represents a combination of two NP-hard problems: a vehicle routing problem, which determines the optimal set of routes to fulfill the demands of a set of customers, and a location problem, as the depots from which the vehicles performing the routes can be associated must be chosen from a set of possible locations. We propose a Variable Neighborhood Search (VNS) metaheuristic to solve this problem, and report on preliminary computational experiments conducted on a set of instances from the literature. To the best of our knowledge, this is the first time that a VNS based heuristic is proposed for solving this variant of the LRP.
Document type :
Conference papers
Complete list of metadata
Contributor : Kathleen TORCK Connect in order to contact the contributor
Submitted on : Thursday, December 9, 2021 - 5:12:16 PM
Last modification on : Wednesday, March 9, 2022 - 4:06:02 PM


  • HAL Id : hal-03473141, version 1



Rita Macedo, Said Hanafi, Bassem Jarboui, Nenad Mladenovic, Claudio Alves, et al.. Variable neighborhood search for the location routing problem with multiple routes. International Conference on Industrial Engineering and Systems Management, Oct 2013, Rabat, Morocco. ⟨hal-03473141⟩



Record views