Skip to main content

Hybrid Ant Colony Algorithm and Its Application on Function Optimization

  • Conference paper

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

Abstract

A new hybrid ant colony algorithm was proposed. Firstly, weight factor was introduced to the binary ant colony algorithm, and then we obtained a new probability by combining probability model of Population based incremental learning (PBIL) with transfer probability of ants pheromone . The new population are produced by probability model of PBIL, transfer probability of ants pheromone and the probability of proposed algorithm so that population polymorphism is ensured and the optimal convergence rate and the ability of breaking away from the local minima are improved. Optimization simulation results based on the benchmark test functions show that the hybrid algorithm has higher convergence rate and stability than binary ant colony algorithm (BACA) and Population based incremental learning (PBIL).

This work is supported by NSF of Hebei Province #F2008001166 to Liubo.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm intelligence: from natural to artificial systems. Oxford University Press, Oxford (1999)

    MATH  Google Scholar 

  2. Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dipartimento Di Elettronicaq – Politecnico Di Milano (1991)

    Google Scholar 

  3. Dorigo, M., Stützle, T.: Ant colony optimization. The MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  4. Xiong, W., Wang, L., Yan, C.: Binary Ant Colony Evolutionary Algorithm. International Journal of Information Technology 12(3) (2006)

    Google Scholar 

  5. Petrovski, A., Shakya, S., McCall, J.: Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation, Seattle, Washington, USA, pp. 413–418. ACM Press, New York (2006)

    Google Scholar 

  6. Yuan, B., Gallagher, M.: Playing in Continuous Spaces: Some Analysis and Extension of Population-Based Incremental Learning. In: Proceedings of Congress of Evolutionary Computation (CEC), pp. 443–450 (2003)

    Google Scholar 

  7. Shapiro, J.L.: The Sensitivity of PBIL to the Learning Rate, and How Detailed Balance Can Remove It. In: Cotta, C., de Jong, K., Poli, R., Rowe, J. (eds.) Foundations of Genetic Algorithms VII. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  8. Očenášek, J.: Parallel Estimation of Distribution Algorithms, Brno University of Technology, Faculty of Information Technology, Doctoral Thesis (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, B., Li, H., Wu, T., Zhang, Q. (2008). Hybrid Ant Colony Algorithm and Its Application on Function Optimization. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2008. Lecture Notes in Computer Science, vol 5370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92137-0_84

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92137-0_84

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics