Task differentiation in Polistes wasp colonies: a model for self-organizing groups of robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
The ant colony optimization meta-heuristic
New ideas in optimization
Introduction to Algorithms
Depth-bounded discrepancy search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
An iterative sampling procedure for resource constrained project scheduling ith time windows
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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
Task allocation using a distributed market-based planning mechanism
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Wasp-like Agents for Distributed Factory Coordination
Autonomous Agents and Multi-Agent Systems
Experiments on Deliberation Equilibria in Auctions
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
Using performance profile trees to improve deliberation control
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Understanding performance tradeoffs in algorithms for solving oversubscribed scheduling
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Maximizing flexibility: a retraction heuristic for oversubscribed scheduling problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Enhanced probabilistic filtering for improving the efficiency of local searches
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Continuous management of airlift and tanker resources: A constraint-based approach
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
Randomization as a means for improving search performance in combinatorial domains has received increasing interest in recent years. In optimization contexts, it can provide a means for overcoming the deficiencies of available search heuristics and broadening search in productive directions. In this paper, we consider the issue of amplifying the performance of a search heuristic through randomization. We introduce a general framework for embedding a base heuristic within an iterative sampling process and searching a stochastic neighborhood of the heuristic's prescribedt rajectory. In contrast to previous approaches, which have used rank-ordering as a basis for randomization, our approach insteadre lies on assigned heuristic value. Use of heuristic value is important because it makes it possible to vary the level of stochasticity in relation to the discriminatory power of the heuristic in different decision contexts, and hence concentrate search around those decisions where the heuristic is least informative. To evaluate the efficacy of the approach, we apply it to a complex, weighted-tardiness scheduling problem. Taking a state-of-the-art heuristic for this scheduling problem as a starting point, we demonstrate an ability to consistently and significantly improve on the deterministic heuristic solution across a broad range of problem instances. Our approach is also shown to consistently outperform a previously developed, rank-ordering based approach to randomizing the same heuristic in terms of percentage of improvement obtained.