Optimal speedup of Las Vegas algorithms
Information Processing Letters
Nonsystematic backtracking search
Nonsystematic backtracking search
A fast taboo search algorithm for the job shop problem
Management Science
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
Problem difficulty for tabu search in job-shop scheduling
Artificial Intelligence
A Bayesian Approach to Tackling Hard Computational Problems
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Eighteenth national conference on Artificial intelligence
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem
Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Disco - Novo - GoGo: integrating local search and complete search with restarts
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
The effect of restarts on the efficiency of clause learning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Learning How to Propagate Using Random Probing
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An ant colony optimization approach to the traveling tournament problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Using expectation maximization to find likely assignments for solving CSP's
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Fitness-distance correlation and solution-guided multi-point constructive search for CSPs
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A hybrid constraint programming/local search approach to the job-shop scheduling problem
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Search spaces for min-perturbation repair
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Models and strategies for variants of the job shop scheduling problem
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A competent memetic algorithm for complex scheduling
Natural Computing: an international journal
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Bounding, filtering and diversification in CP-based local branching
Journal of Heuristics
Complete characterization of near-optimal sequences for the two-machine flow shop scheduling problem
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Deriving Information from Sampling and Diving
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Hi-index | 0.00 |
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. A small number of these "elite" solutions is maintained during the search. We introduce the technique and perform three sets of experiments on the job shop scheduling problem. First, a systematic, fully crossed study of SGMPCS is carried out to evaluate the performance impact of various parameter settings. Second, we inquire into the diversity of the elite solution set, showing, contrary to expectations, that a less diverse set leads to stronger performance. Finally, we compare the best parameter setting of SGMPCS from the first two experiments to chronological backtracking, limited discrepancy search, randomized restart, and a sophisticated tabu search algorithm on a set of well-known benchmark problems. Results demonstrate that SGMPCS is significantly better than the other constructive techniques tested, though lags behind the tabu search.