Skip to Main content Skip to Navigation
New interface
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
Contributor : TALBI El-Ghazali Connect in order to contact the contributor
Submitted on : Monday, December 4, 2017 - 2:38:10 PM
Last modification on : Tuesday, November 22, 2022 - 2:26:16 PM


  • HAL Id : hal-01654864, version 1



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



Record views