Name
Abstract | ||
|---|---|---|
We had a problem to be solved: the thermal generator maintenance scheduling problem (Yam82). We wanted to look at stochastic methods and this paper will present three methods and discuss the pros and cons of each. We will also present evidence that strongly suggests that for this problem, tabu search was the most effective and efficient technique. The problem is concerned with scheduling essential maintenance over a fixed length repeated planning hori- zon for a number of thermal generator units while min- imising the maintenance costs and providing enough ca- pacity to meet the anticipated demand. Traditional optimisation based techniques such as integer programming (DM75), dynamic program- ming (ZQ75, YSY83) and branch-and-bound (EDM76) have been proposed to solve this problem. For small problems these methods give an exact optimal solution. However, as the size of the problem increases, the size of the solution space increases exponentially and hence also the running time of these algorithms. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/978-3-7091-6492-1_58 | ICANNGA |
Keywords | DocType | Citations |
modern techniques such as simulated annealing ˇ,to overcome this difficulty,tabu search,simulated annealing,branch and bound,scheduling problem | Conference | 7 |
PageRank | References | Authors |
1.01 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edmund K. Burke | 1 | 5593 | 363.80 |
| John A. Clark | 2 | 926 | 68.87 |
| Alistair J. Smith | 3 | 13 | 1.89 |