Authors: Jarboui, Bassem
Derbel, Houda
Hanafi, Saïd
Mladenović, Nenad 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Variable neighborhood search for location routing
Journal: Computers and Operations Research
Volume: 40
Issue: 1
First page: 47
Last page: 57
Issue Date: 1-Jan-2013
Rank: M21
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.05.009
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.
Keywords: Heuristic | Location - routing | Variable neighborhood search
Publisher: Elsevier

Show full item record


checked on May 19, 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.