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

Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness Problem. Compared to an existing ACO algorithm for the unweighted Total Tardiness Problem our algorithm has several improvements. The main novelty is that in our algorithm the ants are guided on their way to good solutions by sums of pheromone values. This allows the ants to take into account pheromone values that have already been used for making earlier decisions.

• Type: Conference
• Year: 2000
• Where: EVOW
• Authors: Daniel Merkle, Martin Middendorf
• Keywords: ACO Algorithm, Artificial Intelligence, EVOW 2000, Pheromone Values, Tardiness Problem