首页> 外文学位 >Optimizing container retrieval operation at a port container terminal.
【24h】

Optimizing container retrieval operation at a port container terminal.

机译:优化港口集装箱码头的集装箱检索操作。

获取原文
获取原文并翻译 | 示例

摘要

In the presence of major challenges, where ports are striving to improve their operation and stay competitive in the global market, the issue of port efficiency, particularly the intelligent management of straddle carriers is investigated in this study. A new approach is presented that optimizes container handling equipment operation and is beneficial for the terminal operator in terms of improving productivity, providing faster service and reducing operating cost. Also, the solution provides acceptable service for truckers. The operational strategies presented are able to assess the operation from the truckers' and terminal operators' perspective.;The research is structured into four different scenarios that use an assignment logic and scheduling methodology to describe the continuous time dependable assignment process of straddle carriers to trucks. In doing so it provides the solution to the question that this dissertation poses. The assignment models used in an attempt to answer the research question are stated as follows: (1) A model is developed to assign straddle carriers to trucks based on the First Come First Served (FCFS) Rule. This is the baseline model and other algorithms will try to improve upon this solution. (2) Two different applications of the Hungarian Algorithm are used for the straddle carrier to truck assignment problem. The first implementation of the Hungarian Algorithm does not consider truck waiting time. The second model implements the truck priority rule into the assignment procedure. (3) Finally, a heuristic implementation of the implicit enumeration procedure develops the sequence of jobs assigned to straddle carriers that will minimize the total distance travelled by them.;The concept of a planning period is introduced for models where the Hungarian Algorithm and the Heuristic with Integer Enumeration are used. The planning period is defined as a time interval within which one can find the optimal solution to the straddle assignment problem. The assumption that by introducing a planning period and thus taking advantage of known truck-container pairs provides better allocation of straddle carriers to trucks is investigated and the answers to questions that this dissertation addresses are presented.;An analysis is presented that utilizes the knowledge of the truck arrival rate to determine the optimal straddle carrier fleet size and the duration of the planning period. The results can be used by port terminal management to develop an optimal straddle carrier deployment strategy and planning period that will minimize the total cost of operation.;The framework is designed to answer questions of interest to port terminal management, and to investigate the trade-off between the cost of operation and the service provided to trucks. The analysis presents guidelines for pricing strategy if an appointment system is implemented.
机译:在面临重大挑战的情况下,港口正在努力改善其运营并在全球市场中保持竞争力,因此本研究研究了港口效率问题,尤其是跨式运​​输船的智能管理。提出了一种新方法,该方法优化了集装箱装卸设备的操作,并且在提高生产率,提供更快的服务和降低运营成本方面对终端操作员有利。而且,该解决方案为卡车司机提供了可接受的服务。提出的操作策略能够从卡车司机和终端操作员的角度评估操作。;研究分为四个不同的场景,这些场景使用分配逻辑和调度方法来描述跨时承运人对卡车的连续时间依赖的分配过程。这样做可以为本文提出的问题提供解决方案。为回答研究问题而使用的分配模型说明如下:(1)根据先来先服务(FCFS)规则开发了一种模型,以将跨式车架分配给卡车。这是基准模型,其他算法将尝试对此解决方案进行改进。 (2)匈牙利算法的两种不同应用被用于跨载人到卡车的分配问题。匈牙利算法的第一个实现不考虑卡车的等待时间。第二个模型将卡车优先级规则实施到分配过程中。 (3)最后,隐式枚举过程的启发式实现开发了分配给跨运载体的作业序列,这将使跨运载体的总行驶距离最小化;;针对匈牙利算法和启发式算法的模型引入了计划期的概念与Integer Enumeration一起使用。规划期定义为一个时间间隔,在此间隔内可以找到跨界分配问题的最佳解决方案。通过引入一个计划周期并利用已知的卡车集装箱对提供更好的跨车运输给卡车的分配的假设进行了研究,并给出了本文解决的问题的答案。卡车到达率,以确定最佳跨骑车队规模和计划时间。该结果可被港口码头管理人员用来制定最佳跨式承运人部署策略和规划周期,以最大程度地降低总运营成本。该框架旨在回答港口码头管理人员感兴趣的问题,并调查贸易在运营成本和向卡车提供的服务之间进行权衡。该分析为实施约会系统的定价策略提供了指导。

著录项

  • 作者

    Besenski, Dejan.;

  • 作者单位

    New Jersey Institute of Technology.;

  • 授予单位 New Jersey Institute of Technology.;
  • 学科 Engineering Civil.
  • 学位 Ph.D.
  • 年度 2009
  • 页码 128 p.
  • 总页数 128
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号