Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics

Authors:
Vincent A. Cicirello;Stephen F. Smith
Affiliations:
Department of Computer Science, Drexel University, Philadelphia 19104;The Robotics Insitute, Carnegie Mellon University, Pittsburgh 15213
Venue:
Journal of Heuristics
Year:
2005

Citing 24
Cited 12

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Introduction to algorithms

Introduction to algorithms
Systematic and nonsystematic search strategies

Proceedings of the first international conference on Artificial intelligence planning systems
BPSS: a scheduling support system for the packaging industry

Operations Research
Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems

Artificial Intelligence
Learning evaluation functions for global optimization and Boolean satisfiability

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Resolving non-uniqueness in design feature histories

Proceedings of the fifth ACM symposium on Solid modeling and applications
Algorithm performance and problem structure for flow-shop scheduling

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
A Constraint-Based Method for Project Scheduling with Time Windows

Journal of Heuristics
An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Amplification of Search Performance through Randomization of Heuristics

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Machining Feature-Based Comparisons of Mechanical Parts

SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Learning evaluation functions for global optimization

Learning evaluation functions for global optimization
An approach to a feature-based comparison of solid models of machined parts

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Depth-bounded discrepancy search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Systematic versus stochastic constraint satisfaction

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Stochastic procedures for generating feasible schedules

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Heuristic-biased stochastic sampling

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Improved limited discrepancy search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Parameter control in evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Non-wrapping order crossover: an order preserving crossover operator that respects absolute position

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

Computers and Operations Research
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times

Computers and Operations Research
Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic

Expert Systems with Applications: An International Journal
Performance Evaluation of an Adaptive Ant Colony Optimization Applied to Single Machine Scheduling

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Solving permutational routing problems by population-based metaheuristics

Computers and Industrial Engineering
The max K-armed bandit: a new model of exploration applied to search heuristic selection

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups

Journal of Intelligent Manufacturing
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine

Computers and Operations Research
A discrete electromagnetism-like mechanism for single machine total weighted tardiness problem with sequence-dependent setup times

Applied Soft Computing
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research
Single machine scheduling with controllable processing times to minimize total tardiness and earliness

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the utility of introducing randomization as a means of boosting the performance of search heuristics. We introduce a particular approach to randomization, called Value-biased stochastic sampling (VBSS), which emphasizes the use of heuristic value in determining stochastic bias. We offer an empirical study of the performance of value-biased and rank-biased approaches to randomizing search heuristics. We also consider the use of these stochastic sampling techniques in conjunction with local hill-climbing. Finally, we contrast the performance of stochastic sampling search with more systematic search procedures as a means of amplifying the performance of search heuristics.