基于pso的先进电厂多提升机统一调度方法

D. Ramin, E. Leo, L. Nicolosi, S. Spinelli, A. Brusaferri
{"title":"基于pso的先进电厂多提升机统一调度方法","authors":"D. Ramin, E. Leo, L. Nicolosi, S. Spinelli, A. Brusaferri","doi":"10.1109/CoDIT49905.2020.9263919","DOIUrl":null,"url":null,"abstract":"In this work, we propose a method based on the unified particle swarm optimization (UPSO) for no-wait multi-hoist scheduling, including a collision avoidance heuristic. Conflicts due to track sharing between hoists and no-wait constraints represent major issues to be addressed. Consequently, a complex optimization problem has to be solved dynamically, to identify the best operating strategy to be executed depending on the characteristics of the current job list. A decomposition procedure has been developed to speed up the solution of the large-scale optimization problem at hand. The proposed approach is demonstrated on a real galvanic process layout, showing the improved performances achieved by the proposed heuristic compared to the monolithic approach.","PeriodicalId":355781,"journal":{"name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Unified PSO-based method for multi-hoist scheduling in advanced Galvanic plants\",\"authors\":\"D. Ramin, E. Leo, L. Nicolosi, S. Spinelli, A. Brusaferri\",\"doi\":\"10.1109/CoDIT49905.2020.9263919\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we propose a method based on the unified particle swarm optimization (UPSO) for no-wait multi-hoist scheduling, including a collision avoidance heuristic. Conflicts due to track sharing between hoists and no-wait constraints represent major issues to be addressed. Consequently, a complex optimization problem has to be solved dynamically, to identify the best operating strategy to be executed depending on the characteristics of the current job list. A decomposition procedure has been developed to speed up the solution of the large-scale optimization problem at hand. The proposed approach is demonstrated on a real galvanic process layout, showing the improved performances achieved by the proposed heuristic compared to the monolithic approach.\",\"PeriodicalId\":355781,\"journal\":{\"name\":\"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CoDIT49905.2020.9263919\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoDIT49905.2020.9263919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种基于统一粒子群优化(UPSO)的多提升机无等待调度方法,并引入了避碰启发式算法。由于起重机之间的轨道共享和无等待约束导致的冲突是需要解决的主要问题。因此,必须动态地解决复杂的优化问题,以根据当前作业列表的特征确定要执行的最佳操作策略。为了加速求解手头的大规模优化问题,开发了一种分解程序。该方法在实际的电偶工艺布局中得到了验证,与单片方法相比,该方法的性能得到了改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Unified PSO-based method for multi-hoist scheduling in advanced Galvanic plants
In this work, we propose a method based on the unified particle swarm optimization (UPSO) for no-wait multi-hoist scheduling, including a collision avoidance heuristic. Conflicts due to track sharing between hoists and no-wait constraints represent major issues to be addressed. Consequently, a complex optimization problem has to be solved dynamically, to identify the best operating strategy to be executed depending on the characteristics of the current job list. A decomposition procedure has been developed to speed up the solution of the large-scale optimization problem at hand. The proposed approach is demonstrated on a real galvanic process layout, showing the improved performances achieved by the proposed heuristic compared to the monolithic approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信