抄録
This paper presents a reactive tabu search for service restoration in electric power distribution systems. Service restoration is an emergency control in distribution control centers to restore out-of-service area as soon as possible when a fault occurs in distribution systems. Therefore, it requires fast computation time and high quality solutions for customers' satisfaction. The problem can be formulated as a combinatorial optimization problem to divide the out-of-service area to each power source. The effectiveness of the proposed method is demonstrated on typical service restoration problems. It is compared favorably with conventional tabu search, genetic algorithm, and parallel simulated annealing. The results reveal the speed and effectiveness of the proposed method for solving the problem.
| 本文言語 | English |
|---|---|
| ページ | 763-768 |
| ページ数 | 6 |
| 出版ステータス | Published - 1998 1月 1 |
| 外部発表 | はい |
| イベント | Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 - Anchorage, AK, USA 継続期間: 1998 5月 4 → 1998 5月 9 |
Other
| Other | Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 |
|---|---|
| City | Anchorage, AK, USA |
| Period | 98/5/4 → 98/5/9 |
ASJC Scopus subject areas
- コンピュータ サイエンス（全般）
- 工学（全般）