Variable neighborhood search for location routing

Bassem Jarboui (1) , Houda Derbel (1) , Said Hanafi (2) , Nenad Mladenovic (3, 4)

1 FSEGS
2 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201
3 Brunel University London
4 SANU - Mathematical Institute of the Serbian Academy of Sciences and Arts

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

Mots clés: "Heuristic"; "Location - routing"; "Variable neighborhood search"

Domaines: Informatique [cs]

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⟩