IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v222y2012i3p616-622.html
   My bibliography  Save this article

A modified Primal–Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

Author

Listed:
  • Soler, Edilaine Martins
  • de Sousa, Vanusa Alves
  • da Costa, Geraldo R.M.

Abstract

The aim of solving the Optimal Power Flow problem is to determine the optimal state of an electric power transmission system, that is, the voltage magnitude and phase angles and the tap ratios of the transformers that optimize the performance of a given system, while satisfying its physical and operating constraints. The Optimal Power Flow problem is modeled as a large-scale mixed-discrete nonlinear programming problem. This paper proposes a method for handling the discrete variables of the Optimal Power Flow problem. A penalty function is presented. Due to the inclusion of the penalty function into the objective function, a sequence of nonlinear programming problems with only continuous variables is obtained and the solutions of these problems converge to a solution of the mixed problem. The obtained nonlinear programming problems are solved by a Primal–Dual Logarithmic-Barrier Method. Numerical tests using the IEEE 14, 30, 118 and 300-Bus test systems indicate that the method is efficient.

Suggested Citation

  • Soler, Edilaine Martins & de Sousa, Vanusa Alves & da Costa, Geraldo R.M., 2012. "A modified Primal–Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables," European Journal of Operational Research, Elsevier, vol. 222(3), pages 616-622.
    • Handle: RePEc:eee:ejores:v:222:y:2012:i:3:p:616-622
    DOI: 10.1016/j.ejor.2012.05.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712003700
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.05.021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Rosehart, William & Roman, Codruta & Behjat, Laleh, 2006. "Interior point models for power system stability problems," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1127-1138, June.
    2. Poojari, C.A. & Beasley, J.E., 2009. "Improving benders decomposition using a genetic algorithm," European Journal of Operational Research, Elsevier, vol. 199(1), pages 89-97, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alencar, Marina Valença & da Silva, Diego Nunes & Nepomuceno, Leonardo & Martins, André Christóvão Pio & Balbo, Antonio Roberto & Soler, Edilaine Martins, 2024. "Discrete optimal power flow with prohibited zones, multiple-fuel options, and practical operational rules for control devices," Applied Energy, Elsevier, vol. 358(C).
    2. Esmaili, Masoud & Shayanfar, Heidar Ali & Moslemi, Ramin, 2014. "Locating series FACTS devices for multi-objective congestion management improving voltage and transient stability," European Journal of Operational Research, Elsevier, vol. 236(2), pages 763-773.
    3. Pinheiro, Ricardo B.N.M. & Lage, Guilherme G. & da Costa, Geraldo R.M., 2019. "A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 1137-1153.
    4. Martins Barros, Rafael & Guimarães Lage, Guilherme & de Andrade Lira Rabêlo, Ricardo, 2022. "Sequencing paths of optimal control adjustments determined by the optimal reactive dispatch via Lagrange multiplier sensitivity analysis," European Journal of Operational Research, Elsevier, vol. 301(1), pages 373-385.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brech, Claus-Henning & Ernst, Andreas & Kolisch, Rainer, 2019. "Scheduling medical residents’ training at university hospitals," European Journal of Operational Research, Elsevier, vol. 274(1), pages 253-266.
    2. Faria, Victor. A.D. & de Queiroz, Anderson Rodrigo & Lima, Luana M.M. & Lima, José W.M., 2018. "Cooperative game theory and last addition method in the allocation of firm energy rights," Applied Energy, Elsevier, vol. 226(C), pages 905-915.
    3. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    4. M. Jenabi & S. Fatemi Ghomi & S. Torabi & S. Hosseinian, 2015. "Acceleration strategies of Benders decomposition for the security constraints power system expansion planning," Annals of Operations Research, Springer, vol. 235(1), pages 337-369, December.
    5. Shoufeng Ji & Qi Sun, 2017. "Low-Carbon Planning and Design in B&R Logistics Service: A Case Study of an E-Commerce Big Data Platform in China," Sustainability, MDPI, vol. 9(11), pages 1-27, November.
    6. N. Beheshti Asl & S. A. MirHassani, 2019. "Accelerating benders decomposition: multiple cuts via multiple solutions," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 806-826, April.
    7. Raidl, Günther R., 2015. "Decomposition based hybrid metaheuristics," European Journal of Operational Research, Elsevier, vol. 244(1), pages 66-76.
    8. Jalali, Sajjad & Seifbarghy, Mehdi & Niaki, Seyed Taghi Akhavan, 2018. "A risk-averse location-protection problem under intentional facility disruptions: A modified hybrid decomposition algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 196-219.
    9. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
    10. Gelareh, Shahin & Pisinger, David, 2011. "Fleet deployment, network design and hub location of liner shipping companies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 947-964.
    11. M. Jenabi & S. M. T. Fatemi Ghomi & S. A. Torabi & Moeen Sammak Jalali, 2022. "An accelerated Benders decomposition algorithm for stochastic power system expansion planning using sample average approximation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1304-1336, December.
    12. Ragheb Rahmaniani & Shabbir Ahmed & Teodor Gabriel Crainic & Michel Gendreau & Walter Rei, 2020. "The Benders Dual Decomposition Method," Operations Research, INFORMS, vol. 68(3), pages 878-895, May.
    13. Reddy, K. Nageswara & Kumar, Akhilesh & Choudhary, Alok & Cheng, T. C. Edwin, 2022. "Multi-period green reverse logistics network design: An improved Benders-decomposition-based heuristic approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 735-752.
    14. Lixin Tang & Wei Jiang & Georgios Saharidis, 2013. "An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions," Annals of Operations Research, Springer, vol. 210(1), pages 165-190, November.
    15. Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
    16. Kuthambalayan, Thyagaraj S. & Mehta, Peeyush & Shanker, Kripa, 2014. "Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand," European Journal of Operational Research, Elsevier, vol. 237(2), pages 617-627.
    17. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    18. Ashkan Fakhri & Mehdi Ghatee, 2013. "Solution of preemptive multi-objective network design problems applying Benders decomposition method," Annals of Operations Research, Springer, vol. 210(1), pages 295-307, November.
    19. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.
    20. Vahab Vahdat & Mohammad Ali Vahdatzad, 2017. "Accelerated Benders’ Decomposition for Integrated Forward/Reverse Logistics Network Design under Uncertainty," Logistics, MDPI, vol. 1(2), pages 1-21, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:222:y:2012:i:3:p:616-622. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.