Skip to main content
SpringerLink
Log in

Implementing a Parallel Simulated Annealing Algorithm

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6067))

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.

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. Czarnas, P., Czech, Z.J., Gocyła, P.: Parallel simulated annealing for bicriterion optimization problems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 233–240. Springer, Heidelberg (2004)

    Google Scholar 

  2. Czech, Z.J., Czarnas, P.: A parallel simulated annealing for the vehicle routing problem with time windows. In: Proc. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, January 2002, pp. 376–383 (2002)

    Google Scholar 

  3. Czech, Z.J., Wieczorek, B.: Solving bicriterion optimization problems by parallel simulated annealing. In: Proc. of the 14th Euromicro Conference on Parallel, Distributed and Network-based Processing, Montbéliard-Sochaux, France, February 15-17, pp. 7–14 (2006) (IEEE Conference Publishing Services)

    Google Scholar 

  4. Czech, Z.J., Wieczorek, B.: Frequency of co-operation of parallel simulated annealing processes. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 43–50. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Czech, Z.J.: Speeding up sequential annealing by parallelization. In: Proc. of the International Conference on Parallel Computing in Electrical Engineering, PARELEC 2006, Białystok, Poland, September 13-17, pp. 349–354 (2006) (IEEE Conference Publishing Services)

    Google Scholar 

  6. Czech, Z.J.: Co-operation of processes in parallel simulated annealing. In: Proc. of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2007), Dallas, Texas, USA (November 13-15, 2006), pp. 401–406 (2007)

    Google Scholar 

  7. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35, 254–265 (1987), http://w.cba.neu.edu/~msolomon/problems.htm

Download references

Author information

Authors and Affiliations

  1. Silesia University of Technology, Gliwice, Poland

    Zbigniew J. Czech & Wojciech Mikanik

  2. University of Silesia, Sosnowiec, Poland

    Zbigniew J. Czech & Rafał Skinderowicz

Authors
  1. Zbigniew J. Czech
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Mikanik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rafał Skinderowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences, Czestochowa University of Technology,  

    Roman Wyrzykowski

  2. Department of Electrical Engineering and Computer Science, University of Tennessee, TN 37996-3450, Knoxville, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 73, PL-42-200, Czestochowa, Poland

    Konrad Karczewski

  4. Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800, Kongens Lyngby, Denmark

    Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czech, Z.J., Mikanik, W., Skinderowicz, R. (2010). Implementing a Parallel Simulated Annealing Algorithm. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14390-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14390-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14389-2

  • Online ISBN: 978-3-642-14390-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation