| 基于并行遗传算法多旅行商问题的求解 |
| |
| 引用本文： | 吴云,姜麟,刘强.基于并行遗传算法多旅行商问题的求解[J].微型电脑应用,2011,27(7):45-47,71. |
| |
| 作者姓名： | 吴云 姜麟 刘强 |
| |
| 作者单位： | 昆明理工大学理学院,云南昆明,650500 |
| |
| 摘 要： | 以往求解多旅行商问题的研究仅局限于以各旅行商路程总和最小为优化标准的传统遗传算法,而没有考虑他们的速度和所花时间。在MPI并行环境下,用C++语言实现了粗粒度模型的并行遗传算法。结合并行遗传算法的特点,提出了解决多旅行商问题的策略以及给出相应的算法过程,并进行了有效验证。通过研究结果表明,与传统遗传算法相比,并行遗传算法提高了运算速度,降低了平均开销时间并且最小总路径值更理想。
|
| 关 键 词： | 并行遗传算法 多旅行商问题 消息传递 |
A Solution to multiple traveling salesman problem Based on Parallel Genetic Algorithm |
| |
| Wu Yan,Jiang Lin,Liu Qiang.A Solution to multiple traveling salesman problem Based on Parallel Genetic Algorithm[J].Microcomputer Applications,2011,27(7):45-47,71. |
| |
| Authors: | Wu Yan Jiang Lin Liu Qiang |
| |
| Affiliation: | Wu Yan,Jiang Lin,Liu Qiang (Faculty of Science,Kunming University of Science and Technology,Kunming 650500,China) |
| |
| Abstract: | Previous reseaches on the problem of multiple traveling salesmen were only limited to that employed total-path-shortest as the evaluating rulefor the traditional genetic algorithm, without consider their speed and time spent. Under MPI, parallel genetic algorithms based on coarse-grained modelwas realized in this article,which C++ language was used. Combining the characteristics of parallel genetic algorithm,a strategy of multiple travelingsalesman problem was proposed,the corresponding process of algorithm... |
| |
| Keywords: | Parallel Genetic Algorithm Multiple Traveling Salesman Problem Message Passing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
