Three Parallel Algorithms for Simulated Annealing

  • Zbigniew J. Czech
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)


A vehicle routing problem which reduces to an NP-complete set-partitioning problem is considered. Three parallel algorithms for simulated annealing, i.e. the independent, semi-independent and co-operating searches are investigated. The objective is to improve the accuracy of solutions to the problem by applying parallelism. The accuracy of a solution is meant as its proximity to the optimum solution. The empirical evidence supported by the statistical analysis indicate that co-operation of processes in parallel simulated annealing yields more accurate solutions to the vehicle routing problem as compared to the case when the processes run independently or semi-independently.


Vehicle routing problem set-partitioning problem parallel simulated annealing algorithms message passing model of parallel computation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aarts, E.H.L., and Korst, J.H.M., Simulated annealing and Boltzmann machines, Wiley, Chichester, 1989.Google Scholar
  2. 2.
    Altinkemer, K., Gavish, Parallel savings based heuristics for the delivery problem, Operations Research 39,3 (May-June 1991), 456–469.Google Scholar
  3. 3.
    Azencott, R., Parallel simulated annealing: An overview of basic techniques, in Azencott, R. (Ed.), Simulated annealing. Parallelization techniques, J. Wiley, NY, (1992), 37–46.Google Scholar
  4. 4.
    Boissin, N., and Lutton, J.-L., A parallel simulated annealing algorithm, Parallel Computing 19, (1993), 859–872.MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Cěrny, V., A thermodynamical approach to the travelling salesman proble: an efficient simulation algorithm, J. of Optimization Theory and Applic. 45, (1985), 41–55.zbMATHCrossRefGoogle Scholar
  6. 6.
    Christofides, N., Mignozzi, A., and Toth, P., Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Math. Prog. 20, (1981), 255–282.zbMATHCrossRefGoogle Scholar
  7. 7.
    Clarke, G, and Wright, J., Scheduling of vehicles from a central depot to a number of delivery points, Opens. res. 12, (1964), 568–581.CrossRefGoogle Scholar
  8. 8.
    Czech, Z.J., Parallel simulated annealing for the delivery problem, Proc. of the 9th Euromicro Workshop on Parallel and Distributed Processing, Mantova, Italy, (February 7–9, 2001), 219–226.Google Scholar
  9. 9.
    Fisher, M.L., and Jaikumar, R., A generalized assignment heuristic for vehicle routing, Networks 11, (1981), 109–124.MathSciNetCrossRefGoogle Scholar
  10. 10.
    Graffigne, C., Parallel annealing by periodically interacting multiple searches: An experimental study, in Azencott, R. (Ed.), Simulated annealing. Parallelization techniques, J. Wiley, NY, (1992), 47–79.Google Scholar
  11. 11.
    Haimovich, M., and Rinnooy Kan, A., Bounds and heuristics for capacitated routing problems, Math. Opns. Res. 10, (1985), 527–542.zbMATHCrossRefGoogle Scholar
  12. 12.
    Kirkpatrick, S., Gellat, C.D., and Vecchi, M.P., Optimization by simulated annealing, Science 220, (1983), 671–680.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Lenstra, J., and Rinnooy, K., Complexity of vehicle routing and scheduling problems, Networks11, (1981), 221–227.CrossRefGoogle Scholar
  14. 14.
    Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., and Teller, E., Equation of state calculation by fast computing machines, Journ. of Chem. Phys. 21, (1953), 1087–1091.CrossRefGoogle Scholar
  15. 15.
    Reeves, C.R., (Ed.) Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Zbigniew J. Czech
    • 1
  1. 1.Silesia University of Technology, Gliwice, and University of SilesiaSosnowiecPoland

Personalised recommendations