Pheromone evaluation in Ant Colony Optimization

In ant colony optimization (ACO) artificial ants communicate by laying synthetic pheromone along the edges on their path through a decision graph. This attracts following ants so that they are likely to search in the same region of the search space. The problem of how pheromone information should be evaluated in ant systems is studied in this paper. The standard approach for pheromone evaluation is that, for every decision, ants use only the local pheromone values corresponding to the possible outcomes of this decision. We show that the optimization behaviour of an ant algorithm can be improved substantially when the ants use more pheromone information than just local pheromone values. This clearly indicates that the problem of pheromone evaluation is an important topic for ant colony optimization that deserves attention.

[1]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[2]  Richard F. Hartl,et al.  An ant colony optimization approach for the single machine total tardiness problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[4]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[5]  S V Zwaan,et al.  ANT COLONY OPTIMISATION FOR JOB SHOP SCHEDULING , 1998 .

[6]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..

[7]  Daniel Merkle,et al.  An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.

[8]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Rainer Kolisch Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[10]  Ben Paechter,et al.  Real-World Applications of Evolutionary Computing , 2003, Lecture Notes in Computer Science.

[11]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[12]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[13]  Rainer Kolisch,et al.  Benchmark instances for project scheduling problems , 1999 .

[14]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..