Matheuristics for a VRPTW with competence constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Matheuristics for a VRPTW with competence constraints

Abstract

This paper considers a variant of the multiple depot Vehicle Routing Problem with Time Windows where skill constraints define the places that vehicles can visit. A difficulty faced here is that the special set of instances are highly constrained, due to tight skill and time window constraints. This induced a matheuristic approach, combining advantages of MIP exact approaches with constructive and local search heuristics. A first work furnishes matheuristics based on compact MIP formulation works. Then, a column generation scheme is developed, using previous work to solve subproblems generating aggressively multiple columns. The resulting column generation heuristic outperforms significantly the previous matheuristics.
No file

Dates and versions

hal-01654864 , version 1 (04-12-2017)

Identifiers

  • HAL Id : hal-01654864 , version 1

Cite

El-Ghazali Talbi, Nicolas Dupin. Matheuristics for a VRPTW with competence constraints. MIC 2017 - Metaheuristics International Conference, Jul 2017, Barcelone, Spain. ⟨hal-01654864⟩
161 View
0 Download

Share

Gmail Facebook X LinkedIn More