Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Hashemi, Vahid Haji"'
Autor:
Borna, Keivan, Hashemi, Vahid Haji
Publikováno v:
International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol. 4, No.4, August 2014, 47-53
The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm (GA) is one of the most useful algorithms for solving this problem. In this paper a conventional GA is compared with an improved hybrid GA in solvin
Externí odkaz:
http://arxiv.org/abs/1409.3078