IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v179y2018i1d10.1007_s10957-018-1367-5.html
   My bibliography  Save this article

Optimal Long-Term Distributed Generation Planning and Reconfiguration of Distribution Systems: An Accelerating Benders’ Decomposition Approach

Author

Listed:
  • Salman Khodayifar

    (Institute for Advanced Studies in Basic Sciences (IASBS))

  • Mohammad A. Raayatpanah

    (Kharazmi University)

  • Abbas Rabiee

    (University of Zanjan)

  • Hamed Rahimian

    (The Ohio State University)

  • Panos M. Pardalos

    (University of Florida)

Abstract

In this paper, we study the multi-period distributed generation planning problem in a multistage hierarchical distribution network. We first formulate the problem as a non-convex mixed-integer nonlinear programming problem. Since the proposed model is non-convex and generally hard to solve, we convexify the model based on semi-definite programming. Then, we use a customized Benders’ decomposition method with valid cuts to solve the convex relaxation model. Computational results show that the proposed algorithm provides an efficient way to solve the problem for relatively large-scale networks.

Suggested Citation

  • Salman Khodayifar & Mohammad A. Raayatpanah & Abbas Rabiee & Hamed Rahimian & Panos M. Pardalos, 2018. "Optimal Long-Term Distributed Generation Planning and Reconfiguration of Distribution Systems: An Accelerating Benders’ Decomposition Approach," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 283-310, October.
    • Handle: RePEc:spr:joptap:v:179:y:2018:i:1:d:10.1007_s10957-018-1367-5
    DOI: 10.1007/s10957-018-1367-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1367-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-018-1367-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. 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.
    2. Costa, Alysson M. & França, Paulo M. & Lyra Filho, Christiano, 2011. "Two-level network design with intermediate facilities: An application to electrical distribution systems," Omega, Elsevier, vol. 39(1), pages 3-13, January.
    3. 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.
    4. Sultana, U. & Khairuddin, Azhar B. & Aman, M.M. & Mokhtar, A.S. & Zareen, N., 2016. "A review of optimum DG placement based on minimization of power losses and voltage stability enhancement of distribution system," Renewable and Sustainable Energy Reviews, Elsevier, vol. 63(C), pages 363-378.
    5. Tanwar, Surender Singh & Khatod, D.K., 2017. "Techno-economic and environmental approach for optimal placement and sizing of renewable DGs in distribution system," Energy, Elsevier, vol. 127(C), pages 52-67.
    6. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2018. "A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities," Omega, Elsevier, vol. 74(C), pages 122-134.
    7. Jean-Hubert Hours & Colin N. Jones, 2017. "An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the Optimal Power Flow Problem," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 844-877, June.
    8. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2001. "Simultaneous Assignment of Locomotives and Cars to Passenger Trains," Operations Research, INFORMS, vol. 49(4), pages 531-548, August.
    9. 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.
    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. Mahmoud M. Sayed & Mohamed Y. Mahdy & Shady H. E. Abdel Aleem & Hosam K. M. Youssef & Tarek A. Boghdady, 2022. "Simultaneous Distribution Network Reconfiguration and Optimal Allocation of Renewable-Based Distributed Generators and Shunt Capacitors under Uncertain Conditions," Energies, MDPI, vol. 15(6), pages 1-27, March.

    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. 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.
    2. 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.
    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. Enrique Castillo & Roberto Mínguez & Antonio Conejo & Beatriz Pérez & Oscar Fontenla, 2013. "Estimating the parameters of a fatigue model using Benders’ decomposition," Annals of Operations Research, Springer, vol. 210(1), pages 309-331, November.
    6. 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.
    7. Roberto Mínguez & Antonio Conejo & Enrique Castillo, 2013. "Optimal engineering design via Benders’ decomposition," Annals of Operations Research, Springer, vol. 210(1), pages 273-293, November.
    8. 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.
    9. 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.
    10. Canca, David & Barrena, Eva, 2018. "The integrated rolling stock circulation and depot location problem in railway rapid transit systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 115-138.
    11. Ricardo Saraiva de Camargo & Gilberto de Miranda & Henrique Pacca L. Luna, 2009. "Benders Decomposition for Hub Location Problems with Economies of Scale," Transportation Science, INFORMS, vol. 43(1), pages 86-97, February.
    12. Dennis Huisman & Leo G. Kroon & Ramon M. Lentink & Michiel J. C. M. Vromans, 2005. "Operations Research in passenger railway transportation," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 59(4), pages 467-497, 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. Lin, Zhiyuan & Kwan, Raymond S.K., 2016. "A branch-and-price approach for solving the train unit scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 97-120.
    15. Contreras, Ivan & Fernández, Elena & Reinelt, Gerhard, 2012. "Minimizing the maximum travel time in a combined model of facility location and network design," Omega, Elsevier, vol. 40(6), pages 847-860.
    16. Christian Va Karsten & Stefan Ropke & David Pisinger, 2018. "Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions," Transportation Science, INFORMS, vol. 52(4), pages 769-787, August.
    17. Camilo Ortiz-Astorquiza & Jean-François Cordeau & Emma Frejinger, 2021. "The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company," Transportation Science, INFORMS, vol. 55(2), pages 510-531, March.
    18. Zhong, Qingwei & Lusby, Richard M. & Larsen, Jesper & Zhang, Yongxiang & Peng, Qiyuan, 2019. "Rolling stock scheduling with maintenance requirements at the Chinese High-Speed Railway," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 24-44.
    19. 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.
    20. Lusby, Richard M. & Haahr, Jørgen Thorlund & Larsen, Jesper & Pisinger, David, 2017. "A Branch-and-Price algorithm for railway rolling stock rescheduling," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 228-250.

    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:joptap:v:179:y:2018:i:1:d:10.1007_s10957-018-1367-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.