A Variable Neighborhood Search Algorithm for Heat Pipe-Constrained Component Layout Optimization

IF 2 3区计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computer Supported Cooperative Work-The Journal of Collaborative Computing Pub Date : 2023-05-24 DOI:10.1109/CSCWD57460.2023.10152572

Shichen Tian, Zhi-Guo Deng, Jia-xu Fan, Chunjiang Zhang, Weiming Shen, Liang Gao

{"title":"A Variable Neighborhood Search Algorithm for Heat Pipe-Constrained Component Layout Optimization","authors":"Shichen Tian, Zhi-Guo Deng, Jia-xu Fan, Chunjiang Zhang, Weiming Shen, Liang Gao","doi":"10.1109/CSCWD57460.2023.10152572","DOIUrl":null,"url":null,"abstract":"This paper proposes a bi-level Multi-Start Variable Neighborhood Search-Genetic Algorithm (MSVNS-GA) for the heat pipe-constrained component layout optimization (HCLO) problems. The proposed algorithm has won the first place in the CEC’2022 Competition on the Heat Pipe-Constrained Component Layout Optimization. First, the HCLO problem is divided into two sub-problems, heat pipe assignment (HA) and component location (CL). In the HA problem, components are assigned to different heat pipes. The best assignment scheme is taken as the input of the CL problem. In the CL problem, the specific coordinates of components are determined to meet practical engineering constraints. In this way, the complexity of the problem is lowered, and a part of the infeasible solution is cropped. Second, to address the HA problem, a multi-start variable neighborhood search algorithm is proposed and five efficient bottleneck-aware neighborhood structures are designed. And the genetic algorithm is used for CL problem. Finally, 30 independent experiments are carried out on the calculation examples with sizes of 6×4, 15×6, 40×16, and 90×32. The best result obtained by MSVNS-GA is 0.0%, 1.0%, 0.8%, and 1.1% different from the estimated lower bounds.","PeriodicalId":51008,"journal":{"name":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","volume":"13 1","pages":"1452-1457"},"PeriodicalIF":2.0000,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/CSCWD57460.2023.10152572","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

Abstract

This paper proposes a bi-level Multi-Start Variable Neighborhood Search-Genetic Algorithm (MSVNS-GA) for the heat pipe-constrained component layout optimization (HCLO) problems. The proposed algorithm has won the first place in the CEC’2022 Competition on the Heat Pipe-Constrained Component Layout Optimization. First, the HCLO problem is divided into two sub-problems, heat pipe assignment (HA) and component location (CL). In the HA problem, components are assigned to different heat pipes. The best assignment scheme is taken as the input of the CL problem. In the CL problem, the specific coordinates of components are determined to meet practical engineering constraints. In this way, the complexity of the problem is lowered, and a part of the infeasible solution is cropped. Second, to address the HA problem, a multi-start variable neighborhood search algorithm is proposed and five efficient bottleneck-aware neighborhood structures are designed. And the genetic algorithm is used for CL problem. Finally, 30 independent experiments are carried out on the calculation examples with sizes of 6×4, 15×6, 40×16, and 90×32. The best result obtained by MSVNS-GA is 0.0%, 1.0%, 0.8%, and 1.1% different from the estimated lower bounds.

查看原文本刊更多论文

热管约束下元件布局优化的变邻域搜索算法

针对热管约束下的元件布局优化问题，提出了一种双层多启动变量邻域搜索遗传算法。该算法在CEC 2022热管约束组件布局优化竞赛中获得第一名。首先，将HCLO问题分为热管分配(HA)和部件定位(CL)两个子问题。在HA问题中，组件被分配到不同的热管中。将最佳分配方案作为CL问题的输入。在CL问题中，确定部件的具体坐标以满足实际工程约束。这样既降低了问题的复杂性，又剔除了一部分不可行的解。其次，针对高可用性问题，提出了一种多起始变量邻域搜索算法，设计了五种高效的瓶颈感知邻域结构。并采用遗传算法求解CL问题。最后，对尺寸分别为6×4、15×6、40×16、90×32的计算例进行了30个独立实验。MSVNS-GA得到的最佳结果与估计的下界分别相差0.0%、1.0%、0.8%和1.1%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computer Supported Cooperative Work-The Journal of Collaborative Computing COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-

CiteScore

6.40

自引率

4.20%

发文量

审稿时长

>12 weeks

期刊介绍： Computer Supported Cooperative Work (CSCW): The Journal of Collaborative Computing and Work Practices is devoted to innovative research in computer-supported cooperative work (CSCW). It provides an interdisciplinary and international forum for the debate and exchange of ideas concerning theoretical, practical, technical, and social issues in CSCW. The CSCW Journal arose in response to the growing interest in the design, implementation and use of technical systems (including computing, information, and communications technologies) which support people working cooperatively, and its scope remains to encompass the multifarious aspects of research within CSCW and related areas. The CSCW Journal focuses on research oriented towards the development of collaborative computing technologies on the basis of studies of actual cooperative work practices (where ‘work’ is used in the wider sense). That is, it welcomes in particular submissions that (a) report on findings from ethnographic or similar kinds of in-depth fieldwork of work practices with a view to their technological implications, (b) report on empirical evaluations of the use of extant or novel technical solutions under real-world conditions, and/or (c) develop technical or conceptual frameworks for practice-oriented computing research based on previous fieldwork and evaluations.