Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/93930
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.creator | Chen, X | en_US |
dc.creator | Zhang, W | en_US |
dc.creator | Guo, X | en_US |
dc.creator | Liu, Z | en_US |
dc.creator | Wang, S | en_US |
dc.date.accessioned | 2022-08-03T08:48:50Z | - |
dc.date.available | 2022-08-03T08:48:50Z | - |
dc.identifier.issn | 1366-5545 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/93930 | - |
dc.language.iso | en | en_US |
dc.publisher | Pergamon Press | en_US |
dc.subject | Bi-objective optimization | en_US |
dc.subject | Commuting congestion management | en_US |
dc.subject | Learning-and-optimization | en_US |
dc.subject | Train fare design | en_US |
dc.title | An improved learning-and-optimization train fare design method for addressing commuting congestion at CBD stations | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 153 | en_US |
dc.identifier.doi | 10.1016/j.tre.2021.102427 | en_US |
dcterms.abstract | This study proposes an improved learning-and-optimization train fare design method to deal with the commuting congestion of train stations at the central business district (CBD). The conventional learning-and-optimization scheme needs accurate boarding/alighting demand to update the train fare in each trial. However, when congestion happens, the observed boarding/alighting demand will be larger than the actual boarding/alighting demand due to the delays and the longer dwelling time. Thus, the actual boarding/alighting demand is not available in practice. The improved algorithm deals with this issue by using inexact and less information to determine the new trial fare during the iteration. Namely, the improved method bypasses the conditions that may lead to biased results so as to significantly enhance the reliability of the learning-and-optimization method. The simplified algorithm also makes this method more practical. The convergence property of the proposed algorithm is rigorously proved and the convergence rate is demonstrated to be exponential. Numerical studies are performed to demonstrate the efficiency of the improved learning-and-optimization method. | en_US |
dcterms.accessRights | embargoed access | en_US |
dcterms.bibliographicCitation | Transportation research. Part E, Logistics and transportation review, Sept. 2021, v. 153, 102427 | en_US |
dcterms.isPartOf | Transportation research. Part E, Logistics and transportation review | en_US |
dcterms.issued | 2021-09 | - |
dc.identifier.scopus | 2-s2.0-85111770521 | - |
dc.identifier.eissn | 1878-5794 | en_US |
dc.identifier.artn | 102427 | en_US |
dc.description.validate | 202208 bckw | en_US |
dc.description.oa | Not applicable | en_US |
dc.identifier.FolderNumber | LMS-0021 | - |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Natural Science Foundation of China; MOE (Ministry of Education in China) Project of Humanities and Social Sciences | en_US |
dc.description.pubStatus | Published | en_US |
dc.date.embargo | 2024-09-30 | en_US |
dc.identifier.OPUS | 55188805 | - |
Appears in Collections: | Journal/Magazine Article |
Page views
44
Last Week
1
1
Last month
Citations as of May 12, 2024
SCOPUSTM
Citations
6
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
7
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.