期刊文献+

基于特征进化的混合遗传算法

HYBRID GENETIC ALGORITHM BASED ON CHARACTERISTIC EVOLUTION
下载PDF
导出
摘要 对于遗传算法存在早熟性收敛和收敛速度慢等问题,可通过保护存在于种群中的最小诱导模式和属于收敛优化解或全局最优解的有效基因块,得到有效的改善。通过对种群中个体之间关系分析,建立特征保护策略及特征进化算子,由此改进的混合遗传算法具有较高的收敛速度,并能收敛于规模小于2 000个城市的旅行商问题全局最优解。 The two problems in genetic algorithm, premature convergence and slow-footed convergence, can be efficiently modified by protecting the minimum inducing schema and the effective gene blocks belonged to convergence optimal solution or global optimal solutions, both of them exist in population. Characteristic protection policy and characteristic evolution operators are put forward through analyzing the relationship among individuals in population. New hybrid genetic algorithm improved with them has more fast convergence speed, and is able to converge to global optimal solution of TSP whose scale is less than 2,000 cities.
作者 林冬梅 王东
出处 《计算机应用与软件》 CSCD 2009年第4期246-248,共3页 Computer Applications and Software
关键词 遗传算法 旅行商问题 特征进化 混合算法 Genetic algorithm Travelling salesman problem Characteristic evolution Hybrid algorithm
  • 相关文献

参考文献12

  • 1Xi Y G, Cai T Y, Yun W M. Survey on genetic algorithms [ J ]. Control Theory, Application, 1996,13 (61) :696 - 704.
  • 2Baraglia R, Hidalgo J I, Perego R. A hybrid heuristic for the traveling salesman problem [J]. IEEE Transactions on Evolutionary Computation ,2001,5 (6) :613 - 622.
  • 3Merz P, Freisleben B. Genetic local search for the TSP: New results [C]. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, 1997 : 159 - 164.
  • 4Merz P, Freisleben B. Memetic algorithms for the traveling salesman problem [ J ]. Complex System, 2001,13 ( 4 ) :297 - 345.
  • 5Ports J C,Terri D G, Surya B Y. The development and evolution of an improved genetic algorithm based on migration an artificial selection [J]. IEEE Transactions on Systems, Man and Cybernetics, 1994,24 (1) :73 -86.
  • 6David A, Robert B, VASEK C. Concorde network optimization package [CP/OL]. http ://www. tsp. gatech, edu/concorde/downloads/ codes/ src/co031219. tgz. 1997-08-08/2006-11-07.
  • 7Jones T, Forrest S. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms [C].//ESHFILMAN L. Proceeding of the 6th International Conference on Genetic Algorithms. San Mateo,CA:Morgan Kauffrnan,1995:184 - 192.
  • 8Lin S, Kernighan B W. An effective heuristic algorithm for the traveling-salesman problem [J]. Operations Research, 1973,31:498 - 516.
  • 9Boese K. Cost versus distance in the traveling salesman problem[ R]. Technical Report,TR-950018, CS Department, UCLA, 1995.
  • 10Lin S, Kernighan B W. An effective heuristic algorithm for the traveling- salesman problem [ J ]. Operations Research, 1973,31:498 - 516.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部