Low Cost Parallel Solutions for the VRPTW Optimization Problem

Authors:
Clemente Rodriguez
Affiliations:
-
Venue:
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Year:
2001

Citing 0
Cited 6

A real fuel distribution problem solved by a two phase parallel algorithm that combines simulated annealing and route building heuristics

International Journal of Hybrid Intelligent Systems
Co-operative, parallel simulated annealing for the VRPTW

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
Frequency of co-operation of parallel simulated annealing processes

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Nesting OpenMP in MPI to implement a hybrid communication method of parallel simulated annealing on a cluster of SMP nodes

PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Ant colony system for optimizing vehicle routing problem with time windows (VRPTW)

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Load balanced parallel simulated annealing on a cluster of SMP nodes

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: In the paper a parallelizable system based on Simulated Annealing to solve VRPTW problems is described. The system consists of two optimization phases: a global one, a the local one, both based on Simulated Annealing and paralllizable. For the first phase different parallelization strategies are presented and evaluated. The importance of the co-operation among processors has been made clear: the communication of partial solutions improves the efficiency of optimal solution's search. Two algorithms, a synchronous one and an asynchronous one, stand out due to their good average behaviour related to the quality of solutions found, and due to their stability when augmenting the number of processors. The second phase has shown to be a great complement of the global search that permits to obtain a very fast and practical, low cost parallel system. This system has been able to reach the optimal solution published for the Solomon's benchmark in an 85% of the problems, and more important, the averages of any set of random executions are less than 5% worse than the best published.