A multi-dimensional co-evolutionary algorithm for multi-objective resource-constrained flexible flowshop with robotic transportation

IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Soft Computing Pub Date : 2025-02-01 Epub Date: 2025-01-02 DOI:10.1016/j.asoc.2024.112689
Jia-ke Li , Rong-hao Li , Jun-qing Li , Xin Yu , Ying Xu
{"title":"A multi-dimensional co-evolutionary algorithm for multi-objective resource-constrained flexible flowshop with robotic transportation","authors":"Jia-ke Li ,&nbsp;Rong-hao Li ,&nbsp;Jun-qing Li ,&nbsp;Xin Yu ,&nbsp;Ying Xu","doi":"10.1016/j.asoc.2024.112689","DOIUrl":null,"url":null,"abstract":"<div><div>In this study, a realistic flexible or hybrid flowshop scheduling problem (HFS) is investigated, in which the following constraints are embedded, i.e., resource-dependent processing, robotic arm loading, and transportation. To solve the considered problem, a multi-dimensional co-evolutionary algorithm (MDCEA) is proposed to minimize makespan and total energy consumption (TEC) simultaneously. First, in the MDCEA, solutions are encoded by a three-dimensional vector with a two-phase decoding heuristic. Then, the initialized population is divided into three subsets to focus on different search tasks. To improve the efficiency of the global search task, a dual-population-based variable dimension cooperative search method is developed. In addition, to explore the promising non-dominated solutions in different dimensions, a Q-learning-based dimension detection search method is designed for the local search task. Finally, to keep the diversity in the evolutionary process, a knowledge-based individual transfer strategy is conducted for populations. The proposed algorithm was tested on 25 randomly generated instances, and detailed comparisons verified the efficiency and robustness compared to six state-of-the-art algorithms was achieved.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"170 ","pages":"Article 112689"},"PeriodicalIF":6.6000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624014637","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/2 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In this study, a realistic flexible or hybrid flowshop scheduling problem (HFS) is investigated, in which the following constraints are embedded, i.e., resource-dependent processing, robotic arm loading, and transportation. To solve the considered problem, a multi-dimensional co-evolutionary algorithm (MDCEA) is proposed to minimize makespan and total energy consumption (TEC) simultaneously. First, in the MDCEA, solutions are encoded by a three-dimensional vector with a two-phase decoding heuristic. Then, the initialized population is divided into three subsets to focus on different search tasks. To improve the efficiency of the global search task, a dual-population-based variable dimension cooperative search method is developed. In addition, to explore the promising non-dominated solutions in different dimensions, a Q-learning-based dimension detection search method is designed for the local search task. Finally, to keep the diversity in the evolutionary process, a knowledge-based individual transfer strategy is conducted for populations. The proposed algorithm was tested on 25 randomly generated instances, and detailed comparisons verified the efficiency and robustness compared to six state-of-the-art algorithms was achieved.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于机器人运输的多目标资源约束柔性流水车间多维协同进化算法
本文研究了一个现实的柔性或混合流程车间调度问题(HFS),其中嵌入了以下约束,即资源依赖性加工,机械臂装载和运输。为了解决该问题,提出了一种多维协同进化算法(MDCEA),以同时最小化完工时间和总能耗(TEC)。首先,在MDCEA中,解是由一个具有两阶段解码启发式的三维向量编码的。然后,将初始化的种群分为三个子集,以专注于不同的搜索任务。为了提高全局搜索任务的效率,提出了一种基于双种群的变维协同搜索方法。此外,针对局部搜索任务,设计了一种基于q学习的维度检测搜索方法,以探索不同维度下有前景的非支配解。最后,为了保持进化过程中的多样性,对种群进行了基于知识的个体迁移策略。该算法在25个随机生成的实例上进行了测试,并与6种最先进的算法进行了详细的比较,验证了算法的有效性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
期刊最新文献
ISTCLR: Improved sparse temporal contrastive learning for video representation ModuleCNN: A modular framework for unified CNN architecture and hyperparameter optimization via metaheuristics in image classification Modeling and treatment of social media addiction using a fractional-order and deep neural network approach Embedding contrastive memory into variational autoencoder for anomaly detection in IIoT systems A global and local encoder fusion network for pavement crack segmentation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1