IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v235y2015i1p337-36910.1007-s10479-015-1983-5.html
   My bibliography  Save this article

Acceleration strategies of Benders decomposition for the security constraints power system expansion planning

Author

Listed:
  • M. Jenabi
  • S. Fatemi Ghomi
  • S. Torabi
  • S. Hosseinian

Abstract

Nowadays the power generation and transmission are substantial elements for the society, and will definitely play a more important role in the future. In this paper a modeling framework is presented to analyze security constrained composite generation and transmission expansion planning problem in power systems. Despite of the traditional expansion planning approaches where only supply side options are considered, the proposed approach accounts for both supply and demand side management (DSM) options simultaneously. DSM options are incorporated to correct the shape of the load duration curve in terms of peak clipping and load shifting programs. A mixed integer non-linear programming model is developed to find the optimal location and timing of electricity generation/transmission as well as DSM options while the effect of transmission losses are also taken into account. Nonlinearity of the transmission loss terms is eliminated using the piecewise linearization. Motivating from the structure of the model, Benders decomposition (BD) algorithm is devised. Three effective strategies named: valid inequalities, multiple generation cuts and strong high density cut are also employed to improve the convergence of the proposed BD algorithm. The performance of the accelerated BD algorithm is validated via applying it to the modified 6, 21, 48, 57, 118 and 300 bus IEEE reliability test systems. The computational experiments ensure the practicality of the proposed BD algorithm in terms of decreasing the number of iterations and CPU times. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:235:y:2015:i:1:p:337-369:10.1007/s10479-015-1983-5
    DOI: 10.1007/s10479-015-1983-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-015-1983-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-015-1983-5?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. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    2. Cote, Gilles & Laughton, Michael A., 1984. "Large-scale mixed integer programming: Benders-type heuristics," European Journal of Operational Research, Elsevier, vol. 16(3), pages 327-333, June.
    3. T. L. Magnanti & R. T. Wong, 1981. "Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria," Operations Research, INFORMS, vol. 29(3), pages 464-484, June.
    4. Dale McDaniel & Mike Devine, 1977. "A Modified Benders' Partitioning Algorithm for Mixed Integer Programming," Management Science, INFORMS, vol. 24(3), pages 312-319, November.
    5. Jean-François Cordeau & Federico Pasin & Marius Solomon, 2006. "An integrated model for logistics network design," Annals of Operations Research, Springer, vol. 144(1), pages 59-82, April.
    6. 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.
    7. 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.
    8. Nader Azad & Georgios Saharidis & Hamid Davoudpour & Hooman Malekly & Seyed Yektamaram, 2013. "Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach," Annals of Operations Research, Springer, vol. 210(1), pages 125-163, November.
    9. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2000. "A Benders Decomposition Approach for the Locomotive and Car Assignment Problem," Transportation Science, INFORMS, vol. 34(2), pages 133-149, May.
    10. Walter Rei & Jean-François Cordeau & Michel Gendreau & Patrick Soriano, 2009. "Accelerating Benders Decomposition by Local Branching," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 333-345, May.
    11. Santoso, Tjendera & Ahmed, Shabbir & Goetschalckx, Marc & Shapiro, Alexander, 2005. "A stochastic programming approach for supply chain network design under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 96-115, November.
    12. Hobbs, Benjamin F., 1995. "Optimization methods for electric utility resource planning," European Journal of Operational Research, Elsevier, vol. 83(1), pages 1-20, May.
    13. Huang, Yun-Hsun & Wu, Jung-Hua, 2008. "A portfolio risk analysis on electricity supply planning," Energy Policy, Elsevier, vol. 36(2), pages 627-641, February.
    14. M Jenabi & S M T Fatemi Ghomi & S A Torabi & S H Hosseinian, 2013. "A Benders decomposition algorithm for a multi-area, multi-stage integrated resource planning in power systems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(8), pages 1118-1136, August.
    15. AlKhal, Farqad & Chedid, Riad & Itani, Zeina & Karam, Tony, 2006. "An assessment of the potential benefits from integrated electricity capacity planning in the northern Middle East region," Energy, Elsevier, vol. 31(13), pages 2316-2324.
    16. Kucukyazici, Beste & Ozdamar, Linet & Pokharel, Shaligram, 2005. "Developing concurrent investment plans for power generation and transmission," European Journal of Operational Research, Elsevier, vol. 166(2), pages 449-468, October.
    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. Hu, Peng & Chu, Feng & Dolgui, Alexandre & Chu, Chengbin & Liu, Ming, 2024. "Integrated multi-product reverse supply chain design and disassembly line balancing under uncertainty," Omega, Elsevier, vol. 126(C).
    2. 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.
    3. J. Kyle Skolfield & Laura M. Escobar & Adolfo R. Escobedo, 2022. "Derivation and generation of path-based valid inequalities for transmission expansion planning," Annals of Operations Research, Springer, vol. 312(2), pages 1031-1049, May.
    4. Castro, Jordi & Nasini, Stefano, 2021. "A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks," European Journal of Operational Research, Elsevier, vol. 290(3), pages 857-869.
    5. López-Ramos, Francisco & Nasini, Stefano & Sayed, Mohamed H., 2020. "An integrated planning model in centralized power systems," European Journal of Operational Research, Elsevier, vol. 287(1), pages 361-377.
    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.

    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. 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.
    2. 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.
    3. Azad, Nader & Hassini, Elkafi, 2019. "Recovery strategies from major supply disruptions in single and multiple sourcing networks," European Journal of Operational Research, Elsevier, vol. 275(2), pages 481-501.
    4. Hanif Sherali & Ki-Hwan Bae & Mohamed Haouari, 2013. "A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture," Annals of Operations Research, Springer, vol. 210(1), pages 213-244, November.
    5. 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.
    6. 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.
    7. 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.
    8. Nader Azad & Georgios Saharidis & Hamid Davoudpour & Hooman Malekly & Seyed Yektamaram, 2013. "Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach," Annals of Operations Research, Springer, vol. 210(1), pages 125-163, November.
    9. 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.
    10. Walter Rei & Jean-François Cordeau & Michel Gendreau & Patrick Soriano, 2009. "Accelerating Benders Decomposition by Local Branching," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 333-345, May.
    11. Keyvanshokooh, Esmaeil & Ryan, Sarah M. & Kabir, Elnaz, 2016. "Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition," European Journal of Operational Research, Elsevier, vol. 249(1), pages 76-92.
    12. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    13. Fausto Errico & Teodor Gabriel Crainic & Federico Malucelli & Maddalena Nonato, 2017. "A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems," Transportation Science, INFORMS, vol. 51(2), pages 706-722, May.
    14. 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.
    15. Vedat Bayram & Hande Yaman, 2018. "Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach," Transportation Science, INFORMS, vol. 52(2), pages 416-436, March.
    16. Hanif Sherali & Brian Lunday, 2013. "On generating maximal nondominated Benders cuts," Annals of Operations Research, Springer, vol. 210(1), pages 57-72, November.
    17. Jeihoonian, Mohammad & Kazemi Zanjani, Masoumeh & Gendreau, Michel, 2016. "Accelerating Benders decomposition for closed-loop supply chain network design: Case of used durable products with different quality levels," European Journal of Operational Research, Elsevier, vol. 251(3), pages 830-845.
    18. Kumar, Pramesh & Khani, Alireza, 2022. "Planning of integrated mobility-on-demand and urban transit networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 499-521.
    19. Joe Naoum-Sawaya & Samir Elhedhli, 2013. "An interior-point Benders based branch-and-cut algorithm for mixed integer programs," Annals of Operations Research, Springer, vol. 210(1), pages 33-55, November.
    20. Morton O’Kelly & Henrique Luna & Ricardo Camargo & Gilberto Miranda, 2015. "Hub Location Problems with Price Sensitive Demands," Networks and Spatial Economics, Springer, vol. 15(4), pages 917-945, 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:spr:annopr:v:235:y:2015:i:1:p:337-369:10.1007/s10479-015-1983-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.