时变路网单车路径优化模型及算法

Optimization Model and Algorithm of Time-dependent Single-vehicle Routing Problem

讨论了一类时变路网下单车辆配送路径优化问题,建立了基于时变路网以配送完成时间最早为优化目标的单车配送路径优化模型。在增加贪婪配送策略情况下,给出了车辆行驶时间满足FIFO规则的动态规划精确求解方法。数值算例验证了理论分析得到的结论。

In this paper, we established the single-vehicle distribution routing optimization model for time-dependent road networks with earlies completion time of distribution operation as the optimization objective. Then through adding the greedy distribution strategy, we gave the dynamic programming algorithm that satisfied the principle of first in first out and used a numerical example to verify the conclusions reached through theoretical analysis.