Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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.
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.
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.
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.
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.
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.
S. Kreipl. A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3(3):125–138, 2000.
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.
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.
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.
O. Martin and S.W. Otto. Combining Simulated Annealing with Local Search Heuristics. Annals of Operations Research, 63:57–75, 1996.
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.
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.
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.
N. Mladenoviç and P. Hansen. Variable Neighborhood Search. Computers & Operations Research, 24:1097–1100, 1997.
C.N. Potts and L.N. Van Wassenhove. Single machine tardiness sequencing heuristics. IIE Transactions, 23:346–354, 1991.
C.R. Reeves. Landscapes, operators and heuristic search. To appear in Annals of Operations Research, 2000.
T. Stützle. Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98-04, FG Intellektik, TU Darmstadt, August 1998.
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.
Thomas Stützle. Iterated local search for the quadratic assignment problem. Technical Report AIDA-99-03, FG Intellektik, FB Informatik, TU Darmstadt, March 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
den Besten, M., Stützle, T., Dorigo, M. (2001). Design of Iterated Local Search Algorithms. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_46
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive