用强化学习解决电动卡车在充电约束下的不确定路径规划问题。
Learning to Route Electric Trucks Under Operational Uncertainty

- 将充电与路径规划建模为事件驱动的马尔可夫决策过程,融合非线性快充特性。
- 在不同车队规模下,算法性能接近优化基准,且在充电拥堵时成功率高。
- 引入图结构状态表示和动作掩码,提升训练效率,适合实际物流场景。
电动卡车运营需在电池续航有限、充电时间长、能耗波动及共享充电设施竞争等条件下做出可行路径决策。这些因素使电动卡车路径规划成为耦合物流与能源的问题,传统启发式方法在大规模下计算不可行。本文提出一种基于学习的随机电车路径规划框架,采用强化学习求解,将问题建模为带共享充电资源、随机行程与能耗需求、真实非线性快充行为的事件驱动半马尔可夫决策过程。为支持学习,引入基于图的状态表示与规则化动作掩码,确保策略仅生成可操作动作,提升训练效率。在此基础上构建了支持强化学习与基准对比的事件驱动仿真环境。多组计算实验表明,所提算法在各类车队规模下均优于基线方法,多数情况下性能接近优化基准,且在充电拥堵与不确定性下仍保持高成功率。
原文摘要 · Abstract (English)
Electric truck operations require routing decisions that remain feasible under limited battery range, long charging times, travel and energy consumption, and competition for shared charging infrastructure. These features make electric truck routing a coupled logistics and energy problem, limiting the practicality of heuristics-based methods and rendering them computationally infeasible at scale. This paper proposes a learning-based framework for the stochastic electric truck routing under charging constraints and operational uncertainty. The problem, solved by Reinforcement Learning, is formulated as an event-driven semi-Markov decision process with shared charging resources, stochastic travel and energy requirements, and realistic nonlinear fast-charging behavior. To support learning in this setting, a graph-based representation of system state and feasible decisions is introduced, together with a rule-based action mask that restricts policies to operationally admissible actions; thus, improving training efficiency. Building on this formulation, an event-driven simulation environment is developed that supports both Reinforcement Learning and benchmarking against heuristic and mathematical programming baselines. Computational experiments across a range of fleet sizes show that the proposed learning-based algorithm consistently outperforms baselines and attains performance close to optimization benchmarks in many settings, while preserving high success rates under charging congestion and uncertainty.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。