首页> 外文学位 >Algorithms for solving the train dispatching problem for general networks.
【24h】

Algorithms for solving the train dispatching problem for general networks.

机译:解决通用网络火车调度问题的算法。

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

摘要

Recently, the research community has focused on the problem of efficient movement of freight by rail since there has been a tremendous increase in worldwide container trade. For example, there is an estimation that the Ports of Los Angeles and Long Beach (San Pedro Bay Ports), which are one of the busiest ports in North America, will double their current cargo by year 2020. This raises the demand for freight trains and leads to congestion in rail operation.; Several train studies in the past focused on solving the train scheduling problem by simplifying and omitting many realistic characteristics such as trackage configurations or speed restrictions. However, we incorporate these characteristics into our models so we can obtain a solution that can be easily applied to actual railway operations more efficiently. These characteristics include multiple trackage configurations, multiple train types, multiple train lengths, multiple speed limit restrictions, and incorporation of acceleration and deceleration rates.; The purpose of this research is to optimize the train travel time for general rail networks. We formulate a nonlinear integer mathematical model with an objective function to minimize the travel time. Since the model is computationally intractable to solve optimally, we present a heuristic based on a genetic algorithm to solve the problem. We benchmark our algorithm against standard procedures for train scheduling. We study both the static and dynamic scheduling problems since each of those problems has their own unique characteristics.
机译:近来,由于全球集装箱贸易的巨大增长,研究界一直关注铁路货运的高效运输问题。例如,据估计,作为北美最繁忙的港口之一的洛杉矶港和长滩港(圣佩德罗湾港)到2020年将使目前的货运量增加一倍。这增加了对货运列车的需求并导致铁路运营拥挤。过去的几项火车研究着重于通过简化和省略许多实际特征(例如跟踪配置或速度限制)来解决火车调度问题。但是,我们将这些特征纳入模型中,因此我们可以轻松地将其轻松应用于实际的铁路运营。这些特征包括多种跟踪配置,多种列车类型,多种列车长度,多种限速限制以及加速和减速速率的结合。这项研究的目的是优化通用铁路网络的火车行驶时间。我们制定了具有目标函数的非线性整数数学模型,以最小化旅行时间。由于该模型在计算上难以解决,因此无法实现最优解,因此我们提出了一种基于遗传算法的启发式算法来解决该问题。我们根据标准的火车调度程序对算法进行基准测试。我们研究静态和动态调度问题,因为每个问题都有其独特的特征。

著录项

  • 作者

    Suteewong, Worawan.;

  • 作者单位

    University of Southern California.;

  • 授予单位 University of Southern California.;
  • 学科 Engineering Industrial.; Operations Research.
  • 学位 Ph.D.
  • 年度 2006
  • 页码 128 p.
  • 总页数 128
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 一般工业技术;运筹学;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号