|
|
|
|
| LEADER |
00000cam a22000004a 4500 |
| 001 |
ocm57182707 |
| 003 |
OCoLC |
| 005 |
20240909213021.0 |
| 006 |
m o d |
| 007 |
cr cnu|||unuuu |
| 008 |
041207s2004 maua ob 001 0 eng d |
| 040 |
|
|
|a N$T
|b eng
|e pn
|c N$T
|d OCLCQ
|d YDXCP
|d OCLCQ
|d N$T
|d OCLCQ
|d TUU
|d OCLCQ
|d OCLCO
|d OCLCQ
|d IEEEE
|d TEFOD
|d OCLCF
|d NLGGC
|d OCLCO
|d OCLCQ
|d COCUF
|d DKDLA
|d E7B
|d OCLCQ
|d EBLCP
|d OCLCQ
|d AZK
|d LOA
|d AGLDB
|d MOR
|d PIFBR
|d ZCU
|d MERUC
|d OCLCQ
|d WY@
|d U3W
|d LUE
|d STF
|d WRM
|d VTS
|d MERER
|d OCLCQ
|d ICG
|d VT2
|d AU@
|d OCLCQ
|d MITPR
|d G3B
|d LEAUB
|d DKC
|d OCLCQ
|d K6U
|d UKCRE
|d VLY
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 019 |
|
|
|a 290578252
|a 475377700
|a 646747529
|a 654766976
|a 722664915
|a 961534685
|a 962602017
|a 966106454
|a 988420881
|a 991905205
|a 991988074
|a 1037944525
|a 1038682983
|a 1045514957
|a 1055336112
|a 1081247619
|a 1125389163
|a 1136174424
|a 1153554929
|a 1162508319
|a 1171697429
|a 1172757649
|a 1228613903
|a 1259081772
|a 1286901005
|
| 020 |
|
|
|a 9780262256032
|q (electronic bk.)
|
| 020 |
|
|
|a 0262256037
|q (electronic bk.)
|
| 020 |
|
|
|a 141756041X
|q (electronic bk.)
|
| 020 |
|
|
|a 9781417560417
|q (electronic bk.)
|
| 020 |
|
|
|a 9780262042192
|q (alk. paper)
|
| 020 |
|
|
|a 0262042193
|q (alk. paper)
|
| 020 |
|
|
|a 0262292440
|
| 020 |
|
|
|a 9780262292443
|
| 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)1045514957
|z (OCoLC)1055336112
|z (OCoLC)1081247619
|z (OCoLC)1125389163
|z (OCoLC)1136174424
|z (OCoLC)1153554929
|z (OCoLC)1162508319
|z (OCoLC)1171697429
|z (OCoLC)1172757649
|z (OCoLC)1228613903
|z (OCoLC)1259081772
|z (OCoLC)1286901005
|
| 037 |
|
|
|a 1290
|b MIT Press
|
| 037 |
|
|
|a 9780262256032
|b MIT Press
|
| 050 |
|
4 |
|a QA402.5
|b .D64 2004eb
|
| 072 |
|
7 |
|a MAT
|x 042000
|2 bisacsh
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Dorigo, Marco.
|
| 245 |
1 |
0 |
|a Ant colony optimization /
|c Marco Dorigo, Thomas Stützle.
|
| 260 |
|
|
|a Cambridge, Mass. :
|b MIT Press,
|c ©2004.
|
| 300 |
|
|
|a 1 online resource (xi, 305 pages) :
|b illustrations
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a data file
|
| 500 |
|
|
|a "A Bradford book."
|
| 504 |
|
|
|a Includes bibliographical references (pages 277-300) and index.
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|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.
|
| 546 |
|
|
|a English.
|
| 650 |
|
0 |
|a Mathematical optimization.
|
| 650 |
|
0 |
|a Ants
|x Behavior
|x Mathematical models.
|
| 650 |
|
7 |
|a MATHEMATICS
|x Optimization.
|2 bisacsh
|
| 650 |
|
7 |
|a Ants
|x Behavior
|x Mathematical models
|2 fast
|
| 650 |
|
7 |
|a Mathematical optimization
|2 fast
|
| 700 |
1 |
|
|a Stützle, Thomas.
|
| 758 |
|
|
|i has work:
|a ANT COLONY OPTIMIZATION (Text)
|1 https://id.oclc.org/worldcat/entity/E39PD3cVX89YqJGrDTyrQ9WyHP
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Dorigo, Marco.
|t Ant colony optimization.
|d Cambridge, Mass. : MIT Press, ©2004
|z 0262042193
|w (DLC) 2003066629
|w (OCoLC)53306742
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/holycrosscollege-ebooks/detail.action?docID=3338887
|y Click for online access
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.7551/mitpress/1290.001.0001?locatt=mode:legacy
|y Click for online access
|
| 903 |
|
|
|a EBC-AC
|
| 903 |
|
|
|a MIT-D2O-Backfile-Complete
|
| 994 |
|
|
|a 92
|b HCD
|