Ant Algorithms

1. Front Matter

   Pages I-XIV

   PDF

2. A MAX-MIN Ant System for the University Course Timetabling Problem

   1. A MAX-MIN Ant System for the University Course Timetabling Problem

      • Krzysztof Socha, Joshua Knowles, Michael Sampels

      Pages 1-13

3. ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification

   1. ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification

      • Christian Blum

      Pages 14-27

4. Agent-Based Approach to Dynamic Task Allocation

   1. Agent-Based Approach to Dynamic Task Allocation

      • Shervin Nouyan

      Pages 28-39

5. An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem

   1. An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem

      • Alena Shmygelska, Rosalía Aguirre-Hernández, Holger H. Hoos

      Pages 40-52

6. An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows

   1. An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows

      • Ismail Ellabib, Otman A. Basir, Paul Calamai

      Pages 53-64

7. Ant Algorithms for Assembly Line Balancing

   1. Ant Algorithms for Assembly Line Balancing

      • Joaquín Bautista, Jordi Pereira

      Pages 65-75

8. Ant Colonies as Logistic Processes Optimizers

   1. Ant Colonies as Logistic Processes Optimizers

      • Carlos A. Silva, Thomas A. Runkler, João M. Sousa, Rainer Palm

      Pages 76-87

9. Ant Systems for a Dynamic TSP

   1. Ant Systems for a Dynamic TSP

      • Casper Joost Eyckelhof, Marko Snoek

      Pages 88-99

10. Anti-pheromone as a Tool for Better Exploration of Search Space

    1. Anti-pheromone as a Tool for Better Exploration of Search Space

       • James Montgomery, Marcus Randall

       Pages 100-110

11. Applying Population Based ACO to Dynamic Optimization Problems

    1. Applying Population Based ACO to Dynamic Optimization Problems

       • Michael Guntsch, Martin Middendorf

       Pages 111-122

12. Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks

    1. Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks

       • Otto Wittner, Bjarne E. Helvik

       Pages 123-134

13. Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows

    1. Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows

       • Marc Reimann, Karl Doerner, Richard F. Hartl

       Pages 135-148

14. Modelling ACO: Composed Permutation Problems

    1. Modelling ACO: Composed Permutation Problems

       • Daniel Merkle, Martin Middendorf

       Pages 149-162

15. Self-Organized Networks of Galleries in the Ant Messor Sancta

    1. Self-Organized Networks of Galleries in the Ant Messor Sancta

       • Jérôme Buhl, Jean-Louis Deneubourg, Guy Theraulaz

       Pages 163-175

16. Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic

    1. Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic

       • Leonora Bianchi, Luca Maria Gambardella, Marco Dorigo

       Pages 176-187

17. Toward the Formal Foundation of Ant Programming

    1. Toward the Formal Foundation of Ant Programming

       • Mauro Birattari, Gianni Di Caro, Marco Dorigo

       Pages 188-201

18. Towards Building Terrain-Covering Ant Robots

    1. Towards Building Terrain-Covering Ant Robots

       • Jonas Svennebring, Sven Koenig

       Pages 202-215

19. Short Papers

    1. A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions

       • Johann Dréo, Patrick Siarry

       Pages 216-221

    2. An Ant-Based Framework for Very Strongly Constrained Problems

       • Vittorio Maniezzo, Matteo Milandri

       Pages 222-227

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

• Ant Algorithms
• Ant Colonies
• Ant Programming
• Ant algorithm
• Autonomous Agent
• Distributed Control
• Evolutionary Systems
• Fault Tolerance
• Genetic ALgorithms
• Networking
• Self-Organization
• algorithms
• ants
• operations research
• optimization
• algorithm analysis and problem complexity

• IRIDIA, Université de Bruxelles, Brussels, Belgium

  Marco Dorigo, Gianni Caro, Michael Sampels

Policies and ethics