Skip to main content
SpringerLink
Log in

Three Parallel Algorithms for Simulated Annealing

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

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.

This research was supported in part by the State Committee for Scientific Research grant BK-280-RAu2-2001. We thank the Wroclaw Centre of Networking and Supercomputing for the computing grant No 04/97, and the Computer Center of the Silesia University of Technology for the similar computing grant which enabled us to obtain the empirical results described in this work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E.H.L., and Korst, J.H.M., Simulated annealing and Boltzmann machines, Wiley, Chichester, 1989.

    Google Scholar 

  2. Altinkemer, K., Gavish, Parallel savings based heuristics for the delivery problem, Operations Research 39,3 (May-June 1991), 456–469.

    Google Scholar 

  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. Boissin, N., and Lutton, J.-L., A parallel simulated annealing algorithm, Parallel Computing 19, (1993), 859–872.

    Article  MathSciNet  MATH  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  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.

    Article  Google Scholar 

  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. Fisher, M.L., and Jaikumar, R., A generalized assignment heuristic for vehicle routing, Networks 11, (1981), 109–124.

    Article  MathSciNet  Google Scholar 

  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. Haimovich, M., and Rinnooy Kan, A., Bounds and heuristics for capacitated routing problems, Math. Opns. Res. 10, (1985), 527–542.

    Article  MATH  Google Scholar 

  12. Kirkpatrick, S., Gellat, C.D., and Vecchi, M.P., Optimization by simulated annealing, Science 220, (1983), 671–680.

    Article  MathSciNet  MATH  Google Scholar 

  13. Lenstra, J., and Rinnooy, K., Complexity of vehicle routing and scheduling problems, Networks11, (1981), 221–227.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  15. Reeves, C.R., (Ed.) Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Silesia University of Technology, Gliwice, and University of Silesia, Sosnowiec, Poland

    Zbigniew J. Czech

Authors
  1. Zbigniew J. Czech
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czech, Z.J. (2002). Three Parallel Algorithms for Simulated Annealing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation