21,835 research outputs found

    Phase Synchronization in Railway Timetables

    Full text link
    Timetable construction belongs to the most important optimization problems in public transport. Finding optimal or near-optimal timetables under the subsidiary conditions of minimizing travel times and other criteria is a targeted contribution to the functioning of public transport. In addition to efficiency (given, e.g., by minimal average travel times), a significant feature of a timetable is its robustness against delay propagation. Here we study the balance of efficiency and robustness in long-distance railway timetables (in particular the current long-distance railway timetable in Germany) from the perspective of synchronization, exploiting the fact that a major part of the trains run nearly periodically. We find that synchronization is highest at intermediate-sized stations. We argue that this synchronization perspective opens a new avenue towards an understanding of railway timetables by representing them as spatio-temporal phase patterns. Robustness and efficiency can then be viewed as properties of this phase pattern

    Stochastic Improvement of Cyclic Railway Timetables

    Get PDF
    Real-time railway operations are subject to stochastic disturbances. However, a railway timetable is a deterministic plan. Thus a timetable should be designed in such a way that it can cope with the stochastic disturbances as well as possible. For that purpose, a timetable usually contains time supplements in several process times and buffer times between pairs of consecutive trains. This paper describes a Stochastic Optimization Model that can be used to allocate the time supplements and the buffer times in a given timetable in such a way that the timetable becomes maximally robust against stochastic disturbances. The Stochastic Optimization Model was tested on several instances of NS Reizigers, the main operator of passenger trains in the Netherlands. Moreover, a timetable that was computed by the model was operated in practice in a timetable experiment on the so-called “Zaanlijnâ€. The results show that the average delays of trains can often be reduced significantly by applying relatively small modifications to a given timetable.Railway Timetabling;Stochastic Optimization;Robustness

    Tour-based Travel Mode Choice Estimation based on Data Mining and Fuzzy Techniques

    Get PDF
    This paper extends tour-based mode choice model, which mainly includes individual trip level interactions, to include linked travel modes of consecutive trips of an individual. Travel modes of consecutive trip made by an individual in a household have strong dependency or co-relation because individuals try to maintain their travel modes or use a few combinations of modes for current and subsequent trips. Traditionally, tour based mode choice models involved nested logit models derived from expert knowledge. There are limitations associated with this approach. Logit models assumes i) specific model structure (linear utility model) in advance; and, ii) it holds across an entire historical observations. These assumptions about the predefined model may be representative of reality, however these rules or heuristics for tour based mode choice should ideally be derived from the survey data rather than based on expert knowledge/ judgment. Therefore, in this paper, we propose a novel data-driven methodology to address the issues identified in tour based mode choice. The proposed methodology is tested using the Household Travel Survey (HTS) data of Sydney metropolitan area and its performances are compared with the state-of-the-art approaches in this area

    Route Planning in Transportation Networks

    Full text link
    We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4, previously published by Microsoft Research. This work was mostly done while the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at Microsoft Research Silicon Valle
    • …
    corecore