安徽工程大学学报2016，Vol.31Issue(2)：64-67,4.
基于改进萤火虫算法的TSP问题
Travel salesman problem based on improved firefly algorithm
摘要
Abstract
According to the characteristics of travel salesman problem,an improved firefly algorithm is proposed.Firstly,a new distance formula are location update formula is redefined.Secondly,in order to increase the diversity of firefly swarms,avoid quick convergence to local optimal solution and save time, genetic algorithm is introduced.Finally,simulation experiments show that the improved algorithm can find the global optimal solution with less evolving time,and the proposed method is feasible and effec-tive.关键词
旅行商问题/改进的萤火虫算法/遗传算法Key words
travel salesman problem/improved firefly algorithm/genetic algorithm分类
信息技术与安全科学引用本文复制引用
胡楠,徐晓光..基于改进萤火虫算法的TSP问题[J].安徽工程大学学报,2016,31(2):64-67,4.基金项目
安徽省高等学校省级自然科学研究项目(KJ2014A024) （KJ2014A024）
