{"title":"分布式光伏系统中电缆布线的可变深度大邻域搜索算法","authors":"","doi":"10.1016/j.autcon.2024.105839","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":8660,"journal":{"name":"Automation in Construction","volume":null,"pages":null},"PeriodicalIF":9.6000,"publicationDate":"2024-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Variable-depth large neighborhood search algorithm for cable routing in distributed photovoltaic systems\",\"authors\":\"\",\"doi\":\"10.1016/j.autcon.2024.105839\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>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.</div></div>\",\"PeriodicalId\":8660,\"journal\":{\"name\":\"Automation in Construction\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":9.6000,\"publicationDate\":\"2024-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automation in Construction\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0926580524005752\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CONSTRUCTION & BUILDING TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automation in Construction","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0926580524005752","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CONSTRUCTION & BUILDING TECHNOLOGY","Score":null,"Total":0}
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.
期刊介绍:
Automation in Construction is an international journal that focuses on publishing original research papers related to the use of Information Technologies in various aspects of the construction industry. The journal covers topics such as design, engineering, construction technologies, and the maintenance and management of constructed facilities.
The scope of Automation in Construction is extensive and covers all stages of the construction life cycle. This includes initial planning and design, construction of the facility, operation and maintenance, as well as the eventual dismantling and recycling of buildings and engineering structures.