mlsanityData to 7 Oct 2026

Multiobjective Vehicle Routing Optimization with Time Windows: A Hybrid Approach Using Deep Reinforcement Learning and NSGA-II

arXiv 2407.13113 ↗First posted 18 Jul 2024cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

This paper proposes a weight-aware deep reinforcement learning (WADRL) approach designed to address the multiobjective vehicle routing problem with time windows (MOVRPTW), aiming to use a single deep reinforcement learning (DRL) model to solve the entire multiobjective optimization problem. The Non-dominated sorting genetic algorithm-II (NSGA-II) method is then employed to optimize the outcomes produced by the WADRL, thereby mitigating the limitations of both approaches. Firstly, we design an MOVRPTW model to balance the minimization of travel cost and the maximization of customer satisfaction. Subsequently, we present a novel DRL framework that incorporates a transformer-based policy network. This network is composed of an encoder module, a weight embedding module where the weights of the objective functions are incorporated, and a decoder module. NSGA-II is then utilized to optimize the solutions generated by WADRL. Finally, extensive experimental results demonstrate that our method outperforms the existing and traditional methods. Due to the numerous constraints in VRPTW, generating initial solutions of the NSGA-II algorithm can be time-consuming. However, using solutions generated by the WADRL as initial solutions for NSGA-II significantly reduces the time required for generating initial solutions. Meanwhile, the NSGA-II algorithm can enhance the quality of solutions generated by WADRL, resulting in solutions with better scalability. Notably, the weight-aware strategy significantly reduces the training time of DRL while achieving better results, enabling a single DRL model to solve the entire multiobjective optimization problem.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 5 of its 47 references that are in the map. First posted on arXiv 18 Jul 2024.

Builds on

5 of 47 references.

References · 5

  1. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  2. 2018Attention, Learn to Solve Routing Problems!cited by 646
  3. 2019Deep Reinforcement Learning for Multi-objective Optimizationcited by 87
  4. 2020Multi-Vehicle Routing Problems with Soft Time Windows: A Multi-Agent Reinforcement Learning Approachcited by 30
  5. 2020Deep Reinforcement Learning for Electric Vehicle Routing Problem with Time Windowscited by 25

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.