小件货物运送车辆调度优化  

Optimal Algorithm for Solving VRP in Carrying Packages

作　　者：童岱[1] 

机构地区：[1]西华大学交通与汽车工程学院,四川成都610039

出　　处：《西华大学学报（自然科学版）》2005年第5期43-44,65,共3页Journal of Xihua University:Natural Science Edition

摘　　要：针对城市小件货物运送车辆调度优化方法进行了研究,分析了C-W节约算法在解决小件货物运送车辆调度问题的局限性。基于货物的体积和形状对车辆调度的影响,提出用货物的体积进行车辆容量检验,改进了C-W节约算法,使其更加符合小件货物运送车辆调度的实际。This paper researches the vehicle routing problem （VRP） in carrying packages, analyzes the limitation of C-W algorithm to solve VRP for carrying packages. Based on the influence of the volume and shape of the packages on VRP, the article suggests that the volume of the packages should be used to check the vehicle capacity. As a result, the improved C-W algorithm is much better to solve the problem.

关 键 词：小件货物 车辆调度 C-W节约算法 

分 类 号：U492.312[交通运输工程—交通运输规划与管理]