Skip to Main content Skip to Navigation
Journal articles

Variable neighborhood search for location routing

Abstract : In this paper we propose various neighborhood search heuristics (VNS) for solving the location routing problem with multiple capacitated depots and one uncapacitated vehicle per depot. The objective is to find depot locations and to design least cost routes for vehicles. We integrate a variable neighborhood descent as the local search in the general variable neighborhood heuristic framework to solve this problem. We propose five neighborhood structures which are either of routing or location type and use them in both shaking and local search steps. The proposed three VNS methods are tested on benchmark instances and successfully compared with other two state-of-the-art heuristics
Document type :
Journal articles
Complete list of metadata
Contributor : Aurélien Vicentini Connect in order to contact the contributor
Submitted on : Wednesday, March 2, 2022 - 4:22:22 PM
Last modification on : Tuesday, August 30, 2022 - 5:03:01 PM




Bassem Jarboui, Houda Derbel, Said Hanafi, Nenad Mladenovic. Variable neighborhood search for location routing. Computers and Operations Research, Elsevier, 2013, 40 (1), pp.47-57. ⟨10.1016/j.cor.2012.05.009⟩. ⟨hal-03594471⟩



Record views