000			03123nam a22002897a 4500
999			_c58529 _d58529
005			20211021112435.0
008			211021b ||||| |||| 00| 0 eng d
020			_a9788120326842
028			_a:Donated from Mathematical Dept
082			_a519.6 DOR
100			_aDorigo, Marco;
245			_aAnt Colony Optimization _c/ Marco Dorigo
260			_aCambridge, Mass. _b: MIT Press, _c©2004.
300			_axi, 305 page _c24cm
365			_bDonated
505			_a Preface; Acknowledgments; 1 -- From Real to Artificial Ants; 2 -- The Ant Colony Optimization Metaheuristic; 3 -- Ant Colony Optimization Algorithms for the Traveling Salesman Problem; 4 -- Ant Colony Optimization Theory; 5 -- Ant Colony Optimization for NP-Hard Problems; 6 -- AntNet: An ACO Algorithm for Data Network Routing; 7 -- Conclusions and Prospects for the Future; Appendix: Sources of Information about the ACO Field; References; Index.
520			_a An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications. The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses. The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms
650			_aMathematics
650			_aProbabilities and applied mathematics
650			_aMathematical optimization.
650			_aAnts -- Behavior -- Mathematical models.
650			_aMATHEMATICS -- Optimization.
650			_aCOMPUTER SCIENCE/General
700			_aDorigo, Marco;
700			_aStützle, Thomas
942			_cMDL