Abstract
It is known, that concurrent computing can be applied to heuristic methods (e.g. simulated annealing) for combinatorial optimization to shorten time of computation. This paper presents a communication scheme for message passing environment, tested on the known optimization problem - VRPTW. Application of the scheme allows speed-up without worsening quality of solutions - for one of Solomon’s benchmarking tests the new best solution was found.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E.H.L, and Korst, J., 1989, Simulated Annealing and Boltzman Machines, John Wiley & Sons.
Aarts, E.H.L., 1986, Parallel implementation of the statistical cooling algorithm. INTEGRATION, the VLSI journal.
Azencott, R., ed., 1992, Simulated Annealing. Parallelization Techniques, John Wiley & Sons.
Chan, A., Gropp, W., and Lusk, E., 2000, A tour of Jumpshot-3, ftp://ftp.mcs.anl.gov/pub/mpi/nt/binaries.
Czarnas, P, 2001, Traveling Salesman Problem With Time Windows. Solution by Simulated Annealing, MSc thesis (in Polish), Uniwersytet Wrocławski, Wrocław.
Czech, Z.J., and Czarnas, P., 2002, Parallel simulated annealing for the vehicle routing problem with time windows, 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands-Spain, (January 9–11, 2002).
Fujimoto, R.M., 2000, Parallel and Distributed Simulation Systems, A Wiley-Interscience Publication.
Gropp, W., Lusk, E., Doss, N., and Skjellum A., 1996, A high-performance, portable implementation of the MPI message passing interface standard, Parallel Computing 22(6):789–828.
Gropp, W., and Lusk, E., 1996, User’s Guide for mpich, a Portable Implementation of MPI, ANL-96/6, Mathematics and Computer Science Division, Argonne National Laboratory.
Larsen, J., 1999, Vehicle routing with time windows-finding optimal solutions efficiently, http://citeseer.nj.nec.com/larsen99vehicle.html, (September 15, 1999).
Roussel-Ragot, P., and Dreyfus, G., 1992, Parallel annealing by multiple trials: an experimental study on a transputer network, in Azencott (1992), pp. 91–108.
Solomon, M., 1987, Algorithms for the vehicle routing and scheduling problem with time windows constraints, Oper. Res. 35:254–265.
Salamon, P., Sibani, P., and Frost, R., 2002, Facts, Conjectures and Improvements for Simulated Annealing, SIAM.
Tan, K.C., Lee, L.H., and Zhu, K.Q., 1999, Heuristic methods for vehicle routing problem with time widows, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science + Business Media, Inc.
About this chapter
Cite this chapter
Debudaj-Grabysz, A., Czech, Z.J. (2005). A Concurrent Implementation of Simulated Annealing and Its Application to the VRPTW Optimization Problem. In: Juhász, Z., Kacsuk, P., Kranzlmüller, D. (eds) Distributed and Parallel Systems. The International Series in Engineering and Computer Science, vol 777. Springer, Boston, MA. https://doi.org/10.1007/0-387-23096-3_23
Download citation
DOI: https://doi.org/10.1007/0-387-23096-3_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23094-8
Online ISBN: 978-0-387-23096-2
eBook Packages: EngineeringEngineering (R0)