摘要
物流配送车辆路径优化问题已被证明是一个NP难题,很难得到最优解。应用蚁群算法对带时间窗的物流车辆路径优化问题进行了算法设计,建立了车辆路径优化问题的蚁群算法数学模型及解决方案。通过对蚁群算法的分析,提出了改进的蚁群算法,并结合实例对该算法进行测试和分析,检验其有效性,结果表明了改进蚁群算法的可行性,符合实际的需要。
Logistics distribution vehicle routing optimization problem has been proven to be a NP problem, which is difficult to get an optimal solution. The algorithm of logistics vehicle routing with time windows is designed by using ant colony algorithm.Mathematical model and solution of vehicle routing optimization are established. Through analyzing the ant colony algorithm, the improved ant colony algorithm is proposed. The algorithm is tested and analyzed by examples. The validity of the improved ant colony algorithm is ensured, proving the feasibility of the improved ant colony algorithm, which can accord with the actual needs.
出处
《计算机时代》
2015年第3期21-24,共4页
Computer Era
关键词
物流配送
车辆路径
蚁群算法
时间窗
logistics distribution
vehicle routing
ant colony algorithm
time windows
