See this document in CiteSeerX!

Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu (2004)  (Make Corrections)  
Jean-Paul Watson, L. Darrell Whitley, Andrew Howe



  Home/Search   Context   Related

 
View or download:
sandia.gov/cfupload/c...cameraready.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sandia.gov/ccim..._presented=2005 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Tabu search is one of the most e#ective 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 di#culty. We consider these questions in the context of the job-shop... (Update)

Active bibliography (related documents):   More   All
1.9:   Deconstructing Nowicki and Smutnicki's i-TSAB Tabu Search.. - Watson, Howe, Whitley (2005)   (Correct)
1.0:   Problem Difficulty for Tabu Search in Job-Shop Scheduling - Watson, Beck, Howe, Whitley (2002)   (Correct)
0.5:   Toward an Understanding of Local Search Cost in Job-Shop .. - Watson, Beck, Howe.. (2001)   (Correct)

Similar documents based on text:
4.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ watson-linking,
  author = "Jean-Paul Watson and L. Darrell Whitley and Andrew Howe",
  title = "Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty:
    A Step Toward Demystifying Tabu",
  url = "citeseer.ist.psu.edu/watson04linking.html" }
Citations (may not include all citations):
1749   An Introduction to Probability Theory and Its Applications (context) - Feller - 1968
1527   Optimization by simulated annealing - Kirkpatrick, Gelatt et al. - 1983
329   Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
276   Finite Markov Chains (context) - Kemeny, Snell - 1960
272   Tabu Search - Glover, Laguna - 1997
112   A computational study of the job-shop scheduling problem (context) - Applegate, Cook - 1991
92   Cooling schedules for optimal annealing (context) - Hajek - 1988
79   A new adaptive multi-start technique for combinatorial globa.. (context) - Boese, Kahng et al. - 1994
64   Benchmarks for basic scheduling problems - Taillard - 1993
52   A fast taboo search algorithm for the job shop problem (context) - Nowicki, Smutnicki - 1996
44   Stochastic Local Search - Methods (context) - Hoos - 1998
42   Local search and the number of solutions - Clark, Frank et al. - 1996
41   Algorithms for solving production scheduling problems (context) - er, Thompson - 1960
40   New search spaces for sequencing problems with application t.. (context) - Storer, Wu et al. - 1992
39   Parallel taboo search techniques for the job shop scheduling.. (context) - Taillard - 1994
25   Job shop scheduling by simulated annealing (context) - van Laarhoven, Aarts et al. - 1992
23   Local search characteristics of incomplete SAT procedures - Schuurmans, Southey - 2001
23   The complexity of flowshop and jobshop scheduling (context) - Garey, Johnson et al. - 1976
21   Deterministic job-shop scheduling: Past (context) - Jain, Meeran - 1999
20   Backbone fragility and the local search cost peak - Singer, Gent et al. - 2000
15   Insertion techniques for the heuristic solution of the job s.. (context) - Werner, Winkler - 1995
14   Iterated local search (context) - Lourenco, Martin et al. - 2003
13   Backbones in optimization and approximation - Slaney, Walsh - 2001
12   Dynamic problem structure analysis as a basis for constraint.. (context) - Beck, Fox - 2000
11   Probability and Statistics for Engineers (context) - er, McClave - 1990
10   Annals of Operations Research (context) - Reeves - 1998
9   A search space analysis of the job shop scheduling problem - Mattfeld, Bierwirth et al. - 1999
8   Evolutionary Search and the Job Shop - Mattfeld - 1996
8   Benchmarks for shop scheduling problems (context) - Demirkol, Mehta et al. - 1998
6   Stochastic Local Search: Foundations and Applications (context) - Hoos, Stutzle - 2005
6   Generalized Job Shop Scheduling: Complexity and Local Search (context) - Vaessens - 1995
5   Solving the job shop scheduling problem with tabu search (context) - Barnes, Chambers - 1995
5   The job shop scheduling problem: Conventional and new soluti.. (context) - zewicz, Domschke et al. - 1996
3   A tabu search method guided by shifting bottleneck for the j.. - Pezzella, Merelli - 2000
3   Why solutions can be hard to find: A featural theory of cost.. (context) - Singer - 2000
3   Empirical Modeling and Analysis of Local Search Algorithms f.. (context) - Watson - 2003
2   Metaheuristic Optimization Via Memory and Evolution (context) - Nowicki, Smutnicki - 2005
2   Contrasting structured and random permutation flow-shop sche.. - Watson, Barbulescu et al. - 2002
2   Fitness landscapes - Stadler - 2002
1   Toward a descriptive model of local search cost in job-shop .. - Watson, Beck et al. - 2001
1   A mixture-model for the behaviour of SLS algorithms for SAT - Hoos - 2002
1   New and (context) - Jain, Rangaswamy et al. - 1996
1   Problem di#culty for tabu search in job-shop scheduling (context) - Watson, Beck et al. - 2003

Documents on the same site (http://gaston.sandia.gov/ccim_pubs_prod/main.cfm?year_presented=2005):   More
Confidence Region Estimation Techniques for Nonlinear.. - Vugrin, Swiler.. (2005)   (Correct)
A Combined Molecular Simulation-Molecular Theory Method.. - Frink, Martin (2005)   (Correct)
Source Location Inversion and the Effect of.. - McKenna..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC