旅行商问题的贪心求解算法
he greedy algorithm for the traveling salesman problem
旅行商问题是组合数学中一个古老而又困难的问题, 至今尚未彻底解决。因此，人们转向寻找近似算法或启发式算法, 其中较有成效的是反馈神经网络法和遗传算法。我们学习了各类旅行商问题的求解方法，并重点学习了遗传算法。同时我们在前人研究的基础之上，提出了一种新的贪心遗传算法，实验结果表明这个方法是行之有效的。
he traveling salesman problem is an old and difficult problem in combinatorialmathematics，which have not been completely resolved yet .Therefore, people turn to find approximate algorithm or heuristic algorithm,in which the more effective is the feedback neural network and genetic algorithm.We studied all kinds of methods of solving traveling salesman problem,and the study is focused on the genetic algorithm.In this paper,author propose a new greedy genetic algorithm and the experimental results show that this method is effective.
吴飞跃、姚香娟、周龙强、周扬、孙政庭
数学计算技术、计算机技术
旅行商问题，多目标问题，遗传算法，种群
he traveling salesman problemThe multi-objective problemGenetic algorithmPopulation
吴飞跃,姚香娟,周龙强,周扬,孙政庭.旅行商问题的贪心求解算法[EB/OL].(2014-04-28)[2025-08-11].http://www.paper.edu.cn/releasepaper/content/201404-388.点此复制
评论