Theoretical and practical issues of parallel simulated annealing

  • Authors:
  • Agnieszka Debudaj-Grabysz;Zbigniew J. Czech

  • Affiliations:
  • Silesia University of Technology, Institute of Computer Science, Gliwice, Poland;Silesia University of Technology, Institute of Computer Science, Gliwice, Poland and Silesia University, Sosnowiec, Poland

  • Venue:
  • PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several parallel simulated annealing algorithms with different co-operation schemes are considered. The theoretical analysis of speedups of the algorithms is presented. The outcome of the theoretical analysis was verified by practical experiments whose aim was to investigate the influence of the co-operation of parallel simulated annealing processes on the quality of results. The experiments were performed assuming a constant cost of parallel computations, i.e., searching for solutions was conducted with a given number of processors for a specified period of time. For the experiments a suite of benchmarking tests for the vehicle routing problem with time windows was used.