Skip to main content
SpringerLink
Log in

Distributed Simulated Annealing with MapReduce

  • Conference paper
Book cover Applications of Evolutionary Computation (EvoApplications 2012)

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

Included in the following conference series:

Abstract

Simulated annealing’s high computational intensity has stimulated researchers to experiment with various parallel and distributed simulated annealing algorithms for shared memory, message-passing, and hybrid-parallel platforms. MapReduce is an emerging distributed computing framework for large-scale data processing on clusters of commodity servers; to our knowledge, MapReduce has not been used for simulated annealing yet. In this paper, we investigate the applicability of MapReduce to distributed simulated annealing in general, and to the TSP in particular. We (i) design six algorithmic patterns of distributed simulated annealing with MapReduce, (ii) instantiate the patterns into MR implementations to solve a sample TSP problem, and (iii) evaluate the solution quality and the speedup of the implementations on a cloud computing platform, Amazon’s Elastic MapReduce. Some of our patterns integrate simulated annealing with genetic algorithms. The paper can be beneficial for those interested in the potential of MapReduce in computationally intensive nature-inspired methods in general and simulated annealing in particular.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Cantú-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer, Boston (2000)

    Book  MATH  Google Scholar 

  2. Choong, A., Beidas, R., Zhu, J.: Parallelizing Simulated Annealing-Based Placement using GPGPU. In: Field Programmable Logic and Applications, pp. 31–34. IEEE, New York (2010)

    Google Scholar 

  3. Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. CACM 51(1), 107–113 (2008)

    Google Scholar 

  4. Debudaj-Grabysz, A., Rabenseifner, R.: Nesting OpenMP in MPI to Implement a Hybrid Communication Method of Parallel Simulated Annealing on a Cluster of SMP Nodes. In: Di Martino, B., Kranzlmüller, D., Dongarra, J. (eds.) EuroPVM/MPI 2005. LNCS, vol. 3666, pp. 18–27. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Elhaddad, Y., Sallabi, O.: A New Hybrid Genetic and Simulated Annealing Algorithm to Solve the Traveling Salesman Problem. In: World Congress on Engineering (WCE 2010), vol. 1, pp. 11–14. International Association of Engineers, Taipei (2010)

    Google Scholar 

  6. Hansen, P.-B.: Studies in Computational Science. Prentice Hall, Englewood Cliffs (1995)

    Google Scholar 

  7. Huang, D.-W., Lin, J.: Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce. In: 2010 IEEE 2nd International Conference on Cloud Computing Technology and Science, pp. 78–85. IEEE, New York (2010)

    Google Scholar 

  8. Lin, J., Dyer, C.: Data-Intensive Text Processing with MapReduce. Morgan and Claypool, San Francisco Bay Area (2010)

    Google Scholar 

  9. Ma, J., Li, K., Zhang, L.: The Adaptive Parallel Simulated Annealing Algorithm Based on TBB. In: 2nd International Conference on Advanced Computer Control, pp. 611–615. IEEE, New York (2010)

    Google Scholar 

  10. Moscato, P., Fontanari, J.: Stochastic versus Deterministic Update in Simulated Annealing. Physics Letters A 146(4), 204–208 (1990)

    Article  Google Scholar 

  11. Ohlídal, M., Schwarz, J.: Hybrid Parallel Simulated Annealing Using Genetic Operations. In: 10th International Conference on Soft Computing, Mendel 2004, pp. 89–94. University of Technology, Brno (2004)

    Google Scholar 

  12. Ram, J.D., Sreenevas, T.T., Subramaniam, K.G.: Parallel Simulated Annealing Algorithms. J. Par. Distr. Computing 37, 207–212 (1996)

    Article  Google Scholar 

  13. Sengoku, H., Yoshihara, I.: A Fast TSP Solver Using GA on Java. In: 3rd Int. Symp. Artif. Life and Robot., pp. 283–288. Springer, Japan (1998)

    Google Scholar 

  14. Verma, A., Llorà, X., Goldberg, D.E., Campbell, R.H.: Scaling Genetic Algorithms Using MapReduce. In: 9th International Conference on Intelligent Systems Design and Applications, pp. 13–18. IEEE, New York (2009)

    Chapter  Google Scholar 

  15. White, T.: Hadoop: The Definitive Guide, 2nd edn. O’Reilly Media, Sebastopol (2009)

    Google Scholar 

  16. Yao, X.: Optimization by Genetic Annealing. In: 2nd Australian Conf. Neural Networks, pp. 94–97. Sidney University, Sidney (1991)

    Google Scholar 

  17. Zhou, C.: Fast Parallelization of Differential Evolution Algorithm Using MapReduce. In: 12th Annual Conference on Genetic and Evolutionary Computation, pp. 1113–1114. ACM, New York (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chapman University, Orange, 92865, USA

    Atanas Radenski

Authors
  1. Atanas Radenski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, University of Strathclyde, 16 Richmond Street, G1 1XQ, Glasgow, UK

    Cecilia Di Chio

  2. Financial Mathematics and Computation Cluster Natural Computing Research and Applications Group Complex and Adaptive Systems Laboratory, University College, Dublin, Ireland

    Alexandros Agapitos

  3. Department of Computer Engineering, University of Parma, Viale Usberti 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  4. ETSI Informática, Universidad de Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  5. Centro Universitario de Merida, Universidad de Extremadura, Spain

    Francisco Fernández de Vega

  6. Dalle Molle Institute for Artificial Intelligence (IDSIA), Lugano, Switzerland

    Gianni A. Di Caro

  7. DFKI Bremen, Cyber-Physical Systems, Bremen, Germany

    Rolf Drechsler

  8. Knowledge Engineering Research Group, Aston University, B4 7ET, Aston Triangle, Birmingham, UK

    Anikó Ekárt

  9. Instituto Tecnológico de Informática, Edif. 8G Acceso B, Universidad Politécnica de Valencia, 46022, Valencia, Spain

    Anna I. Esparcia-Alcázar

  10. Next Generation Intelligent Networks Research Center (nexGIN RC), National University of Computer & Emerging Sciences (FAST-NU), Islamabad, Pakistan

    Muddassar Farooq

  11. Department of Computer Science,, University College London, Gower Street, WC1E 6BT, London, UK

    William B. Langdon

  12. Depto. Arquitectura y Tecnologa de Computadores, ETS Ingeiera Informtica, C/Daniel Saucedo Aranda, s/n, 18071, Granada, Spain

    Juan J. Merelo-Guervós

  13. Chair of Algorithm Engineering, Computational Intelligence Group, Dept. of Computer Science, Technische Universität Dortmund, Germany

    Mike Preuss

  14. HTWK Leipzig, Fakultät Elektrotechnik und Informationstechnik, Institut Mess–, Steuerungs– und Regelungstechnik, Postfach 30 11 66, D–04251, Leipzig, Germany

    Hendrik Richter

  15. INESC-ID Lisboa, Rua Alves Redol 9,, 1000-029, Lisboa, Portugal

    Sara Silva

  16. Centre for Informatics and Systems, University of Coimbra, Portugal

    Anabela Simões

  17. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

  18. Institute of High Performance Computing and Networking, ICAR-CNR, Naples, Italy

    Ernesto Tarantino

  19. Dipartimento di Tecnologie dell’Informazione, Universita’ degli Studi di Milano, Italy

    Andrea G. B. Tettamanzi

  20. IT University of Copenhagen, Rued Langaards Vej 7, 2300, Copenhagen, Denmark

    Julian Togelius

  21. Centre for Emergent Computing, Edinburgh Napier University, Edinburgh,, UK

    Neil Urquhart

  22. Department of Computer Engineering, Istanbul Technical University, 34490, Maslak, Turkey

    A. Şima Uyar

  23. Center For Computer Games Research, IT University Of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Georgios N. Yannakakis

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Radenski, A. (2012). Distributed Simulated Annealing with MapReduce. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2012. Lecture Notes in Computer Science, vol 7248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29178-4_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29178-4_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29177-7

  • Online ISBN: 978-3-642-29178-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation