Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems

We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Windows. Both hybrid Metaheuristics are based on the same neighborhood generating operators and local search procedures. The initial solutions are obtained by the Coefficient Weighted Distance Time Heuristics with automated parameter tuning. The strategies are compared in an empirical study on four real-world problems. A performance measure is used that also considers multiple restarts of the algorithms.

• Type: Conference
• Year: 2007
• Where: HM
• Authors: Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold, Andreas Reinholz
• Keywords: HM 2007, Hybrid Metaheuristics, Hybrid Simulated Annealing, Local Search, Optimization