| 用列队竞争算法解旅行商问题 |
| |
| 引用本文： | 鄢烈祥.用列队竞争算法解旅行商问题[J].运筹与管理,1999,8(3):24-30. |
| |
| 作者姓名： | 鄢烈祥 |
| |
| 作者单位： | 湖北工学院化工系!湖北武汉430068 |
| |
| 摘 要： | 给出了列队竞争算法解组合优化问题的框架和确定变异邻域的两条原则。用列队竞争算法解旅行商问题获得了满意的结果，显示出列队竞争算法良好的全局搜索性能。
|
| 关 键 词： | 列队竞争算法 进化算法 组合优化 旅行商问题 |
Solving Traveling Salesman Problem with Line up Competition Algorithm |
| |
| YAN Lie,xiang.Solving Traveling Salesman Problem with Line up Competition Algorithm[J].Operations Research and Management Science,1999,8(3):24-30. |
| |
| Authors: | YAN Lie xiang |
| |
| Abstract: | The framework is given for solving combinatorial optimization problems with Line up Competition Algorithm (LCA), and the two principles of determining mutation neighbor region is presented. By using LCA to solve traveling salesman problem , satisfactory results are obtained. Examples show that LCA has good global search characteristic. |
| |
| Keywords: | line up competition algorithm evolutionary algorithm combinatorial optimization traveling salesman problem |
| 本文献已被 CNKI 维普 等数据库收录！ |
