Skip to Main content Skip to Navigation
Journal articles

Skewed general variable neighborhood search for the location routing scheduling problem

Abstract : 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. [ABSTRACT FROM AUTHOR]
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01592785
Contributor : Romain Boisselet <>
Submitted on : Monday, September 25, 2017 - 1:52:13 PM
Last modification on : Monday, May 4, 2020 - 11:50:04 AM

Identifiers

Citation

Rita Macedo, Claudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, et al.. Skewed general variable neighborhood search for the location routing scheduling problem. Computers and Operations Research, Elsevier, 2015, 61, pp.143-152. ⟨10.1016/j.cor.2015.03.011⟩. ⟨hal-01592785⟩

Share

Metrics

Record views

174