Co-operative, parallel simulated annealing for the VRPTW

Authors:
Rafał Skinderowicz
Affiliations:
Institute of Computer Science, Silesia University, Sosnowiec, Poland
Venue:
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
Year:
2011

Citing 6
Cited 0

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

Operations Research
Cooling schedules for optimal annealing

Mathematics of Operations Research
Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains

IEEE Transactions on Parallel and Distributed Systems
Trading accuracy for speed in parallel simulated annealing with simultaneous moves

Parallel Computing - High performance computing in operations research
Low Cost Parallel Solutions for the VRPTW Optimization Problem

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Implementing a parallel simulated annealing algorithm

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The parallel simulated annealing algorithm solving the vehicle routing problem with time windows (VRPTW) is presented. The algorithm consists of a number of processes which co-operate by synchronously exchanging data about their best solutions found so far. The exchange of information is made according to a pre-set communication scheme. The objective of the work is to investigate how the utilization of the data received by a process can affect the accuracy of its solutions to the VRPTW. Performance of the presented parallel algorithm is also considered.