Implementing a parallel simulated annealing algorithm

Authors:
Zbigniew J. Czech;Wojciech Mikanik;Rafał Skinderowicz
Affiliations:
Silesia University of Technology, Gliwice, Poland and University of Silesia, Sosnowiec, Poland;Silesia University of Technology, Gliwice, Poland;University of Silesia, Sosnowiec, Poland
Venue:
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Year:
2009

Citing 5
Cited 2

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Solving Bicriterion Optimization Problems by Parallel Simulated Annealing

PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Speeding Up Sequential Simulated Annealing by Parallelization

PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
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
Frequency of co-operation of parallel simulated annealing processes

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

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
A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The MPI and OpenMP implementations of the parallel simulated annealing algorithm solving the vehicle routing problem (VRPTW) are presented. The algorithm consists of a number of components which co-operate periodically by exchanging their best solutions found to date. The objective of the work is to explore speedups and scalability of the two implementations. For comparisons the selected VRPTW benchmarking tests are used.