IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i2p768-775.html
   My bibliography  Save this article

Online Passenger Flow Control in Metro Lines

Author

Listed:
  • Jinpeng Liang

    (School of Transportation Engineering, Dalian Maritime University, Dalian, Liaoning 116026, China)

  • Guodong Lyu

    (School of Business and Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong)

  • Chung-Piaw Teo

    (Institute of Operations Research and Analytics, National University of Singapore, Singapore 117602; NUS Business School, National University of Singapore, Singapore 119245)

  • Ziyou Gao

    (School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100080, China)

Abstract

Crowd management during peak commuting hours is a key challenge facing oversaturated metro systems worldwide, which results in serious safety concerns and uneven service experience for commuters on different origin-destination (o-d) pairs. This paper develops real-time passenger flow control policies to manage the inflow of crowds at each station, to optimize the total load carried or revenue earned (efficiency), and to ensure that adequate service is provided to passengers on each o-d pair (fairness), as much as possible. For given train capacity, we use Blackwell’s approachability theorem and Fenchel duality to characterize the attainable service level of each o-d pair. We use these insights to develop online policies for crowd control problems. Numerical experiments on a set of transit data from Beijing show that our approach performs well compared with existing benchmarks in the literature.

Suggested Citation

  • Jinpeng Liang & Guodong Lyu & Chung-Piaw Teo & Ziyou Gao, 2023. "Online Passenger Flow Control in Metro Lines," Operations Research, INFORMS, vol. 71(2), pages 768-775, March.
    • Handle: RePEc:inm:oropre:v:71:y:2023:i:2:p:768-775
    DOI: 10.1287/opre.2022.2417
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2417
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.2417?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:71:y:2023:i:2:p:768-775. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.