Name
Abstract | ||
|---|---|---|
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 isthen analyzed to find the trouble spots, i.e., those elements, that, if improved, are likelyto improve the objective function score. The results of the analysis are used to generatenew priorities that determine the order in which the greedy algorithm constructs the nextsolution. This Construct/Analyze/Prioritize cycle... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1613/jair.561 | Journal of Artificial Intelligence Research |
Keywords | Field | DocType |
general technique,successive solution,next solution,prior solution,squeaky wheel,search space,greedy algorithm,general approach,successive prioritizations,acceptable solution,prioritize cycle,objective function | Mathematical optimization,Computer science,Scheduling (computing),Greedy algorithm,Artificial intelligence,Greedy randomized adaptive search procedure,Machine learning,Graph coloring | Journal |
Volume | Issue | ISSN |
10 | 1 | Journal Of Artificial Intelligence Research, Volume 10, pages
353-373, 1999 |
ISBN | Citations | PageRank |
0-262-51098-7 | 47 | 3.56 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Joslin | 1 | 172 | 17.29 |
| David P. Clements | 2 | 61 | 5.97 |