Show simple item record

dc.contributor.author
Long, Sihui
dc.contributor.author
Meng, Lingyun
dc.contributor.author
Luan, Xiaojie
dc.contributor.author
Trivella, Alessio
dc.contributor.author
Miao, Jianrui
dc.contributor.author
Corman, Francesco
dc.date.accessioned
2021-01-08T08:52:00Z
dc.date.available
2021-01-08T08:52:00Z
dc.date.issued
2020
dc.identifier.issn
1979-2016
dc.identifier.issn
2042-3195
dc.identifier.other
10.1155/2020/8894174
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/460487
dc.identifier.doi
10.3929/ethz-b-000447672
dc.description.abstract
The metro system is an important component of the urban transportation system due to the large volume of transported passengers. Hub stations connecting metro and high-speed railway (HSR) networks are particularly critical in this system. When HSR trains are delayed due to a disruption on the HSR network, passengers of these trains arriving at the hub station at night may fail to get their last metro connection. The metro operator can thus decide to schedule extra metro trains at night to serve passengers from delayed HSR trains. In this paper, we consider the extra metro train scheduling problem in which the metro operator decides how many extra metro trains to dispatch and their schedules. The problem is complex because (i) the arrival of delayed HSR trains is usually uncertain, and (ii) the operator has to minimize operating costs (i.e., number of additional trains and operation-ending time) but maximize the number of served passengers, which are two conflicting objectives. In other words, the problem we consider is stochastic and biobjective. We formulate this problem as a two-stage stochastic program with recourse and use an epsilon-constrained method to find a set of nondominated solutions. We perform extensive numerical experiments using realistic instances based on the Beijing metro network and two HSR lines connected to this network. We find that our stochastic model outperforms out-of-sample a deterministic model that relies on forecasts of the delay by a range of 3–5%. Moreover, we show that our solutions are nearly optimal by computing a perfect information dual bound and obtaining average optimality gaps below 1%.
en_US
dc.format
application/pdf
en_US
dc.language.iso
en
en_US
dc.publisher
Hindawi
en_US
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
dc.title
A stochastic programming approach for scheduling extra metro trains to serve passengers from uncertain delayed high-speed railway trains
en_US
dc.type
Journal Article
dc.rights.license
Creative Commons Attribution 4.0 International
dc.date.published
2020-11-16
ethz.journal.title
Journal of Advanced Transportation
ethz.journal.volume
2020
en_US
ethz.journal.abbreviated
J Advanced Transp
ethz.pages.start
8894174
en_US
ethz.size
18 p.
en_US
ethz.version.deposit
publishedVersion
en_US
ethz.grant
DADA - Dynamic data driven Approaches for stochastic Delay propagation Avoidance in railways
en_US
ethz.identifier.wos
ethz.publication.place
Oxford
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::09611 - Corman, Francesco / Corman, Francesco
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 u. Landschaft ARCH u BAUG / Network City and Landscape ARCH and BAUG
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::09611 - Corman, Francesco / Corman, Francesco
en_US
ethz.grant.agreementno
181210
ethz.grant.fundername
SNF
ethz.grant.funderDoi
10.13039/501100001711
ethz.grant.program
Eccellenza
ethz.date.deposited
2020-10-24T08:11:28Z
ethz.source
FORM
ethz.source
WOS
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2021-01-08T08:52:09Z
ethz.rosetta.lastUpdated
2025-02-13T22:48:17Z
ethz.rosetta.versionExported
true
dc.identifier.olduri
http://hdl.handle.net/20.500.11850/447672
dc.identifier.olduri
http://hdl.handle.net/20.500.11850/459677
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=A%20stochastic%20programming%20approach%20for%20scheduling%20extra%20metro%20trains%20to%20serve%20passengers%20from%20uncertain%20delayed%20high-speed%20railway%20train&rft.jtitle=Journal%20of%20Advanced%20Transportation&rft.date=2020&rft.volume=2020&rft.spage=8894174&rft.issn=1979-2016&2042-3195&rft.au=Long,%20Sihui&Meng,%20Lingyun&Luan,%20Xiaojie&Trivella,%20Alessio&Miao,%20Jianrui&rft.genre=article&rft_id=info:doi/10.1155/2020/8894174&
 Search print copy at ETH Library

Files in this item

Thumbnail

Publication type

Show simple item record