Shortest paths finding in public transport networks
DOI:
https://doi.org/10.15587/1729-4061.2011.2254Keywords:
Traffic network, the shortest path, transfersAbstract
A general formulation of search problem the shortest paths in public transport networks is presented. The technique of finding the shortest path by time in route for passengers, taking into account the waiting time and transfers on the route is suggestedReferences
- Magnanti, T. L. Network design and transportation planning: models and algorithms / T. L. Magnanti, R. T. Wong // Transportation Science .— 1984.— №18(1) .— P. 1–55
- Геронимус, Б. Л. Экономико-математические методы в планировании на автомобильном транспорте [Текст] / Б. Л. Геронимус.— М.: Транспорт, 1982.— 192 с.
- Хрущев, М. В. Исследование методов маршрутизации автобусного транспорта в городах : дис.…д-ра экон. наук / М. В. Хрущев.— М., 2000.— 206 с.
- Guihaire, V. Transit network design and scheduling: A global review [Текст] / V. Guihaire, J. Hao // Transportation Research.— 2008.— Vol. 42, №10.— P. 1251–1273
- Кормен, Т. Алгоритмы: построение и анализ [Текст] / Т. Кормен, Ч. Лейзерсон, Р. Ривест ; под. ред. И. В. Красикова .— 2-е изд. — М.: Вильямс, 2005 .— 1296 С.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2014 Олексій Феліксович Кузькін
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.