摘要
本文从求解TSP来分析遗传算法,蚁群算法,模拟退火算法三种优化算法特性分析,总结各算法的改进策略及混合算法策略,并提出基于分区的混合算法。
This paper first introduces the basic ideas of three algorithms to solve traveling salesman problem, including genetic algorithm, simulated annealing and ant colony algorithm, summarizes these algorithms features and the strategies to improve. At last a dividing large scale cities into several sub zones hybrid algorithm is introduced.
出处
《科技信息》
2008年第29期231-232,共2页
Science & Technology Information
关键词
旅行商
遗传算法
蚁群算法
模拟退火算法
TSP
genetic algorithm
simulated annealing
ant colony algorithm
