Low cost parallel solutions for the VRPTW optimisation problem

Authors:
Olatz Arbelaitz;Clemente Rodriguez
Affiliations:
Department of Computer Architecture and Technology, University of the Basque Country, M. Lardizabal, 1, 20018 Donostia, Spain.;Department of Computer Architecture and Technology, University of the Basque Country, M. Lardizabal, 1, 20018 Donostia, Spain
Venue:
International Journal of Computational Science and Engineering
Year:
2005

Citing 3
Cited 0

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
Solving real-life vehicle routing problems efficiently using tabu search

Annals of Operations Research - Special issue on Tabu search

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a two phase system (global optimisation and local optimisation) to solve VRPTW problems is described; both phases are based on Simulated Annealing and parallelised. For the first phase, different parallelisation strategies are presented and evaluated. Two algorithms, a synchronous one and an asynchronous one, stand out due to their good average behaviour. The second phase permits very fast improvement of the solutions, adding efficiency to the system. This system has been able to reach the optimal solution published for the Solomon's benchmark in 85% of the problems, and more importantly, the averages of any set of random executions are less than 5% inferior to the best published.