Skip to main content

Application of ACO in Continuous Domain

  • Conference paper
Advances in Natural Computation (ICNC 2006)

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

Included in the following conference series:

Abstract

The Ant Colony Optimization has gained great success in applications to combinatorial optimization problems, but few of them are proposed in the continuous domain. This paper proposes an ant algorithm, called Direct Ant Colony Optimization (DACO), for the function optimization problem in continuous domain. In DACO, artificial ants generate solutions according to a set of normal distribution, of which the characteristics are represented by pheromone modified by ants according to the previous search experience. Experimental results show the advantage of DACO over other ACO based algorithms for the function optimization problems of different characteristics.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bilchev, G., Parmee, I.C.: The ant colony metaphor for searching continuous design spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 25–39. Springer, Heidelberg (1995)

    Google Scholar 

  2. Bilchev, G., Parmee, I.C.: Constrained optimization with an ant colony search model. In: 2nd International Conference on Adaptive Computing in Engineering Design and Control, pp. 26–28. PEDC, University of Plymouth (1996)

    Google Scholar 

  3. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics, Part B 34(2), 1161–1172 (2004)

    Article  Google Scholar 

  4. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, Oxford (1999)

    MATH  Google Scholar 

  5. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  6. Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Boston (2003)

    Google Scholar 

  7. Dréo, J., Siarry, P.: A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 216–221. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Dreo, J., Siarry, P.: Continuous interacting ant colony algorithm based on dense heterarchy. Future Generation Computer Systems 20(5), 841–856 (2004)

    Article  Google Scholar 

  9. Gambardella, L.M., Taillard, E.D., Agazzi, G.: Macs-vrptw: a multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorgo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63–76. McGraw-Hill Ltd., London (1999)

    Google Scholar 

  10. Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50(2), 167–176 (1999)

    Article  MATH  Google Scholar 

  11. Mathur, M., Karale, S.B., Priye, S., Jyaraman, V.K., Kulkarni, B.D.: Ant colony approach to continuous function optimization. Ind. Eng. Chem. Res. 39(10), 3814–3822 (2000)

    Article  Google Scholar 

  12. Monmarche, N., Venturini, G., Slimane, M.: On how pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems 16(8), 937–946 (2000)

    Article  Google Scholar 

  13. Socha, K.: ACO for continuous and mixed-variable optimization. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 25–36. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Tan, K.C., Lim, M.H., Yao, X., Wang, L.P. (eds.): Recent Advances in Simulated Evolution And Learning. World Scientific, Singapore (2004)

    MATH  Google Scholar 

  15. Wodrich, M., Bilchev, G.: Cooperative distributed search: the ant’s way. Control & Cybernetics 3, 413–446 (1997)

    MathSciNet  Google Scholar 

  16. Yao, X.: Evolutionary Computation: Theory and Applications. World Scientific, Singapore (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kong, M., Tian, P. (2006). Application of ACO in Continuous Domain. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_17

Download citation

  • DOI: https://doi.org/10.1007/11881223_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45907-1

  • Online ISBN: 978-3-540-45909-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics