The solution on The Traveling Salesman Problem which is a famous problem in the combination optimal mathematics is very profound.
货郎担问题是组合优化中的著名问题,到目前为止它还没有一个有效算法。
By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.
通过选择合适的算子和参数,遗传算法(GA)可以有效求解旅行商问题(tsp)。
The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).
影片递送问题(简称FDP)是组合优化的一个新问题,它比旅行商问题(简称TSP)复杂得多。
应用推荐