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

A hierarchical decision framework for dynamic operation of mobile charging stations

Author

Listed:
  • Yan, Yiming
  • Tian, Qingyun
  • Sun, Ziyuan
  • Cao, Rong
  • Wang, David Z.W.

Abstract

The growing adoption of electric vehicles (EVs) has led to increasing demand for flexible and responsive charging services in urban areas. To address spatiotemporal imbalance between charging supply and EV demand, this study investigates the real-time operation of mobile charging stations (MCSs), a promising solution that leverages portable chargers to meet spatiotemporally distributed charging demand. We propose a two-layer online decision framework that integrates reinforcement learning (RL) with exact optimization to jointly address upper-level deployment of the MCS and lower-level charging service scheduling decisions. In the upper layer, a deep Q-network (DQN) learns an adaptive dispatching policy to determine the next deployment location of the MCS based on real-time system states. In the lower layer, an exact optimization solver computes the optimal charging schedule by jointly selecting which EVs to charge, assigning them to ports, and determining the service duration at each stop. The proposed framework follows an event-driven paradigm and enables closed-loop coordination between hierarchical decision layers. Numerical experiments on both synthetic and realistic settings validate the proposed framework. In small-scale tests, the RL policy achieves 24.5 % higher cumulative rewards than the strongest greedy baseline, with greater improvements over queue-based, static, and random heuristics. In a realistic case study with 20 candidate facilities and spatiotemporally heterogeneous demand, it improves cumulative rewards by 11.2 % over the strongest baseline under practical operational constraints. The findings are robust to variations in the number of ports, dwell time, and demand scale; moreover, in a multi-MCS setting the RL policy also outperforms the strongest baseline. These results highlight the effectiveness, scalability, and practical value of the proposed hierarchical framework for dynamic EV charging operations.

Suggested Citation

  • Yan, Yiming & Tian, Qingyun & Sun, Ziyuan & Cao, Rong & Wang, David Z.W., 2026. "A hierarchical decision framework for dynamic operation of mobile charging stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 206(C).
  • Handle: RePEc:eee:transe:v:206:y:2026:i:c:s1366554525005812
    DOI: 10.1016/j.tre.2025.104553
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    2. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    3. Andu Dukpa & Boguslaw Butrylo, 2022. "MILP-Based Profit Maximization of Electric Vehicle Charging Station Based on Solar and EV Arrival Forecasts," Energies, MDPI, vol. 15(15), pages 1-14, August.
    4. Wang, Yineng & Li, Meng & Lin, Xi & He, Fang, 2021. "Online operations strategies for automated multistory parking facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    5. Maria-Simona Răboacă & Irina Băncescu & Vasile Preda & Nicu Bizon, 2020. "An Optimization Model for the Temporary Locations of Mobile Charging Stations," Mathematics, MDPI, vol. 8(3), pages 1-20, March.
    6. Yiming Yan & Xi Lin & Fang He & David Z. W. Wang, 2024. "Dynamic Operations of a Mobile Charging Crowdsourcing Platform," Transportation Science, INFORMS, vol. 58(5), pages 995-1015, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li, Xiaofeng & Yu, Xinlian & Pu, Ziyuan & Chen, Jingxu, 2025. "Electric vehicle charging optimization with coordinated mobile and fixed chargers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
    2. Hung, Ying-Chao & PakHai Lok, Horace & Michailidis, George, 2022. "Optimal routing for electric vehicle charging systems with stochastic demand: A heavy traffic approximation approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 526-541.
    3. Reyes, Damián & Erera, Alan L. & Savelsbergh, Martin W.P., 2018. "Complexity of routing problems with release dates and deadlines," European Journal of Operational Research, Elsevier, vol. 266(1), pages 29-34.
    4. Simona Mikšíková & David Ulčák & František Kuda, 2022. "Analysis of Malfunctions in Selected Parking Systems in the Czech Republic," Sustainability, MDPI, vol. 14(3), pages 1-10, February.
    5. Dessouky, Maged M & Hu, Shichun, 2021. "Dynamic Routing for Ride-Sharing," Institute of Transportation Studies, Working Paper Series qt6qq8r7hz, Institute of Transportation Studies, UC Davis.
    6. LIAN, Ying & LUCAS, Flavien & SÖRENSEN, Kenneth, 2022. "On-demand bus routing problem with dynamic stochastic requests and prepositioning," Working Papers 2022004, University of Antwerp, Faculty of Business and Economics.
    7. Marlin W. Ulmer & Alan Erera & Martin Savelsbergh, 2022. "Dynamic service area sizing in urban delivery," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 763-793, September.
    8. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    9. Rubio, Francisco & Llopis-Albert, Carlos & Valero, Francisco, 2021. "Multi-objective optimization of costs and energy efficiency associated with autonomous industrial processes for sustainable growth," Technological Forecasting and Social Change, Elsevier, vol. 173(C).
    10. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    11. Cordeau, Jean-François & Dell’Amico, Mauro & Falavigna, Simone & Iori, Manuel, 2015. "A rolling horizon algorithm for auto-carrier transportation," Transportation Research Part B: Methodological, Elsevier, vol. 76(C), pages 68-80.
    12. Stacy A. Voccia & Ann Melissa Campbell & Barrett W. Thomas, 2019. "The Same-Day Delivery Problem for Online Purchases," Service Science, INFORMS, vol. 53(1), pages 167-184, February.
    13. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    14. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    15. Yuxin Liu & Zihang Qin & Jin Liu, 2023. "An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup," Mathematics, MDPI, vol. 11(15), pages 1-15, July.
    16. Zahra Navidi & Nicole Ronald & Stephan Winter, 2018. "Comparison between ad-hoc demand responsive and conventional transit: a simulation study," Public Transport, Springer, vol. 10(1), pages 147-167, May.
    17. Syed Muhammad Ahsan & Hassan Abbas Khan & Sarmad Sohaib & Anas M. Hashmi, 2023. "Optimized Power Dispatch for Smart Building and Electric Vehicles with V2V, V2B and V2G Operations," Energies, MDPI, vol. 16(13), pages 1-15, June.
    18. Hyland, Michael & Mahmassani, Hani S., 2020. "Operational benefits and challenges of shared-ride automated mobility-on-demand services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 134(C), pages 251-270.
    19. Martijn Merwe & Melih Ozlen & John W. Hearne & James P. Minas, 2017. "Dynamic rerouting of vehicles during cooperative wildfire response operations," Annals of Operations Research, Springer, vol. 254(1), pages 467-480, July.
    20. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).

    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:206:y:2026:i:c:s1366554525005812. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.