A comparison of two exact methods for passenger railway rolling stock (re)scheduling

Haahr, Jørgen Thorlund; Wagenaar, Joris; Veelenturf, Lucas P.; Kroon, Leo

doi:10.1016/j.tre.2016.03.019

Cited by 53 publications

(29 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The former is a kind of vehicle without traction engines, which can be coupled individually and independently to a convoy. The latter is a necessary part of trains which can provide traction power and pull the convoy [3,5]. Thus, most of previous research focused on the utilization planning of both locomotives and carriages.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Different from above traditional railway vehicles, the trainset is a kind of self-contained trains with an engine and passenger seats, which means self-propelled train units that are not required to be pulled by a locomotive. These units consist of a fixed number of carriages and have their own traction engines [5]. As a new and important branch of RSP problem, the topic of TCP problem has been receiving increasing attention.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Uniqueness Constraints. In this paper, the uniqueness constraints include two aspects: firstly, as shown in (4), each trip in the given TD must be undertaken by a train-set, and only one train-set can be allocated to complete the task; secondly, to avoid train-sets being idle after completing a trip task as well as formulate utilization circulation, (5) and (6) restrain that there must be one and only one trip task being assigned to train-sets; i.e., another trip must be connected with the former trip task.…”

Section: = ∈ ∈mentioning

confidence: 99%

See 2 more Smart Citations

Optimizing Train-Set Circulation Plan in High-Speed Railway Networks Using Genetic Algorithm

Wang

Yan

2019

Journal of Advanced Transportation

View full text Add to dashboard Cite

As a sustainable transportation mode, high-speed railway (HSR) has been developing rapidly during the past decade in China. With the formation of dense HSR network, how to improve the utilization efficiency of train-sets (the carrying tools of HSR) has been a new research hotspot. Moreover, the emergence of railway transportation hubs has brought great challenges to the traditional train-sets’ utilization mode. Thus, in this paper, we address the issue of train-sets’ utilization problem with the consideration of railway transportation hubs, which consists of finding an optimal Train-set Circulation Plan (TCP) to complete trip tasks in a given Train Diagram (TD). An integer programming TCP model is established to optimize the train-set utilization scheme, aiming to obtain the one-to-one correspondence relationship among sets of train-sets, trip tasks, and maintenances. A genetic algorithm (GA) is designed to solve the model. A case study based on Nanjing and Shanghai HSR transportation hubs is made to demonstrate the practical significance of the proposed method. The results show that a more efficient TCP can be formulated by introducing train-sets being dispatched among different stations in the same hub.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: = ∈ ∈mentioning

confidence: 99%

See 1 more Smart Citation

Optimizing Train-Set Circulation Plan in High-Speed Railway Networks Using Genetic Algorithm

Wang

Yan

2019

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…Imada and Tomii [7] used mixed integer linear planning to solve turning back operations. A train rescheduling algorithm considering rolling stock is also being researched, for example, Haahr et al [8] use a mixed integer linear program, Dollevoet et al [9] report changing track at the station for delay, and so on.…”

Section: Introductionmentioning

confidence: 99%

Train rescheduling plan generation based on train route combination considering rolling stock types

Katori¹,

Izumi²

2019

Int. J. TDI

View full text Add to dashboard Cite

Railway transport has high punctuality, however, sometimes accidents happens due to facility failure or natural disasters, and the operation needs to change from its original scheduled timetable. When the operation has to return to the original schedule that operation is called "train rescheduling". Automatic rescheduling methods have been suggested considering several operation conditions and operation environments. During the rescheduling, the operated rolling stock types must be considered because different types of rolling stock have limitations for each running section, for example, one type of vehicle cannot run sections that are driven in a different electrical manner. Based on the above, this paper describes how to generate automatic rescheduling methods while specifically considering the operated rolling stock types. We suggest a rescheduling method which does not use software tools such as mixed integer linear programming. Train rescheduling deals with the problem of how to move rolling stocks from their location after resumption time to their location at time of recovery to scheduled conditions. Thus considering the conditions, track routes are registered for each type, and the created rolling stock operation plan is a combination of the possible routes during rescheduling time. Other stock operation routes are also searched for, and the combination of all these routes results in a complete rescheduling plan. When more than one train is located at the same location at the same time, the solution is rejected because the plan is impossible to be realized. Average headway time and its standard deviation at each station are used as evaluation functions to decide which solution to adopt from the multiple rescheduling timetables that can be generated. Shorter average headway time results in a higher train number, and accordingly more passengers can be transported. With a smaller deviation, trains run at similar intervals and the number of passengers is equalized for all operated trains. The operation plan with the smallest evaluation value is adopted as the final rescheduling timetable. Finally, we apply the suggested method to a theoretical track modelled on an existing track for a variation of traffic accident parameters, and indicate that rescheduling timetables are generated that fulfil the operation conditions of the rolling stock types under consideration.

show abstract

“…Computer processor performance improved and processors are able to solve realistic size problems [4]. And a train rescheduling algorithm considering rolling stock that uses a mixed integer linear program [5], and changing track at the station for delay [6] is also being researched.…”

Section: Introductionmentioning

confidence: 99%

Train Rescheduling Generation Considering Rolling Stock Types and Closed-Off Areas

Katori

Izumi

2018

WIT Transactions on the Built Environment

View full text Add to dashboard Cite

During railway operations, trains cannot operate on a scheduled timetable when a traffic accident happens. In such a case, exact re-operation time must be predicted and a rescheduling timetable after re-operation has to be generated quickly. Rescheduling timetables have been generated by manual operators. However, recently high-performance computers have also generated rescheduling timetables automatically. When a traffic accident happens, there are two main rescheduling plans considering traffic features on the tracks and infrastructure (for example, possible locations for a turning operation). In one plan, all tracks are closed and all trains restarted at the same time. In the second plan, the closed-off area is limited to only one part, and in other areas trains can run turning back operations. This rescheduling applies to where many trains run turning operations, and this type of rescheduling has the merit of continued traffic. Against this background, we are studying the automatic generation of rescheduling timetables. In Japanese urban areas, JR and some private company trains (rolling stocks) run through each other for passenger convenience, but the rolling stocks have limited running areas. For example, an area is operated by directory current rolling stock, but another area is powered by alternative current or diesel rolling stock operation. In this paper, we propose an improved rescheduling generation method that includes the closed-off area while also considering the rolling stock types. The generated rescheduling timetable includes turning operations in certain areas. With this method, a pausing time is set for each rolling stock, and other trains' paths may not cross the accident location. Of course, if the same pausing time is set for all trains, a rescheduling plan will be generated. Generated rescheduling plans are evaluated for passenger convenience; average headway time at each station for other directions and standard deviation time are evaluated. Shorter average headway time leads to larger transportation numbers, and smaller standard deviation means a more even passenger distribution for all trains. This method is applied to two scheduled timetables on a modelled double track line. Some rescheduling results are compared with different parameters. Generated rescheduled timetables include turning back operation.

show abstract

A comparison of two exact methods for passenger railway rolling stock (re)scheduling

Cited by 53 publications

References 23 publications

Optimizing Train-Set Circulation Plan in High-Speed Railway Networks Using Genetic Algorithm

Optimizing Train-Set Circulation Plan in High-Speed Railway Networks Using Genetic Algorithm

Train rescheduling plan generation based on train route combination considering rolling stock types

Train Rescheduling Generation Considering Rolling Stock Types and Closed-Off Areas

Contact Info

Product

Resources

About