Authors: Macedo, Rita
Alves, Cláudio
Hanafi, Saïd
Jarboui, Bassem
Mladenović, Nenad 
Ramos, Bruna
Valério De Carvalho, J. M.
Title: Skewed general variable neighborhood search for the location routing scheduling problem
Journal: Computers and Operations Research
Volume: 61
First page: 143
Last page: 152
Issue Date: 1-Sep-2015
Rank: M21
ISSN: 0305-0548
DOI: 10.1016/j.cor.2015.03.011
The integrated location routing scheduling problem is a variant of the well-known location routing problem. The location routing problem consists in selecting a set of depots to open and in building a set of routes from these depots, to serve a set of customers at minimum cost. In this variant, a vehicle can perform more than a single route in the planning period. As a consequence, the routes have to be scheduled within the workdays of each vehicle. The problem arises typically when routes are constrained to have a short duration. It happens for example within the boundaries of small geographic areas or in the transportation of perishable goods. In this paper, we propose a skewed general variable neighborhood search based heuristic to solve it. The algorithm is tested extensively and we show that it is efficient and provides the proven optimal solution in a significant number of cases. Moreover, it clearly outperforms a multi-start VND based heuristic that uses the same neighborhood structures.
Keywords: Location | Routing | Scheduling | Variable neighborhood search
Publisher: Elsevier
Project: Programa Operacional Factores de Competitividade - COMPETE
National funding through the Portuguese Science and Technology Foundation (FCT), Project PTDC/EGE-GES/116676/2010
RSF, Grant 14-41-00039

Show full item record


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