• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on automation science and engineering >An MILP Optimization Problem for Sizing Port Rail Networks and Planning Shunting Operations in Container Terminals
【24h】

An MILP Optimization Problem for Sizing Port Rail Networks and Planning Shunting Operations in Container Terminals

机译：港口铁路网的规模和集装箱码头规划调车作业的MILP优化问题

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

摘要

This paper proposes an optimization approach for sizing port rail networks and planning railway shunting operations by adopting a discrete-time model of the overall system. First, a mixed-integer linear mathematical programming problem is defined in order to optimize shunting operations to be performed on the considered network by satisfying certain arrivals and departures of import and export flows. Moreover, the proposed procedure can be used to evaluate the capacity of a port rail network, in terms of maximum number of trains that can be managed over a certain time horizon, and to carry out what-if analyses aimed at testing different scenarios. The effectiveness of the proposed approach is shown by applying the optimization problem to a real case study referred to the port rail network of La Spezia Container Terminal located in Northern Italy. A computational analysis realized by varying the dimension and complexity of the problem instances is also reported in this paper to discuss the computational performance of the proposed model.
机译：本文提出了一种优化方法，通过采用整个系统的离散时间模型来确定港口铁路网络的规模并规划铁路调车作业。首先，定义了一个混合整数线性数学程序设计问题，以便通过满足进出口流量的某些到达和离开，来优化要在所考虑的网络上执行的分流操作。此外，提出的程序可以用来评估港口铁路网络的容量，可以在一定的时间范围内管理火车的最大数量，并且可以进行假设分析以测试不同的情况。通过将优化问题应用于位于意大利北部的拉斯佩齐亚集装箱码头的港口铁路网络的实际案例研究，表明了所提出方法的有效性。本文还报告了通过改变问题实例的维度和复杂度而实现的计算分析，以讨论所提出模型的计算性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号