The Selected Problems of Public Transport Organization Using Mathematical Tools on the Example of Poland

Public transport plays an increasingly important role in satisfying the transport needs. Travellers’ requirements regarding the quality of services are increasing. In addition to passenger comfort, other parameters are important (timetable and the state of transport infrastructure). Therefore, methods that determine the appropriate organization of public transport for an area should be sought. The purpose of the article is to present the most commonly used optimization methods and tools that have been applied to the chosen problems of organization of public transport mainly in Poland (described in the articles of mainly Polish scientists), but against the background of global research. The article characterizes the functioning of public transport in Poland. The selected problems of public transport functioning, which can be solved by using optimization methods and tools were discussed. The chosen methods that were used to formulate and solve the identified problems were indicated. The effects of this article will form part of the work on the POIR.01.01.01-00-0970/17-00 project "IT system for computer-aided public transport planning" financed by the National Centre for Research and Development

Algorithm Engineering for Realistic Journey Planning in Transportation Networks

Diese Dissertation beschäftigt sich mit der Routenplanung in Transportnetzen. Es werden neue, effiziente algorithmische Ansätze zur Berechnung optimaler Verbindungen in öffentlichen Verkehrsnetzen, Straßennetzen und multimodalen Netzen, die verschiedene Transportmodi miteinander verknüpfen, eingeführt. Im Fokus der Arbeit steht dabei die Praktikabilität der Ansätze, was durch eine ausführliche experimentelle Evaluation belegt wird

Route Planning in Transportation Networks

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