全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于Linformer和多关系解码器的异构车队路径规划模型研究
Research on Heterogeneous Capacitated Vehicle Routing Models Based on Linformer and Multi-Relational Decoder

DOI: 10.12677/mos.2025.142139, PP. 142-156

Keywords: 异构车辆路径规划,深度强化学习,低秩注意力机制,多关系解码器,马尔可夫决策过程
Heterogeneous Vehicle Routing
, Deep Reinforcement Learning, Low-Rank Attention Mechanism, Multi-Relational Decoder, Markov Decision Process

Full-Text   Cite this paper   Add to My Lib

Abstract:

异构有容量限制的车辆路径规划问题(Heterogeneous Capacitated Vehicle Routing Problem, HCVRP)因其广泛的实际应用和复杂的约束条件,成为现代物流优化中的重要研究课题。然而,现有方法在处理异构车队多目标优化任务时,仍存在计算复杂度高和泛化能力不足的问题。针对上述挑战,本文提出了一种基于深度强化学习(Deep Reinforcement Learning, DRL)的新型HCVRP求解框架。首先,引入低秩注意力机制的Linformer模型,显著降低了传统Transformer在大规模问题中的计算复杂度。其次,设计多关系节点选择解码器,通过结合动态节点特征实时更新和车辆状态建模,有效提升了路径优化的解质量。在随机生成的数据集上,通过与多种经典启发式算法和现有深度强化学习方法的对比实验,验证了所提方法的性能。结果表明,本文方法在解质量和计算效率方面均具有显著优势,尤其在复杂约束和大规模实例中表现出更高的适用性。本文为解决异构车队路径规划问题提供了新的理论方法和实践工具,具备广泛的应用前景。
The Heterogeneous Capacitated Vehicle Routing Problem (HCVRP) is a critical research topic in modern logistics optimization due to its extensive real-world applications and complex constraints. However, existing methods often face challenges such as high computational complexity and limited generalization ability when handling heterogeneous fleets and multi-objective optimization tasks. To address these issues, this paper proposes a novel HCVRP solution framework based on Deep Reinforcement Learning (DRL). First, a Linformer model with a low-rank attention mechanism is introduced, significantly reducing the computational complexity of traditional Transformers in large-scale problems. Second, a multi-relational node selection decoder is designed to enhance solution quality by dynamically updating node features and modeling vehicle states in real time. Extensive experiments on randomly generated datasets demonstrate the performance of the proposed approach compared with various classical heuristic algorithms and existing DRL methods. The results show that the proposed framework achieves significant advantages in both solution quality and computational efficiency, especially in scenarios with complex constraints and large-scale instances. This study provides a new theoretical methodology and practical tool for solving heterogeneous fleet routing problems, offering broad application prospects.

References

[1]  Jabali, O., Gendreau, M. and Laporte, G. (2012) A Continuous Approximation Model for the Fleet Composition Problem. Transportation Research Part B: Methodological, 46, 1591-1606.
https://doi.org/10.1016/j.trb.2012.06.004

[2]  Ilhan, İ. (2021) An Improved Simulated Annealing Algorithm with Crossover Operator for Capacitated Vehicle Routing Problem. Swarm and Evolutionary Computation, 64, Article ID: 100911.
https://doi.org/10.1016/j.swevo.2021.100911

[3]  Wang, F., Liao, F., Li, Y., Yan, X. and Chen, X. (2021) An Ensemble Learning Based Multi-Objective Evolutionary Algorithm for the Dynamic Vehicle Routing Problem with Time Windows. Computers & Industrial Engineering, 154, Article ID: 107131.
https://doi.org/10.1016/j.cie.2021.107131

[4]  Sadati, M.E.H. and Çatay, B. (2021) A Hybrid Variable Neighborhood Search Approach for the Multi-Depot Green Vehicle Routing Problem. Transportation Research Part E: Logistics and Transportation Review, 149, Article ID: 102293.
https://doi.org/10.1016/j.tre.2021.102293

[5]  Vaswani, A., Shazeer, N., Parmar, N., et al. (2017) Attention Is All You Need. Proceedings of the 31st International Conference on Neural Information Processing Systems, Long Beach, 4-9 December 2017, 6000-6010.
[6]  Kool, W., van Hoof, H. and Welling, M. (2018) Attention, Learn to Solve Routing Problems!
[7]  Wang, S., Li, B.Z., Khabsa, M., et al. (2020) Linformer: Self-Attention with Linear Complexity.
[8]  Christiaens, J. and Vanden Berghe, G. (2020) Slack Induction by String Removals for Vehicle Routing Problems. Transportation Science, 54, 417-433.
https://doi.org/10.1287/trsc.2019.0914

[9]  Palma-Blanco, A., González, E.R. and Paternina-Arboleda, C.D. (2019) A Two-Pheromone Trail Ant Colony System Approach for the Heterogeneous Vehicle Routing Problem with Time Windows, Multiple Products and Product Incompatibility. In: Paternina-Arboleda, C. and Voß, S., Eds., Lecture Notes in Computer Science, Springer International Publishing, 248-264.
https://doi.org/10.1007/978-3-030-31140-7_16

[10]  Matthopoulos, P.P. and Sofianopoulou, S. (2019) A Firefly Algorithm for the Heterogeneous Fixed Fleet Vehicle Routing Problem. International Journal of Industrial and Systems Engineering, 33, 204-224.
https://doi.org/10.1504/ijise.2019.102471

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133