| 求旅行商(TSP)问题的几种改进遗传算法的比较分析 |
| |
| 引用本文： | 张燚,华斌.求旅行商(TSP)问题的几种改进遗传算法的比较分析[J].科技广场,2007(1):25-27. |
| |
| 作者姓名： | 张燚 华斌 |
| |
| 作者单位： | 天津财经大学信息科学与技术系,天津,300222 |
| |
| 基金项目： | 天津市科技计划发展项目支持项目(立项人:华斌，项目名称:科技经费管理决策支持系统，项目编号:06YFGZGX05500)。 |
| |
| 摘 要： | 随着现代科技的发展,待研究问题的规模与难度越来越大,单一的算法已经不能很好地解决问题。本文在阅读了大量关于混合遗传算法论文的基础上,总结了三种能够比较有效地求解旅行商(TSP)问题的改进型遗传算法,并阐述了它们的基本思想以及操作步骤。最后指出了它们的优缺点和今后的研究方向。
|
| 关 键 词： | 改进遗传算法 模拟退火算法 知识库 贪婪算法 |
| 文章编号： | 1671-4792-（2007）1-0129-02 |
Comparative Analysis of Several Improved Genetic Algorithm for Traveling Salesman Problem |
| |
| Zhang Yi,Hua Bin.Comparative Analysis of Several Improved Genetic Algorithm for Traveling Salesman Problem[J].Science Mosaic,2007(1):25-27. |
| |
| Authors: | Zhang Yi Hua Bin |
| |
| Abstract: | With the development of modern technology, the scale and difficulty of the problems are bigger and bigger, Single algorithm can not solve them well.Based on reading lots of paper of hybrid genetic algorithm, this paper summarizes three improved genetic algorithm for traveling salesman problem (TSP), expounds their basic thoughts and processes.At last, the advantages and disadvantages of them and the research way for the future are pointed out. |
| |
| Keywords: | Improved Genetic Algorithm Simulated Annealing Algorithm Case Base Greedy Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
