GA easily traps in permutation for (NP-hard) problem such as TSP, especially when the city scale is large.
在解决像旅行商这类组合优化中的NP完全问题，是极易陷入早熟收敛，城市规模越大越难求得最优解。
GA easily traps in permutation for (NP-hard) problem such as TSP, especially when the city scale is large.
在解决像旅行商这类组合优化中的NP完全问题，是极易陷入早熟收敛，城市规模越大越难求得最优解。
应用推荐