IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v33y2021i2p452-476.html
   My bibliography  Save this article

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants

Author

Listed:
  • Zhixing Luo

    (School of Management and Engineering, Nanjing University, Nanjing 210093, China)

  • Hu Qin

    (School of Management, Huazhong University of Science and Technology, 430074 Wuhan, China)

  • T. C. E. Cheng

    (PolyU Business School, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong)

  • Qinghua Wu

    (School of Management, Huazhong University of Science and Technology, 430074 Wuhan, China)

  • Andrew Lim

    (Department of Industrial and Systems Engineering, National University of Singapore, Singapore 117576)

Abstract

A solar power plant is a large-scale photovoltaic (PV) system designed to supply usable solar power to the electricity grid. Building a solar power plant needs consideration of arrangements of several important components, such as PV arrays, solar inverters, combiner boxes, cables, and other electrical accessories. The design of solar power plants is very complex because of various optimization parameters and design regulations. In this study, we address the cable-routing problem arising in the planning of large-scale solar power plants, which aims to determine the partition of the PV arrays, the location of combiner boxes, and cable routing such that the installation cost of the cables connecting the components is minimized. We formulate the problem as a mathematical programming problem, which can be viewed as a generalized capacitated minimum spanning tree (CMST) problem, and then devise a branch-and-price-and-cut (BPC) algorithm to solve it. The BPC algorithm uses two important valid inequalities, namely the capacity inequalities and the subset-row inequalities, to tighten the lower bounds. We also adopt several acceleration strategies to speed up the algorithm. Using real-world data sets, we show by numerical experiments that our BPC algorithm is superior to the typical manual-based planning approach used by many electric power planning companies. In addition, when solving the CMST problem with unitary demands, our algorithm is highly competitive compared with the best exact algorithm in the literature.

Suggested Citation

  • Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim, 2021. "A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 452-476, May.
    • Handle: RePEc:inm:orijoc:v:33:y:2021:i:2:p:452-476
    DOI: 10.1287/ijoc.2020.0981
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2020.0981
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2020.0981?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
    ---><---

    References listed on IDEAS

    as
    1. Guy Desaulniers, 2010. "Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 58(1), pages 179-192, February.
    2. Araque, J. & Hall, L. & Magnanti, T., 1990. "Capacitated trees, capacitated routing, and associated polyhedra," LIDAM Discussion Papers CORE 1990061, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. C. Archetti & M. Bouchard & G. Desaulniers, 2011. "Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows," Transportation Science, INFORMS, vol. 45(3), pages 285-298, August.
    4. Zhang-Hua Fu & Jin-Kao Hao, 2015. "Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 221-237, May.
    5. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    6. Hee-Su Hwang & Siriwat Visoldilokpun & Jay M. Rosenberger, 2008. "A Branch-and-Price-and-Cut Method for Ship Scheduling with Limited Risk," Transportation Science, INFORMS, vol. 42(3), pages 336-351, August.
    7. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    8. Leslie Hall, 1996. "Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 219-234, August.
    9. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    10. Kacira, Murat & Simsek, Mehmet & Babur, Yunus & Demirkol, Sedat, 2004. "Determining optimum tilt angles and orientations of photovoltaic panels in Sanliurfa, Turkey," Renewable Energy, Elsevier, vol. 29(8), pages 1265-1275.
    11. Cesar Rego & Frank Mathew & Fred Glover, 2010. "RAMP for the capacitated minimum spanning tree problem," Annals of Operations Research, Springer, vol. 181(1), pages 661-681, December.
    12. Cabrera-Tobar, Ana & Bullich-Massagué, Eduard & Aragüés-Peñalba, Mònica & Gomis-Bellmunt, Oriol, 2016. "Topologies for large scale photovoltaic power plants," Renewable and Sustainable Energy Reviews, Elsevier, vol. 59(C), pages 309-319.
    13. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    14. Mehleri, E.D. & Zervas, P.L. & Sarimveis, H. & Palyvos, J.A. & Markatos, N.C., 2010. "Determination of the optimal tilt angle and orientation for solar photovoltaic arrays," Renewable Energy, Elsevier, vol. 35(11), pages 2468-2475.
    15. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    16. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
    17. L. Gouveia & P. Martins, 1999. "The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel," Annals of Operations Research, Springer, vol. 86(0), pages 271-294, January.
    18. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    19. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    Full references (including those not matched with items on IDEAS)

    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. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    2. Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2017. "Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost," Transportation Science, INFORMS, vol. 51(2), pages 668-687, May.
    3. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    4. Pedro Munari & Martin Savelsbergh, 2020. "A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows," SN Operations Research Forum, Springer, vol. 1(4), pages 1-24, December.
    5. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
    6. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    7. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    8. Tilk, Christian & Drexl, Michael & Irnich, Stefan, 2019. "Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies," European Journal of Operational Research, Elsevier, vol. 276(2), pages 549-565.
    9. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    10. Guy Desaulniers & Jørgen G. Rakke & Leandro C. Coelho, 2016. "A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 50(3), pages 1060-1076, August.
    11. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
    12. Barış Yıldız & Oya Ekin Karaşan, 2017. "Regenerator Location Problem in Flexible Optical Networks," Operations Research, INFORMS, vol. 65(3), pages 595-620, June.
    13. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
    14. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
    15. Guy Desaulniers & Fausto Errico & Stefan Irnich & Michael Schneider, 2016. "Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 64(6), pages 1388-1405, December.
    16. Ciancio, Claudio & Laganá, Demetrio & Vocaturo, Francesca, 2018. "Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 267(1), pages 187-199.
    17. Christian Tilk & Michael Drexl & Stefan Irnich, 2018. "Nested Branch-and-Price-and-Cut for Vehicle Routing Problems with Multiple Resource Interdependencies," Working Papers 1801, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
    19. Pedro Munari & Reinaldo Morabito, 2018. "A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 437-464, October.
    20. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.

    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:inm:orijoc:v:33:y:2021:i:2:p:452-476. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.