Frequency of co-operation of parallel simulated annealing processes

Authors:
Zbigniew J. Czech;Bożena Wieczorek
Affiliations:
Silesia University of Technology, Gliwice;Katowice School of Economics, Katowice, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 3
Cited 2

Parallel Simulated Annealing Algorithms in Global Optimization

Journal of Global Optimization
Low Cost Parallel Solutions for the VRPTW Optimization Problem

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Parallel simulated annealing for the vehicle routing problem with time windows

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing

Implementing a parallel simulated annealing algorithm

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
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

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.