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 , Rong-hao Li , Jun-qing Li , Xin Yu , 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":7.2000,"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":"","PubModel":"","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.
期刊介绍:
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.