Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8723
DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineering-
dc.creatorLam, WHK-
dc.creatorZhou, J-
dc.date.accessioned2014-12-30T08:39:18Z-
dc.date.available2014-12-30T08:39:18Z-
dc.identifier.issn0361-1981-
dc.identifier.urihttp://hdl.handle.net/10397/8723-
dc.language.isoenen_US
dc.publisherU.S. National Research Council, Transportation Research Boarden_US
dc.titleOptimal fare structure for transit networks with elastic demanden_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage8-
dc.identifier.epage14-
dc.identifier.issue1733-
dcterms.abstractA bilevel model is presented to optimize the fare structure for transit networks with elastic demand under the assumption of fixed transit service frequency. It is known that the transit fare structure has significant effects on passengers' demand and route choice behavior. The transit operator therefore should predict passengers' response to changing fare charges. A bilevel programming method is developed to determine the optimal fare structure for the transit operator while taking passengers' response into account. The upper-level problem seeks to maximize the operator's revenue, whereas the lower-level problem is a stochastic user equilibrium transit assignment model with capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Finally, a numerical example is given together with some useful discussion.-
dcterms.bibliographicCitationTransportation research record : journal of the Transportation Research Board, 2000, no. 1733, p. 8-14-
dcterms.isPartOfTransportation research record : journal of the Transportation Research Board-
dcterms.issued2000-
dc.identifier.isiWOS:000176463700002-
dc.identifier.scopus2-s2.0-0034432825-
dc.identifier.rosgroupidr04259-
dc.description.ros2000-2001 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

36
Last Week
0
Last month
0
Citations as of Feb 15, 2020

WEB OF SCIENCETM
Citations

33
Last Week
0
Last month
0
Citations as of Oct 24, 2020

Page view(s)

115
Last Week
0
Last month
Citations as of Oct 21, 2020

Google ScholarTM

Check


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