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

Spatiotemporal Features-Aware relocating for idle vehicles using spatial mean field deep Q network reinforcement learning

Author

Listed:
  • Chen, Zhiju
  • Liu, Kai
  • Wang, Jiangbo
  • Ke, Jintao

Abstract

The cruising behavior of idle ride-hailing vehicles in search of passengers is a key influencing factor that restricts the spatiotemporal balance between online ride-hailing supply and passenger demands. This paper aims to simulate the strategy of transferring idle vehicles in multiple hexagonal partitions to adjacent grid partitions by proposing a spatiotemporal features-aware relocating approach (STFAR) that integrates spatiotemporal features of ride hailing into deep reinforcement learning. Specifically, spatial clustering algorithm and time series clustering algorithm are used to identify the spatiotemporal pattern of ride-hailing demand in each hexagonal partition. In addition, the direction of central hot spot is determined by accurately predicting the future short-term travel demand of each hexagonal partition. Finally, a spatial mean field deep Q network (SMFDQN) reinforcement learning method which regards the hexagonal partition as limited and fixed numbers spatial multi-agents is proposed to optimize the efficiency of idle vehicle transfer. STFAR improves the SMFDQN method by integrating the above spatiotemporal features into state space and action space designs and effectively improves the supply and demand balance in the entire region. Experiments based on Didi Chuxing order data during a certain time period in Chengdu showed that STFAR increases the cumulative order revenue by 3.64%, increases the completion rate of demand by 4.03%, and increases the dispatched rate of idle vehicles by 2.98% compared with the state-of-the-art algorithms.

Suggested Citation

  • Chen, Zhiju & Liu, Kai & Wang, Jiangbo & Ke, Jintao, 2026. "Spatiotemporal Features-Aware relocating for idle vehicles using spatial mean field deep Q network reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 208(C).
  • Handle: RePEc:eee:transe:v:208:y:2026:i:c:s1366554525006738
    DOI: 10.1016/j.tre.2025.104651
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2025.104651?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:208:y:2026:i:c:s1366554525006738. 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.