Neural Network with Transient Chaos (TCNN) can be used to solve the Traveling Salesman Problem (TSP).
具有瞬态混沌特性的神经网络(TCNN)可以解tsp。
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)复杂得多。
应用推荐