Show simple item record

dc.contributor.author
Khanzad, Iran
dc.contributor.author
Seyedabrishami, Seyedehsan
dc.contributor.author
Nazemi, Mohsen
dc.contributor.author
Zarrinmehr, Amirali
dc.date.accessioned
2021-07-26T09:34:38Z
dc.date.available
2017-06-12T09:31:37Z
dc.date.available
2021-07-26T09:34:38Z
dc.date.issued
2016
dc.identifier.uri
http://hdl.handle.net/20.500.11850/118648
dc.description.abstract
The problem of public transportation routes network design deals with establishing the configuration of transit routes in a transportation network. This problem is recognized as one of the most complicated problems in transportation planning. An appropriate design of transit network will help increasing transit share of urban trips and reducing traffic congestion in urban networks. Previous research proposed the Route Generation Algorithm (RGA) in which shortest paths with the highest demands are selected and then expanded by insertion of new nodes in order to increase transit demand coverage. This paper expands RGA by introducing a new algorithm namely Extended Route Generation Algorithm (ERGA) with further details in node insertion scheme. A heuristic algorithm is proposed, tested in a medium-size network, and applied on a real-size network. In contrast to the conventional RGA in which all nodes are examined to be inserted between nodes of origin-destination pairs, the algorithm inserts only adjacent nodes to the shortest paths between selected origin-destinations. Moreover, the proposed algorithm restricts the distance between each pair of nodes, not to be greater than two times of the shortest path length between the two nodes and the travel time of each generated route in the problem. In addition, the number of common links between proposed routes of ERGA has been restricted due to the specifications of case study network. ERGA is coded in MATLAB and is applied on a test network and a real network.
en_US
dc.language.iso
en
en_US
dc.publisher
IVT, ETH Zürich
en_US
dc.title
Transit network design problem: An expansion of the route generation algorithm
en_US
dc.type
Working Paper
ethz.journal.title
Arbeitsberichte Verkehrs- und Raumplanung
ethz.journal.volume
1173
en_US
ethz.publication.place
Zürich
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02115 - Dep. Bau, Umwelt und Geomatik / Dep. of Civil, Env. and Geomatic Eng.::02610 - Inst. f. Verkehrspl. u. Transportsyst. / Inst. Transport Planning and Systems::03521 - Axhausen, Kay W. / Axhausen, Kay W.
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02100 - Dep. Architektur / Dep. of Architecture::02655 - Netzwerk Stadt und Landschaft D-ARCH::02226 - NSL - Netzwerk Stadt und Landschaft / NSL - Network City and Landscape
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02100 - Dep. Architektur / Dep. of Architecture::02655 - Netzwerk Stadt und Landschaft D-ARCH
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02115 - Dep. Bau, Umwelt und Geomatik / Dep. of Civil, Env. and Geomatic Eng.::02610 - Inst. f. Verkehrspl. u. Transportsyst. / Inst. Transport Planning and Systems::03521 - Axhausen, Kay W. / Axhausen, Kay W.
ethz.date.deposited
2017-06-12T09:36:18Z
ethz.source
ECIT
ethz.identifier.importid
imp593654911c07725920
ethz.ecitpid
pub:180612
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2017-07-18T14:26:53Z
ethz.rosetta.lastUpdated
2022-03-29T10:39:55Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Transit%20network%20design%20problem:%20An%20expansion%20of%20the%20route%20generation%20algorithm&rft.jtitle=Arbeitsberichte%20Verkehrs-%20und%20Raumplanung&rft.date=2016&rft.volume=1173&rft.au=Khanzad,%20Iran&Seyedabrishami,%20Seyedehsan&Nazemi,%20Mohsen&Zarrinmehr,%20Amirali&rft.genre=preprint&
 Search print copy at ETH Library

Files in this item

FilesSizeFormatOpen in viewer

There are no files associated with this item.

Publication type

Show simple item record