Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Discrete Mathematics Year : 2018

Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows

(1) , (2, 1) , (1) , (3) , (4)
1
2
3
4

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.
Not file

Dates and versions

hal-02525237 , version 1 (30-03-2020)

Identifiers

Cite

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, 2018, 66, pp.207-214. ⟨10.1016/j.endm.2018.03.027⟩. ⟨hal-02525237⟩
20 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More