Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search

27Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features that influence problem difficulty. We consider these questions in the context of the job-shop scheduling problem (JSP), a domain where tabu search algorithms have been shown to be remarkably effective. Previously, we demonstrated that the mean distance between random local optima and the nearest optimal solution is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of this measure and develop a new model of problem difficulty that corrects these deficiencies. We show that Taillard's algorithm can be modeled with high fidelity as a simple variant of a straight-forward random walk. The random walk model accounts for nearly all of the variability in the cost required to locate both optimal and sub-optimal solutions to random JSPs, and provides an explanation for differences in the difficulty of random versus structured JSPs. Finally, we discuss and empirically substantiate two novel predictions regarding tabu search algorithm behavior. First, the method for constructing the initial solution is highly unlikely to impact the performance of tabu search. Second, tabu tenure should be selected to be as small as possible while simultaneously avoiding search stagnation; values larger than necessary lead to significant degradations in performance. © 2005 AI Access Foundation. All rights reserved.

References Powered by Scopus

Optimization by simulated annealing

34920Citations
N/AReaders
Get full text

COMPLEXITY OF FLOWSHOP AND JOBSHOP SCHEDULING.

2388Citations
N/AReaders
Get full text

Benchmarks for basic scheduling problems

2108Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Local search with edge weighting and configuration checking heuristics for minimum vertex cover

165Citations
N/AReaders
Get full text

New hard benchmark for flowshop scheduling problems minimising makespan

159Citations
N/AReaders
Get full text

Dynamic local search for the maximum clique problem

142Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Watson, J. P., Darrell Whitley, L., & Howe, A. E. (2005). Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search. Journal of Artificial Intelligence Research, 24, 221–261. https://doi.org/10.1613/jair.1576

Readers over time

‘09‘12‘13‘14‘15‘16‘18‘21‘22‘2401234

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 8

57%

Researcher 4

29%

Professor / Associate Prof. 1

7%

Lecturer / Post doc 1

7%

Readers' Discipline

Tooltip

Computer Science 8

53%

Engineering 3

20%

Psychology 2

13%

Business, Management and Accounting 2

13%

Save time finding and organizing research with Mendeley

Sign up for free
0