Authors: Derbel, Houda
Jarboui, Bassem
Chabchoub, Habib
Hanafi, Saïd
Mladenović, Nenad 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A variable neighborhood search for the capacitated location-routing problem
Journal: 2011 4th International Conference on Logistics, LOGISTIQUA'2011
First page: 514
Last page: 519
Conference: 4th International Conference on Logistics, LOGISTIQUA'2011; Hammamet; Tunisia; 31 May 2011 through 3 June 2011
Issue Date: 3-Aug-2011
ISBN: 978-1-457-70324-9
DOI: 10.1109/LOGISTIQUA.2011.5939452
Abstract: 
In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.
Keywords: location routing problem | variable neighborhood search
Publisher: IEEE

Show full item record

SCOPUSTM   
Citations

14
checked on Apr 14, 2021

Page view(s)

7
checked on Apr 15, 2021

Google ScholarTM

Check

Altmetric

Altmetric


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