...
首页> 外文期刊>Applied Mathematical Modelling >A decision making procedure for robust train rescheduling based on mixed integer linear programming and Data Envelopment Analysis
【24h】

A decision making procedure for robust train rescheduling based on mixed integer linear programming and Data Envelopment Analysis

机译:基于混合整数线性规划和数据包络分析的鲁棒列车重调度决策程序

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

摘要

This paper presents a self-learning decision making procedure for robust real-time train rescheduling in case of disturbances. The procedure is applicable to aperiodic timetables of mixed-tracked networks and it consists of three steps. The first two are executed in real-time and provide the rescheduled timetable, while the third one is executed offline and guarantees the self-learning part of the method. In particular, in the first step, a robust timetable is determined, which is valid for a finite time horizon. This robust timetable is obtained solving a mixed integer linear programming problem aimed at finding the optimal compromise between two objectives: the minimization of the delays of the trains and the maximization of the robustness of the timetable. In the second step, a merging procedure is first used to join the obtained timetable with the nominal one. Then, a heuristics is applied to identify and solve all conflicts eventually arising after the merging procedure. Finally, in the third step an offline cross-efficiency fuzzy Data Envelopment Analysis technique is applied to evaluate the efficiency of the rescheduled timetable in terms of delays minimization and robustness maximization when different relevance weights (defining the compromise between the two optimization objectives) are used in the first step. The procedure is thus able to determine appropriate relevance weights to employ when disturbances of the same type affect again the network. The railway service provider can take advantage of this procedure to automate, optimize, and expedite the rescheduling process. Moreover, thanks to the self-learning capability of the procedure, the quality of the rescheduling is improved at each reapplication of the method. The technique is applied to a real data set related to a regional railway network in Southern Italy to test its effectiveness.
机译:本文提出了一种在干扰情况下用于鲁棒实时列车重新调度的自学习决策过程。该程序适用于混合跟踪网络的非定期时间表,它包括三个步骤。前两个实时执行并提供重新安排的时间表,而第三个离线执行并保证该方法的自学部分。特别地,在第一步中,确定稳健的时间表,该时间表对于有限的时间范围是有效的。该鲁棒的时间表是通过解决混合整数线性规划问题而获得的,目的是找到两个目标之间的最佳折衷:列车延误的最小化和时间表的鲁棒性的最大化。在第二步中,首先使用合并过程将获得的时间表与名义时间表合并。然后,采用启发式方法来识别和解决合并过程之后最终出现的所有冲突。最后,在第三步中,当使用不同的相关权重(定义两个优化目标之间的折衷)时,采用离线交叉效率模糊数据包络分析技术,根据延迟最小化和鲁棒性最大化来评估重新安排的时间表的效率。在第一步中。因此,该过程能够确定在相同类型的干扰再次影响网络时要采用的适当的相关权重。铁路服务提供商可以利用此过程来自动化,优化和加快重新安排过程。此外,由于该过程的自学习能力,在每次重新使用该方法时,重新计划的质量都得到了提高。将该技术应用于与意大利南部地区铁路网络有关的真实数据集,以测试其有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号