Author:
Fonseka Jagath,Miranda Vladimiro
Abstract
This paper proposes an integrated approach of genetic algorithms, Tabu search and simulated annealing for multi‐stage (dynamic) transmission network expansion planning. The proposed algorithm integrates the most interesting and best features of the above individual algorithms. The efficiency and reliability of the proposed algorithm is proved with the modified Garver's six‐bus network. Finally, a real‐world application (Sri Lankan transmission network) of the integrated algorithm is presented for multi‐stage transmission expansion planning.
Subject
Applied Mathematics,Electrical and Electronic Engineering,Computational Theory and Mathematics,Computer Science Applications
Reference16 articles.
1. Aarts, A. and Korst, J. (1989), Simulated Annealing and Boltzmann Machines, Wiley, New York, USA.
2. Bennon, R.J., Juves, J.A. and Meliopoulos, A.P. (1982), “Use of sensitivity analysis automated transmission planning”, IEEE Transactions on Power Apparatus and Systems, Vol. PAS‐101 No. 1, pp. 53‐9.
3. Davis, L. (1991), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York.
4. Dusonchet, Y.P. and El‐Abiad, A. (1973), “Transmission planning using discrete dynamic optimizing”, IEEE Transactions on Power Apparatus and Systems, Vol. PAS‐89, pp. 1358‐71.
5. Gallego, R.A., Monticelli, A. and Romero, R. (1998), “Comparative studies on non‐convex optimization methods for transmission network expansion planning”, IEEE Transactions on Power Systems, Vol. 13 No. 3, pp. 822‐8.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献