Ant Algorithms (Lecture Notes in Computer Science) de Marco Dorigo

Ant Algorithms: Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings: Lecture Notes in Computer Science, cartea 2463

Marco Dorigo

Gianni Di Caro

Michael Sampels

en Limba Engleză Paperback – 28 aug 2002

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

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1021^.30 lei
20%

Preț: 337^.03 lei
20%

Preț: 340^.22 lei
20%

Preț: 256^.27 lei
20%

Preț: 324^.32 lei
20%

Preț: 438^.69 lei
20%

Preț: 315^.78 lei
20%

Preț: 327^.52 lei
20%

Preț: 148^.66 lei
20%

Preț: 122^.89 lei
20%

Preț: 557^.41 lei
20%

Preț: 561^.37 lei
15%

Preț: 558^.56 lei
20%

Preț: 238^.01 lei
20%

Preț: 504^.57 lei
20%

Preț: 329^.09 lei
20%

Preț: 563^.75 lei
20%

Preț: 630^.24 lei
20%

Preț: 321^.96 lei
20%

Preț: 1361^.10 lei
20%

Preț: 310^.26 lei
20%

Preț: 607^.39 lei
Preț: 366^.90 lei
20%

Preț: 172^.69 lei
20%

Preț: 315^.19 lei
20%

Preț: 985^.59 lei
20%

Preț: 620^.87 lei
20%

Preț: 436^.22 lei
20%

Preț: 734^.34 lei
20%

Preț: 1034^.49 lei
17%

Preț: 360^.19 lei
20%

Preț: 309^.90 lei
20%

Preț: 573^.92 lei
20%

Preț: 301^.95 lei
20%

Preț: 307^.71 lei
20%

Preț: 369^.12 lei
20%

Preț: 327^.52 lei
20%

Preț: 794^.65 lei
20%

Preț: 569^.16 lei
Preț: 395^.43 lei
20%

Preț: 1138^.26 lei
20%

Preț: 734^.34 lei
20%

Preț: 315^.78 lei
20%

Preț: 330^.70 lei
20%

Preț: 538^.29 lei
20%

Preț: 326^.98 lei

Cuprins

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.