LEADER 04283oam 22006014a 450 001 9910777451803321 005 20231213122853.0 010 $a0-262-29244-0 010 $a0-262-25603-7 035 $a(CKB)1000000000450290 035 $a(EBL)3338887 035 $a(SSID)ssj0000103976 035 $a(PQKBManifestationID)11140778 035 $a(PQKBTitleCode)TC0000103976 035 $a(PQKBWorkID)10070250 035 $a(PQKB)11604288 035 $a(Au-PeEL)EBL3338887 035 $a(CaPaEBR)ebr10229602 035 $a(OCoLC)57182707 035 $a(MiAaPQ)EBC3338887 035 $a(OCoLC)57182707$z(OCoLC)290578252$z(OCoLC)475377700$z(OCoLC)646747529$z(OCoLC)654766976$z(OCoLC)722664915$z(OCoLC)961534685$z(OCoLC)962602017$z(OCoLC)966106454$z(OCoLC)988420881$z(OCoLC)991905205$z(OCoLC)991988074$z(OCoLC)1037944525$z(OCoLC)1038682983$z(OCoLC)1055336112$z(OCoLC)1081247619 035 $a(OCoLC-P)57182707 035 $a(MaCbMITP)1290 035 $a(PPN)258496525 035 $a(EXLCZ)991000000000450290 100 $a20041207d2004 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAnt colony optimization /$fMarco Dorigo, Thomas Stu?tzle 210 $aCambridge, Mass. $cMIT Press$dİ2004 215 $a1 online resource (321 p.) 300 $a"A Bradford book." 311 $a0-262-04219-3 320 $aIncludes bibliographical references (p. [277]-300) and index. 327 $aContents; 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 330 $aAn 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. 606 $aMathematical optimization 606 $aAnts$xBehavior$xMathematical models 610 $aCOMPUTER SCIENCE/General 615 0$aMathematical optimization. 615 0$aAnts$xBehavior$xMathematical models. 676 $a519.6 700 $aDorigo$b Marco$0317250 701 $aStu?tzle$b Thomas$0432894 801 0$bOCoLC-P 801 1$bOCoLC-P 906 $aBOOK 912 $a9910777451803321 996 $aAnt colony optimization$9782040 997 $aUNINA