Skip to main content
Springer Nature Link
Log in

Frequency of Co-operation of Parallel Simulated Annealing Processes

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

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

  • 872 Accesses

Abstract

A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is considered. The objective is to investigate how the frequency of co-operation of parallel simulated annealing processes influences the quality of solutions to the problem. The quality of a solution is measured by its proximity to the optimum solution.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arbelaitz, O., Rodriguez, C., Zamakola, I.: Low cost parallel solutions for the VRPTW optimization problem. In: Proceedings of the International Conference on Parallel Processing Workshops (2001)

    Google Scholar 

  2. Azencott, R. (ed.): Simulated annealing. Parallelization techniques. J. Wiley, NY (1992)

    MATH  Google Scholar 

  3. Czarnas, P., Czech, Z.J., Gocyla, P.: Parallel simulated annealing for bicriterion optimization problems. In: Proc. of the 5th International Conference on Parallel Processing and Applied Mathematics (PPAM 2003), Czȩstochowa, Poland, September 7–10, 2003, pp. 233–240 (2003)

    Google Scholar 

  4. 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 

  5. Onbaşoğlu, E., Özdamar, L.: Parallel simulated annealing algorithms in global optimization. Journal of Global Optimization 19, 27–50 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Silesia University of Technology, Gliwice

    Zbigniew J. Czech

  2. University of Silesia, Sosnowiec, Poland

    Zbigniew J. Czech

  3. Katowice School of Economics, Katowice, Poland

    Bożena Wieczorek

Authors
  1. Zbigniew J. Czech
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bożena Wieczorek
    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, Poland

    Roman Wyrzykowski

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

    Jack Dongarra

  3. Poznan Supercomputing and Networking Center, Poland

    Norbert Meyer

  4. Informatics & Mathematical Modeling, Technical University of Denmark, 2800, Lyngby, DK, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czech, Z.J., Wieczorek, B. (2006). Frequency of Co-operation of Parallel Simulated Annealing Processes. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_6

Download citation

  • DOI: https://doi.org/10.1007/11752578_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34141-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics