|
|
|
|
|
Ai-Hua Zhou, Li-Peng Zhu, Bin Hu, Song Deng, Yan Song, Hongbin Qiu and Sen Pan
The traveling-salesman problem can be regarded as an NP-hard problem. To better solve the best solution, many heuristic algorithms, such as simulated annealing, ant-colony optimization, tabu search, and genetic algorithm, were used. However, these algori...
ver más
|
|
|
|
|