Three Parallel Algorithms for Simulated Annealing
A vehicle routing problem which reduces to an NP-complete set-partitioning problem is considered. Three parallel algorithms for simulated annealing, i.e. the independent, semi-independent and co-operating searches are investigated. The objective is to improve the accuracy of solutions to the problem by applying parallelism. The accuracy of a solution is meant as its proximity to the optimum solution. The empirical evidence supported by the statistical analysis indicate that co-operation of processes in parallel simulated annealing yields more accurate solutions to the vehicle routing problem as compared to the case when the processes run independently or semi-independently.
KeywordsVehicle routing problem set-partitioning problem parallel simulated annealing algorithms message passing model of parallel computation
Unable to display preview. Download preview PDF.
- 1.Aarts, E.H.L., and Korst, J.H.M., Simulated annealing and Boltzmann machines, Wiley, Chichester, 1989.Google Scholar
- 2.Altinkemer, K., Gavish, Parallel savings based heuristics for the delivery problem, Operations Research 39,3 (May-June 1991), 456–469.Google Scholar
- 3.Azencott, R., Parallel simulated annealing: An overview of basic techniques, in Azencott, R. (Ed.), Simulated annealing. Parallelization techniques, J. Wiley, NY, (1992), 37–46.Google Scholar
- 8.Czech, Z.J., Parallel simulated annealing for the delivery problem, Proc. of the 9th Euromicro Workshop on Parallel and Distributed Processing, Mantova, Italy, (February 7–9, 2001), 219–226.Google Scholar
- 10.Graffigne, C., Parallel annealing by periodically interacting multiple searches: An experimental study, in Azencott, R. (Ed.), Simulated annealing. Parallelization techniques, J. Wiley, NY, (1992), 47–79.Google Scholar
- 15.Reeves, C.R., (Ed.) Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1995.Google Scholar