求解旅行商问题的改进育种算法  

An Improved Breeding Algorithm of Solving Traveling-Salesman Problems

作　　者：高尚[1] 

机构地区：[1]江苏科技大学电子信息学院

出　　处：《航空计算技术》2007年第6期16-18,21,共4页Aeronautical Computing Technique

摘　　要：介绍了基本育种算法,提出了求解旅行商问题的育种算法,给出了4种变异策略,算法的测试表明,策略D是一种简单有效的算法。在分析基本育种算法特征基础上,提出了改进育种算法,对CTSP问题进行了仿真实验,仿真研究表明,改进后的育种算法具有优良的性能。The principle of basic breeding algorithm is introduced and the breeding algorithm of solving traveling - salesman problems is given. Four mutation strategies are put forward. And strategy D is a simple and effective algorithm by tests. An improved breeding algorithm is presented based on analysis characteristic of basic breeding algorithms. The CTSP is simulated using an improved breeding algorithm, and the simulation results show that the improved breeding algorithm has excellent properties.

关 键 词：旅行商问题 育种算法 遗传算法 模拟退火算法 

分 类 号：O24[理学—计算数学]