An integrated micro–macro approach to robust railway timetabling

Bešinović, Nikola; Goverde, Rob M.P.; Quaglietta, Egidio; Roberti, Roberto

doi:10.1016/j.trb.2016.02.004

Cited by 103 publications

(65 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Additionally, procedures were developed for network and data transformations from the microscopic to macroscopic level, and vice versa. Details of the building blocks of the microscopic module are given in Besinovic et al (2015aBesinovic et al ( , 2015b.…”

Section: Microscopic Timetablingmentioning

confidence: 99%

“…If the computed infrastructure occupation is not satisfactory for a corridor then we relax the running time supplements of the trains in the corridor to allow more homogenised traffic through the considered corridor by reducing running time differences. This relaxation is explained in Besinovic et al (2015a). The relaxed constraints are provided to a new iteration of the macroscopic timetable optimization.…”

Section: -8 6th International Conference On Railway Operations Modmentioning

confidence: 99%

“…However, the drawback of this model is that it contains an exponential number of variables. We can cope with this drawback by solving the ILP model in a heuristic way using a randomized multi-start greedy heuristic (Besinovic et al 2015a). …”

Section: 31mentioning

confidence: 99%

“…In order to take into account the described objectives, next to the path variables also auxiliary variables are included in the ILP model used respectively for computing the number of missed connections, the excess times over the nominal connection times and the overall number of cancelled trains (Besinovic et al 2015a). Timetable feasibility at a macroscopic level is achieved by means of the constraints included in the ILP model.…”

Section: 31mentioning

confidence: 99%

“…For each delay scenario the effect on each timetable is evaluated by applying a heuristic algorithm that tries to resolve the potential conflicts caused by the generated delays by retiming the trains (see Besinovic et al 2015a for further details). The algorithm computes the overall delay propagation or establishes that some conflicts cannot be resolved.…”

Section: 32mentioning

confidence: 99%

See 4 more Smart Citations

A three-level framework for performance-based railway timetabling

Goverde

Bešinović

Binder

et al. 2016

Transportation Research Part C: Emerging Technologies

Self Cite

View full text Add to dashboard Cite

The performance of railway operations depends highly on the quality of the railway timetable. In particular for dense railway networks it can be a challenge to obtain a stable robust conflict-free and energy-efficient timetable with acceptable infrastructure occupation and short travel times. This paper presents a performance-based railway timetabling framework using an integrated approach on three levels: microscopic, macroscopic and a corridor fine-tuning level, to compute a timetable explicitly driven by the above mentioned performance indicators. A case study on the Dutch railway network illustrates the feasibility of this approach to achieve the highest timetabling design level.

show abstract

Section: Microscopic Timetablingmentioning

confidence: 99%

Section: -8 6th International Conference On Railway Operations Modmentioning

confidence: 99%

Section: 31mentioning

confidence: 99%

Section: 31mentioning

confidence: 99%

Section: 32mentioning

confidence: 99%

See 3 more Smart Citations

A three-level framework for performance-based railway timetabling

Goverde

Bešinović

Binder

et al. 2016

Transportation Research Part C: Emerging Technologies

Self Cite

View full text Add to dashboard Cite

show abstract

A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements

et al. 2018

View full text Add to dashboard Cite

Timetable regularity, that is, equability of headways, is an important measure for service quality in high frequency public transit systems, assuring an evenly distributed passenger load as well as improving product attractiveness. However, to be feasible during daily operation a timetable may also have to adhere to other planning requirements, such as departure time coordination with other service providers or deliberately short headways to reduce the passenger load of follow-up vehicles. In this article, a disjunctive program formulation combining aspects of two previous optimization models is proposed, to generate regular public transit timetables adhering to planning requirements. The modeled requirements not only allow for the consideration of feasibility constraints from daily operations, but also for the consideration of simultaneous departures for transfer connections, an objective traditionally opposed to regularity. To show its applicability the approach is applied to two models of artificial transit networks as well as to models of the public transit network of Cologne, Germany. The results show that the proposed formulation can be used to generate timetables for network instances of realistic size in acceptable time. For networks consisting of multiple connected components it is shown that a decomposition approach can significantly reduce run times. K E Y W O R D Sdisjunctive programming, mixed integer programming,

show abstract

Periodic Timetabling with ‘Track Choice’-PESP Based on Given Line Concepts and Mesoscopic Infrastructure

Wüst

Bütikofer

Ess

et al. 2019

Operations Research Proceedings

View full text Add to dashboard Cite

In bilevel optimization there are two decision makers, commonly denoted as the leader and the follower, and decisions are made in a hierarchical manner: the leader makes the first move, and then the follower reacts optimally to the leader's action. It is assumed that the leader can anticipate the decisions of the follower, hence the leader optimization task is a nested optimization problem that takes into consideration the follower's response.In this talk we focus on new branch-and-cut (B&C) algorithms for dealing with mixed-integer bilevel linear programs (MIBLPs). We first address a general case in which intersection cuts are used to cut off infeasible solutions. We then focus on a subfamily of MIBLPs in which the leader and the follower share a set of items, and the leader can select some of the items to inhibit their usage by the follower. Interdiction Problems, Blocker Problems, Critical Node/Edge Detection Problems are some examples of optimization problems that satisfy the later condition. We show that, in case the follower subproblem satisfies monotonicity property, a family of "interdiction-cuts" can be derived resulting in a more efficient B&C scheme.These new B&C algorithms consistently outperform (often by a large margin) alternative state-of-the-art methods from the literature, including methods that exploit problem specific information for special instance classes.

show abstract

An integrated micro–macro approach to robust railway timetabling

Cited by 103 publications

References 12 publications

A three-level framework for performance-based railway timetabling

A three-level framework for performance-based railway timetabling

A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements

Periodic Timetabling with ‘Track Choice’-PESP Based on Given Line Concepts and Mesoscopic Infrastructure

Contact Info

Product

Resources

About