Design of Iterated Local Search Algorithms

An Example Application to the Single Machine Total Weighted Tardiness Problem
  • Matthijs den Besten
  • Thomas Stützle
  • Marco Dorigo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)


In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently proposed iterated dynasearch approach, which was shown to be a very effective ILS algorithm for this problem. In this paper we systematically configure an ILS algorithms by optimizing the single procedures part of ILS and optimizing their interaction. We come up with a highly effective ILS approach, which outperforms our implementation of the iterated dynasearch algorithm on the hardest benchmark instances.


Local Search Acceptance Criterion Local Search Algorithm Iterate Local Search Total Weighted Tardiness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T.S. Abdul-Razaq, C.N. Potts, and L.N. Van Wassenhove. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics, 26:235–253, 1990.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    E.B. Baum. Towards practical “neural” computation for combinatorial optimization problems. In J. Denker, editor, Neural Networks for Computing, pages 53–64, 1986. AIP conference proceedings.Google Scholar
  3. 3.
    R.K. Congram, C.N. Potts, and S.L. Van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, to appear, 2000.Google Scholar
  4. 4.
    H.A.J. Crauwels, C.N. Potts, and L.N. Van Wassenhove. Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 10(3):341–350, 1998.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    M. den Besten, T. Stützle, and M. Dorigo. Ant colony optimization for the total weighted tardiness problem. In M. Schoenauer et al., editor, Proceedings of PPSN-VI, volume 1917 of LNCS, pages 611–620. Springer Verlag, Berlin, Germany, 2000.Google Scholar
  6. 6.
    I. Hong, A.B. Kahng, and B.R. Moon. Improved large-step Markov chain variants for the symmetric TSP. Journal of Heuristics, 3(1):63–81, 1997.CrossRefzbMATHGoogle Scholar
  7. 7.
    H.H. Hoos and T. Stützle. Evaluating Las Vegas algorithms — pitfalls and remedies. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence 1998, pages 238–245. Morgan Kaufmann Publishers, 1998.Google Scholar
  8. 8.
    S. Kreipl. A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3(3):125–138, 2000.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problem. In P.L. Hammer et al., editor, Studies in Integer Programming, volume 1 of Annals of Discrete Mathematics, pages 343–362. North-Holland, Amsterdam, NL, 1977.CrossRefGoogle Scholar
  10. 10.
    H.R. Lourenço. Job-shop scheduling: Computational study of local search and large-step optimization methods. European Journal of Operational Research, 83:347–364, 1995.CrossRefzbMATHGoogle Scholar
  11. 11.
    H.R. Lourenço and M. Zwijnenburg. Combining the large-step optimization with tabu-search: Application to the job-shop scheduling problem. In I.H. Osman and J.P. Kelly, editors, Meta-Heuristics: Theory & Applications, pages 219–236. Kluwer, 1996.Google Scholar
  12. 12.
    O. Martin and S.W. Otto. Combining Simulated Annealing with Local Search Heuristics. Annals of Operations Research, 63:57–75, 1996.CrossRefzbMATHGoogle Scholar
  13. 13.
    O. Martin, S.W. Otto, and E.W. Felten. Large-Step Markov Chains for the Traveling Salesman Problem. Complex Systems, 5(3):299–326, 1991.MathSciNetzbMATHGoogle Scholar
  14. 14.
    H. Matsuo, C.J. Suh, and R.S. Sullivan. A controlled search simulated annealing method for the single machine weighted tardiness problem. Working paper 87-12-2, Department of Management, University of Texas at Austin, TX, 1987.Google Scholar
  15. 15.
    D. Merkle and M. Middendorf. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In S. Cagnoni et al., editor, Proceedings of EvoWorkshops 2000, volume 1803 of LNCS, pages 287–296. Springer Verlag, Berlin, Germany, 2000.Google Scholar
  16. 16.
    N. Mladenoviç and P. Hansen. Variable Neighborhood Search. Computers & Operations Research, 24:1097–1100, 1997.MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    C.N. Potts and L.N. Van Wassenhove. Single machine tardiness sequencing heuristics. IIE Transactions, 23:346–354, 1991.CrossRefGoogle Scholar
  18. 18.
    C.R. Reeves. Landscapes, operators and heuristic search. To appear in Annals of Operations Research, 2000.Google Scholar
  19. 19.
    T. Stützle. Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98-04, FG Intellektik, TU Darmstadt, August 1998.Google Scholar
  20. 20.
    T. Stützle. Local Search Algorithms for Combinatorial Problems-Analysis, Improvements, and New Applications. PhD thesis, Darmstadt University of Technology, Department of Computer Science, 1998.Google Scholar
  21. 21.
    Thomas Stützle. Iterated local search for the quadratic assignment problem. Technical Report AIDA-99-03, FG Intellektik, FB Informatik, TU Darmstadt, March 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Matthijs den Besten
    • 1
  • Thomas Stützle
    • 1
  • Marco Dorigo
    • 2
  1. 1.Intellectics GroupDarmstadt University of TechnologyDarmstadtGermany
  2. 2.Université Libre de Bruxelles IRIDIABrusselsBelgium

Personalised recommendations