首页> 外文会议>Third International Workshop on Advanced Computational Intelligence >Stacker-reclaimer scheduling for raw material yard operation
【24h】

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.
机译:干散货码头的原料堆场是入库和出库原料的临时缓冲区。在大多数情况下,放电和装料过程均由原料场支持。堆取料机是堆场中用于原材料处理的专用设备。堆场的效率在很大程度上取决于堆取料机的生产率。本文讨论了堆取料机调度问题。给定一个堆场中的一组处理操作,目的是在每个堆取料机上找到最佳的操作顺序,以使工期最小化。建立了混合整数规划模型。由于考虑的问题本质上是NP难题,因此开发了孤雌遗传算法来获得接近最优的解决方案。进行计算实验以检验所提出的模型和求解算法。计算结果表明,所提出的孤雌遗传算法是有效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号