LEADER 07472nam 22008295 450 001 996465516903316 005 20201019012846.0 010 $a3-540-45724-0 024 7 $a10.1007/3-540-45724-0 035 $a(CKB)1000000000211851 035 $a(SSID)ssj0000321307 035 $a(PQKBManifestationID)11262189 035 $a(PQKBTitleCode)TC0000321307 035 $a(PQKBWorkID)10263535 035 $a(PQKB)11299233 035 $a(DE-He213)978-3-540-45724-4 035 $a(MiAaPQ)EBC3073098 035 $a(PPN)155188704 035 $a(EXLCZ)991000000000211851 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAnt Algorithms$b[electronic resource] $eThird International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings /$fedited by Marco Dorigo, Gianni Di Caro, Michael Sampels 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIV, 310 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2463 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-44146-8 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aA MAX-MIN Ant System for the University Course Timetabling Problem -- A MAX-MIN Ant System for the University Course Timetabling Problem -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- Agent-Based Approach to Dynamic Task Allocation -- Agent-Based Approach to Dynamic Task Allocation -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- Ant Algorithms for Assembly Line Balancing -- Ant Algorithms for Assembly Line Balancing -- Ant Colonies as Logistic Processes Optimizers -- Ant Colonies as Logistic Processes Optimizers -- Ant Systems for a Dynamic TSP -- Ant Systems for a Dynamic TSP -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Applying Population Based ACO to Dynamic Optimization Problems -- Applying Population Based ACO to Dynamic Optimization Problems -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Modelling ACO: Composed Permutation Problems -- Modelling ACO: Composed Permutation Problems -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Toward the Formal Foundation of Ant Programming -- Toward the Formal Foundation of Ant Programming -- Towards Building Terrain-Covering Ant Robots -- Towards Building Terrain-Covering Ant Robots -- Short Papers -- A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions -- An Ant-Based Framework for Very Strongly Constrained Problems -- Analysis of the Best-Worst Ant System and Its Variants on the QAP -- Ants and Loops -- Candidate Set Strategies for Ant Colony Optimisation -- Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization -- Homogeneous Ants for Web Document Similarity Modeling and Categorization -- Parallel Ant System for the Set Covering Problem -- Real-World Shop Floor Scheduling by Ant Colony Optimization -- Simulation of Nest Assessment Behavior by Ant Scouts -- Using Genetic Algorithms to Optimize ACS-TSP -- Posters -- A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm -- A Nested Layered Threshold Model for Dynamic Task Allocation -- ACO Algorithm with Additional Reinforcement -- Ant Colony System for Image Segmentation Using Markov Random Field -- Bidimensional Shapes Polygonalization by ACO -- Coevolutionary Ant Algorithms Playing Games -- GAACO: A GA + ACO Hybrid for Faster and Better Search Capability -- GPS Positioning Networks Design: An Application of the Ant Colony System. 330 $aThis book constitutes the refereed proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, held in Brussels, Belgium in September 2002. The 17 revised full papers, 11 short papers, and extended poster abstracts presented were carefully reviewed and selected from 52 submissions. The papers deal with theoretical and foundational aspects and a variety of new variants of ant algorithms as well as with a broad variety of optimization applications in networking and operations research. All in all, this book presents the state of the art in research and development in the emerging field of ant algorithms. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2463 606 $aComputer communication systems 606 $aArtificial intelligence 606 $aComputer programming 606 $aAlgorithms 606 $aComputers 606 $aNumerical analysis 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 615 0$aComputer communication systems. 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputers. 615 0$aNumerical analysis. 615 14$aComputer Communication Networks. 615 24$aArtificial Intelligence. 615 24$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aNumeric Computing. 676 $a512/.7 702 $aDorigo$b Marco$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDi Caro$b Gianni$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSampels$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aANTS 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465516903316 996 $aAnt Algorithms$92065528 997 $aUNISA