Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/79898
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electrical Engineering-
dc.creatorFan, WB-
dc.creatorMei, Y-
dc.creatorGu, WH-
dc.date.accessioned2018-12-21T07:13:48Z-
dc.date.available2018-12-21T07:13:48Z-
dc.identifier.issn0191-2615-
dc.identifier.urihttp://hdl.handle.net/10397/79898-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rights© 2018 Elsevier Ltd. All rights reserved.en_US
dc.rights© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/.en_US
dc.subjectBimodal transit networken_US
dc.subjectContinuum modelsen_US
dc.subjectOptimal designen_US
dc.subjectTransit route choiceen_US
dc.titleOptimal design of intersecting bimodal transit networks in a grid cityen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage203-
dc.identifier.epage226-
dc.identifier.volume111-
dc.identifier.doi10.1016/j.trb.2018.03.007-
dcterms.abstractThe urban transit system in a real city usually has two major components: a sparse express (e.g. rail) network and a dense local (e.g. bus) network. The two networks intersect and interweave with each other throughout the city to furnish various route options for serving transit patrons with distinct ODs. The optimal design problem of this bimodal transit system, however, has not been well explored in the literature, partly due to the difficulty of modeling the patrons' complex route choice behavior in the bimodal networks. In light of this, we formulate parsimonious continuum models for minimizing the total cost of the patrons and the transit agency for an intersecting bimodal transit network in a grid city, where the perpendicular local and express lines intersect at transfer stops. Seven distinct route types are identified in this network, which represent realistic intra- and inter-modal route options. A lower-level assignment problem between these routes is embedded in the upper-level network design optimization problem. We develop an efficient method to find near-optimal designs of the intersecting network. Numerical results unveil a number of insightful findings, e.g., that sizable cost savings are observed for the intersecting bimodal design as compared to the single-mode designs for moderate to high demand levels, and that only moderate benefits are observed as compared to the trunk-feeder designs under certain operating conditions. We also show that the conventional practice of designing the local and express networks separately would greatly undermine the benefit of the bimodal system.-
dcterms.accessRightsopen access-
dcterms.bibliographicCitationTransportation research. Part B, Methodological, May 2018, v. 111, p. 203-226-
dcterms.isPartOfTransportation research. Part B, Methodological-
dcterms.issued2018-05-
dc.identifier.isiWOS:000432513100010-
dc.identifier.scopus2-s2.0-85044738745-
dc.identifier.eissn1879-2367-
dc.identifier.rosgroupid2017002759-
dc.description.ros2017-2018 > Academic research: refereed > Publication in refereed journal-
dc.description.validate201812 bcrc-
dc.description.oaAccepted Manuscript-
dc.identifier.FolderNumbera0783-n06-
dc.identifier.SubFormID1705-
dc.description.fundingSourceRGC-
dc.description.fundingTextGeneral Research Fund 15280116-
dc.description.pubStatusPublished-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
1705_intersecting_bimodal_networks.pdfPre-Published version2.37 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

94
Last Week
0
Last month
Citations as of Apr 14, 2024

Downloads

120
Citations as of Apr 14, 2024

SCOPUSTM   
Citations

47
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

41
Last Week
0
Last month
Citations as of Apr 18, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.