用蚁群算法求解汽车喷漆车间的虚拟重排序问题

2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA) Pub Date : 2021-04-23 DOI:10.1109/ICIEA52957.2021.9436810

Hui Sun

{"title":"用蚁群算法求解汽车喷漆车间的虚拟重排序问题","authors":"Hui Sun","doi":"10.1109/ICIEA52957.2021.9436810","DOIUrl":null,"url":null,"abstract":"Virtual resequencing can be used to achieve color-batching in automobile paint shops, in which preassigned colors are rearranged to white car bodies while their sequence positions in the upstream body shop remain unchanged. The objective is to minimize the number of color changes during painting. A 0-1 integer programming model is presented to describe the color-batching problem. Aimed at quickly finding near-optimal solutions to this NP-complete problem, an ant colony optimization (ACO) metaheuristic is proposed. Computational experiments show that the ACO algorithm generates as good results as CPLEX for small and medium size instances. For large size instances in real production settings, the algorithm can be applied effectively on a rolling horizon basis to obtain favorable results.","PeriodicalId":328445,"journal":{"name":"2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving a Virtual Resequencing Problem in Automotive Paint Shops with Ant Colony Optimization\",\"authors\":\"Hui Sun\",\"doi\":\"10.1109/ICIEA52957.2021.9436810\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Virtual resequencing can be used to achieve color-batching in automobile paint shops, in which preassigned colors are rearranged to white car bodies while their sequence positions in the upstream body shop remain unchanged. The objective is to minimize the number of color changes during painting. A 0-1 integer programming model is presented to describe the color-batching problem. Aimed at quickly finding near-optimal solutions to this NP-complete problem, an ant colony optimization (ACO) metaheuristic is proposed. Computational experiments show that the ACO algorithm generates as good results as CPLEX for small and medium size instances. For large size instances in real production settings, the algorithm can be applied effectively on a rolling horizon basis to obtain favorable results.\",\"PeriodicalId\":328445,\"journal\":{\"name\":\"2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIEA52957.2021.9436810\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEA52957.2021.9436810","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

虚拟重排序可用于实现汽车涂装车间的颜色批次，将预先分配的颜色重新排列到白色车身，而其在上游车身车间的序列位置保持不变。目的是尽量减少绘画过程中颜色变化的数量。提出了一个0-1整数规划模型来描述颜色批处理问题。为了快速找到该np完全问题的近最优解，提出了一种蚁群优化(ACO)元启发式算法。计算实验表明，对于中小型实例，蚁群算法的求解效果与CPLEX算法相当。对于实际生产环境中的大型实例，该算法可以在滚动水平面上有效地应用，获得较好的效果。

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

查看原文本刊更多论文

Solving a Virtual Resequencing Problem in Automotive Paint Shops with Ant Colony Optimization

Virtual resequencing can be used to achieve color-batching in automobile paint shops, in which preassigned colors are rearranged to white car bodies while their sequence positions in the upstream body shop remain unchanged. The objective is to minimize the number of color changes during painting. A 0-1 integer programming model is presented to describe the color-batching problem. Aimed at quickly finding near-optimal solutions to this NP-complete problem, an ant colony optimization (ACO) metaheuristic is proposed. Computational experiments show that the ACO algorithm generates as good results as CPLEX for small and medium size instances. For large size instances in real production settings, the algorithm can be applied effectively on a rolling horizon basis to obtain favorable results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA)

自引率

0.00%

发文量