| TSP问题的演化算法求解 |
| |
| 引用本文： | 杨殿生.TSP问题的演化算法求解[J].鄂州大学学报,2004,11(4):53-55. |
| |
| 作者姓名： | 杨殿生 |
| |
| 作者单位： | 鄂州大学,教务处,湖北,鄂州,436000 |
| |
| 摘 要： | 该文针对遗传算法在解决排序优化时,交叉操作会导致非法染色体出现,必须使用一些较为复杂的方法加以解决,从而使得计算量增大的问题,提出了一种改进的遗传算法,取消交叉操作,强化变异作用.既简化了遗传操作,又克服了早熟现象,较为成功地解决了TSP问题.
|
| 关 键 词： | 演化算法 组合优化 交叉算子 |
| 文章编号： | 1008-9004(2004)04-0053-03 |
| 修稿时间： | 2004年9月22日 |
A TSP Problem Resolver Based on Evolutionary Algorithm |
| |
| YANG Dian-sheng.A TSP Problem Resolver Based on Evolutionary Algorithm[J].Journal of Ezhou University,2004,11(4):53-55. |
| |
| Authors: | YANG Dian-sheng |
| |
| Institution: | YANG Dian-sheng |
| |
| Abstract: | Aiming at the problem when the heredity algorithm is used to resolve the sequence optimizing, the intercross operation will cause illegal chromosome, so that some more complex methods will be adopted and the calculation will be increased, the author puts forward an improved heredity algorithm, in which the mutual operation is canceled and the variability is strengthened. The improved heredity algorithm, simplifying the heredity operation and overcoming the prematurity phenomena, can solve TSP problem more successfully. |
| |
| Keywords: | Evolutionary Algorithm Sequence Optimizing Intercross Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
