搜索资源列表
TravelingSalesmanProblemwithGeneticAlgorithm
- 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)
HopfieldExperiment
- 采用Hopfield网络解决旅行商问题,收敛速度快。-using Hopfield network to solve the traveling salesman problem, and fast convergence.
travelingsalemanproblem
- 主要解决旅行商问题(traveling saleman problem,简称tsp,即已知n个城市之间的相互距离,现有一个推销员必须遍访这n个城市,并且每个城市只能访问一次,最后又必须返回出发城市,求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n betwee
MAOS_TSP
- 用于求解TSP(Traveling salesman problem,旅行商问题)问题,基本执行见run.bat, 其它详见其中的readme.txt。(实例为TSPLIB格式,见myprojects目录,包括eil51, d198, lin318等小型问题,以及1000到3000城市之间的例子,基本能得到最优解)-for TSP (Traveling salesman problem, TSP), the implementation
TSP
- 旅行商问题: 某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He s
hopfieldTSP
- 利用hopfield神经网络解决TSP(旅行商)问题-use hopfield neural network to solve TSP salesman problem (TSP)
GA_TSA
- 利用遗传算法解决TSP旅行商问题的Java原码-using genetic algorithms to solve the traveling salesman problem TSP original Java code
SA_TSA
- 利用模拟退火算法解决旅行商问题的java原码-using simulated annealing algorithm to solve the traveling salesman problem java original code
tspsa
- 旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem)
tsp
- tsp问题俗称旅行商问题,一个商人从一个城市出发,经过所有的城市一次且仅一次回到出发的城市,问旅行商应当如何选择路径使总路径最短。本程序是用lingo软件编写的,只需要更改城市的数目以及距离矩阵即可。-tsp problem commonly known as the traveling salesman problem, a businessman from a city of departure, after all of the
TravelingSalesmanProblemGeneticAlgorithm
- 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)
TSP
- 这是一个用遗传算法来求解旅行商问题(TSP问题:Travelling Salesman Problem)的源代码,学习遗传算法,演化计算的很值得一看!-This is a genetic algorithm to solve the traveling salesman problem (TSP problems: Travelling Salesman Problem) source code, learning genetic al
TSP(TravelingSalesmanProblem)
- 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 numb
tsp-ga
- 基于遗传算法解决旅行商问题的vc++源码。-Based on genetic algorithm to solve the traveling salesman problem vc++ Source.
tsp
- 用模拟退火算法解决旅行商问题,算法较简单-Using simulated annealing algorithm to solve traveling salesman problem, relatively simple algorithms
TSP
- 用遗传算法解决旅行商问题,并用图形界面显示出来。比较了分别采用轮盘赌选择算子和锦标赛选择算子的遗传算法求解TSP问题的性能,包括:运行时间、进化总代数和最优解质量。 结果曲线可以用图形显示出来。-Genetic algorithm is used to solve the traveling salesman problem, and use graphical interface is displayed. Compared usin
huishufa
- 用分支限界法求界旅行商问题,用C++语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
tspapp
- 遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and r
java-tsp-1.3-src
- Traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
multisp
- 使用MPI编写一个并行程序,利用遗传算法来解决旅行商问题。-The use of MPI to prepare a parallel process, the use of genetic algorithm to solve the traveling salesman problem.