By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.

通过选择合适的算子和参数，遗传算法(GA)可以有效求解旅行商问题(tsp)。

youdao

Solving Traveling Salesman problem (TSP) is an important problem in Genetic Algorithm's Application, it is an optimization problem of the TSP path encoding in essence.

求解tsp问题是遗传算法应用的一个重要领域，其本质是TSP问题中巡回路径编码串的组合最优化问题。

youdao

The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).

影片递送问题（简称FDP）是组合优化的一个新问题，它比旅行商问题（简称TSP）复杂得多。

youdao