IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v209y2026ics1366554526001110.html

Game theoretic Markov decision process for service scheduling in stochastic railway-based multi-modal transit network

Author

Listed:
  • Wang, Shouyi
  • Chow, Andy H.F.
  • Wang, Junyi

Abstract

This paper presents a game theoretic Markov decision process for urban transit service scheduling in a stochastic multi-modal network. The Markov decision game consists of multiple decision-making agents, in which we first have an agent that manipulates the number of connecting bus services and hence passenger influx to a core rail transit network. This agent operates as an attacker to construct a worst-case scenario for deriving the core train operational plans under a robust optimization framework. In response, the rail transit agents would defend these disturbances from the connecting mode by managing the corresponding transit service headways, routes to serve, and fleet sizes of vehicles to deploy. The objective of the transit operation is to minimize the passenger waiting times due to disturbances as well as the associated operating costs. To address the inherent computational complexity, we implement an adversarial multi-agent deep reinforcement learning framework in which the state and decision spaces of each agent involved are approximated by artificial neural network surrogates with a decentralized policy function and a centralized value function approximation. The reinforcement learning framework is to be trained through a multi-agent proximal policy optimization algorithm in a stochastic environment. The proposed framework is tested using a real-world multi-modal network with operational data from the Hong Kong Light Rail Transit and the connecting bus network. Experimental results show that the computing framework trained with the proximal policy optimization process outperforms various well-established offline meta-heuristic approaches in solution quality and computational effectiveness. Additional experiments also demonstrate the robustness and adaptability of the proposed attacker-defender model under different scenarios. This study contributes to adaptive and robust multi-modal transit services with advanced control and optimization technologies.

Suggested Citation

  • Wang, Shouyi & Chow, Andy H.F. & Wang, Junyi, 2026. "Game theoretic Markov decision process for service scheduling in stochastic railway-based multi-modal transit network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 209(C).
  • Handle: RePEc:eee:transe:v:209:y:2026:i:c:s1366554526001110
    DOI: 10.1016/j.tre.2026.104771
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526001110
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2026.104771?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:transe:v:209:y:2026:i:c:s1366554526001110. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.