Design of iterated local search algorithms An Example application to the single machine total weighted tardiness problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2037, Issue , 2001, Pages 441-451

  Besten, Matthijs Den ^a   Stutzle, Thomas ^a   Dorigo, Marco ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; EVOLUTIONARY ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); SCHEDULING ALGORITHMS;

ITERATED LOCAL SEARCH; SINGLE MACHINE TOTAL WEIGHTED TARDINESS PROBLEM;

OPTIMIZATION;

EID: 84958038708     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_46     Document Type: Conference Paper

References (21)

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.
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.
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.
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.
5. M. den Besten, T. Stutzle, 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.
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.
7. H. H. Hoos and T. Stutzle. 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.
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.
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.
10. H. R. Lourenco. Job-shop scheduling: Computational study of local search and large-step optimization methods. European Journal of Operational Research,83:347-364, 1995.
11. H. R. Lourenco 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.
12. O. Martin and S.W. Otto. Combining Simulated Annealing with Local Search Heuristics. Annals ofOperations Research, 63:57-75, 1996.
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.
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.
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.
16. N. Mladenovic and P. Hansen. Variable Neighborhood Search. Computers & Operations Research, 24:1097-1100, 1997.
17. C. N. Potts and L. N. Van Wassenhove. Single machine tardiness sequencing heuristics. IIE Transactions, 23:346-354, 1991.
18. C. R. Reeves. Landscapes, operators and heuristic search. To appear in Annals of Operations Research, 2000.
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.
20. T. Stutzle. Local Search Algorithms for Combinatorial Problems-Analysis, Improvements, and New Applications. PhD thesis, Darmstadt University of Technology, Department of Computer Science, 1998.
21. Thomas Stuützle. Iterated local search for the quadratic assignment problem. Technical Report AIDA-99-03, FG Intellektik, FB Informatik, TU Darmstadt, March 1999.