Effective algorithm for handling constraints in generator maintenance scheduling

K. Y. Huang, H. T. Yang

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)


An effective algorithm for handling constraints to solve the generator maintenance scheduling (GMS) problem is presented. The proposed algorithm of constraint logic programming (CLP) synthesises logic programming, constraint satisfaction technique (CST), and branch and bound search schemes to provide an efficient and flexible approach to the problem. The constraints of the problem cannot only be conveniently managed by the logic programming but also be actively used to reduce the search space by the CST. Once the infeasible solutions are pruned away from the search space, the depth-first branch and bound search strategy is then used for determining the optimal solution. The practical GMS problem of Taiwan Power (Taipower) system is solved by the proposed CLP algorithm for demonstrating its effectiveness. To exhibit the efficiency of the proposed algorithm, the results obtained are compared with those from the established methods of simulated annealing (SA) and lagrangian relaxation (LR).

Original languageEnglish
Pages (from-to)274-282
Number of pages9
JournalIEE Proceedings: Generation, Transmission and Distribution
Issue number3
Publication statusPublished - 2002 May 1

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Effective algorithm for handling constraints in generator maintenance scheduling'. Together they form a unique fingerprint.

Cite this