©Guy Theraulaz




 Conference email address: ants@iridia.ulb.ac.be

Program

The workshop will be spread over three locations, called: IRIDIA, TALKS ROOM, and POSTERS ROOM. The addresses are given below.

IRIDIA
Building C
5th Floor
87 av. Adolphe Buyl
1050 Brussels
Directions

TALKS ROOM
Building S (Sociologie)
Institut de Hautes Etudes de Belgique (1st floor)
44 av. Jeanne
1050 Brussels
Directions
.

POSTERS ROOM
Building C (same as IRIDIA)
Room C-3-122 (3rd floor)
87 av. Adolphe Buyl
1050 Brussels
Directions
.

Thursday 7 September 2000

  • 16:00 - 19:30 Registration at IRIDIA lab (5th floor, Building C)
  • 18:30 - 20:30 Tutorial on Ant Algorithms by M. Dorigo in the TALKS ROOM

Friday 8 September 2000

  • From 08:00 Registration

  • 08:45 Introductory remarks

Session 1: Real Ants (TALKS ROOM)

  • 9:00 - 9:30 Self-Organization or Individual Complexity in Social Insects

    • J.-L. Deneubourg & C. Detrain, Université Libre de Bruxelles, Bruxelles, Belgium
  • 9:30 - 10:00 How Many Agents Make a Working Whole?

    • D.J.T. Sumpter, Oxford University, Oxford, U.K.
    M. Beekman, Sheffield University, Sheffield, U.K.
  • 10:00 - 10:30 Collective Decision-making in a Small Society: How the Ant Leptothorax Albipennis Chooses a Nest Site

    • S.C. Pratt (1), E. B. Mallon (1), D. J. T. Sumpter (2), N. R. Franks (1),
    (1) University of Bath, Bath, U.K.
    (2) University of Oxford Mathematical Institute, Oxford, U.K.
10:30 - 11:00 Coffee break

Session 2: Combinatorial Optimization 1 (TALKS ROOM)

  • 11:00 - 11:30 The A(ge)nt based Cross-entropy (ABCE) Method for Combinatorial and Network Optimization

    • R. Y. Rubinstein, Technion, Israel Institute of Technology, Haifa, Israel
  • 11:30 - 12:00 Solving CSPs with Ant Colonies

    • L. Schoofs & B. Naudts, Universiteit Antwerpen, Antwerpen, Belgium
  • 12:00 - 12:30 A Generic Ant Algorithm for Solving Constraint Satisfaction Problems

    • S. Pimont & C. Solnon, Université de Lyon, Villeurbanne, France
12:30 - 14:30 Free time for lunch
(Lunch is up to the attendees. A list of restaurants and cafeterias in the neighborhood will be provided.)

Poster Session 1 (POSTERS ROOM)

  • 14:30 - 17:00

    • Multiple Pheromones for Improved Guidance
    S. A. Brueckner & H. Van Dyke Parunak, ERIM Center for Electronic Commerce, Ann Arbor, MI, USA

    Mixed-Model Final Assembly Line Scheduling by Means of a Virtual Ants Colony
    A. Brun & M. Caridi, Politecnico di Milano, Milano, Italy

    ACO Strategies for Dynamic TSP
    M. Guntsch, J. Branke, M. Middendorf, H. Schmeck, University of Karlsruhe, Karlsruhe, Germany

    Wavelength Routing Using Artificial Ants in the Optical Communication Networks
    C. Moon, K. Wee, H. Yeh, M. Hong, Ajou University, South Korea

    Comparison of Foraging Strategies in Two Ant Colony Models - The Normal Model and the Desensitization Model
    M. Nakamura, Electrotechnical Laboratory, Nakoji, Japan

    Ant System Approach for the Flowshop Problem with Bicriteria of Makespan and Total Flow Time Minimisation
    G. C. Onwubolu, National University of Science and technology, Bulawayo, Zimbabwe

    Artificial Ant Colonies in Digital Image Habitats - A Mass Behaviour Effect Study on Pattern Recognition
    V. Ramos, Instituto Superior Technico, Lisboa, Portugal
    F. Almeida, VARIOGRAMA.com, Lisboa, Portugal

    Project MASCADA, Ant Algorithms in Manufacturing Control Systems
    P. Valckenaers, P. Peeters, H. van Brussel, Katholieke Universiteit Leuven, Heverlee, Belgium

    The Zero Sum Game of Ant Vision and Olfaction
    C. Washington, K. Vick, J. Thomas, University of Maryland College Park, MD, USA

    Edge Ant Walk for Patrolling Networks
    V. M. Yanovski, I. A. Wagner, A. M. Bruckstein, IBM Haifa Research Lab, Haifa, Israel

16:00 - 16:30 Coffee break (during poster session)

Session 3: Combinatorial Optimization 2 (TALKS ROOM)

  • 18:00 - 18:30 An ANTS Heuristic for the Long-Term Car Pooling Problem

    • V. Maniezzo, A. Carbonaro, University of Bologna, Cesena, Italy
    D. Vigo, University of Bologna, Bologna, Italy
    H. Hildmann, University of Amsterdam, Amsterdam, The Netherlands
  • 18:30 - 19:00 Ant Colonies for the Set Covering Problem

    • R. Hadji, M. Rahoual, Université de Sciences et de Technologie Houari Boumediene, Alger, Algeria
    E. Talbi, V. Bachelet, LIFL, Cité scientifique, Villeneuve d'Ascq, France
20:00 Social Dinner

Saturday 9 September 2000

Session 4: Combinations with other Paradigms (TALKS ROOM)

  • 9:00 - 9:30 Learning Fuzzy Rules Using Ant Colony Optimization Algorithms

    • J. Casillas, O. Cordón, F. Herrera, University of Granada, Granada, Spain
  • 9:30 - 10:00 Ant Programming: Or How to Use Ants for Automatic Programming

    • O. Roux & C. Fonlupt, Université du Littoral, Calais, France
  • 10:00 - 10:30 A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System

    • O. Cordón, I. Fernández de Viana, F. Herrera, L. Moreno, University of Granada, Granada, Spain
10:30 - 11:00 Coffee break

Session 5: Combinatorial Optimization 3 (TALKS ROOM)

  • 11:00 - 11:30 An Ant Colony Optimization Application to the Single Machine Total Weighted Tardiness Problem

    • M. den Besten, University of Amsterdam, The Netherlands
    T. Stützle, Darmstadt University of Technology, Darmstadt, Germany
    M. Dorigo, Université Libre de Bruxelles, Bruxelles, Belgium
  • 11:30 - 12:00 Ant Colony Optimization for the RCPSP Using Weighted Summation Evaluation

    • D. Merkle, M. Middendorf, H. Schmeck, University of Karlsruhe, Karlsruhe, Germany
  • 12:00 - 12:30 A Coloured Ant System Approach to Graph Tree Partition

    • R. Cordone & F. Maffioli, Politecnico di Milano, Milano, Italy
12:30 - 14:30 Free time for lunch
(Lunch is up to the attendees. A list of restaurants and cafeterias in the neighborhood will be provided.)

Poster Session 2 (POSTERS ROOM)

  • 14:30 - 17:00

    • Reorganization of a Productive Department in Cells through the Use of Insect Society
    A. Brun, A. Pedroni, F. D. Pecere, Politecnico di Milano, Milano, Italy

    AntNet Combined to Stochastic Estimator Learning Automata (SELA) for QoS Routing in ATM Networks
    G. Di Caro, ATR Human Information Processing, Kyoto, Japan
    A. V. Vasilakos, Institute of Computer Science, FORTH, Heraklion, Crete, Greece

    Clustering Ants: A JAVA Implementation
    M. Dorigo & S. Magdelyns, Université Libre de Bruxelles, Bruxelles, Belgium

    Scheduling a Single Machine where Setup Times are Sequence Dependent Using an Ant-Colony Heuristic
    C. Gagné & M. Gravel, Université du Québec à Chicoutimi, Québec, Canada
    W. L. Price, Université Laval, Québec, Canada

    Ant Colony Optimization for the Sequential Ordering Problem
    L. M. Gambardella, IDSIA, Manno-Lugano, Switzerland
    M. Dorigo, Université Libre de Bruxelles, Bruxelles, Belgium

    Satisfied Ants
    A. Løkketangen, Molde College Britveien, Molde, Norway

    Ant-based Multi-constrained Routing and NK-landscapes
    T. Michalareas & L. Sacks, University College London, London, UK

    Ant Economics: What Simple Agents Can Teach us about Supply, Demand and Eating Your Dead
    M. Reddy & P. Kedward, University of Glamorgan, Wales, U.K.

    Stigmergy and Bootstrapping: Using Ant Algorithms as a Case Study for Learning in MAS
    K. Verbeeck & A. Nowé, Vrije Universiteit Brussel, Brussels, Belgium

15:45 - 16:15 Coffee break (during poster session)

17:00 Conclusion

Last updated September 2, 2000