Ant Algorithms Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings /

This 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....

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Dorigo, Marco (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Di Caro, Gianni (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sampels, Michael (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Έκδοση:1st ed. 2002.
Σειρά:Lecture Notes in Computer Science, 2463
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 06867nam a2200613 4500
001 978-3-540-45724-4
003 DE-He213
005 20191220130336.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 |a 9783540457244  |9 978-3-540-45724-4 
024 7 |a 10.1007/3-540-45724-0  |2 doi 
040 |d GrThAP 
050 4 |a TK5105.5-5105.9 
072 7 |a UKN  |2 bicssc 
072 7 |a COM075000  |2 bisacsh 
072 7 |a UKN  |2 thema 
082 0 4 |a 004.6  |2 23 
245 1 0 |a Ant Algorithms  |h [electronic resource] :  |b Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings /  |c edited by Marco Dorigo, Gianni Di Caro, Michael Sampels. 
250 |a 1st ed. 2002. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2002. 
300 |a XIV, 310 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2463 
505 0 |a A 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. 
520 |a This 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. 
650 0 |a Computer communication systems. 
650 0 |a Artificial intelligence. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Computers. 
650 0 |a Numerical analysis. 
650 1 4 |a Computer Communication Networks.  |0 http://scigraph.springernature.com/things/product-market-codes/I13022 
650 2 4 |a Artificial Intelligence.  |0 http://scigraph.springernature.com/things/product-market-codes/I21000 
650 2 4 |a Programming Techniques.  |0 http://scigraph.springernature.com/things/product-market-codes/I14010 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Computation by Abstract Devices.  |0 http://scigraph.springernature.com/things/product-market-codes/I16013 
650 2 4 |a Numeric Computing.  |0 http://scigraph.springernature.com/things/product-market-codes/I1701X 
700 1 |a Dorigo, Marco.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Di Caro, Gianni.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Sampels, Michael.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540441465 
776 0 8 |i Printed edition:  |z 9783662195260 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2463 
856 4 0 |u https://doi.org/10.1007/3-540-45724-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)