摘要
在以往的车辆路径问题研究中,配送中心的货车为同一车型(车辆的最大载重量和最大行驶距离相近),考虑到不同车型的货车配送费用不同,配送中心可根据需求点的需求量和距离来选择较小费用的车辆,以减小配送成本,因此求解一个时间窗的多车型车辆路径问题更具实际意义。基于此问题进行研究,建立相应的数学模型,运用改进的蚁群算法对建立的模型进行求解。最后,通过对不同车型求解结果的对比,证明建模及求解算法的有效性和选用多车型车辆配送的科学性。
In the research of vehicle routing problem of the past, distribution center truck for the same model （the maximum load and maximum distance of the vehicle is the same）. Considering the different models of truck distribution costs, distribution center can choose according to the demand of demand point and the distance smaller cost of vehicles,to reduce the distribution cost, therefore solving a soft time windows for vehicle routing problem is more practical significance. In this paper, based on the soft time windows of many models of vehicle routing problem, establish the corresponding mathematical model, the improved ant colony algorithm is used to solve model, Finally, based on the comparison between results of different models of solving, prove the validity of the modeling and algorithm of this article and use models of vehicle distribution more scientific.
出处
《交通科技与经济》
2015年第4期71-74,78,共5页
Technology & Economy in Areas of Communications
关键词
物流配送
车辆路径问题
时间窗
改进蚁群算法
logistics distribution
vehicle routing problem
soft time windows
improved ant colony algorithm
