Ant Colony Optimization with the Relative Pheromone Evaluation Method

Authors:
Daniel Merkle;Martin Middendorf
Affiliations:
-;-
Venue:
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Year:
2002

Citing 5
Cited 1

The ant colony optimization meta-heuristic

New ideas in optimization
An ACO algorithm for the shortest common supersequence problem

New ideas in optimization
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems

Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Ant colony optimization for resource-constrained project scheduling

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Automated Selection of Appropriate Pheromone Representations in Ant Colony Optimization

Artificial Life

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the relative pheromone evaluation method for Ant Colony Optimization is investigated.We compare this method to the standard pheromone method and the summation method. Moreover we propose a new variant of the relative pheromone evaluation method. Experiments performed for various instances of the single machine scheduling problems with earliness costs and multiple due dates show the potential of the relative pheromone evaluation method.