Skip to Main content Skip to Navigation
Journal articles

Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows

Huggo Silva Ferreira 1 Eduardo Theodoro Bogue 2, 1 Thiago Noronha 1 Slim Belhaiza 3 Christian Prins 4
1 UFMG - Universidade Federal de Minas Gerais [Belo Horizonte]
2 UFMS - Universidade Federal de Mato Grosso do Sul
3 KFUPM - King Fahd University of Petroleum and Minerals
4 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
ICD - Institut Charles Delaunay
Abstract : The Vehicle Routing Problem (VRP) with Multiple Time Windows is a generalization of VRP, where the customers have one or more time windows in which they can be visited. The best heuristic in the literature is a Hybrid Variable Neighborhood Tabu Search (HVNTS) that mostly deals with infeasible solutions, because it is assumed that one may not reach some regions of the search space without passing through infeasible solutions. In this short paper, we propose a simpler Variable Neighborhood Search heuristic where all the computational effort is spent on searching for feasible solutions. Computational experiments showed that the proposed heuristic is competitive with the best heuristic in the literature.
Keywords : Multiple Time Windows Variable Neighborhood Search Vehicle Routing Problem
Document type :
Journal articles
Complete list of metadata
https://hal-utt.archives-ouvertes.fr/hal-02525237
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Monday, March 30, 2020 - 6:33:38 PM
Last modification on : Friday, August 27, 2021 - 3:14:08 PM

Identifiers

Collections

TDS-MACS | UTT | CNRS

Citation

Huggo Silva Ferreira, Eduardo Theodoro Bogue, Thiago Noronha, Slim Belhaiza, Christian Prins. Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows. Electronic Notes in Discrete Mathematics, Elsevier, 2018, 66, pp.207-214. ⟨10.1016/j.endm.2018.03.027⟩. ⟨hal-02525237⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

29