143
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems

, , , , &
Pages 1446-1461 | Received 02 Apr 2018, Accepted 12 Aug 2018, Published online: 24 Oct 2018

References

  • Abido, M. A. 2002. “Optimal Power Flow Using Particle Swarm Optimization.” International Journal of Electrical Power Energy Systems 24 (7): 563–571. doi: 10.1016/S0142-0615(01)00067-9
  • Abou El Ela, A. A., M. A. Abido, and S. R. Spea. 2010. “Optimal Power Flow Using Differential Evolution Algorithm.” Electric Power Systems Research 80 (7): 878–885. doi: 10.1016/j.epsr.2009.12.018.
  • Adjiman, C. S., I. P. Androulakis, and C. A. Floudas. 1998. “A Global Optimization Method, αBB, for General Twice-Differentiable Constrained NLPs−II. Implementation and Computational Results.” Computers & Chemical Engineering 22 (9): 1159–1179. doi: 10.1016/S0098-1354(98)00218-X
  • Bai, X., H. Wei, K. Fujisawa, and Y. Wang. 2008. “Semidefinite Programming for Optimal Power Flow Problems.” International Journal of Electrical Power and Energy Systems 30 (6–7): 383–392. doi: 10.1016/j.ijepes.2007.12.003
  • Belotti, P., J. Lee, L. Liberti, F. Margot, and A. Wächter. 2009. “Branching and Bounds Tightening Techniques for Non-Convex MINLP.” Optimization Methods and Software 24 (4–5): 597–634. doi: 10.1080/10556780903087124
  • Bukhsh, W. A., A. Grothey, K. I. M. McKinnon, and P. A. Trodden. 2013. “Local Solutions of the Optimal Power Flow Problem.” IEEE Transactions on Power Systems 28 (4): 4780–4788. doi: 10.1109/TPWRS.2013.2274577
  • Capitanescu, F. 2016. “Critical Review of Recent Advances and Future Developments Needed in AC Optimal Power Flow.” Electric Power Systems Research 136: 57–68. doi: 10.1016/j.epsr.2016.02.008
  • Castro, P. M. 2017. “Spatial Branch-and-Bound Algorithm for MIQCPs Featuring Multiparametric Disaggregation.” Optimization Methods and Software 32 (4): 719–737. doi: 10.1080/10556788.2016.1264397
  • Edward, J. Belwin, N. Rajasekar, K. Sathiyasekar, N. Senthilnathan, and R. Sarjila. 2013. “An Enhanced Bacterial Foraging Algorithm Approach for Optimal Power Flow Problem Including FACTS Devices Considering System Loadability.” ISA Transactions—The Journal of Automation 52 (5): 622–628. doi: 10.1016/j.isatra.2013.04.002.
  • Frank, S., I. Steponavice, and S. Rebennack. 2012a. “Optimal Power Flow: A Bibliographic Survey I.” Energy Systems 3 (3): 221–258. doi: 10.1007/s12667-012-0056-y.
  • Frank, S., I. Steponavice, and S. Rebennack. 2012b. “Optimal Power Flow: A Bibliographic Survey II.” Energy Systems 3 (3): 259–289. doi: 10.1007/s12667-012-0057-x.
  • Garloff, J. 1993. “The Bernstein Algorithm.” Interval Computations 2: 154–168.
  • Gerard, D., M. Köppe, and Q. Louveaux. 2017. “Guided Dive for the Spatial Branch-and-Bound.” Journal of Global Optimization 68 (4): 685–711. doi: 10.1007/s10898-017-0503-3.
  • Ghasemi, Mojtaba, Sahand Ghavidel, Mohammad Mehdi Ghanbarian, Masihallah Gharibzadeh, and Ali Azizi Vahed. 2014a. “Multi-Objective Optimal Power Flow Considering the Cost, Emission, Voltage Deviation and Power Losses Using Multi-Objective Modified Imperialist Competitive Algorithm.” Energy 78: 276–289. doi: 10.1016/j.energy.2014.10.007
  • Ghasemi, Mojtaba, Sahand Ghavidel, Mohammad Mehdi Ghanbarian, and Mohsen Gitizadeh. 2015. “Multi-Objective Optimal Electric Power Planning in the Power System Using Gaussian Bare-Bones Imperialist Competitive Algorithm.” Information Sciences 294: 286–304. doi: 10.1016/j.ins.2014.09.051
  • Ghasemi, Mojtaba, Sahand Ghavidel, Shima Rahmani, Alireza Roosta, and Hasan Falah. 2014b. “A Novel Hybrid Algorithm of Imperialist Competitive Algorithm and Teaching Learning Algorithm for Optimal Power Flow Problem with Non-Smooth Cost Functions.” Engineering Applications of Artificial Intelligence 29: 54–69. doi: 10.1016/j.engappai.2013.11.003
  • Gopalakrishnan, A., A. U. Raghunathan, D. Nikovski, and L. T. Biegler. 2012. “Global Optimization of Optimal Power Flow Using a Branch & Bound Algorithm.” In Proceedings of the 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton 2012), 609–616. IEEE. doi: 10.1109/Allerton.2012.6483274.
  • Grimstad, B., and A. Sandnes. 2016. “Global Optimization with Spline Constraints: A New Branch-and-Bound Method Based on B-Splines.” Journal of Global Optimization 65 (3): 401–439. doi: 10.1007/s10898-015-0358-4
  • Hansen, E. R., and G. W. Walster. 2005. Global Optimization Using Interval Analysis. 2nd ed. New York: Marcel Dekker.
  • Kocuk, Burak, Santanu S. Dey, and Xu Andy Sun. 2016. “Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow.” IEEE Transactions on Power Systems 31 (1): 642–651. doi: 10.1109/TPWRS.2015.2402640.
  • Kundur, P. 1994. Power System Stability and Control. New York: McGraw-Hill.
  • Lebbah, Yahia, Claude Michel, and Michel Rueher. 2007. “An Efficient and Safe Framework for Solving Optimization Problems.” Journal of Computational and Applied Mathematics 199 (2): 372–377. doi: 10.1016/j.cam.2005.08.037
  • Li, Dan, and Xiang Li. 2016. “Decomposition-Based Global Optimization for Optimal Design of Power Distribution Systems.” In Proceedings of the 55th IEEE Conference on Decision and Control (CDC 2016), 3265–3270. IEEE. doi: 10.1109/CDC.2016.7798760.
  • Li, Duan, and Xiaoling Sun. 2006. Nonlinear Integer Programming. New York: Springer Science+Business Media. http://www.worldcat.org/title/nonlinear-integer-programming/oclc/68570634.
  • Mohamed, Al-Attar Ali, Yahia S. Mohamed, Ahmed A. M. El-Gaafary, and Ashraf M. Hemeida. 2017. “Optimal Power Flow Using Moth Swarm Algorithm.” Electric Power Systems Research 142: 190–206. doi: 10.1016/j.epsr.2016.09.025
  • Molzahn, D., J. Holzer, B. Lesieutre, and C. DeMarco. 2013. “Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite Programming.” IEEE Transactions on Power Systems 28 (4): 3987–3998. doi: 10.1109/TPWRS.2013.2258044
  • Momoh, J., M. El-Hawary, and R. Adapa. 1999a. “A Review of Selected Optimal Power Flow Literature to 1993—Part I: Nonlinear and Quadratic Programming Approaches.” IEEE Transactions on Power Systems 14 (1): 96–104. doi: 10.1109/59.744492
  • Momoh, J., M. El-Hawary, and R. Adapa. 1999b. “A Review of Selected Optimal Power Flow Literature to 1993—Part II: Newton, Linear and Interior Programming.” IEEE Transactions on Power Systems 14 (1): 105–111. doi: 10.1109/59.744495
  • Moore, R. E., R. B. Kearfott, and M. J. Cloud. 2009. Introduction to Interval Analysis. Philadelphia, PA: SIAM.
  • Nataraj, P. S. V., and M. Arounassalame. 2011. “Constrained Global Optimization of Multivariate Polynomials Using Bernstein Branch and Prune Algorithm.” Journal of Global Optimization 49 (2): 185–212. doi: 10.1007/s10898-009-9485-0
  • Patil, Bhagyesh V., P. S. V. Nataraj, and Sharad Bhartiya. 2012. “Global Optimization of Mixed-Integer Nonlinear (Polynomial) Programming Problems: The Bernstein Polynomial Approach.” Computing 94 (2–4): 325–343. doi: 10.1007/s00607-011-0175-7
  • Patil, B. V., L. P. M. I. Sampath, A. Krishnan, K. V. Ling, and H. B. Gooi. 2016. “Examining the Bernstein Global Optimization Approach to Optimal Power Flow Problem.” AIP Proceedings 1776 (1): Article ID 090022. doi: 10.1063/1.4965386.
  • Phan, D., and J. Kalagnanam. 2014. “Some Efficient Methods for Solving the Security-Constrained Optimal Power Flow Problem.” IEEE Transactions on Power Systems 29 (2): 863–872. doi: 10.1109/TPWRS.2013.2283175
  • Ratschek, H., and J. Rokne. 1988. New Computer Methods for Global Optimization. Chichester, UK: Ellis Horwood.
  • Roa-Sepulveda, C. A., and B. J. Pavez-Lazo. 2003. “A Solution to the Optimal Power Flow Using Simulated Annealing.” International Journal of Electrical Power Energy Systems 25 (1): 47–57. doi: 10.1016/S0142-0615(02)00020-0
  • Shaheen, A. M., R. A. El-Sehiemy, and S. M. Farrag. 2016. “Solving Multi-Objective Optimal Power Flow Problem Via Forced Initialised Differential Evolution Algorithm.” IET Generation, Transmission Distribution 10 (7): 1634–1647. doi: 10.1049/iet-gtd.2015.0892
  • Soares, J., T. Sousa, Z. A. Vale, H. Morais, and P. Faria. 2011. “Ant Colony Search Algorithm for the Optimal Power Flow Problem.” In Proceedings of the IEEE Power and Energy Society General Meeting, 1–8. IEEE. doi: 10.1109/PES.2011.6039840.
  • Tawarmalani, M., and N. V. Sahinidis. 2002. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications (Nonconvex Optimization and Its Applications). Dordrecht, The Netherlands: Kluwer Academic.
  • Tawarmalani, M., and N. V. Sahinidis. 2005. “A Polyhedral Branch-and-Cut Approach to Global Optimization.” Mathematical Programming 103 (2): 225–249. doi: 10.1007/s10107-005-0581-8
  • Todorovski, M., and D. Rajičić. 2006. “An Initialization Procedure in Solving Optimal Power Flow by Genetic Algorithm.” IEEE Transactions on Power Systems 21 (2): 480–487. doi: 10.1109/TPWRS.2006.873120.
  • Vaidyanathan, R., and M. El-Halwagi. 1996. “Global Optimization of Nonconvex MINLP's by Interval Analysis.” In Global Optimization in Engineering Design, 175–193. New York: Springer. doi:10.1007/978-1-4757-5331-8_6.
  • Vaisakh, K., and L. R. Srinivas. 2011. “Adaptive PSODV Algorithm for OPF with Non-Smooth Cost Functions and Statistical Analysis.” Simulation Modelling Practice and Theory 19 (9): 1824–1846. doi: 10.1016/j.simpat.2011.04.013
  • Zhijun, Q., Y. Hou, and Y. Chen. 2015. “Convex Envelopes of Optimal Power Flow with Branch Flow Model in Rectangular Form.” In Proceedings of the IEEE Power and Energy Society General Meeting, 1–5. IEEE. doi: 10.1109/PESGM.2015.7286234.
  • Zimmerman, R. D., C. E. Murillo-Sanchez, and R. J. Thomas. 2011. “MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education.” IEEE Transactions on Power Systems 26 (1): 12–19. doi: 10.1109/TPWRS.2010.2051168

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.