物流配送车辆路径优化问题的仿真研究  

Vehicle Routing Optimization Problem of Logistics Distribution

作　　者：吴洁明[1] 

机构地区：[1]梧州学院计算机科学系,广西梧州543002

出　　处：《计算机仿真》2011年第7期357-360,共4页Computer Simulation

基　　金：2008年广西科学研究与技术开发计划项目(桂科攻0815003-4)

摘　　要：研究物流配送车辆路径优化问题,由于物流行业要求货物及时配送,又要降低物流运输成本。物流配送车辆路径选择是重点解决的问题,传统优化方法搜索时间长,难以找到最优路径,造成物流配送成本高。为了降低物流配送成本,提高车辆路径优化效率,提出一种蚁群算法的物流配送车辆路径优化算法。首先对物流配送车辆路径问题进行分析,然后建立相应的数学模型,最后采用蚁群算法对车辆路径问题的数学模型进行求解。通过具体实例对算法进行实验,实验结果表明,蚁群算法提高寻优效果,找到的物流配送车辆路径的最优解短于其它算法,降低物流配送成本,并为物流配送车辆路径选择提供了一种有效算法。Logistics distribution vehicle routing optimization problem is studied to reduce logistics transportation cost.Logistics distribution vehicle routing problem is a typical NP problem,traditional optimization methods have the defects of long searching time,difficult to find the optimal path,and high logistics costs.In order to reduce logistics distribution cost and improve vehicle routing optimization efficiency,a logistics distribution vehicle routing optimization algorithm on ant colony algorithm is put forward.Firstly,the logistics distribution vehicle routing problems are analyzed,a corresponding mathematical model established,and then the ant colony algorithm is used to sovle the mathematical model for the vehicle routing problem.The algorithm is verified by experiment with instances,and the experimental results show that the ant colony algorithm can improve optimal effect,the optimal solution of vehicel route is shorter than other algorithms,and the logistics cost is reduced.It is an effective algorithm to sovle the logistics distribution vehicle routing problem.

关 键 词：车辆路径问题 蚁群算法 物流配送 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]