Skip to main content

Multiagent Search Strategy for Combinatorial Optimization Problems in Ant Model

  • Conference paper
  • 946 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4456))

Abstract

Ant Colony System (ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants that accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, it is necessary to make a search for various edges. In existing ACS, the local updating rule assigns the fixed pheromone value to visited edge in all process. In this paper, modified local updating rule gives the pheromone value according to the number of visiting and the edge’s distance between visited nodes. Our approach can have less local optima than existing ACS and can find better solution by taking advantage of more information during searching.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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. Freisleben, B., Merz, P.: Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In: Proceedings of IEEE International Conference of Evolutionary Computation, IEEE-EC 1996, pp. 616–621. IEEE Press, New York (1996)

    Chapter  Google Scholar 

  2. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F., Bourgine, P. (eds.) Proceedings of ECAL91-European Conference of Artificial Life, Paris, France, pp. 134–144. Elsevier Publishing, Amsterdam (1991)

    Google Scholar 

  3. Gambardella, L.M., Dorigo, M.: Ant Colony System: A Cooperative Learning approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1) (1997)

    Google Scholar 

  4. Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems, 73–81 (1997)

    Google Scholar 

  5. Dorigo, M., Caro, G.D.: Ant Algorithms for Discrete Optimization. Artificial Life 5(3), 137–172 (1999)

    Article  Google Scholar 

  6. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperation agents. IEEE Transactions of Systems, Man, and Cybernetics-Part B 26(2), 29–41 (1996)

    Article  Google Scholar 

  7. Lee, S.G., Jung, T.U., Chung, T.C.: Improved Ant Agents System by the Dynamic Parameter Decision. In: Proceedings of IEEE International Conference on FUZZ-IEEE 2001, pp. 666–669. IEEE Press, New York (2001)

    Google Scholar 

  8. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hong, S., Lee, S. (2007). Multiagent Search Strategy for Combinatorial Optimization Problems in Ant Model. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74377-4_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74376-7

  • Online ISBN: 978-3-540-74377-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics