Adaptive reference-points learning and cooperation driven multi-objective algorithm for hybrid group flow shop with outsourcing option

IF 4.6 2区 工程技术 Q2 ENGINEERING, MANUFACTURING
Xinrui Wang , Junqing Li , Jiake Li , Ying Xu
{"title":"Adaptive reference-points learning and cooperation driven multi-objective algorithm for hybrid group flow shop with outsourcing option","authors":"Xinrui Wang ,&nbsp;Junqing Li ,&nbsp;Jiake Li ,&nbsp;Ying Xu","doi":"10.1016/j.cirpj.2025.04.006","DOIUrl":null,"url":null,"abstract":"<div><div>With the development of economic globalization, group scheduling with outsourcing option has attracted much attention. This study considers a hybrid flow shop with group and outsourcing constraints, named HFGSP_OO. To solve this problem, adaptive reference-points learning and cooperation driven multi-objective algorithm (ARPCMOA) is proposed to optimize makespan, total energy consumption (TEC) and outsourcing cost, simultaneously. First, according to the characteristics of the problem, a strategy for determining the group to be outsourced is considered to generate the promising initial solutions. Second, a two-stage co-evolutionary method is used to explore the solution space in depth. In the first stage, a hybrid local search (HLS) is proposed to obtain more extreme solutions. In the second stage, the reference points adaptation mechanism is employed to enhance the global search capability of the algorithm, which can select high-quality solutions. These two stages are working cooperatively during the iterative process so that the population evolves towards the true Pareto front. In addition, an energy saving strategy based on idle time is proposed to better optimize TEC. Finally, a large number of statistical analysis experiments (KW) show that ARPCMOA outperforms existing multi-objective algorithms.</div></div>","PeriodicalId":56011,"journal":{"name":"CIRP Journal of Manufacturing Science and Technology","volume":"60 ","pages":"Pages 56-75"},"PeriodicalIF":4.6000,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CIRP Journal of Manufacturing Science and Technology","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1755581725000598","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of economic globalization, group scheduling with outsourcing option has attracted much attention. This study considers a hybrid flow shop with group and outsourcing constraints, named HFGSP_OO. To solve this problem, adaptive reference-points learning and cooperation driven multi-objective algorithm (ARPCMOA) is proposed to optimize makespan, total energy consumption (TEC) and outsourcing cost, simultaneously. First, according to the characteristics of the problem, a strategy for determining the group to be outsourced is considered to generate the promising initial solutions. Second, a two-stage co-evolutionary method is used to explore the solution space in depth. In the first stage, a hybrid local search (HLS) is proposed to obtain more extreme solutions. In the second stage, the reference points adaptation mechanism is employed to enhance the global search capability of the algorithm, which can select high-quality solutions. These two stages are working cooperatively during the iterative process so that the population evolves towards the true Pareto front. In addition, an energy saving strategy based on idle time is proposed to better optimize TEC. Finally, a large number of statistical analysis experiments (KW) show that ARPCMOA outperforms existing multi-objective algorithms.
带有外包选项的混合群流车间自适应参考点学习与合作驱动多目标算法
随着经济全球化的发展,具有外包选项的集团调度受到了广泛关注。本研究考虑了一个具有集团和外包约束的混合流车间,命名为HFGSP_OO。为了解决这一问题,提出了自适应参考点学习和合作驱动多目标算法(ARPCMOA),同时优化完工时间、总能耗(TEC)和外包成本。首先,根据问题的特点,考虑确定外包组的策略,以产生有希望的初始解决方案。其次,采用两阶段协同进化方法对解空间进行深入探索。在第一阶段,提出了一种混合局部搜索(HLS)方法,以获得更极端的解。第二阶段,采用参考点自适应机制,增强算法的全局搜索能力,选择出高质量的解。这两个阶段在迭代过程中协同工作,使总体向真正的帕累托前沿发展。此外,提出了一种基于空闲时间的节能策略,以更好地优化TEC。最后,大量的统计分析实验(KW)表明,ARPCMOA算法优于现有的多目标算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CIRP Journal of Manufacturing Science and Technology
CIRP Journal of Manufacturing Science and Technology Engineering-Industrial and Manufacturing Engineering
CiteScore
9.10
自引率
6.20%
发文量
166
审稿时长
63 days
期刊介绍: The CIRP Journal of Manufacturing Science and Technology (CIRP-JMST) publishes fundamental papers on manufacturing processes, production equipment and automation, product design, manufacturing systems and production organisations up to the level of the production networks, including all the related technical, human and economic factors. Preference is given to contributions describing research results whose feasibility has been demonstrated either in a laboratory or in the industrial praxis. Case studies and review papers on specific issues in manufacturing science and technology are equally encouraged.
×
引用
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学术官方微信