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. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Czech, Z. J., Mikanik, W., & Skinderowicz, R. (2010). Implementing a parallel simulated annealing algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6067 LNCS, pp. 146–155). https://doi.org/10.1007/978-3-642-14390-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
