Ant Algorithms

Third International Workshop, ANTS 2002 Brussels, Belgium, September 12–14, 2002 Proceedings

  • Marco Dorigo
  • Gianni Di Caro
  • Michael Sampels
Conference proceedings ANTS 2002

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2463)

Table of contents

  1. Front Matter
    Pages I-XIV
  2. A MAX-MIN Ant System for the University Course Timetabling Problem

    1. Krzysztof Socha, Joshua Knowles, Michael Sampels
      Pages 1-13
  3. ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification

  4. Agent-Based Approach to Dynamic Task Allocation

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

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

  7. Ant Algorithms for Assembly Line Balancing

    1. Joaquín Bautista, Jordi Pereira
      Pages 65-75
  8. Ant Colonies as Logistic Processes Optimizers

    1. Carlos A. Silva, Thomas A. Runkler, João M. Sousa, Rainer Palm
      Pages 76-87
  9. Ant Systems for a Dynamic TSP

    1. Casper Joost Eyckelhof, Marko Snoek
      Pages 88-99
  10. Anti-pheromone as a Tool for Better Exploration of Search Space

    1. James Montgomery, Marcus Randall
      Pages 100-110
  11. Applying Population Based ACO to Dynamic Optimization Problems

    1. Michael Guntsch, Martin Middendorf
      Pages 111-122
  12. Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks

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

    1. Marc Reimann, Karl Doerner, Richard F. Hartl
      Pages 135-148
  14. Modelling ACO: Composed Permutation Problems

    1. Daniel Merkle, Martin Middendorf
      Pages 149-162
  15. Self-Organized Networks of Galleries in the Ant Messor Sancta

    1. 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. Leonora Bianchi, Luca Maria Gambardella, Marco Dorigo
      Pages 176-187
  17. Toward the Formal Foundation of Ant Programming

    1. Mauro Birattari, Gianni Di Caro, Marco Dorigo
      Pages 188-201
  18. Towards Building Terrain-Covering Ant Robots

    1. Jonas Svennebring, Sven Koenig
      Pages 202-215
  19. Short Papers

    1. Vittorio Maniezzo, Matteo Milandri
      Pages 222-227
    2. Oscar Cordón, Iñaki Fernández de Viana, Francisco Herrera
      Pages 228-234
    3. Geoffrey Canright
      Pages 235-242
    4. Marcus Randall, James Montgomery
      Pages 243-249
    5. Ryan M. Garlick, Richard S. Barr
      Pages 250-255
    6. Kok Meng Hoe, Weng Kin Lai, Tracy S. Y. Tai
      Pages 256-261
    7. Malek Rahoual, Riad Hadji, Vincent Bachelet
      Pages 262-267
    8. Andre Vogel, Marco Fischer, Hendrik Jaehn, Tobias Teich
      Pages 268-273
    9. E. Şahin, N. R. Franks
      Pages 274-281
    10. Marcin L. Pilat, Tony White
      Pages 282-287
  20. Posters

    1. Chen Ling, Sheng Jie, Qin Ling, Chen Hongjian
      Pages 288-289
    2. Tom De Wolf, Liesbeth Jaco, Tom Holvoet, Elke Steegmans
      Pages 290-291
    3. Stefka Fidanova
      Pages 292-293
    4. Salima Ouadfel, Mohamed Batouche, Catherine Garbay
      Pages 294-295
    5. Jürgen Branke, Michael Decker, Daniel Merkle, Hartmut Schmeck
      Pages 298-299
  21. Back Matter
    Pages 305-305

About these 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. 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

Editors and affiliations

  • Marco Dorigo
    • 1
  • Gianni Di Caro
    • 1
  • Michael Sampels
    • 1
  1. 1.IRIDIAUniversité de BruxellesBrusselsBelgium

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-44146-5
  • Online ISBN 978-3-540-45724-4
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site