摘要
文章针对TSP最短回路问题,引入一类递增插入算子,由此得到递增插入算法,该算法是单点插入算法和交叉算法的更一般形式。通过对随机案例和eil101案例寻优并比较分析,其结果明显好于蚁群算法与遗传算法融合后的求解效果,同时计算量和迭代次数较少。
In this paper,a kind of increasing insert operator is introduced to solve the TSP shortest loop problem,and an increasing insert algorithm is obtained.This algorithm is a more general form of single-point insert algorithm and cross algorithm.Through the optimization and comparative analysis of the random case and eil101 case,the result is obviously better than that of the ant colony algorithm and the genetic algorithm,and the computing times and iterative times are less.
作者
邹进
ZOU Jin(School of Mathematics and Information Science,Leshan Normal University,Leshan Sichuan 614000,China)
出处
《乐山师范学院学报》
2019年第8期1-6,共6页
Journal of Leshan Normal University
关键词
TSP
递增插入算法
组合优化
蚁群算法遗传算法
TSP
Increasing Insert Algorithm
Combinatorial Optimization
Ant Colony Algorithm
Genetic Algorithm
