Analysis of Optimal Power Flow Using Gravitational Search Algorithm

M. Lakshmikantha Reddy*, M. Ramprasad Reddy**, V.C. Veera Reddy***
* Associate Professor, Department of Electrical and Electronics Engineering, Yogananda Institute of Technology and Science, Tirupati, India.
** Associate Professor, Department of Electrical and Electronics Engineering, Aditya College of Engineering, Madanapalli, India.
*** Former Professor & HOD, Department of Electrical and Electronics Engineering, SV University, Tirupati, India.
Periodicity:November - January'2016
DOI : https://doi.org/10.26634/jps.3.4.4800

Abstract

The operation of an electric power system is a complex one due to its nonlinear and computational difficulties. One task of operating a power system economically and securely is optimal scheduling, commonly referred to as the Optimal Power Flow (OPF) problem. It optimizes a certain objective function while satisfying a set of physical and operating constraints. Optimal power flow has become an essential tool in power system planning and operation. In this paper, a gravitational search algorithm is presented to solve OPF problems while satisfying system equality, in-equality constraints. The effect of security limits such as transmission line limits and load bus voltage magnitudes is also analyzed on OPF problem. The developed methodology is tested on the standard IEEE-30 bus test system, supporting numerical and as well as graphical results.

Keywords

Optimal Power Flow, Gravitational Search Algorithm, Security Constraints, Quadratic Fuel Cost.

How to Cite this Article?

Reddy, M. L., Reddy, M. R., and Reddy, V. V. (2016). Analysis of Optimal Power Flow Using Gravitational Search Algorithm. i-manager’s Journal on Power Systems Engineering, 3(4), 1-11. https://doi.org/10.26634/jps.3.4.4800

References

[1]. Alsac O, and Stott B. (1974). “Optimal load flow with steady state security”. IEEE Trans Pwr Appar Syst, Vol.93, pp.745-751.
[2]. Po-Hung Chen and Hong-Chan Chang, (1995). “Large-Scale Economic Dispatch By Genetic Algorithm”. IEEE Transactions on Power Systems, Vol.10, No.4, pp.1919-1926.
[3]. J. Z. Zhu and G. Y. Xu, (1992). “A new real power economic dispatch method with security”. Electric Power Systems Research, Vol.25, No.1, pp. 9-15.
[4]. Shoults R, and Sun D. (1982). “Optimal power flow based on P-Q decomposition”. IEEE Trans Pwr Appar Syst, Vol.101, No.2, pp.397-405.
[5]. Habiabollahzadeh H, Luo, and Semlyen A. (1989). “Hydrothermal optimal power flow based on combined linear and nonlinear programming methodology”. IEEE Trans Pwr Appar Syst, Vol.4, No.2, pp.530-537.
[6]. Burchet RC, Happ HH, and Vierath DR. (1984). “Quadratically convergent optimal power flow”. IEEE Trans Pwr Appar Syst, Vol.103, pp.3267-3276.
[7]. Aoki K, Nishikori A, and Yokoyama RT. (1987). ”Constrained load flow using recursive quadratic programming”. IEEE Trans Pwr Syst, Vol.2, No.1, pp.8-16.
[8]. Mota-Palomino R, and Quintana V H. (1986). “Sparse reactive power scheduling by a penalty function linear programming technique”. IEEE Trans Pwr Syst, Vol.1, No.3, pp.31-39.
[9]. Sun DI, Ashley B, Brewer B. Hughes A, and Tinney WF. (1984). “Optimal power flow by Newton approach”. IEEE Trans Pwr Appar Syst, Vol.103, No.10, pp.2864-2875.
[10]. Santos A, and da Costa GR. (1995). “Optimal power flow solution by Newton's method applied to an augmented lagrangian function”. IEEE Proc Gener Transm Distrib, Vol.142, No.1, pp.33-36.
[11]. Dommel H, Timmy W, (1968). “Optimal power flow solution”. IEEE Trans Pwr Appar Syst, Vol.87, No.10, pp.1866-1876.
[12]. Happ HH, (1977). “Optimal power dispatch: a comprehensive survey”. IEEE Trans Pwr Appar Syst, Vol.96, pp.841-854.
[13]. Mamandur KRC, (1981). “Optimal control of reactive power flow for improvements in voltage profiles and for real power loss minimization”. IEEE Trans Pwr Appar Syst, Vol.100, No.7, pp.3185-3193.
[14]. Abou El-Ela AA, and Abido MA, (1992). “Optimal operation strategy for reactive power control, modeling, simulation and control”. AMSE Press, Vol.41, No.3, pp.19- 40.
[15]. Stadlin W, and Fletcher D, (1982). “Voltage versus reactive current model for dispatch and control”. IEEE Trans Pwr Appar Syst, Vol.101, No.10, pp.3751-3758.
[16]. Kennedy J, (1997). “The particle swarm; social adaptation of knowledge”. Proc of IEEE Int Conf Evol Comput ICEC-97, Indianapolis, IN, USA, pp.303-308.
[17]. Angeline P, (1998). “Evolutionary optimization versus particle swarm optimization:Philosophy and th performance differences”. Proc 7 Annu Conf Evol Prog, pp.601-610.
[18]. Shi Y, and Eberhart R, (1998). “Parameter selection in th particle swarm optimization”. Proc 7 Annu Conf Evol Prog, pp.591-600.
[19]. Ozcan E, and Mohan C, (1998). “Analysis of a simple particle swarm optimization system”. Intel Engng Syst Artif Neural networks, Vol.8, pp.253-258.
[20]. R.J. Ringlee and D.D. William, (1963). ”Economic dispatch operation considering valve throttling losses. Part II: Distribution of system loads by the method of dynamic programming”. IEEE Transactions on Power Apparatus and Systems, Vol.82, No.1.
[21]. IEEE Committee Report, (1971). “Practices in the economic operation of power systems”. IEEE Trans. Power Apparatus and Systems, Pas-90, pp.1768-1775.
[22]. Yang H, Yang P, and Huang C., (1996). “Evolutionary programming based economic dispatch for units with non-smooth fuel cost functions”. IEEE Trans. Power Syst., Vol.11, pp.112-118.
[23]. W. Ongsakul and T. Tantimaporn, (2006). “Optimal power flow by improved evolutionary programming”. Electric Power Components and Systems, Vol.34, pp.79-95.
[24]. Lin W, Cheng F, and Tasy M., (2002). “An improved search for economic dispatch with multiple minima”. IEEE Trans. Power Syst., Vol.17, pp.108-112.
[25]. D Devaraj, and B. Yegnanarayana, (2005). “Genetic Algorithm based optimal power flow for security enhancement”. IEE Proc. on Gener. Trans. Distr., Vol.52, No.6, pp.899-905.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.