Matheuristics for a VRPTW with competence ...
Document type :
Communication dans un congrès avec actes
Title :
Matheuristics for a VRPTW with competence constraints
Author(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]
Conference title :
MIC 2017 - Metaheuristics International Conference
City :
Barcelone
Country :
Espagne
Start date of the conference :
2017-07-04
HAL domain(s) :
Informatique [cs]
Computer Science [cs]/Operations Research [math.OC]
Computer Science [cs]/Operations Research [math.OC]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :