Super Heuristic Genetic Algorithm for Fuzzy Flexible Job Shop Scheduling

Yu-yan Han
{"title":"Super Heuristic Genetic Algorithm for Fuzzy Flexible Job Shop Scheduling","authors":"Yu-yan Han","doi":"10.38007/ijmc.2022.030404","DOIUrl":null,"url":null,"abstract":": The purpose of this paper is to propose a hybrid super heuristic genetic algorithm for solving a class of fuzzy flexible job shop scheduling problems of work pieces processing time represented by using triangular fuzzy numbers, to minimize the optimization goal and reduce the fuzzy completion time. At the same time, under the conditions of product customization trend, diversified development of process routes, provide enterprises with a small-scale customized production that can be realized in time and a solution to improve the flexible operation of production systems .This paper first considers the practical problems in the production process of fuzzy flexible job shop and establishes a multi-objective optimization model. Then carried out a lot of research and analysis on traditional genetic algorithm, finding that the standard genetic algorithm is easy to fall into the problems of local optimum, low search efficiency and infeasible solution when solving the problem of shop scheduling. Came up with the hybrid heuristic algorithm for this problem, the algorithm incorporates methods such as hybrid heuristics, making the generated initial population as much as possible in the solution space of the whole problem, and to ensure the diversity of solution. Finally, through a series of improvements to the traditional genetic algorithm, improve the way of coding and genetic operators based on the super heuristic genetic algorithm, combine elite retention strategies and niche technologies to further optimize the convergence and diversity of algorithms. Calculates the fitness of the chromosome by weight coefficient change method. Therefore, the results of experimental analysis show that the proposed algorithm can verify the effectiveness of the proposed sorting criterion and super heuristic genetic algorithm, and can play a good role in the actual production process, it can also fully reflect the target requirements of fuzzy flexible job shop scheduling in production.","PeriodicalId":43265,"journal":{"name":"International Journal of Mobile Computing and Multimedia Communications","volume":"16 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mobile Computing and Multimedia Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.38007/ijmc.2022.030404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

: The purpose of this paper is to propose a hybrid super heuristic genetic algorithm for solving a class of fuzzy flexible job shop scheduling problems of work pieces processing time represented by using triangular fuzzy numbers, to minimize the optimization goal and reduce the fuzzy completion time. At the same time, under the conditions of product customization trend, diversified development of process routes, provide enterprises with a small-scale customized production that can be realized in time and a solution to improve the flexible operation of production systems .This paper first considers the practical problems in the production process of fuzzy flexible job shop and establishes a multi-objective optimization model. Then carried out a lot of research and analysis on traditional genetic algorithm, finding that the standard genetic algorithm is easy to fall into the problems of local optimum, low search efficiency and infeasible solution when solving the problem of shop scheduling. Came up with the hybrid heuristic algorithm for this problem, the algorithm incorporates methods such as hybrid heuristics, making the generated initial population as much as possible in the solution space of the whole problem, and to ensure the diversity of solution. Finally, through a series of improvements to the traditional genetic algorithm, improve the way of coding and genetic operators based on the super heuristic genetic algorithm, combine elite retention strategies and niche technologies to further optimize the convergence and diversity of algorithms. Calculates the fitness of the chromosome by weight coefficient change method. Therefore, the results of experimental analysis show that the proposed algorithm can verify the effectiveness of the proposed sorting criterion and super heuristic genetic algorithm, and can play a good role in the actual production process, it can also fully reflect the target requirements of fuzzy flexible job shop scheduling in production.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
模糊柔性作业车间调度的超启发式遗传算法
本文的目的是提出一种混合超启发式遗传算法来解决一类用三角模糊数表示的工件加工时间的模糊柔性作业车间调度问题,以最小化优化目标和减少模糊完成时间。同时,在产品定制化趋势下,工艺路线多元化发展,为企业提供可及时实现的小规模定制生产和提高生产系统柔性运行的解决方案。本文首先考虑模糊柔性作业车间生产过程中存在的实际问题,建立了多目标优化模型。然后对传统遗传算法进行了大量的研究和分析,发现标准遗传算法在求解车间调度问题时容易陷入局部最优、搜索效率低、解不可行等问题。针对该问题提出了混合启发式算法,该算法结合混合启发式等方法,使生成的初始种群尽可能多地分布在整个问题的解空间中,并保证了解的多样性。最后,通过对传统遗传算法的一系列改进,在超启发式遗传算法的基础上改进编码方式和遗传算子,结合精英保留策略和小众技术,进一步优化算法的收敛性和多样性。利用权系数变化法计算染色体的适合度。因此,实验分析结果表明,所提算法能够验证所提排序准则和超启发式遗传算法的有效性,并能在实际生产过程中发挥良好的作用,也能充分体现生产中模糊柔性作业车间调度的目标要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.40
自引率
16.70%
发文量
23
期刊最新文献
Biometric Authentication Methods on Mobile Platforms Reverse Chronology: The Nature of News Stories——Based on the Investigation of the Typical Reports of the Model of the Times Design of Accounting Information System Based on Computer Network Challenges and Solutions for Network Security in Data Centers Driven by Information Technology Using Eye Tracking to Measure Overall Usability of Online Grocery Shopping Websites
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1