Variable-depth large neighborhood search algorithm for cable routing in distributed photovoltaic systems

Distributed photovoltaic power systems, typically deployed in complex scenarios like irregular rooftops, present a challenging detailed cable routing problem (DCRP). This involves grouping solar modules and routing cables to connect each group, traditionally addressed through manual design. This paper presents a variable-depth large neighborhood search (VDLNS) algorithm to address the DCRP, which is modeled as a specialized cycle covering problem using arc-flow and partition formulations. A cycle-split heuristic, derived from DCRP’s connection to the traveling salesman problem, is introduced and combined with a series of destroy operators to construct the VDLNS algorithm. Numerical experiments conducted on both synthetic and real-world instances validated the algorithm’s efficacy, achieving an average total cost reduction of 12.87% on house rooftop instances compared to manual design. The results indicate that the method effectively streamlines photovoltaic system design by delivering cost-efficient cable routing schemes within a reasonable timeframe.