Skip to main content

Parallel Max-Min Ant System Using MapReduce

  • Conference paper
Advances in Swarm Intelligence (ICSI 2012)

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

Included in the following conference series:

Abstract

Ant colony optimization algorithms have been successfully applied to solve many problems. However, in some large scale optimization problems involving large amounts of data, the optimization process may take hours or even days to get an excellent solution. Developing parallel optimization algorithms is a common way to tackle with this issue. In this paper, we present a MapReduce Max-Min Ant System (MRMMAS), a MMAS implementation based on the MapReduce parallel programming model. We describe MapReduce and show how MMAS can be naturally adapted and expressed in this model, without explicitly addressing any of the details of parallelization. We present benchmark travelling salesman problems for evaluating MRMMAS. The experimental results demonstrate that the proposed algorithm can scale well and outperform the traditional MMAS with similar running times.

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

Access this chapter

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. Stützle, T., Hoos, H.: MAX-MIN ant system. Future Generation Computer System 16(8), 889–914 (2000)

    Article  Google Scholar 

  2. Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, America (2004)

    Book  MATH  Google Scholar 

  3. Chu, S.-C., Roddick, J., Pan, J.-S., Su, C.-J.: Parallel Ant Colony Systems. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 279–284. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Bernd, B., Gabriel, E.K., Christine, S.: Parallel Strategies for the Ant System. University of Vienna, Vienna (1997)

    Google Scholar 

  5. Jeffrey, D., Sanjay, G.: MapReduce: Simplified Data Processing on Large Clusters. Communications of the ACM 51, 107–113 (2008)

    Google Scholar 

  6. Ralf, L.: Google’s MapReduce Programming Model – Revisited. Science of Computer Programming 70, 1–30 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Harlow (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, Q., He, Q., Shi, Z. (2012). Parallel Max-Min Ant System Using MapReduce. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30976-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30976-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30975-5

  • Online ISBN: 978-3-642-30976-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics