{"title":"考虑到预防性维护情况的双面装配线平衡的知识辅助变量邻域搜索","authors":"Lianpeng Zhao;Qiuhua Tang;Zikai Zhang;Yingying Zhu","doi":"10.1109/TSMC.2024.3407724","DOIUrl":null,"url":null,"abstract":"In a realistic two-sided assembly line, a preventive maintenance (PM) activity may cause a stoppage of the whole line and a waste of capacity in most stations. To promote production continuity, multiple interchangeable task assignment schemes are required, each targeting one of the regular and PM scenarios. Yet previous studies have not solved the resulting two-sided assembly line balancing problem considering PM scenarios (TALBP-PM), and the domain knowledge deserves extraction. Hence, a multiobjective mixed-integer linear programming model is formulated to minimize cycle times and total task adjustment simultaneously, and a knowledge-assisted variable neighborhood search (KVNS) is customized. Specifically, a decoding mechanism with idle time reduction is proposed to achieve schemes with the shortest cycle times. A rule-based initialization relying on the externalization of implicit relations among unique attributes is designed to derive a high-quality initial solution. Supported by the critical station and task knowledge, objective-oriented neighborhood structures are developed to generate neighbor solutions with increasingly better objectives. Besides, a restart operator adaptive to multidomain knowledge is refined to escape from local optima. Computational results show that the knowledge assistance is effective, and KVNS is superior to other state-of-the-art meta-heuristics in achieving well-converged and -distributed Pareto fronts of TALBP-PM.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":null,"pages":null},"PeriodicalIF":8.6000,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Knowledge-Assisted Variable Neighborhood Search for Two-Sided Assembly Line Balancing Considering Preventive Maintenance Scenarios\",\"authors\":\"Lianpeng Zhao;Qiuhua Tang;Zikai Zhang;Yingying Zhu\",\"doi\":\"10.1109/TSMC.2024.3407724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a realistic two-sided assembly line, a preventive maintenance (PM) activity may cause a stoppage of the whole line and a waste of capacity in most stations. To promote production continuity, multiple interchangeable task assignment schemes are required, each targeting one of the regular and PM scenarios. Yet previous studies have not solved the resulting two-sided assembly line balancing problem considering PM scenarios (TALBP-PM), and the domain knowledge deserves extraction. Hence, a multiobjective mixed-integer linear programming model is formulated to minimize cycle times and total task adjustment simultaneously, and a knowledge-assisted variable neighborhood search (KVNS) is customized. Specifically, a decoding mechanism with idle time reduction is proposed to achieve schemes with the shortest cycle times. A rule-based initialization relying on the externalization of implicit relations among unique attributes is designed to derive a high-quality initial solution. Supported by the critical station and task knowledge, objective-oriented neighborhood structures are developed to generate neighbor solutions with increasingly better objectives. Besides, a restart operator adaptive to multidomain knowledge is refined to escape from local optima. Computational results show that the knowledge assistance is effective, and KVNS is superior to other state-of-the-art meta-heuristics in achieving well-converged and -distributed Pareto fronts of TALBP-PM.\",\"PeriodicalId\":48915,\"journal\":{\"name\":\"IEEE Transactions on Systems Man Cybernetics-Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":8.6000,\"publicationDate\":\"2024-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Systems Man Cybernetics-Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10659209/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man Cybernetics-Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10659209/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
A Knowledge-Assisted Variable Neighborhood Search for Two-Sided Assembly Line Balancing Considering Preventive Maintenance Scenarios
In a realistic two-sided assembly line, a preventive maintenance (PM) activity may cause a stoppage of the whole line and a waste of capacity in most stations. To promote production continuity, multiple interchangeable task assignment schemes are required, each targeting one of the regular and PM scenarios. Yet previous studies have not solved the resulting two-sided assembly line balancing problem considering PM scenarios (TALBP-PM), and the domain knowledge deserves extraction. Hence, a multiobjective mixed-integer linear programming model is formulated to minimize cycle times and total task adjustment simultaneously, and a knowledge-assisted variable neighborhood search (KVNS) is customized. Specifically, a decoding mechanism with idle time reduction is proposed to achieve schemes with the shortest cycle times. A rule-based initialization relying on the externalization of implicit relations among unique attributes is designed to derive a high-quality initial solution. Supported by the critical station and task knowledge, objective-oriented neighborhood structures are developed to generate neighbor solutions with increasingly better objectives. Besides, a restart operator adaptive to multidomain knowledge is refined to escape from local optima. Computational results show that the knowledge assistance is effective, and KVNS is superior to other state-of-the-art meta-heuristics in achieving well-converged and -distributed Pareto fronts of TALBP-PM.
期刊介绍:
The IEEE Transactions on Systems, Man, and Cybernetics: Systems encompasses the fields of systems engineering, covering issue formulation, analysis, and modeling throughout the systems engineering lifecycle phases. It addresses decision-making, issue interpretation, systems management, processes, and various methods such as optimization, modeling, and simulation in the development and deployment of large systems.