首页> 外文会议>Integration of AI and OR techniques in constraint programming for combinatorial optimization problems >Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations A Comparative Analysis of Models, Solution Methods, and Their Integration
【24h】

Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations A Comparative Analysis of Models, Solution Methods, and Their Integration

机译:中断运营下的列车调度的约束规划和混合整数线性规划模型,求解方法及其集成的比较分析

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

摘要

The problem of rescheduling trains under disrupted operations has received more attention in the last years because of the increasing demand in railway transportation. Railway networks are more and more saturated and the probability that delayed trains affect others is large. Therefore, it is very important to react after incidents by recalculating new arrival/departure times and reassigning tracks/platforms with the aim of minimizing the effect of propagation of incidents.rnIt is possible to define the rescheduling railway problem as follows: given a set of trains, a railway network, an original schedule (i.e., arrival/departure times of every train as well as the complete assignment of tracks and platforms), and known delays of one or several trains; the problem is to create a new provisional schedule by minimizing the difference with the original plan respecting several operational and commercial constraints. We propose to use an objective function that penalizes delays, changes of tracks/platforms, and unplanned stops; all of them referred to the original (unperturbed) schedule.rnWe present two different approaches: MIP (Mixed Integer Linear Programming) and CP (Constraint Programming). The solutions of both are comparable because they use the same objective function. Nevertheless, the definition of decision variables and constraints differs significantly.rnOn the one hand, the MIP uses an extension of a formulation originally presented in [5]. The more interested reader will find a full description of the model in our previous work [3]. This model includes many practical rules and constraints, which explains its relative complexity compared to other models presented in the literature. It supports allocation of tracks and platforms, connection of trains, bidirectional multi-track lines, and extra time for accelerating and braking.
机译:近年来,由于铁路运输需求的增长,在中断运营的情况下对火车进行重新安排的问题受到了越来越多的关注。铁路网络越来越饱和,火车延误影响他人的可能性很大。因此,在事故发生后做出反应非常重要,通过重新计算新的到达/离开时间并重新分配轨道/平台,以最大程度地减少事故传播的影响.rn可以如下定义重新调度铁路问题:给定一组火车,铁路网络,原始时间表(即每列火车的到达/出发时间以及轨道和站台的完整分配)以及一列或多列火车的已知延误;问题是要在考虑到一些运营和商业约束的情况下,通过将与原始计划的差异最小化来创建新的临时计划。我们建议使用一个目标函数来惩罚延迟,轨道/平台的更改以及计划外的停靠点;它们都参考原始(不受干扰的)时间表。我们提出了两种不同的方法:MIP(混合整数线性规划)和CP(约束规划)。两者的解决方案具有可比性,因为它们使用相同的目标函数。尽管如此,决策变量和约束的定义还是有很大差异。一方面,MIP使用了最初在[5]中提出的公式的扩展。感兴趣的读者可以在我们以前的工作中找到该模型的完整描述[3]。该模型包括许多实际规则和约束,与文献中提供的其他模型相比,它可以解释其相对复杂性。它支持轨道和平台的分配,火车的连接,双向多轨道线路,以及用于加速和制动的额外时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号