| 遗传算法求解组合优化问题研究 |
| |
| 引用本文： | 罗映红.遗传算法求解组合优化问题研究[J].甘肃科学学报,1997,9(2):46-49. |
| |
| 作者姓名： | 罗映红 |
| |
| 作者单位： | 兰州铁道学院电信与自动控制系 |
| |
| 摘 要： | 利用遗传算法（ＧＡ）的机理分析，提出了求解旅行商问题（ＴＳＰ）的一整套进化策略，并对算法对有效进行了分析，计算机模拟结果表明ＧＡ是求解组合优化问题的一种有效方法。
|
| 关 键 词： | 遗传算法 旅行商问题 优化 组合优化 |
RESEARCH ON HOW TO SOLVE THE PROBLEM OF GETTING THE OPTIMAL COMBINATION IN GA |
| |
| Luo Yinghong.RESEARCH ON HOW TO SOLVE THE PROBLEM OF GETTING THE OPTIMAL COMBINATION IN GA[J].Journal of Gansu Sciences,1997,9(2):46-49. |
| |
| Authors: | Luo Yinghong |
| |
| Abstract: | A comprehensiv set of evotution strategies for solving the Traveling Salesman Problem(TSP)in genetic algorithm(GA) are put forward.Meanwhile the effectiveness of the algorithm is also analized.The results of computer imitation show that GA is an effective way to find the optimal combnation. |
| |
| Keywords: | genetic algorithm travelling salesman problem optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
