An ant colony hybrid simulated annealing algorithm for collaborative optimization of robotic mixed-model parallel two-sided assembly lines balancing

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Yuling Jiao, Yang Wang, Xinyue Su, Fuyu Wang
{"title":"An ant colony hybrid simulated annealing algorithm for collaborative optimization of robotic mixed-model parallel two-sided assembly lines balancing","authors":"Yuling Jiao,&nbsp;Yang Wang,&nbsp;Xinyue Su,&nbsp;Fuyu Wang","doi":"10.1016/j.cor.2025.107113","DOIUrl":null,"url":null,"abstract":"<div><div>Aiming at the flexible production of small-lot and multi-variety assembly lines in intelligent manufacturing systems, a robot-operated mixed-model sequencing and parallel two-sided assembly line assembly system is proposed. Systematic co-optimization in three dimensions of task assignment at mated-stations and multi-line stations, multi-product mixed-model sequencing and task line balancing, as well as robot types and task time at workstations are solved. Mixed-model parallel two-sided assembly line system and its key terms are defined. A mathematical model of the mixed-model robotic parallel two-sided assemblyGreen line type-II balancing problem (MRPTALBP-II) considering energy consumption is developed. Based on the ant colony optimization algorithm (ACO) and simulated annealing algorithm (SA) for solving the model, the ant colony hybrid simulated annealing algorithm (ACHSA) is proposed to solve the model. A new initial solution encoding, multiple neighborhood structures and dual pheromone matrix updating method are designed,in order to avoid the algorithm from falling into local optimum and to expand the search range. Three sets of calculations are obtained for comparative analysis in conjunction with classical arithmetic cases. The results show that the ACHSA outperforms the SA and the ACO, with an excellence rate of 100% for large-scale arithmetic cases and 61% for small-scale arithmetic cases, which verifies the validity of the model and the algorithm. Firstly, the MRPTALBP-II is successfully solved, which provides a useful reference for the solution of multi-factor collaborative problems of complex systems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107113"},"PeriodicalIF":4.1000,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825001418","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the flexible production of small-lot and multi-variety assembly lines in intelligent manufacturing systems, a robot-operated mixed-model sequencing and parallel two-sided assembly line assembly system is proposed. Systematic co-optimization in three dimensions of task assignment at mated-stations and multi-line stations, multi-product mixed-model sequencing and task line balancing, as well as robot types and task time at workstations are solved. Mixed-model parallel two-sided assembly line system and its key terms are defined. A mathematical model of the mixed-model robotic parallel two-sided assemblyGreen line type-II balancing problem (MRPTALBP-II) considering energy consumption is developed. Based on the ant colony optimization algorithm (ACO) and simulated annealing algorithm (SA) for solving the model, the ant colony hybrid simulated annealing algorithm (ACHSA) is proposed to solve the model. A new initial solution encoding, multiple neighborhood structures and dual pheromone matrix updating method are designed,in order to avoid the algorithm from falling into local optimum and to expand the search range. Three sets of calculations are obtained for comparative analysis in conjunction with classical arithmetic cases. The results show that the ACHSA outperforms the SA and the ACO, with an excellence rate of 100% for large-scale arithmetic cases and 61% for small-scale arithmetic cases, which verifies the validity of the model and the algorithm. Firstly, the MRPTALBP-II is successfully solved, which provides a useful reference for the solution of multi-factor collaborative problems of complex systems.
基于蚁群混合模拟退火算法的机器人混合模型双面平行装配线平衡协同优化
针对智能制造系统中小批量、多品种装配线的柔性生产问题,提出了一种机器人操作的混合模式排序并行双面装配线装配系统。解决了多工位和多工位任务分配、多产品混合模型排序和任务线平衡、工位机器人类型和任务时间三个维度的系统协同优化问题。定义了混合型双面平行装配线系统及其关键术语。建立了考虑能耗的混合模型机器人平行双面装配绿线平衡问题(MRPTALBP-II)的数学模型。在蚁群优化算法(ACO)和模拟退火算法(SA)求解模型的基础上,提出了蚁群混合模拟退火算法(ACHSA)求解模型。为了避免算法陷入局部最优,扩大搜索范围,设计了新的初始解编码、多邻域结构和对偶信息素矩阵更新方法。结合经典算术实例,得到了三组计算方法进行对比分析。结果表明,ACHSA算法优于SA算法和蚁群算法,大规模算法的优良率为100%,小规模算法的优良率为61%,验证了模型和算法的有效性。首先,成功求解了MRPTALBP-II,为复杂系统多因素协同问题的求解提供了有益的参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信