HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01654864
Contributor : Talbi El-Ghazali Connect in order to contact the contributor
Submitted on : Monday, December 4, 2017 - 2:38:10 PM
Last modification on : Wednesday, March 23, 2022 - 3:51:17 PM

Identifiers

  • HAL Id : hal-01654864, version 1

Collections

Citation

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

Share

Metrics

Record views

158