Low cost parallel solutions for the VRPTW optimisation problem
by Olatz Arbelaitz, Clemente Rodriguez
International Journal of Computational Science and Engineering (IJCSE), Vol. 1, No. 2/3/4, 2005

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.

Online publication date: Fri, 05-May-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com