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
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Tuning local search for satisfiability testing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Mixed-initiative decision support in agent-based automated contracting
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Coloration Neighbourhood Search With Forward Checking
Annals of Mathematics and Artificial Intelligence
A Hybrid Seachr Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Eighteenth national conference on Artificial intelligence
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A Range-Compaction Heuristic for Graph Coloring
Journal of Heuristics
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Journal of Scheduling
Proceedings of the 2005 ACM symposium on Applied computing
Coordinating multiple rovers with interdependent science objectives
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
An agent-based algorithm for generalized graph colorings
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Generalised graph colouring by a hybrid of local search and constraint programming
Discrete Applied Mathematics
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Leap before you look: an effective strategy in an oversubscribed scheduling problem
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
An effective algorithm for project scheduling with arbitrary temporal constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A comparison of techniques for scheduling earth observing satellites
IAAI'04 Proceedings of the 16th conference on Innovative applications of artifical intelligence
Understanding performance tradeoffs in algorithms for solving oversubscribed scheduling
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
GIB: imperfect information in a computationally challenging game
Journal of Artificial Intelligence Research
Understanding algorithm performance on an oversubscribed scheduling application
Journal of Artificial Intelligence Research
An evolutionary squeaky wheel optimization approach to personnel scheduling
IEEE Transactions on Evolutionary Computation
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows
IEEE Transactions on Evolutionary Computation
The general yard allocation problem
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
A constraint-based approach to scheduling an individual's activities
ACM Transactions on Intelligent Systems and Technology (TIST)
A squeaky wheel optimisation methodology for two-dimensional strip packing
Computers and Operations Research
Optimization of stowage plans for RoRo ships
Computers and Operations Research
Expert Systems with Applications: An International Journal
Evolutionary squeaky wheel optimization: A new framework for analysis
Evolutionary Computation
Improved squeaky wheel optimisation for driver scheduling
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Mixed discrete and continuous algorithms for scheduling airborne astronomy observations
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
DR.FILL: crosswords and an implemented solver for singly weighted CSPs
Journal of Artificial Intelligence Research
A bi-objective model for robust berth allocation scheduling
Computers and Industrial Engineering
Turning personal calendars into scheduling assistants
CHI '12 Extended Abstracts on Human Factors in Computing Systems
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
Multistart Iterated Tabu Search for Bandwidth Coloring Problem
Computers and Operations Research
An improved squeaky wheel optimization approach to the airport gates assignment problem
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Hi-index | 0.00 |
We describe a general approach to optimization which we term "Squeaky Wheel" Optimization (SWO). In SWO, a greedy algorithm is used to construct a solution which is then analyzed to find the trouble spots, i.e., those elements, that, if improved, are likely to improve the objective function score. The results of the analysis are used to generate new priorities that determine the order in which the greedy algorithm constructs the next solution. This Construct/Analyze/Prioritize cycle continues until some limit is reached, or an acceptable solution is found. SWO can be viewed as operating on two search spaces: solutions and prioritizations. Successive solutions are only indirectly related, via the re-prioritization that results from analyzing the prior solution. Similarly, successive prioritizations are generated by constructing and analyzing solutions. This "coupled search" has some interesting properties, which we discuss. We report encouraging experimental results on two domains, scheduling problems that arise in fiber-optic cable manufacturing, and graph coloring problems. The fact that these domains are very different supports our claim that SWO is a general technique for optimization.