搜索：Traveling+Salesman
找到约 37 项符合「Traveling+Salesman」的查询结果
结果 37
按分类筛选
https://www.eeworm.com/dl/518/227038.html
数值算法/人工智能
A Genetic Algorithms and the Traveling Salesman Problem
A Genetic Algorithms and the Traveling Salesman Problem
https://www.eeworm.com/dl/650/210208.html
人工智能/神经网络
用于求解TSP(Traveling salesman problem
用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解） ...
https://www.eeworm.com/dl/665/462039.html
matlab例程
a program about Traveling Salesman Problem (TSP) Genetic Algorithm
a program about Traveling Salesman Problem (TSP) Genetic Algorithm
https://www.eeworm.com/dl/650/482147.html
人工智能/神经网络
Solve the traveling salesman problem with a genetic algorithm.
Solve the traveling salesman problem with a genetic algorithm.
https://www.eeworm.com/dl/650/449363.html
人工智能/神经网络
Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
https://www.eeworm.com/dl/633/291395.html
Java编程
Traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
Traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
https://www.eeworm.com/dl/665/313199.html
matlab例程
TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect
TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.
https://www.eeworm.com/dl/652/255944.html
文章/文档
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optim
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities ...
https://www.eeworm.com/dl/665/237671.html
matlab例程
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algo
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
https://www.eeworm.com/dl/650/198173.html
人工智能/神经网络
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be speci ...