基于DNA-蚁群算法的车辆路径优化问题求解

摘要

蚁群算法在解决车辆路径问题( VRP)时存在过早收敛于局部最优解、收敛速度慢等问题,并且由于蚁群算法的参数选择没有严格规定,如果参数选择不当,将影响其寻找最优解的效率。为解决上述问题,将DNA算法中的交叉变异思想应用于基本蚁群算法中,提出一种新的DNA-蚁群算法,将基本蚁群算法中的参数进行DNA交叉变异,有效控制蚁群算法的参数选择,从而得到一组最优参数来求解VRP模型。实验结果表明,DNA-蚁群算法能有效解决车辆路径优化问题,更快寻找到全局最优解或较优解,提高了基本蚁群算法的寻优能力和效率。%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.