首页> 外文OA文献 >Integrated Rolling Stock Planning for Suburban Passenger Railways
【2h】

Integrated Rolling Stock Planning for Suburban Passenger Railways

机译:城郊铁路客运专线综合车辆规划

摘要

One of the core issues for operators of passenger railways is providing sufficient number of seats for passengers while keeping operating costs at a minimum. The process a railway operator undertakes in order to achieve this is called rolling stock planning. Rolling stock planning deals with deciding how to utilise the fleet of available train units in space and time. In this thesis, rolling stock planning has been studied, using as case study DSB S-tog, the suburban passenger railway operator of the City of Copenhagen. At DSB S-tog, the rolling stock planning process is subdivided according to time horizon into two subprocesses. Firstly, there is the long-term circulation planning process, in which planning is conducted for anonymous, virtual train units months in advance. Secondly, there is the short-term train unit dispatching process, which covers the execution of the long term circulation plan. In the train unit dispatching process, the anonymous, virtual train units from the circulation planning process will have real, physical train units assigned to them. The train unit dispatching process has a short-term time horizon of days, hours and minutes and makes sure the actual, real-world train services are performed. Disruptions are also handled in this process. In the long term circulation planning phase of rolling stock planning, a large number of railway-specific requirements must be taken into account: The physical railway infrastructure must be adhered to, e.g., platform and depot track capacities, the rules of the train control system and the order in which train units may be parked so as not to obstruct each other’s movements; All trains services of the timetable must have a least one train unit assigned; Only the available rolling stock can be used in the plan; The plan should provide seating capacity according to the passenger demand and provide an even distribution of flexible space for bicycles etc.; Planned shunting operations in the depot should have sucient personnel on duty; Train units must undergo interior and exterior cleaning, surface foil application and winter preparedness treatment at regular time intervals; At regular service distance intervals, train units must undergo scheduled maintenance etc., and consumables must be refilled; Certain train services must have train units with additional train control system equipment installed, special passenger counting equipment installed and/or perform predefined exposure of commercials.In the short-term train unit dispatching phase of rolling stock planning, additional railwayspecific requirements include: Exterior graffiti removal and unscheduled maintenance on demand and sometimes within a given time frame; Make available train units to meet surveillance video recording requests from the police within a given time frame. Due to the large number of railway-specific requirements and their nature, rolling stock planning is traditionally conducted in a step-by-step manner, in which the individual planning processes are not integrated with each other. Needless to say, this yields rolling stock plans that are either suboptimal or infeasible with regard to the requirements. In this thesis it is shown that it is possible to design and implement a rolling stock planning model integrating into one planning process all the railway-specific requirements of DSB S-tog, all at the same time. This integrated rolling stock planning model is implemented using a greedy heuristic and makes use of the novel (train) unit order conservation principle, implemented as special side constraints to a resource constrained shortest path algorithm. The integrated rolling stock planning model is tested extensively on 15 real-world, manually constructed rolling stock plan data instances. When run on these instances, the greedy heuristic can achieve an average economic gain of approx. 2% with processing times in all cases less than 1 hour 20 minutes. In addition to this, the greedy heuristic can make typically infeasible rolling stock plans feasible within just a few minutes of processing time. Moreover, in this thesis a number of different economic net value upper bound calculation models are designed, implemented and tested. The net value upper bound calculation models implement the railway-specific requirements to a varying degree and consequently expose different properties with regard to tightness of bounds and processing times. The net value upper bound model having the highest degree of requirements integration adheres to 47% of the requirements by count. Using this tightest net value upper bound calculation model, it is shown that the greedy heuristic mentioned before is able to gain approx. 1/3 of the relative gap between the net value of the original, manual plans and the net value upper bound. Moreover, it is shown that in most cases, the net value of the original, manual plans already lie close to the upper bound.Furthermore, a branch-and-price based matheuristic integrated rolling stock planning model is designed, implemented and tested. It is shown that this type of matheuristic model is able to adhere fully to all railway-specific requirements, and that the vast majority of requirements can be integrated into the optimisation steps of the atheuristic algorithm. The branch-andprice matheuristic model can solve small instances (e. g., in the form of matheuristic iterations) to optimality. Used in conjunction with the greedy heuristic, the two methods combined can achieve an additional small gain in objective value not achievable using each method by itself. With a yearly cost of the rolling stock operation in the hundreds of million DKK, the potential benefit of a real-world application of the models to DSB S-tog is in the order of several million DKK per year. In addition to this, a substantial benefit can be gained by the way the models can automate the current, manual planning procedures. This will enable planners to invest more creativity and meticulousness into the planning process as a result of being liberated from manual planning procedures. For these reasons, DSB S-tog is eager to proceed with the real-world application of the models developed in this thesis.
机译:客运铁路运营商的核心问题之一是为乘客提供足够数量的座位,同时将运营成本保持在最低水平。铁路运营商为了实现这一目标而进行的过程称为机车车辆计划。机车车辆计划负责确定如何在时空上利用可用列车单元的数量。本文以哥本哈根市郊区客运铁路运营商DSB S-tog为例,对机车车辆计划进行了研究。在DSB S-tog中,机车车辆计划过程根据时间范围细分为两个子过程。首先,有一个长期的循环计划过程,其中要提前几个月对匿名的虚拟火车单位进行计划。其次,有一个短期列车单元调度过程,其中包括长期循环计划的执行。在火车单元调度过程中,来自循环计划过程的匿名虚拟火车单元将分配有实际的物理火车单元。火车单位的调度过程具有几天,几小时和几分钟的短期时间范围,并确保执行实际的,实际的火车服务。在此过程中也会处理中断。在机车车辆计划的长期循环计划阶段,必须考虑大量铁路特定要求:必须遵守铁路的物理基础设施,例如站台和仓库的轨道容量,列车控制系统的规则停放火车单位的顺序,以免妨碍彼此的活动;时间表中的所有火车服务必须至少分配一个火车单元;该计划中只能使用可用的机车车辆;规划应根据乘客的需求提供座位,并为自行车等提供灵活的空间均匀分配;计划在仓库进行的调车作业应有足够的人员值班;火车单位必须定期进行内部和外部清洁,表面箔的应用和冬季准备工作;在定期的服务距离间隔内,必须对火车单元进行定期维护等,并且必须补充消耗品。某些列车服务必须安装有额外的列车控制系统设备,特殊的乘客计数设备和/或对商业广告进行预定义的列车单元。在机车车辆计划的短期列车单元调度阶段,其他铁路特定要求包括:外部涂鸦根据需要有时在给定的时间范围内进行拆除和计划外维护;在指定的时间范围内提供可用的训练单元,以满足警察对监视录像的要求。由于铁路专用要求的数量众多且其性质,传统上以逐步的方式进行机车车辆计划,其中各个计划过程彼此不集成。不用说,这会导致机车车辆计划在需求方面不理想或不可行。本文表明,可以同时设计和实现将DSB S-tog的所有铁路特定要求集成到一个计划流程中的机车车辆计划模型。这种集成的机车车辆计划模型是使用贪婪的启发式方法实现的,并利用了新颖的(火车)单位顺序守恒原理,该原理作为对资源受限的最短路径算法的特殊侧约束而实现。集成的机车车辆计划模型已在15个实际的手动构建的机车车辆计划数据实例上进行了广泛的测试。当在这些情况下运行时,贪婪的启发式方法可以实现平均经济收益约。在所有情况下,处理时间均少于1小时20分钟为2%。除此之外,贪婪的试探法还可以使通常不可行的机车车辆计划在几分钟的处理时间内就变得可行。此外,本文设计,实现和测试了许多不同的经济净值上限计算模型。净值上限计算模型在不同程度上实现了铁路特定要求,因此在界限紧密度和处理时间方面暴露出不同的属性。需求集成度最高的净值上限模型按数量计满足47%的需求。使用这个最紧密的净值上限计算模型,可以证明前面提到的贪婪启发式算法能够获得大约。原始计划,手动计划的净值和净值上限之间的相对差距的1/3。此外,它表明在大多数情况下,原始手动计划的净值已经接近上限。,设计,实施和测试了基于分支价格的数学综合机车车辆计划模型。结果表明,这种数学模型能够完全满足所有铁路特定需求,并且绝大多数需求都可以集成到无神论算法的优化步骤中。分支和价格数学模型可以将小的实例(例如,以数学迭代的形式)求解为最优。与贪婪的启发式方法一起使用时,两种方法的结合可以实现目标值额外的小幅增长,​​而这两种方法本身无法实现。由于机车车辆运营的年度成本为数亿丹麦克朗,因此将模型实际应用到DSB S-tog的潜在利益约为每年数百万丹麦克朗。除此之外,通过模型可以自动执行当前的手动计划程序的方式,可以获得很大的好处。由于摆脱了手动计划程序,因此计划人员可以在计划过程中投入更多的创造力和细致性。由于这些原因,DSB S-tog迫切希望将本文开发的模型应用于现实世界。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号