计算机工程Issue(12)：205-208,213,5.DOI:10.3969/j.issn.1000-3428.2014.12.038
基于DNA-蚁群算法的车辆路径优化问题求解
Solution of Vehicle Routing Optimization Problem Based on DNA-ant Colony Algorithm
摘要
Abstract
The ant colony algorithm for solving the Vehicle Routing Problem ( VRP ) has the problem of premature convergence to local optimal solution rather than the global optimal solution and slow convergence speed are still exist. The parameter selection of the ant colony algorithm is not strictly required,and it affects the efficiency of its search for the optimal solution if improper parameter selection. In order to solve these problems,this paper proposes a new DNA-ant colony algorithm. The parameters of basic ant colony algorithm are optimized by the crossover and mutation in DNA algorithm to effectively control the parameters of the ant colony algorithm. It chooses the best parameters to solve the VRP model. Experimental results show the algorithm can find the optimum solution or the optimal solution of VRP model,solve the vehicle routing optimization problem effectively,and improve optimization ability and efficiency of the basic ant colony algorithm.关键词
DNA-蚁群算法/基本蚁群算法/车辆路径优化问题/交叉变异/信息素更新Key words
DNA-ant colony algorithm/basic ant colony algorithm/vehicle routing optimization problem/crossover variation/pheromone update分类
信息技术与安全科学引用本文复制引用
费腾,张立毅,孙云山..基于DNA-蚁群算法的车辆路径优化问题求解[J].计算机工程,2014,(12):205-208,213,5.基金项目
中国物流学会基金资助项目(2012CSLKT027)。 （2012CSLKT027）
