Skip to main content

A Parallel Pre-schedule Max-Min Ant System

  • Conference paper
  • First Online:
Cloud Computing and Security (ICCCS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11063))

Included in the following conference series:

  • 1609 Accesses

Abstract

The parameter sensitivity of MMAS algorithm is analyzed in this paper. And then, we propose a multi-ant colony parallel optimization algorithm based on dynamic parameter adaptation strategy, aiming at the performance lack of traditional ACO algorithm. This algorithm makes use of cloud computing parallelism to design and analyze the MMAS system. The convergence solution comparison results show that this method has certain advantages.

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 EPUB and 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

Similar content being viewed by others

References

  1. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B Cybern. 26(1), 29–41 (1996)

    Article  Google Scholar 

  2. Stützle, T., Hoos, H.H.: MAX–MIN ant system. Future Gener. Comput. Syst. 16(8), 889–914 (2000)

    Article  Google Scholar 

  3. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

    Article  Google Scholar 

  4. Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)

    Article  Google Scholar 

  5. Bullnheimer, B., Kotsis, G., Strauß, C.: Parallelization strategies for the ant system. J. Econ. Integr. 12(4), 419–432 (1998)

    MATH  Google Scholar 

  6. Talbi, E.G., Roux, O., Fonlupt, C., et al.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17(4), 441–449 (2001)

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (51409117, 51679105, 61672261), Jilin Province Department of Education Thirteen Five science and technology research projects [2016] No. 432, [2017] No. JJKH20170804KJ.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lili He .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zheng, Y., Yang, Q., Jin, L., He, L. (2018). A Parallel Pre-schedule Max-Min Ant System. In: Sun, X., Pan, Z., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2018. Lecture Notes in Computer Science(), vol 11063. Springer, Cham. https://doi.org/10.1007/978-3-030-00006-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00006-6_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00005-9

  • Online ISBN: 978-3-030-00006-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics