Authors: Macedo, Rita
Hanafi, Saïd
Jarboui, Bassem
Mladenović, Nenad 
Alves, Cláudio
De Carvalho, J. M.Valério
Title: Variable neighborhood search for the location routing problem with multiple routes
Journal: Proceedings of 2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013
Conference: International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013; Rabat; Morocco; 28 October 2013 through 30 October 2013
Issue Date: 1-Jan-2013
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.
Publisher: IEEE

Show full item record


checked on May 17, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.