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

Authors:
Daniel Merkle;Martin Middendorf
Affiliations:
-;-
Venue:
Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Year:
2000

Citing 7
Cited 13

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
The ant colony optimization meta-heuristic

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

New ideas in optimization
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

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

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

Ant Colony Optimization with the Relative Pheromone Evaluation Method

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Design of Iterated Local Search Algorithms

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Fast ant colony optimization on reconfigurable processor arrays

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Modelling ACO: Composed Permutation Problems

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant Algorithms for Assembly Line Balancing

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Bi-Criterion Optimization with Multi Colony Ant Algorithms

EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed

Computers and Operations Research
Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem

Journal of Intelligent Manufacturing
Beam-ACO applied to assembly line balancing

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Solving a bi-objective flowshop scheduling problem by pareto-ant colony optimization

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
A new ant colony algorithm for makespan minimization in permutation flow shops

Computers and Industrial Engineering
Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.