Matheuristics for a VRPTW with competence ...
Type de document :
Communication dans un congrès avec actes
Titre :
Matheuristics for a VRPTW with competence constraints
Auteur(s) :
Talbi, El-Ghazali [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Dupin, Nicolas [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Dupin, Nicolas [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Titre de la manifestation scientifique :
MIC 2017 - Metaheuristics International Conference
Ville :
Barcelone
Pays :
Espagne
Date de début de la manifestation scientifique :
2017-07-04
Discipline(s) HAL :
Informatique [cs]
Computer Science [cs]/Operations Research [math.OC]
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :