In:
INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS)
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.
Type of Medium:
Online Resource
ISSN:
1091-9856
,
1526-5528
DOI:
10.1287/ijoc.2020.0981
Language:
English
Publisher:
Institute for Operations Research and the Management Sciences (INFORMS)
Publication Date:
2020
detail.hit.zdb_id:
2070411-2
detail.hit.zdb_id:
2004082-9
SSG:
3,2
Permalink
