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

Deep reinforcement learning approach to solving clustered vehicle routing problems

Author

Listed:
  • Wu, Yaoxin
  • Yu, Yue
  • Wu, Lingxiao
  • Feng, Tao
  • Zhang, Lu
  • Wang, Zhenkun
  • Gao, Jie

Abstract

Clustered vehicle routing problems (CluVRPs) represent a complex class of combinatorial optimization problems with significant real-world relevance. They extend classic VRPs by introducing pre-specified customer clusters and requiring effective routing both between clusters and within each cluster. While numerous deep learning approaches have been developed to address the standard VRP, research on CluVRPs remains relatively limited, presenting opportunities and challenges for advancing solutions to more practical VRPs with cluster-related constraints. This paper offers a deep reinforcement learning (DRL) approach to solving CluVRPs. We propose a cluster-aware attention module in the encoder, along with inter-cluster and intra-cluster decoders to specialize the constructive policies within and between clusters. Symmetrical data augmentation is adopted in the training to improve the performance. Empirical results in different CluVRP variants manifest that the DRL method outperforms existing approaches, consistently offering advantages for various instances.

Suggested Citation

  • Wu, Yaoxin & Yu, Yue & Wu, Lingxiao & Feng, Tao & Zhang, Lu & Wang, Zhenkun & Gao, Jie, 2026. "Deep reinforcement learning approach to solving clustered vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 209(C).
  • Handle: RePEc:eee:transe:v:209:y:2026:i:c:s1366554526000827
    DOI: 10.1016/j.tre.2026.104742
    as

    Download full text from publisher

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

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