Study of Mathematical Model and Ant Colony Optimization (ACO)

α
Dr. Pawandeep Chahal
Dr. Pawandeep Chahal
α Punjab Technical University

Send Message

To: Author

Study of Mathematical Model and Ant Colony Optimization (ACO)

Article Fingerprint

ReserarchID

29059

Study of Mathematical Model and Ant Colony Optimization (ACO) Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

In this paper we define those mathematical notions and terms that are useful about ACO and the relationships between ACO and other frameworks for optimization and control. This chapter defines and discusses the characteristics of: (i) the combinatorial optimization problems addressed by ACO, (ii) construction heuristics for combinatorial problems, (iii) the equivalence between solution construction and sequential decision process (iv) the graphical tools (state graph and construction graph) that can be used to represent and reason on the structure and dynamics of construction processes.

References

34 Cites in Article
  1. C Bibby,T Abe,S Levin,M Higashi (1997). Biodiversity: An Ecological Perspective..
  2. M Beckmann,C Mcguire,C Winstein (1956). Studies in the Economices of Transportation.
  3. R Bellman (1957). Dynamic Programming.
  4. R Bellman (1958). On a routing problem.
  5. Dimitri Bertsekas,John Tsitsiklis,Cynara Wu (1997). Rollout Algorithms for Combinatorial Optimization.
  6. Mauro Birattari,Gianni Di Caro,Marco Dorigo (2002). Toward the Formal Foundation of Ant Programming.
  7. J Bland (2001). OPTIMAL STRUCTURAL DESIGN BY ANT COLONY OPTIMIZATION.
  8. J Bland (1999). LAYOUT OF FACILITIES USING AN ANT SYSTEM APPROACH.
  9. J Bland (1999). Space-planning by ant colony optimisation.
  10. K Bolding,M Fulgham,L Snyder (1994). The case for chaotic adaptive routing.
  11. E Bonabeau,M Dorigo,G Theraulaz (1999). Swarm Intelligence: From Natural to Artificial Systems.
  12. Josh Broch,David Maltz,David Johnson,Yih-Chun Hu,Jorjeta Jetcheva (1998). A performance comparison of multi-hop wireless ad hoc network routing protocols.
  13. Daniel Câmara,Antonio Loureiro (2001). GPS/Ant-Like Routing in Ad Hoc Networks.
  14. H Chang,W Gutjahr,J Yang,S Park (2003). An Ant System approach to Markov Decision Processes.
  15. C Cheng,R Riley,S Kumar,J Garcia-Luna-Aceves (1989). A loop-free extended Bellman-Ford routing protocol without bouncing effect.
  16. L Chrisman (1992). Reinforcement learning with perceptual aliasing: The perceptual distinctions approach.
  17. I Cidon,R Rom,Y Shavitt (1997). Multi-path routing combined with resource reservation.
  18. I Cidon,R Rom,Y Shavitt (1999). Analysis of multi-path routing.
  19. A Colorni,M Dorigo,V Maniezzo,M Trubian (1994). Figure 4: Initial conditions between ant colony in a nest and food source (Dorigo, Maniezzo & Colorni, 1996)..
  20. M Cottarelli,A Gobbi (1997). Estensioni dell'algoritmo formiche per il problema del commesso via ggiatore.
  21. J-L Deneubourg,S Aron,S Goss,J.-M Pasteels (1990). The self-organizing exploratory pattern of the argentine ant.
  22. J Deneubourg,S Goss,N Franks,A Sendova-Franks,C Detrain,L Chrétien (1991). The Dynamics of Collective Sorting: Robot-Like Ants and Ant-Like Robots.
  23. G,Di Caro,M Dorigo (1997). AntNet: A mobile agents approach to adaptive routing.
  24. G Caro,F Ducatelle,L Gambardella (2004). AntHocNet: an ant-based hybrid routing algorithm for mobile ad hoc networks.
  25. G Caro,F Ducatelle,L Gambardella (2005). AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks.
  26. E Dijkstra (1959). A note on two problems in connexion with graphs.
  27. M Dorigo,G Caro,L Gambardella (1999). Ant algorithms for discrete optimization.
  28. J Garcia-Luna-Aceves,Shree Murthy (1997). A path-finding algorithm for loop-free routing.
  29. Fred Glover (1989). Tabu Search—Part I.
  30. J Moy (1994). OSPF Version 2.
  31. J Moy (1998). OSPF Anatomy of an Internet Routing Protocol.
  32. Guillermo Owen (1995). The not-quite non-atomic game: Homogeneous games on two measures.
  33. Martin Puterman (1994). Markov Decision Processes.
  34. K Romer,Friedemann Mattern (2004). The design space of wireless sensor networks.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. Pawandeep Chahal. 2013. \u201cStudy of Mathematical Model and Ant Colony Optimization (ACO)\u201d. Global Journal of Research in Engineering - J: General Engineering GJRE-J Volume 12 (GJRE Volume 12 Issue J4): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Version of record

v1.2

Issue date

January 6, 2013

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 5075
Total Downloads: 2511
2026 Trends
Related Research

Published Article

In this paper we define those mathematical notions and terms that are useful about ACO and the relationships between ACO and other frameworks for optimization and control. This chapter defines and discusses the characteristics of: (i) the combinatorial optimization problems addressed by ACO, (ii) construction heuristics for combinatorial problems, (iii) the equivalence between solution construction and sequential decision process (iv) the graphical tools (state graph and construction graph) that can be used to represent and reason on the structure and dynamics of construction processes.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Study of Mathematical Model and Ant Colony Optimization (ACO)

Dr. Pawandeep Chahal
Dr. Pawandeep Chahal Punjab Technical University

Research Journals