基于改进蚁群算法的物流配送路径问题研究

针对蚁群算法求解物流配送路径问题易陷入早熟、停滞、局部最优的缺点,提出了混沌、变异与最大最小蚂蚁算法相融合的改进蚁群算法。在仿真实验中,分别采用最大最小蚂蚁算法、加入混沌的最大最小蚂蚁算法、加入变异的最大最小蚂蚁算法、加入混沌和变异的最大最小蚂蚁算法对物流配送路径问题进行求解。实验结果表明,加入混沌和变异的最大最小蚂蚁算法能够有效提高蚁群算法的全局寻优能力,对物流配送路径问题的求解能够得出比较好的结果。

A Study of the Logistic Distribution Routing Problem Based on the Improved Ant Colony Algorithm

The ant colony algorithm solving the logistic distribution routing problem is prone to prematurity,stagnation and local optimum.In order to overcome this defect,a mixed algorithm of the MAX MIN ant system,chaos and mutation is proposed.In the simulation experiments,the max min ant algorithm,the mixed algorithm of the MAX MIN ant system and chaos,the mixed algorithm of the MAX MIN ant system and mutation,the mixed algorithm of the MAX MIN ant system,chaos and mutation are respectively adopted to solve the logistic distribution routing problem.Experiments show that the mixed algorithm of the MAX MIN ant system,chaos and mutation is better to enhance the global optimization capacity of the ant colony algorithm,as well as to achieve better results for the logistic distribution routing problem.