摘要
针对多车场满载车辆路径问题(MDVRPFL),结合节约法提出了一种依次对车场、配送中心、用户进行循环调整直到最优的迭代算法。该算法具有使总费用随迭代次数逐渐降低的特点,其运算结果能同时得到最优车辆分配方案和车辆行驶路径。最后用该算法对不同规模的算例进行试验。试验结果表明,该算法对多车场车辆路径问题有效适用。
Combining C-W saving method algorithm, a kind of cycle iterative algorithm is proposed for multiple-depot vehicle routing problem with full loads （MDVRPFL）. The algorithm continuous adjusts depot, distribution center and consumer in turn to get the optimal solution. The amount charges gradually are decreased with the increasing iterative times. When the algorithm ends, the optimal vehicle distribution projects and the optimal vehicle routes are computed. In the end, different dimensions of examples are experienced on the algorithm, the results shows that the algorithm is suitable and effective to solve MDVRPFL.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第22期5866-5868,5871,共4页
Computer Engineering and Design
关键词
车辆路径问题
满载运输
多车场
节约法
优化算法
vehicle routing problem
full loaded transportation
multiple-depot
saving method algorithm
optimal algorithm
