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

A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks

Author

Listed:
  • Vizcaino González, José Federico
  • Lyra, Christiano
  • Usberti, Fábio Luiz

Abstract

Allocation of shunt capacitor banks on radial electric power distribution networks allow reduction of energy losses and aggregated benefits. Four decades ago Durán proposed the use of dynamic programming to find optimal capacitor placement on these networks; however, with the restricting assumption of single-ended networks, which precluded its application to real capacitor allocation problems. Subsequently heuristic methods prevailed in the capacitor allocation literature. Here the Extended Dynamic Programming Approach (EDP) lifts Durán’s restricting assumption; a richer definition of state and the projection of multidimensional informations into equivalent one-dimensional representations are the supporting concepts. In addition to allow consideration of multi-ended networks, EDP deals with other requirements of capacitor allocation studies, including the use of both fixed and switched capacitors and representation of voltage drops along the networks. When switched capacitors are considered the optimization procedure also solves the capacitor control problem, obtaining the best tap adjustments for them. Case studies with real scale distribution networks put into perspective the benefits of the methodology; EDP has the appeal of providing global optimal solutions with pseudo-polynomial computational complexity in the worst-case, and with linear complexity for practical applications.

Suggested Citation

  • Vizcaino González, José Federico & Lyra, Christiano & Usberti, Fábio Luiz, 2012. "A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks," European Journal of Operational Research, Elsevier, vol. 222(1), pages 149-156.
    • Handle: RePEc:eee:ejores:v:222:y:2012:i:1:p:149-156
    DOI: 10.1016/j.ejor.2012.03.042
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712002524
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.03.042?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. Rossi, André & Aubry, Alexis & Jacomino, Mireille, 2012. "Connectivity-and-hop-constrained design of electricity distribution networks," European Journal of Operational Research, Elsevier, vol. 218(1), pages 48-57.
    2. Gordon H. Bradley & Gerald G. Brown & Glenn W. Graves, 1977. "Exceptional Paper--Design and Implementation of Large Scale Primal Transshipment Algorithms," Management Science, INFORMS, vol. 24(1), pages 1-34, September.
    3. Benchakroun, A. & Ferland, J. A. & Cleroux, R., 1992. "Distribution system planning through a generalized Benders decomposition approach," European Journal of Operational Research, Elsevier, vol. 62(2), pages 149-162, October.
    4. 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.
    5. Avella, Pasquale & Villacci, Domenico & Sforza, Antonio, 2005. "A Steiner arborescence model for the feeder reconfiguration in electric distribution networks," European Journal of Operational Research, Elsevier, vol. 164(2), pages 505-509, July.
    6. Garcia, Viní­cius Jacques & França, Paulo Morelato, 2008. "Multiobjective service restoration in electric distribution networks using a local search based heuristic," European Journal of Operational Research, Elsevier, vol. 189(3), pages 694-705, September.
    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. Frank, Stephen M. & Rebennack, Steffen, 2015. "Optimal design of mixed AC–DC distribution systems for commercial buildings: A Nonconvex Generalized Benders Decomposition approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 710-729.

    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. Chardy, M. & Costa, M.-C. & Faye, A. & Trampont, M., 2012. "Optimizing splitter and fiber location in a multilevel optical FTTH network," European Journal of Operational Research, Elsevier, vol. 222(3), pages 430-440.
    2. Rossi, André & Aubry, Alexis & Jacomino, Mireille, 2012. "Connectivity-and-hop-constrained design of electricity distribution networks," European Journal of Operational Research, Elsevier, vol. 218(1), pages 48-57.
    3. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    4. Park, Chanwoo & Lee, Youngho & Kim, Youngjin & Park, Gigyoung, 2014. "An access network design problem with end-to-end QoS constraints," Omega, Elsevier, vol. 48(C), pages 36-48.
    5. Blanco, Víctor & Puerto, Justo & Ramos, Ana B., 2011. "Expanding the Spanish high-speed railway network," Omega, Elsevier, vol. 39(2), pages 138-150, April.
    6. Yi-Chung Hu, 2017. "Electricity consumption prediction using a neural-network-based grey forecasting approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1259-1264, October.
    7. Georgiadis, Michael C. & Tsiakis, Panagiotis & Longinidis, Pantelis & Sofioglou, Maria K., 2011. "Optimal design of supply chain networks under uncertain transient demand variations," Omega, Elsevier, vol. 39(3), pages 254-272, June.
    8. George, John A. & Kuan, Chong Juin & Ring, Brendan J., 1995. "Confidentiality control of tabulated data: Some practical network models," European Journal of Operational Research, Elsevier, vol. 85(3), pages 454-472, September.
    9. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    10. Joseph C. Hartman, 2000. "The parallel replacement problem with demand and capital budgeting constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 40-56, February.
    11. Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.
    12. Castro, J. & Nabona, N., 1996. "An implementation of linear and nonlinear multicommodity network flows," European Journal of Operational Research, Elsevier, vol. 92(1), pages 37-53, July.
    13. Qasem Abu Al-Haija, 2021. "A Stochastic Estimation Framework for Yearly Evolution of Worldwide Electricity Consumption," Forecasting, MDPI, vol. 3(2), pages 1-11, April.
    14. Fu, Zhang-Hua & Hao, Jin-Kao, 2014. "Breakout local search for the Steiner tree problem with revenue, budget and hop constraints," European Journal of Operational Research, Elsevier, vol. 232(1), pages 209-220.
    15. Ferrer-Martí, L. & Domenech, B. & García-Villoria, A. & Pastor, R., 2013. "A MILP model to design hybrid wind–photovoltaic isolated rural electrification projects in developing countries," European Journal of Operational Research, Elsevier, vol. 226(2), pages 293-300.
    16. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    17. Karatas, Mumtaz & Eriskin, Levent, 2023. "Linear and piecewise linear formulations for a hierarchical facility location and sizing problem," Omega, Elsevier, vol. 118(C).
    18. Li, Xiangyong & Aneja, Y.P. & Huo, Jiazhen, 2012. "A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem," Omega, Elsevier, vol. 40(2), pages 210-217, April.
    19. Sun, Minghe, 2002. "The transportation problem with exclusionary side constraints and two branch-and-bound algorithms," European Journal of Operational Research, Elsevier, vol. 140(3), pages 629-647, August.
    20. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.

    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:1:p:149-156. 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.