Advertisement

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

  • Daniel Merkle
  • Martin Middendorf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1803)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Bauer, B. Bullnheimer, R.F. Hartl, C. Strauss: An Ant Colony Optimization Approach for the Single Machine Total Tardiness Problem; in: Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), 6–9 July Washington D.C., USA, 1445–1450, 1999.Google Scholar
  2. 2.
    A. Colorni, M. Dorigo, V. Maniezzo, M. Trubian: Ant System for Job-Shop Scheduling; JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science, 34: 39–53 (1994).zbMATHGoogle Scholar
  3. 3.
    R.K. Congram, C.N. Potts, S. L. van de Velde: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem; submitted to INFORMS Journal on Computing.Google Scholar
  4. 4.
    H.A.J. Crauwels, C.N. Potts, L.N. Van Wassenhove: Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem; INFORMS Journal on Computing, 10: 341–359 (1998).zbMATHMathSciNetGoogle Scholar
  5. 5.
    M. Dorigo, G. Di Caro: The ant colony optimization meta-heuristic; in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, 1999, 11–32.Google Scholar
  6. 6.
    M. Dorigo, L. M. Gambardella: Ant colony system: A cooperative learning approach to the travelling salesman problem; IEEE Trans. on Evolutionary Comp., 1: 53–66 (1997).CrossRefGoogle Scholar
  7. 7.
    M. Dorigo, V. Maniezzo, A. Colorni: The Ant System: Optimization by a Colony of Cooperating Agents; IEEE Trans. Systems, Man, and Cybernetics — Part B, 26:29–41 (1996).CrossRefGoogle Scholar
  8. 8.
    J. Du, J.Y.-T. Leung: Minimizing the Total Tardiness on One Machine is NP-hard; Mathematics of Operations Research, 15: 483–496 (1990).zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    P. Forsyth, A. Wren: An Ant System for Bus Driver Scheduling; Report 97.25, University of Leeds-School of Computer Studies, 1997.Google Scholar
  10. 10.
    E.L. Lawler: A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness; Annals of Discrete Mathematics, i: 331–342 (1977).MathSciNetCrossRefGoogle Scholar
  11. 11.
    R. Michels, M. Middendorf: An Ant System for the Shortest Common Supersequence Problem; in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, (1999) 692–701.Google Scholar
  12. 12.
    C.N. Potts, L.N. Van Wessenhove: Single machine tardiness sequencing heuristics; IEE Transactions, 23: 346–354 (1991)CrossRefGoogle Scholar
  13. 13.
    T. Stützle: An ant approach for the flow shop problem; in Proc. of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT’ 98), Vol. 3, Verlag Mainz, Aachen, 1560–1564, 1998.Google Scholar
  14. 14.
    http://mscmga.ms.ic.ac.uk/jeb/orlib/wtinfo.html.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Daniel Merkle
    • 1
  • Martin Middendorf
    • 1
  1. 1.Institute for Applied Computer Science and Formal Description MethodsUniversity of KarlsruheGermany

Personalised recommendations