排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators 总被引:8,自引:0,他引:8
P. Larrañaga C.M.H. Kuijpers R.H. Murga I. Inza S. Dizdarevic 《Artificial Intelligence Review》1999,13(2):129-170
This paper is the result of a literature study carried out by the authors. It is a review of the different attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with different standard examples using combination of crossover and mutation operators in relation with path representation. 相似文献
1