原料堆场作业的堆取料机调度

Dayong Hu, Z. Yao
{"title":"原料堆场作业的堆取料机调度","authors":"Dayong Hu, Z. Yao","doi":"10.1109/IWACI.2010.5585235","DOIUrl":null,"url":null,"abstract":"Raw material yards at dry bulk terminals act as temporary buffers for inbound and outbound raw materials. Both discharging and charging processes are supported by raw material yards in most cases. Stacker-reclaimers are dedicated equipments in yards for raw material handling. The efficiency of yard operation depends to a great extent on the productivity of stacker-reclaimers. Stacker-reclaimer scheduling problem is discussed in this paper. Given a set of handling operations in a yard, the objective is to find an optimal operation sequence on each stacker-reclaimer so as to minimize the makespan. A mixed integer programming model is formulated. Since the considered problem is NP-hard in nature, a parthenogenetic algorithm is developed to obtain near optimal solutions. Computational experiments are conducted to examine the presented model and the solution algorithm. The computational results show that the proposed parthenogenetic algorithm is effective.","PeriodicalId":196572,"journal":{"name":"International Workshop on Advanced Computational Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Stacker-reclaimer scheduling for raw material yard operation\",\"authors\":\"Dayong Hu, Z. Yao\",\"doi\":\"10.1109/IWACI.2010.5585235\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Raw material yards at dry bulk terminals act as temporary buffers for inbound and outbound raw materials. Both discharging and charging processes are supported by raw material yards in most cases. Stacker-reclaimers are dedicated equipments in yards for raw material handling. The efficiency of yard operation depends to a great extent on the productivity of stacker-reclaimers. Stacker-reclaimer scheduling problem is discussed in this paper. Given a set of handling operations in a yard, the objective is to find an optimal operation sequence on each stacker-reclaimer so as to minimize the makespan. A mixed integer programming model is formulated. Since the considered problem is NP-hard in nature, a parthenogenetic algorithm is developed to obtain near optimal solutions. Computational experiments are conducted to examine the presented model and the solution algorithm. The computational results show that the proposed parthenogenetic algorithm is effective.\",\"PeriodicalId\":196572,\"journal\":{\"name\":\"International Workshop on Advanced Computational Intelligence\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Advanced Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWACI.2010.5585235\",\"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 Workshop on Advanced Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWACI.2010.5585235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

干散货码头的原料堆场充当进出原料的临时缓冲区。在大多数情况下,卸料和装料过程都由原料堆场支持。堆取料机是堆场中处理原料的专用设备。堆场作业的效率在很大程度上取决于堆取料机的生产效率。本文讨论了堆取料机的调度问题。给定堆场中的一组搬运作业,目标是在每个堆取料机上找到一个最优的操作顺序,以使最大完工时间最小化。建立了一个混合整数规划模型。由于所考虑的问题本质上是np困难的,因此提出了一种孤雌生殖算法来获得近似最优解。计算实验验证了所提出的模型和求解算法。计算结果表明,所提出的孤雌生殖算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stacker-reclaimer scheduling for raw material yard operation
Raw material yards at dry bulk terminals act as temporary buffers for inbound and outbound raw materials. Both discharging and charging processes are supported by raw material yards in most cases. Stacker-reclaimers are dedicated equipments in yards for raw material handling. The efficiency of yard operation depends to a great extent on the productivity of stacker-reclaimers. Stacker-reclaimer scheduling problem is discussed in this paper. Given a set of handling operations in a yard, the objective is to find an optimal operation sequence on each stacker-reclaimer so as to minimize the makespan. A mixed integer programming model is formulated. Since the considered problem is NP-hard in nature, a parthenogenetic algorithm is developed to obtain near optimal solutions. Computational experiments are conducted to examine the presented model and the solution algorithm. The computational results show that the proposed parthenogenetic algorithm is effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信