Matheuristics for a VRPTW with competence constraints

El-Ghazali Talbi 1, 2, 3, 4 Nicolas Dupin 5
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. Matheuristics for a VRPTW with competence constraints (PDF Download Available). Available from: https://www.researchgate.net/publication/318340273_Matheuristics_for_a_VRPTW_with_competence_constraints [accessed Dec 11 2017].
Type de document :
Communication dans un congrès
MIC’2017 - Metaheuristics International Conference, Jul 2017, Barcelone, Spain
Liste complète des métadonnées

https://hal.inria.fr/hal-01654864
Contributeur : Talbi El-Ghazali <>
Soumis le : lundi 4 décembre 2017 - 14:38:10
Dernière modification le : jeudi 11 janvier 2018 - 06:28:16

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

31