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

Deep reinforcement learning for the vehicle routing problem with route balancing

Author

Listed:
  • Xiao, Jianhua
  • Kong, Detian
  • Cao, Zhiguang
  • Zhao, Jingyi

Abstract

The Vehicle Routing Problem with Route Balancing (VRPRB) is a multi-objective combinatorial optimization (MOCO) problem that aims to balance workload distribution while minimizing overall travel costs. Unlike traditional Vehicle Routing Problems (VRP), VRPRB introduces fleet size constraints to improve resource utilization and reduce operational costs. Existing deep reinforcement learning (DRL) approaches for VRP rarely address multi-objective optimization and often assume an unlimited fleet size, limiting their practical applicability. To address this issue, we propose an Equity Attention Model (E-AM), a problem-tailored DRL framework designed to generate Pareto-optimal solutions for VRPRB. Our E-AM formulates the problem as a sequential decision-making process, where each decision involves pairing a vehicle with a customer. E-AM is built on an attention-based architecture, incorporating a node encoder, a vehicle context encoder, and a decoder, with a hyper-network technique to efficiently handle multi-objective optimization. Experimental results demonstrate that our approach finds better solutions than current state-of-the-art methods on VRPRB benchmark instances while maintaining higher computational efficiency. By fully leveraging the strengths of deep reinforcement learning, our approach provides a scalable and adaptive alternative to traditional heuristic and exact algorithms, achieving high-quality solutions for complex real-world routing problems. To enhance scalability and training efficiency, we introduce a two-stage reinforcement learning strategy that enables E-AM to solve VRPRB instances with up to 1000 customers. To promote transparency and reproducibility, we have open-sourced our implementation1.

Suggested Citation

  • Xiao, Jianhua & Kong, Detian & Cao, Zhiguang & Zhao, Jingyi, 2026. "Deep reinforcement learning for the vehicle routing problem with route balancing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 208(C).
  • Handle: RePEc:eee:transe:v:208:y:2026:i:c:s1366554525006544
    DOI: 10.1016/j.tre.2025.104632
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525006544
    Download Restriction: Full text may be restricted for ScienceDirect subscribers

    File URL: https://libkey.io/10.1016/j.tre.2025.104632?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. Chen, Xinwei & Wang, Tong & Thomas, Barrett W. & Ulmer, Marlin W., 2023. "Same-day delivery with fair customer service," European Journal of Operational Research, Elsevier, vol. 308(2), pages 738-751.
    2. Peter Reiter & Walter Gutjahr, 2012. "Exact hybrid algorithms for solving a bi-objective vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 19-43, March.
    3. Irnich, S. & Schneider, M. & Vigo, D., 2014. "Four Variants of the Vehicle Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 63514, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Huang, Michael & Smilowitz, Karen & Balcik, Burcu, 2012. "Models for relief routing: Equity, efficiency and efficacy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 2-18.
    5. Jozefowiez, Nicolas & Semet, Frédéric & Talbi, El-Ghazali, 2009. "An evolutionary algorithm for the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 195(3), pages 761-769, June.
    6. Maria Battarra & Güneş Erdoğan & Daniele Vigo, 2014. "Exact Algorithms for the Clustered Vehicle Routing Problem," Operations Research, INFORMS, vol. 62(1), pages 58-71, February.
    7. Nicholas D. Kullman & Martin Cousineau & Justin C. Goodson & Jorge E. Mendoza, 2022. "Dynamic Ride-Hailing with Electric Vehicles," Transportation Science, INFORMS, vol. 56(3), pages 775-794, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Yangyang & Xu, Ying & Gong, Yitian & Zhang, Hao & Liu, Qingyun & Li, Zhiyuan & Wen, Yixun, 2026. "Prediction-aided hierarchical and safe reinforcement learning for cold-chain electric vehicle routing," Energy, Elsevier, vol. 357(C).

    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. P. Matl & R. F. Hartl & T. Vidal, 2018. "Workload Equity in Vehicle Routing Problems: A Survey and Analysis," Transportation Science, INFORMS, vol. 52(2), pages 239-260, March.
    2. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    3. Chen, Xinwei & Wang, Tong & Thomas, Barrett W. & Ulmer, Marlin W., 2023. "Same-day delivery with fair customer service," European Journal of Operational Research, Elsevier, vol. 308(2), pages 738-751.
    4. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    5. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    6. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
    7. Amine Masmoudi, M. & Mancini, Simona & Baldacci, Roberto & Kuo, Yong-Hong, 2022. "Vehicle routing problems with drones equipped with multi-package payload compartments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    8. Marvin Caspar, 2026. "A matheuristic for the split delivery capacitated profitable tour problem with incomplete service," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 34(1), pages 211-238, March.
    9. repec:bcp:journl:v:10:y:2026:i:14:p:68-77 is not listed on IDEAS
    10. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    11. Rasul Esmaeilbeigi & Richard Middleton & Rodolfo García-Flores & Mojtaba Heydar, 2025. "Benders decomposition for a reverse logistics network design problem in the dairy industry," Annals of Operations Research, Springer, vol. 354(2), pages 495-546, November.
    12. Claudia Archetti & Guy Desaulniers & M. Grazia Speranza, 2017. "Minimizing the logistic ratio in the inventory routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 289-306, December.
    13. Ashlea Bennett Milburn & Emre Kirac & Mina Hadianniasar, 2017. "Case Article—Growing Pains: A Case Study for Large-Scale Vehicle Routing," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 75-80, January.
    14. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
    15. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    16. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 53(5), pages 1334-1353, September.
    17. Yang Wang & Lei Zhao & Martin Savelsbergh & Shengnan Wu, 2022. "Multi-Period Workload Balancing in Last-Mile Urban Delivery," Transportation Science, INFORMS, vol. 56(5), pages 1348-1368, September.
    18. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    19. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns," Omega, Elsevier, vol. 48(C), pages 60-74.
    20. Qingqing Qiao & Fengming Tao & Hailin Wu & Xuewei Yu & Mengjun Zhang, 2020. "Optimization of a Capacitated Vehicle Routing Problem for Sustainable Municipal Solid Waste Collection Management Using the PSO-TS Algorithm," IJERPH, MDPI, vol. 17(6), pages 1-22, March.
    21. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.

    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:s1366554525006544. 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.