PPAM 2005: Parallel Processing and Applied Mathematics pp 43-50 | Cite as
Frequency of Co-operation of Parallel Simulated Annealing Processes
Conference paper
Abstract
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is considered. The objective is to investigate how the frequency of co-operation of parallel simulated annealing processes influences the quality of solutions to the problem. The quality of a solution is measured by its proximity to the optimum solution.
Keywords
Parallel simulated annealing frequency of co-operation of parallel processes vehicle routing problem with time windows bicriterion optimizationPreview
Unable to display preview. Download preview PDF.
References
- 1.Arbelaitz, O., Rodriguez, C., Zamakola, I.: Low cost parallel solutions for the VRPTW optimization problem. In: Proceedings of the International Conference on Parallel Processing Workshops (2001)Google Scholar
- 2.Azencott, R. (ed.): Simulated annealing. Parallelization techniques. J. Wiley, NY (1992)MATHGoogle Scholar
- 3.Czarnas, P., Czech, Z.J., Gocyla, P.: Parallel simulated annealing for bicriterion optimization problems. In: Proc. of the 5th International Conference on Parallel Processing and Applied Mathematics (PPAM 2003), Czȩstochowa, Poland, September 7–10, 2003, pp. 233–240 (2003)Google Scholar
- 4.Czech, Z.J., Czarnas, P.: A parallel simulated annealing for the vehicle routing problem with time windows. In: Proc. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, January 2002, pp. 376–383 (2002)Google Scholar
- 5.Onbaşoğlu, E., Özdamar, L.: Parallel simulated annealing algorithms in global optimization. Journal of Global Optimization 19, 27–50 (2001)MathSciNetCrossRefMATHGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2006