An algorithm for thermal unit maintenance scheduling through combined use of GA SA and TS

Hyunchul Kim, Yasuhiro Hayashi, Koichi Nara

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper describes a method of solving a large scale long term thermal units' maintenance scheduling problem. In the solution algorithm, the genetic algorithms (GA), the simulated annealing (SA) and the tabu search (TS) are cooperatively used. The solution algorithm keeps the advantages of individual algorithm and shows a reasonable combination of local search and global search. It adopts acceptance probability to improve the convergence of the simple GA, and introduces special encoding/ decoding techniques. To strengthen the searching ability, the neighborhood of current solution produced by genetic operations are search by tabu search. The multiyear thermal unit maintenance scheduling problem is a large scale combinatorial optimization problem, and the "curse of dimension" limits the applications of such method as dynamic programming branch and bound method and integer programming, etc. Furthermore, by the recent amendment of law in Japan, thermal unit maintenance can be postponed under the permitted combination of the maintenance class (A:detailed, B:simplified, C:Minor). This makes the problem more complex and larger in scale because the time horizon is extended to several consecutive years and the maintenance class of certain unit could be changed to get feasible or more accurate solutions. The authors also proposed a method which combines the genetic algorithm and the simulated annealing. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution. However, it is hard to find the optimum solution by only applying the genetic operators. As a result, the accuracy of this method is not a stable one. In the solution algorithm, the neighborhood of the solutions produced by genetic operations can be searched through the TS in every GA generation. Moreover, to strengthen the searching ability, the intensification and diversification of the searching region can be attained by using the long term and intermediate term memory of the TS. From the numerical results, the calculation results of the proposed method are better than those through any single algorithms or that of GA+SA, and the computation time is significantly smaller than that of the SA method.

Original languageEnglish
Pages (from-to)64
Number of pages1
JournalIEEE Power Engineering Review
Volume17
Issue number2
Publication statusPublished - 1997
Externally publishedYes

Fingerprint

Tabu search
Simulated annealing
Genetic algorithms
Scheduling
Branch and bound method
Combinatorial optimization
Integer programming
Dynamic programming
Decoding
Hot Temperature
Data storage equipment

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

An algorithm for thermal unit maintenance scheduling through combined use of GA SA and TS. / Kim, Hyunchul; Hayashi, Yasuhiro; Nara, Koichi.

In: IEEE Power Engineering Review, Vol. 17, No. 2, 1997, p. 64.

Research output: Contribution to journalArticle

@article{aff42e70643e47bb82691badec3e719d,
title = "An algorithm for thermal unit maintenance scheduling through combined use of GA SA and TS",
abstract = "This paper describes a method of solving a large scale long term thermal units' maintenance scheduling problem. In the solution algorithm, the genetic algorithms (GA), the simulated annealing (SA) and the tabu search (TS) are cooperatively used. The solution algorithm keeps the advantages of individual algorithm and shows a reasonable combination of local search and global search. It adopts acceptance probability to improve the convergence of the simple GA, and introduces special encoding/ decoding techniques. To strengthen the searching ability, the neighborhood of current solution produced by genetic operations are search by tabu search. The multiyear thermal unit maintenance scheduling problem is a large scale combinatorial optimization problem, and the {"}curse of dimension{"} limits the applications of such method as dynamic programming branch and bound method and integer programming, etc. Furthermore, by the recent amendment of law in Japan, thermal unit maintenance can be postponed under the permitted combination of the maintenance class (A:detailed, B:simplified, C:Minor). This makes the problem more complex and larger in scale because the time horizon is extended to several consecutive years and the maintenance class of certain unit could be changed to get feasible or more accurate solutions. The authors also proposed a method which combines the genetic algorithm and the simulated annealing. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution. However, it is hard to find the optimum solution by only applying the genetic operators. As a result, the accuracy of this method is not a stable one. In the solution algorithm, the neighborhood of the solutions produced by genetic operations can be searched through the TS in every GA generation. Moreover, to strengthen the searching ability, the intensification and diversification of the searching region can be attained by using the long term and intermediate term memory of the TS. From the numerical results, the calculation results of the proposed method are better than those through any single algorithms or that of GA+SA, and the computation time is significantly smaller than that of the SA method.",
author = "Hyunchul Kim and Yasuhiro Hayashi and Koichi Nara",
year = "1997",
language = "English",
volume = "17",
pages = "64",
journal = "IEEE Power Engineering Review",
issn = "0272-1724",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - An algorithm for thermal unit maintenance scheduling through combined use of GA SA and TS

AU - Kim, Hyunchul

AU - Hayashi, Yasuhiro

AU - Nara, Koichi

PY - 1997

Y1 - 1997

N2 - This paper describes a method of solving a large scale long term thermal units' maintenance scheduling problem. In the solution algorithm, the genetic algorithms (GA), the simulated annealing (SA) and the tabu search (TS) are cooperatively used. The solution algorithm keeps the advantages of individual algorithm and shows a reasonable combination of local search and global search. It adopts acceptance probability to improve the convergence of the simple GA, and introduces special encoding/ decoding techniques. To strengthen the searching ability, the neighborhood of current solution produced by genetic operations are search by tabu search. The multiyear thermal unit maintenance scheduling problem is a large scale combinatorial optimization problem, and the "curse of dimension" limits the applications of such method as dynamic programming branch and bound method and integer programming, etc. Furthermore, by the recent amendment of law in Japan, thermal unit maintenance can be postponed under the permitted combination of the maintenance class (A:detailed, B:simplified, C:Minor). This makes the problem more complex and larger in scale because the time horizon is extended to several consecutive years and the maintenance class of certain unit could be changed to get feasible or more accurate solutions. The authors also proposed a method which combines the genetic algorithm and the simulated annealing. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution. However, it is hard to find the optimum solution by only applying the genetic operators. As a result, the accuracy of this method is not a stable one. In the solution algorithm, the neighborhood of the solutions produced by genetic operations can be searched through the TS in every GA generation. Moreover, to strengthen the searching ability, the intensification and diversification of the searching region can be attained by using the long term and intermediate term memory of the TS. From the numerical results, the calculation results of the proposed method are better than those through any single algorithms or that of GA+SA, and the computation time is significantly smaller than that of the SA method.

AB - This paper describes a method of solving a large scale long term thermal units' maintenance scheduling problem. In the solution algorithm, the genetic algorithms (GA), the simulated annealing (SA) and the tabu search (TS) are cooperatively used. The solution algorithm keeps the advantages of individual algorithm and shows a reasonable combination of local search and global search. It adopts acceptance probability to improve the convergence of the simple GA, and introduces special encoding/ decoding techniques. To strengthen the searching ability, the neighborhood of current solution produced by genetic operations are search by tabu search. The multiyear thermal unit maintenance scheduling problem is a large scale combinatorial optimization problem, and the "curse of dimension" limits the applications of such method as dynamic programming branch and bound method and integer programming, etc. Furthermore, by the recent amendment of law in Japan, thermal unit maintenance can be postponed under the permitted combination of the maintenance class (A:detailed, B:simplified, C:Minor). This makes the problem more complex and larger in scale because the time horizon is extended to several consecutive years and the maintenance class of certain unit could be changed to get feasible or more accurate solutions. The authors also proposed a method which combines the genetic algorithm and the simulated annealing. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution. However, it is hard to find the optimum solution by only applying the genetic operators. As a result, the accuracy of this method is not a stable one. In the solution algorithm, the neighborhood of the solutions produced by genetic operations can be searched through the TS in every GA generation. Moreover, to strengthen the searching ability, the intensification and diversification of the searching region can be attained by using the long term and intermediate term memory of the TS. From the numerical results, the calculation results of the proposed method are better than those through any single algorithms or that of GA+SA, and the computation time is significantly smaller than that of the SA method.

UR - http://www.scopus.com/inward/record.url?scp=33747791763&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33747791763&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33747791763

VL - 17

SP - 64

JO - IEEE Power Engineering Review

JF - IEEE Power Engineering Review

SN - 0272-1724

IS - 2

ER -