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.

中文翻译：

---

分布式光伏系统中电缆布线的可变深度大邻域搜索算法


分布式光伏发电系统通常部署在不规则屋顶等复杂场景中，存在具有挑战性的详细电缆布线问题 （DCRP）。这涉及对太阳能组件进行分组并布线电缆以连接每组，传统上通过手动设计来解决。本文提出了一种可变深度大邻域搜索 （VDLNS） 算法来解决 DCRP，该算法被建模为使用弧流和分区公式涵盖问题的特殊循环。引入了一种循环拆分启发式方法，该启发式算法源自 DCRP 与旅行商问题的联系，并与一系列销毁运算符相结合，以构建 VDLNS 算法。在合成和真实世界实例上进行的数值实验验证了该算法的有效性，与手动设计相比，房屋屋顶实例的总成本平均降低了 12.87%。结果表明，该方法通过在合理的时间范围内提供具有成本效益的电缆布线方案，有效地简化了光伏系统设计。