Ant Colony Algorithms:
Theory and Applications
TITLE: Ant Colony Algorithms:
Theory and Applications
AUTHOR: Hai-Bin DUAN
PUBLISHER: Science Press
In ant societies, the activities of the individuals, as well as of the society as a whole, are not regulated by any explicit form of centralized control. On the other hand, adaptive and robust behaviors transcending the behavioral repertoire of the single individual can be easily observed at society level. These complex global behaviors are the result of self-organizing dynamics driven by local interactions and communications among a number of relatively simple individuals. The simultaneous presence of these and other fascinating and unique characteristics have made ant societies an attractive and inspiring model for building new algorithms and new multi-agent systems. In the last decade, ant societies have been taken as a reference for an ever growing body of scientific work.
Among the different works inspired by ant colonies, the ant colony algorithm(ACA) is probably the most successful and popular one. ACA is a novel bio-inspired optimization algorithm, which simulates the foraging behavior of ants for solving various complex combinatorial optimization problems. This book clearly defines ACA and its complexities, and presents both the most significant theoretical achievements and the state-of-the-art of ACA applications, especially the hardware realization of ACA. This book is broadly divided into 10 chapters and is organized as follows.
Chapter 1 starts with a description of the biological characteristics ants. On the basis of the introduction of the idea origins of ACA, the development of ACA is illustrated.
Chapter 2 presents a well-structured definition of basic ACA, and detailed implementation process and complexity analyses of basic ACA are also presented in this chapter.
Chapter 3 is dedicated to discuss the in-depth convergence proofs for specific classes of ACAs.
Chapter 4 presents detailed experimental analyses on the effect of pertinent parameters and ant colony behaviors in ACA, and an effective “three-step” method for optimum configuration of pertinent parameters in ACA is concluded in this chapter.
Chapter 5 is devoted to the explanation of improvement strategies of ACA in discrete space optimization, and this description takes advantage of the traveling salesman problem(TSP).
Chapter 6 is devoted to the explanation of improvement strategies of ACA in continuous space optimization.
Chapter 7 presents the state-of-the-art of ACA typical applications in various fields. The main application principles, that is, rules of thumb to be followed when attacking a new problem, are identified and discussed in this chapter.
Chapter 8 reports on what is currently known about the hardware realization of ACA.
Chapter 9 presents a systematic comparison and detailed combination of ACA and other bio-inspired optimization algorithms.
Chapter 10 outlines some ongoing and most promising research trends in ACA.
Finally, there are four appendixes, which are programs of basic ACA, web sources about ACA, terminology(Chinese-English) and a piece of poetry extolling ACA.
This book is intended primarily for (1) advanced undergraduate and graduate students in computer science, cybernetics, management science and other related majors; (2) academic and industry researchers in artificial intelligence and computational intelligence; (3) practitioners willing to learn how to implement ACA to solve various combinational optimization problems.
Copyright © 2006 By Hai-Bin Duan, All rights reserved