KIEE International Transactions on Power Engineering

대한전기학회 (The Korean Institute of Electrical Engineers)
권호 표지

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems

  • Mun Kyeong-Jun (Korea Atomic Energy Research institute(KAERI)) ;
  • Lee Hwa-Seok (Dept. of Electrical Engineering, Koje College) ;
  • Park June-Ho (Division of Electrical and computer Engineering, Pusan National University)
  • 발행 : 2005.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.

키워드

참고문헌

  1. D. Shirmohammadi and H. W. Hong, 'Reconfiguration of electric distribution networks for resistive losses reduction,' IEEE Trans. on Power Delivery, vol. 4, no. 2, pp. 1492-1498, April 1989 https://doi.org/10.1109/61.25637
  2. M. E. Baran and F. F. Wu, 'Network reconfiguration in Distribution systems for loss reduction and load balancing,' IEEE Trans. on Power Delivery, vol. 4, no. 2, pp. 1401-1407, April 1989 https://doi.org/10.1109/61.25627
  3. Tim Taylor and David Lubkeman, 'Implementation of heuristic search strategies for distribution feeder reconfiguration,' IEEE Trans. on Power Delivery, vol. 5, no. 1, pp. 239-246, Jan. 1990 https://doi.org/10.1109/61.107279
  4. Gunther Brauner and Manfred Zabel, 'Knowledge based planning of Distribution networks,' IEEE Trans. on Power Systems, vol. 9, no. 2, pp. 942-948, May 1994 https://doi.org/10.1109/59.317652
  5. Young-Jae Jeon, Jae-Chul Kim, Jin-O Kim, Joong- Rin Shin, Kwang Y. Lee, 'An Efficient Simulated Annealing Algorithm for Network Reconfiguration in Large-Scale Distribution Systems,' IEEE Trans. on Power Delivery, vol. 17, no. 4, pp. 1070-1078, Oct. 2002 https://doi.org/10.1109/TPWRD.2002.803823
  6. K. Nara, A. Shiose, M. Kitagawa, and T.Tshihara, 'Implementation of genetic algorithm for distribution system loss minimum reconfiguration,' IEEE Trans. on Power Systems, vol. 7, no. 3, pp. 1044-1051, Aug. 1992 https://doi.org/10.1109/59.207317
  7. K. Nara, Y. Mishima, A. Gojyo, T. Ito and H. Kaneda, 'Loss minimum reconfiguration of distribution system by tabu search,' Proc. of IEEE PES T&D Conference and Exhibition 2002 Asia Pacific, vol. 1, pp. 232-236, Oct. 2002 https://doi.org/10.1109/TDC.2002.1178296
  8. H. Mori and K. Takeda, 'Parallel simulated annealing for power system decomposition,' IEEE Proc. of PICA 93, pp. 366-372, May 1993
  9. R. Tanese, 'Parallel genetic algorithm for a hypercube,' Proc. of 2th ICGA'87, pp. 177-183, 1987
  10. D. E. Goldberg, Genetic Algorithms in Search, optimization, and Machine Learning, Addison- Wesley publishing Company, INC., 1989
  11. D. B. Fogel, 'An Introduction to Simulated Evolutionary Optimization,' IEEE Trans. on Neural Networks, vol. 5, no. 1, Jan. 1994
  12. J. Arabas, Z. Michalewicz, and J. Mulawka, 'GAVaPS-a Genetic Algorithm with Varying Population Size,' IEEE International Conference on Evolutionary Computation, pp. 73-78, 1994 https://doi.org/10.1109/ICEC.1994.350039
  13. D. Schlierkamp-Voosen and H. Muhlenbein, 'Adaptation of Population Sizes by Competing Subpopulations,' IEEE International Conference on Evolutionary Computation, pp. 330-335, 1996 https://doi.org/10.1109/ICEC.1996.542384
  14. D. B. Fogel, L. J. Fogel and J. W. Atmas, 'Meta- Evolutionary Programming,' Proceedings 2sth Asilomar Conference on Systems, Signals, and Computers, pp. 540-545, 1991 https://doi.org/10.1109/ACSSC.1991.186507
  15. Z. Michalewicz, Genetic Algorithms+Data Structures = Evolution Programs, Springer-Verlag, 1992