N. Gomes and Z. Vale (Portugal)
Power systems; Maintenance scheduling; Constraint Pro gramming; Optimization
Maintenance scheduling of generating units is an important problem of power systems operations. Traditional approaches and even more recent ones, provide little flexibility to the modeling process. In this paper we test two search methods, in order to demonstrate that a Constraint Programming approach can provide the needed modeling flexibility without losing efficiency. One of the methods is complete being the other incomplete, and both are tested with general and specific vari able/value selection heuristics. Our test results show that the complete method performs badly in large problem instances and that the specific heuristics perform better than the general ones. Finally a comparison of our results, with those of other approaches, indicates a similar performance.
Important Links:
Go Back
