In nearly saturated station areas the limited capacity is one of the main reasons of delay propagation. Spreading the trains well in time and space in these areas has a big impact on the passenger robustness, i.e. the total travel time in practice of all passengers in the railway network in case of frequently occurring small delays. We focus on improving the performance in the bottleneck of the network in order to improve the performance of the whole railway network. This paper proposes a method that builds from scratch a routing plan and a cyclic timetable that optimizes the infrastructure occupation and the passenger robustness. An integer linear routing model assigns, without considering a timetable, every train to a route such that the ...
With increase in the use of railway transport, ensuring robustness in railway timetables has never b...
In order to improve the robustness of a railway system in station areas, this paper introduces an it...
We propose a heuristic algorithm to build a railway line plan from scratch that minimizes passenger ...
In nearly saturated station areas the limited capacity is one of the main reasons of delay propagati...
In this paper, we consider complex, busy stations whose limited capacity is one of the main reasons ...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
In this paper, we consider complex, busy stations whose limited capacity is one of the main reasons ...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
In order to improve the robustness of a railway system in station areas, this paper introduces an it...
In order to improve the robustness of a railway system in station areas, this paper introduces an it...
Routing trains through busy railway station layouts is an important part of the timetabling process....
no isbnIn this paper, we consider nearly saturated station areas whose limited capacity is one of th...
In this paper, we consider nearly saturated station areas whose limited capacity is one of the main ...
With increase in the use of railway transport, ensuring robustness in railway timetables has never b...
In order to improve the robustness of a railway system in station areas, this paper introduces an it...
We propose a heuristic algorithm to build a railway line plan from scratch that minimizes passenger ...
In nearly saturated station areas the limited capacity is one of the main reasons of delay propagati...
In this paper, we consider complex, busy stations whose limited capacity is one of the main reasons ...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
In this paper, we consider complex, busy stations whose limited capacity is one of the main reasons ...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
This paper proposes an iterative approach to construct a passenger robust railway routing plan and t...
In order to improve the robustness of a railway system in station areas, this paper introduces an it...
In order to improve the robustness of a railway system in station areas, this paper introduces an it...
Routing trains through busy railway station layouts is an important part of the timetabling process....
no isbnIn this paper, we consider nearly saturated station areas whose limited capacity is one of th...
In this paper, we consider nearly saturated station areas whose limited capacity is one of the main ...
With increase in the use of railway transport, ensuring robustness in railway timetables has never b...
In order to improve the robustness of a railway system in station areas, this paper introduces an it...
We propose a heuristic algorithm to build a railway line plan from scratch that minimizes passenger ...