An adaptive multiobjective evolutionary algorithm for dynamic multiobjective flexible scheduling problem

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Weiwei Yu, Li Zhang, Ning Ge
{"title":"An adaptive multiobjective evolutionary algorithm for dynamic multiobjective flexible scheduling problem","authors":"Weiwei Yu,&nbsp;Li Zhang,&nbsp;Ning Ge","doi":"10.1002/int.23090","DOIUrl":null,"url":null,"abstract":"<p>There are various uncertain disturbances in the actual manufacturing environment, which makes dynamic multiobjective flexible scheduling problem of flexible job shop (MDFJSP) become the research focus in the field of optimal scheduling. In this paper, MDFJSP in the environment of temporary order insertion uncertainty is studied, and a multiobjective dynamic scheduling scheme based on rescheduling index and adaptive nondominated sorting genetic algorithm (NSGA-II) is proposed. First, based on the actual manufacturing environment, the mathematical model of the traditional flexible job shop scheduling problem is improved, and the multiobjective dynamic rescheduling model of flexible work center is established. Then, the existing rescheduling mechanisms are summarized, and a rescheduling hybrid driving mechanism based on the rescheduling index is proposed to enable it to reschedule and drive according to the actual situation. Finally, the shortcomings of the traditional multiobjective scheduling algorithm NSGA-II are analyzed, the adaptive cross mutation strategy and the simplified harmonic normalized distance measure method are proposed to improve it, and an adaptive multiobjective dynamic scheduling algorithm NSGA-II (MDSA-NSGA-II) is formed. To analyze the performance of this algorithm, the performance of this algorithm is compared with five classical flexible job shop multiobjective scheduling algorithms in international general examples, and the effectiveness is verified by real aircraft production examples. The experimental results fully show that MDSA-NSGA-II has good performance in solving MDFJSP.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"37 12","pages":"12335-12366"},"PeriodicalIF":5.0000,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/int.23090","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 1

Abstract

There are various uncertain disturbances in the actual manufacturing environment, which makes dynamic multiobjective flexible scheduling problem of flexible job shop (MDFJSP) become the research focus in the field of optimal scheduling. In this paper, MDFJSP in the environment of temporary order insertion uncertainty is studied, and a multiobjective dynamic scheduling scheme based on rescheduling index and adaptive nondominated sorting genetic algorithm (NSGA-II) is proposed. First, based on the actual manufacturing environment, the mathematical model of the traditional flexible job shop scheduling problem is improved, and the multiobjective dynamic rescheduling model of flexible work center is established. Then, the existing rescheduling mechanisms are summarized, and a rescheduling hybrid driving mechanism based on the rescheduling index is proposed to enable it to reschedule and drive according to the actual situation. Finally, the shortcomings of the traditional multiobjective scheduling algorithm NSGA-II are analyzed, the adaptive cross mutation strategy and the simplified harmonic normalized distance measure method are proposed to improve it, and an adaptive multiobjective dynamic scheduling algorithm NSGA-II (MDSA-NSGA-II) is formed. To analyze the performance of this algorithm, the performance of this algorithm is compared with five classical flexible job shop multiobjective scheduling algorithms in international general examples, and the effectiveness is verified by real aircraft production examples. The experimental results fully show that MDSA-NSGA-II has good performance in solving MDFJSP.

动态多目标柔性调度问题的自适应多目标进化算法
实际制造环境中存在各种不确定扰动,使得柔性车间的动态多目标柔性调度问题成为优化调度领域的研究热点。本文研究了临时订单插入不确定性环境下的MDFJSP,提出了一种基于重调度指标和自适应非支配排序遗传算法(NSGA‐II)的多目标动态调度方案。首先,基于实际制造环境,对传统柔性车间调度问题的数学模型进行了改进,建立了柔性工作中心的多目标动态调度模型。然后,总结了现有的重新调度机制,提出了一种基于重新调度指标的重新调度混合动力驱动机制,使其能够根据实际情况进行重新调度和驾驶。最后,分析了传统多目标调度算法NSGA‐II的不足,提出了自适应交叉变异策略和简化的谐波归一化距离测量方法对其进行改进,形成了自适应多目标动态调度算法NSGA-II(MDSA-NSGA-II)。为了分析该算法的性能,将该算法与国际通用实例中的五种经典柔性作业车间多目标调度算法进行了性能比较,并通过实际飞机生产实例验证了该算法的有效性。实验结果充分表明,MDSA‐NSGA‐II在解决MDFJSP方面具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Intelligent Systems
International Journal of Intelligent Systems 工程技术-计算机:人工智能
CiteScore
11.30
自引率
14.30%
发文量
304
审稿时长
9 months
期刊介绍: The International Journal of Intelligent Systems serves as a forum for individuals interested in tapping into the vast theories based on intelligent systems construction. With its peer-reviewed format, the journal explores several fascinating editorials written by today''s experts in the field. Because new developments are being introduced each day, there''s much to be learned — examination, analysis creation, information retrieval, man–computer interactions, and more. The International Journal of Intelligent Systems uses charts and illustrations to demonstrate these ground-breaking issues, and encourages readers to share their thoughts and experiences.
×
引用
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学术官方微信