• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Ant colony optimisation with random selection for block transportation scheduling with heterogeneous transporters in a shipyard
【24h】

Ant colony optimisation with random selection for block transportation scheduling with heterogeneous transporters in a shipyard

机译：随机选择的蚁群优化算法用于造船厂异构运输商的区块运输调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper considers a scheduling problem of heterogeneous transporters for pickup and delivery blocks in a shipyard assuming a static environment where all transportation requirements for blocks are predetermined. In the block transportation scheduling problem, the important issue is to determine which transporter delivers the block from one plant to the other plant and when, in order to minimise total logistic times. Therefore, the objective of the problem is to simultaneously determine the allocation policy of blocks and the sequence policy of transporters to minimise the weighted sum of empty transporter travel times, delay times, and tardy times. A mathematical model for the optimal solution is derived and an ant colony optimisation algorithm with random selection (ACO_RS) is proposed. To demonstrate the performance of ACO_RS, computational experiments are implemented in comparing the solution with the optimal solutions obtained by CPLEX in small-sized problems and the solutions obtained by conventional ACO in large-sized problems.
机译：本文考虑了在固定环境下所有运输块需求均已预先确定的情况下，船厂中的提取和交付块的异构运输机的调度问题。在块运输调度问题中，重要的问题是确定哪个运输者将块从一个工厂运送到另一工厂以及何时将其运输，以最大程度地减少物流时间。因此，问题的目的是同时确定块的分配策略和运输者的顺序策略，以最小化空运输者行进时间，延迟时间和停顿时间的加权总和。推导了最优解的数学模型，提出了一种带有随机选择的蚁群优化算法（ACO_RS）。为了演示ACO_RS的性能，在将解决方案与CPLEX在小规模问题中获得的最佳解决方案与常规ACO在大规模问题中获得的解决方案进行比较时，进行了计算实验。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号