Skip to Main content Skip to Navigation
Journal articles

Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows

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.
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02525237
Contributor : Daniel Gavrysiak <>
Submitted on : Monday, March 30, 2020 - 6:33:38 PM
Last modification on : Tuesday, March 31, 2020 - 2:01:11 AM

Identifiers

Collections

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⟩

Share

Metrics

Record views

21