Uc��oluk
Download:
|
|
unknown authors
http://www.ceng.metu.edu.tr/~ucoluk/research/publications/tsp.ps.gz
Add To MetaCart
Abstract:
In this work an alternative representation for permutations which is robust under ordinary crossover and mutation, is proposed. This method is used for solving the TSP. 1
Citations
| 115 | A study of permutation crossover operators on the traveling salesman problem,” Proc. Of the Second Int. Conf. Genetic Algorithms, Lawrence Erlbaum Associates – Oliver, Smith, et al. - 1987 |
| 82 | Applying adaptive algorithms to epistatic domains – Davis - 1985 |
| 29 | Algorithmic combinatorics – Even - 1973 |
| 2 | the Travelling Salesman Problem, in:J.J. Grefenstette (ed – Goldberg, Lingle, et al. - 1985 |
