Research on Intelligent Optimization Algorithm for Multi-Objective Vehicle Routing Based on Deep Reinforcement Learning

Authors

  • Xiangxin Wang University of shanghai for Science and Technology, Shanghai, 200093, China

DOI:

https://doi.org/10.54097/zvk8g320

Keywords:

Deep Reinforcement Learning, Multi-objective Vehicle Routing Problem, ADAR-PPO Algorithm, Enhanced Self-attention, Adaptive Reward, PPO

Abstract

To address the problems of slow convergence and poor multi-objective coordination in complex scenarios of traditional multi-objective vehicle routing optimization algorithms, as well as the inaccurate state representation and policy update drift of existing deep reinforcement learning algorithms, this paper proposes an enhanced dynamic self-attention and adaptive reward-based PPO algorithm (ADAR-PPO) to solve the multi-objective vehicle routing optimization problem. First, a mathematical model for multi-objective vehicle routing optimization is constructed, clarifying optimization objectives such as shortest path, lowest transportation cost, and load balancing, along with constraints such as vehicle capacity and time windows. Second, an enhanced dynamic self-attention encoder is designed, integrating channel attention and SwiGLU activation units to achieve dynamic updating and deep fusion of node features, improving the accuracy of state representation. Then, an adaptive multi-objective reward mechanism is proposed, dynamically adjusting the weights of each objective and generating a comprehensive reward by combining constraint penalties to guide the agent in learning the Pareto optimal solution. Finally, the PPO policy update method is improved by introducing advantage normalization and dynamic pruning thresholds to enhance the algorithm's training stability and sample efficiency. Experimental results based on the Solomon standard dataset show that, in the C101 instance, the ADAR-PPO algorithm achieves an HV value of 0.896, a 12.8% improvement over the standard PPO and a 23.5% improvement over GA; an IGD value of 0.087, a 49.4% reduction over the standard PPO and a 61.3% reduction over PSO; an average path length of 892.3 m, a 12.6% reduction over GA; an average transportation cost of 702.5 yuan, a 7.6% reduction over PSO; and a convergence iteration count of 180, a 30% reduction over the standard PPO. These results demonstrate that the proposed algorithm outperforms the comparative algorithms in multi-objective collaborative optimization, convergence speed, solution accuracy, and perturbation adaptability, providing effective technical support for intelligent planning of logistics delivery routes.

Downloads

Download data is not yet available.

References

[1] Li, K. W., Zhang, T., Wang, R., Qin, W. J., He, H. H., & Huang, H. (2021). Research progress in combinatorial optimization based on deep reinforcement learning. Acta Automatica Sinica, 47(11), 2521–2537.

[2] Zhang, D. Z., Qiao, X., Xiao, B. W., Wang, R. D., & Mao, C. H. (2021). Multi-objective vehicle routing optimization based on low-carbon and stochastic demand. Journal of Railway Science and Engineering, 18(8), 2165–2174.

[3] Wang, W. L., Chen, H. L., Li, G. Q., Leng, L. L., & Zhao, Y. W. (2022). Vehicle routing planning for multiple distribution centers based on deep reinforcement learning. Control and Decision, 37(8), 2101–2109.

[4] Liu, Y. Q., & Han, J. (2022). Model and algorithm for vehicle routing problem of freight cars carrying multiple UAVs. Journal of Transportation Engineering and Information, 20(3), 102–113.

[5] Hou, D. K., Fan, H. M., & Ren, X. X. (2022). Optimization of vehicle routes for joint delivery by multi-center hybrid fleets under time-varying road networks. Journal of Dalian Maritime University, 48(1), 11–22.

[6] Li, Y., Fan, H. M., & Zhang, X. N. (2022). Periodic optimization model and solution for vehicle routing problem under dynamic demand. Chinese Journal of Management Science, 30(8), 254–266.

[7] Fan, H. M., Yang, C., Zhang, Y. G., Sun, X. N., & Tian, P. J. (2023). Research on vehicle route optimization of multi-center hybrid fleets under mixed time windows. Computer Integrated Manufacturing Systems, 29(10), 3529–3546.

[8] Li, J. Q., Cai, J. C., Sun, T., Zhu, Q. L., & Lin, Q. Z. (2024). Multi-task assisted evolutionary algorithm for vehicle routing planning in complex logistics and distribution scenarios. Acta Automatica Sinica, 50(3), 544–559.

[9] Zhang, X. Y., Jin, P., Hu, X. X., & Zhu, M. N. (2024). Research on open vehicle routing problem with time window for time-dependent multi-distribution center. Chinese Journal of Management Science, 32(1), 146–157.

[10] Jiang, M., & He, T. (2025). Solving vehicle routing problem with capacity constraints based on deep reinforcement learning. Journal of System Simulation, 37(9), 2177–2187.

[11] Zhang, Y. X., Lei, B. B., Wang, X. F., Zhu, X. J., & Song, J. H. (2025). A review of meta-heuristic algorithms for vehicle routing problem with time window. Journal of Computer Applications Research, 42(5), 1290–1298.

Downloads

Published

07-10-2026

Issue

Section

Articles