Empirical analysis of two different metaheuristics for real-world vehicle routing problems

Authors:
Tonči Carić;Juraj Fosin;Ante Galić;Hrvoje Gold;Andreas Reinholz
Affiliations:
Faculty of Transport and Traffic Sciences, University of Zagreb, Zagreb, Croatia;Faculty of Transport and Traffic Sciences, University of Zagreb, Zagreb, Croatia;Faculty of Transport and Traffic Sciences, University of Zagreb, Zagreb, Croatia;Faculty of Transport and Traffic Sciences, University of Zagreb, Zagreb, Croatia;University of Dortmund, Dortmund, Germany
Venue:
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Year:
2007

Citing 6
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science

Solving real-world vehicle routing problems with time windows using virus evolution strategy

International Journal of Knowledge-based and Intelligent Engineering Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.