• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Operations Research >Modeling and Solution for Yard Truck Dispatch Planning at Container Terminal
【24h】

Modeling and Solution for Yard Truck Dispatch Planning at Container Terminal

机译：集装箱码头院子卡车调度规划的建模与解决方案

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This research addresses the dispatch planning of yard trucks to support transferring tasks of containers between shipside and yard areas. With considering the fundamental operations of fixed number of trucks serving one quay crane, we discuss the possible serving status of yard trucks in the connection of task by task. Upon these limited connection patterns, we formulate a min-max nonlinear integer programming model for dispatching yard trucks to efficiently complete the system works. A heuristic approach with two phases of selecting locations for stored or picked containers then assigning served trucks is suggested. We apply it with four proposed principles of location assignment on the analysis of the real-world cases from a dedicated terminal. The results show that the closest position assignment principle is better in the larger scale problems. However, more trucks than the critical number can not increase the performance.
机译：这项研究解决了院子卡车的调度规划，以支持船锚区和院区之间传输集装箱的任务。考虑到一个码头起重机的固定数量的卡车的根本操作，我们讨论了任务的任务的院子卡车的可能服务状态。在这些有限的连接模式后，我们制定了用于调度码卡车的最小最大非线性整数编程模型，以有效地完成系统工作。提出了一种具有两个阶段的启发式方法，用于选择储存或拾取的容器的位置，然后分配服务的卡车。我们将其应用于四个拟议的位置分配原则，就专用终端分析了真实世界案例。结果表明，最接近的位置分配原理在更大的规模问题中更好。但是，比临界数字更多的卡车不能增加性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号