Metaheuristics to solve some variants of vehicle routing problems

Metaheuristics to solve some variants of vehicle routing problems. This book investigates an optimization problem concerning the distribution management in the supply chain. EUCHI address the Vehicle Routing Problems (VRP) with Heterogeneous Limited Fleet, through the development of resolution strategies with heuristic methods. Taking into account capacity constraints and the limited number of heterogeneous fleet of vehicles available, we studied three variants of vehicle routing problems: the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP), the Vehicle Routing Problem with Private fleet and common Carrier (VRPPC) and the Dynamic Vehicle Routing Problem (DVRP). We have applied Tabu search algorithms, evolutionary algorithms and ant colony algorithm to provide effective solutions to these problems.

Autorentext

Dr. Jalel Euchi completed his PhD in 2011. He prepared his book as co-supervised at the University of LeHavre in France. His primary research interests are in vehicle routing, meta-heuristics algorithms, operations research, and logistics. He participated to different conferences and he was the corresponding author in several published papers.