用深度强化学习解决城市物流多趟时变车辆路径问题
SED2AM: Solving Multi-Trip Time-Dependent Vehicle Routing Problem using Deep Reinforcement Learning
- 引入时间局部性先验,捕捉路程随时间变化的特性
- 双解码器设计实现车辆选择与行程构建,支持多趟调度
- 在真实城市数据上优于现有方法,可扩展至大规模问题
基于深度强化学习(DRL)的框架,采用类似Transformer的策略网络,在多种车辆路径问题(VRP)变体中已证明有效。然而,针对具有最大工作时长限制的多趟时变车辆路径问题(MTTDVRP)——城市物流的核心挑战——其应用仍基本空白。本文提出一种名为同时编码器与双解码器注意力模型(SED2AM)的DRL方法,专为解决带最大工作时长约束的MTTDVRP而设计。该方法在策略网络的编码模块中引入时间局部性归纳偏置,有效建模行程距离或时间随时间变化的依赖关系。解码模块包含车辆选择解码器,从车队中选出车辆,实现行程与车辆的功能性匹配;还配备行程构建解码器,用于构造车辆的行程。该策略模型采用两类状态表示:车队状态和路径状态,以在最大工作时长约束下实现有效路径规划。基于加拿大两大城市的实测数据集进行实验,结果表明SED2AM不仅显著优于当前最先进的基于DRL和元启发式的方法,且展现出良好的可扩展性,适用于更大规模的问题。
原文摘要 · Abstract (English)
Deep reinforcement learning (DRL)-based frameworks, featuring Transformer-style policy networks, have demonstrated their efficacy across various vehicle routing problem (VRP) variants. However, the application of these methods to the multi-trip time-dependent vehicle routing problem (MTTDVRP) with maximum working hours constraints -- a pivotal element of urban logistics -- remains largely unexplored. This paper introduces a DRL-based method called the Simultaneous Encoder and Dual Decoder Attention Model (SED2AM), tailored for the MTTDVRP with maximum working hours constraints. The proposed method introduces a temporal locality inductive bias to the encoding module of the policy networks, enabling it to effectively account for the time-dependency in travel distance or time. The decoding module of SED2AM includes a vehicle selection decoder that selects a vehicle from the fleet, effectively associating trips with vehicles for functional multi-trip routing. Additionally, this decoding module is equipped with a trip construction decoder leveraged for constructing trips for the vehicles. This policy model is equipped with two classes of state representations, fleet state and routing state, providing the information needed for effective route construction in the presence of maximum working hours constraints. Experimental results using real-world datasets from two major Canadian cities not only show that SED2AM outperforms the current state-of-the-art DRL-based and metaheuristic-based baselines but also demonstrate its generalizability to solve larger-scale problems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。