柔性车间工件调度和 AGV 运行的协同算法

Wenlong Cheng, Wenjun Meng
{"title":"柔性车间工件调度和 AGV 运行的协同算法","authors":"Wenlong Cheng, Wenjun Meng","doi":"10.1108/ria-11-2022-0266","DOIUrl":null,"url":null,"abstract":"\nPurpose\nThis study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.\n\n\nDesign/methodology/approach\nIn this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.\n\n\nFindings\nThe experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.\n\n\nOriginality/value\nIn this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.\n","PeriodicalId":501194,"journal":{"name":"Robotic Intelligence and Automation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collaborative algorithm of workpiece scheduling and AGV operation in flexible workshop\",\"authors\":\"Wenlong Cheng, Wenjun Meng\",\"doi\":\"10.1108/ria-11-2022-0266\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\nPurpose\\nThis study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.\\n\\n\\nDesign/methodology/approach\\nIn this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.\\n\\n\\nFindings\\nThe experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.\\n\\n\\nOriginality/value\\nIn this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.\\n\",\"PeriodicalId\":501194,\"journal\":{\"name\":\"Robotic Intelligence and Automation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotic Intelligence and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ria-11-2022-0266\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotic Intelligence and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ria-11-2022-0266","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

目的 本研究旨在解决智能制造车间中的作业调度和多自动导引车(AGV)协同问题。设计/方法/途径 在本研究中,设计了一种作业调度和多 AGV 协同工作的算法。第一部分,以最小化总加工时间和总功耗为目标,使用利基多目标进化算法确定不同机器上的加工任务安排。第二部分,调用 AGV 运输工件,并使用改进的蚁群算法生成 AGV 的初始路径。在第三部分中,为了避免运行中的 AGV 之间发生路径冲突,作者提出了一种简单的基于优先级的等待策略,以避免碰撞。研究结果实验表明,该方案能有效处理车间中的作业调度和多 AGV 运行问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Collaborative algorithm of workpiece scheduling and AGV operation in flexible workshop
Purpose This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops. Design/methodology/approach In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions. Findings The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop. Originality/value In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信