Study of Mathematical Model and Ant Colony Optimization (ACO)
Keywords:
optimization and control, combinatorial
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2012-10-15
Issue
Section
License
Copyright (c) 2012 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.