Variable neighborhood search for location routing - Université Polytechnique des Hauts-de-France Access content directly
Journal Articles Computers and Operations Research Year : 2013

Variable neighborhood search for location routing


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
No file

Dates and versions

hal-03594471 , version 1 (02-03-2022)



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



Gmail Facebook Twitter LinkedIn More