蚁群和遗传混合算法求解旅行商问题  

Hybrid Algorithm of Generation and Ant Colony on Traveling Salesman Problem

作　　者：金晓龙[1] 

机构地区：[1]广东女子职业技术学院应用设计系,广州511450

出　　处：《电脑开发与应用》2014年第8期44-46,共3页Computer Development & Applications

摘　　要：旅行商是应用广泛的优化组合问题,采用蚁群和遗传混合算法解决旅行商问题,利用遗传算法的交叉、变异机制解决蚁群算法易出现局部最优解的问题,将混合算法在VBA环境调试运行。混合算法与蚁群算法、遗传算法仿真数据比较,混合算法具有较好改进效果。Traveling salesman is a widely used optimized combined question. The ant colony and geneic hybrid algorithm is adopted to solve the traveling salesman problem. The problem that ant colony algorithm is prone to local optima is solved by using crossover and mutation mechanism of genetic algorithm.The hybrid algorithm is debugged in VBA.Finally, the hybrid algorithm is proved to be better than ant colony algorithm and geneic algorithm by comparing running data.

关 键 词：旅行商 蚁群算法 遗传算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]