一种具有工作中心的新型FJSP的两阶段遗传算法

David Govi, Alessandro Rizzuto, F. Schipani, Alessandro Lazzeri
{"title":"一种具有工作中心的新型FJSP的两阶段遗传算法","authors":"David Govi, Alessandro Rizzuto, F. Schipani, Alessandro Lazzeri","doi":"10.5220/0010654900003062","DOIUrl":null,"url":null,"abstract":": Inspired by industrial issues and demands, we define a novel version of the Flexible Job Shop Scheduling Problem with Working Center. A working center is a group of machines performing the same type of operation. The job operations of different types follow a strict sequence across the working centers, while any order is allowed among operations of the same type. This paper illustrates a genetic algorithm with a two-stage chromosome representation, adapted genetic operators, local search, and social disaster technique to deal with a real-world industrial application. The algorithm has been tested on a classical benchmark to assess its adaptability and compare its performance with state-of-the-art techniques; then, we tested different variations of the proposed algorithm on a real-case test instance showing a consistent improvement when compared with the heuristic in use at the industrial company.","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Two-stage Genetic Algorithm for a Novel FJSP with Working Centers in a Real-world Industrial Application\",\"authors\":\"David Govi, Alessandro Rizzuto, F. Schipani, Alessandro Lazzeri\",\"doi\":\"10.5220/0010654900003062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": Inspired by industrial issues and demands, we define a novel version of the Flexible Job Shop Scheduling Problem with Working Center. A working center is a group of machines performing the same type of operation. The job operations of different types follow a strict sequence across the working centers, while any order is allowed among operations of the same type. This paper illustrates a genetic algorithm with a two-stage chromosome representation, adapted genetic operators, local search, and social disaster technique to deal with a real-world industrial application. The algorithm has been tested on a classical benchmark to assess its adaptability and compare its performance with state-of-the-art techniques; then, we tested different variations of the proposed algorithm on a real-case test instance showing a consistent improvement when compared with the heuristic in use at the industrial company.\",\"PeriodicalId\":380008,\"journal\":{\"name\":\"International Conference on Innovative Intelligent Industrial Production and Logistics\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Innovative Intelligent Industrial Production and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0010654900003062\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Innovative Intelligent Industrial Production and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0010654900003062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

:受工业问题和需求的启发,我们定义了一个具有工作中心的柔性作业车间调度问题的新版本。一个工作中心是一组执行同一种操作的机器。不同类型的作业作业在各作业中心之间遵循严格的顺序,而同一类型的作业之间则允许任何顺序。本文阐述了一种具有两阶段染色体表示、自适应遗传算子、局部搜索和社会灾难技术的遗传算法来处理现实世界的工业应用。该算法在经典基准上进行了测试,以评估其适应性,并将其性能与最先进的技术进行比较;然后,我们在实际测试实例上测试了所提出算法的不同变体,与工业公司使用的启发式算法相比,显示出一致的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Two-stage Genetic Algorithm for a Novel FJSP with Working Centers in a Real-world Industrial Application
: Inspired by industrial issues and demands, we define a novel version of the Flexible Job Shop Scheduling Problem with Working Center. A working center is a group of machines performing the same type of operation. The job operations of different types follow a strict sequence across the working centers, while any order is allowed among operations of the same type. This paper illustrates a genetic algorithm with a two-stage chromosome representation, adapted genetic operators, local search, and social disaster technique to deal with a real-world industrial application. The algorithm has been tested on a classical benchmark to assess its adaptability and compare its performance with state-of-the-art techniques; then, we tested different variations of the proposed algorithm on a real-case test instance showing a consistent improvement when compared with the heuristic in use at the industrial company.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信