Special Issue "Metaheuristics for Rich Vehicle Routing Problems"
Résumé
Vehicle routing problems (VRPs) represent a rapidly growing research domain in operations research and combinatorial optimization, aiming to develop mathematical models and efficient solution methods. As underlined by Laporte (2009), VRPs are nice laboratory-problems to test new ideas in algorithmics and optimization. Recent trends try to tackle rich VRPs, i.e., problems including many real-word constraints and requiring metaheuristics to solve the large instances met in practice.