Skip to main content

Generalized Nets as Tools for Modeling of the Ant Colony Optimization Algorithms

  • Conference paper
Large-Scale Scientific Computing (LSSC 2009)

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

Included in the following conference series:

Abstract

Ant Colony Optimization (ACO) has been used successfully to solve hard combinatorial optimization problems. This metaheuristic method is inspired by the foraging behavior of ant colonies, which manage to establish the shortest routes to feeding sources and back. We discuss some possibilities for describing of the ACO algorithms by Generalized Nets (GNs), that help us deeply to understand the processes and to improve them. Very important is that the GNs are expandable. For example, some of the GN places can be replaced with a new GN. Thus we can include procedures to improve the search process and the achieved results or various kind of estimations of algorithm behavior.

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. Alexieva, J., Choy, E., Koychev, E.: Review and bibloigraphy on generalized nets theory and applications. In: Choy, E., Krawczak, M., Shannon, A., Szmidt, E. (eds.) A Survey of Generalized Nets. Raffles KvB Monograph, vol. 10, pp. 207–301 (2007)

    Google Scholar 

  2. Atanassov, K.: Generalized Nets. World Scientific, Singapore (1991)

    MATH  Google Scholar 

  3. Fidanova, S.: Ant colony optimization and multiple knapsack problem. In: Renard, J.P. (ed.) Handbook of Research on Nature Inspired Computing for Economics and Management, pp. 498–509. Idea Grup Inc. (2006) ISBN 1-59140-984-5

    Google Scholar 

  4. Atanassov, K.: On Generalized Nets Theory. Prof. M. Drinov Publishing House, Sofia (2007)

    Google Scholar 

  5. Fidanova, S., Atanasov, K.: Generalized Net Models of the Process of Ant Colony Optimization. Issues on Intitionistic Fuzzy Sets and Generalized Nets 7, 108–114 (2008)

    Google Scholar 

  6. Fidanova, S., Atanassov, K.: Generalized Net Model for the Process of Hybrid Ant Colony Optimization. Computer Rendus de l’Academie Bulgare des Sciences 62(3), 315–322 (2009)

    MATH  Google Scholar 

  7. Fidanova, S., Atanasov, K.: Generalized Net Models of the Process of the Ant Colony Optimization with Intuitionistic Fuzzy Estimations. In: Proc. of the Ninth Int. Conf. of Generalized nets, Sofia, pp. 41–48 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fidanova, S., Atanassov, K. (2010). Generalized Nets as Tools for Modeling of the Ant Colony Optimization Algorithms. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2009. Lecture Notes in Computer Science, vol 5910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12535-5_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12535-5_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12534-8

  • Online ISBN: 978-3-642-12535-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics