搜索资源列表
SGALAB1003beta3withdoc
- run the SGALAB_MO_VEGA_demo.m in command windows. to get beta3 version here: http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=5882 What s new: 1)fixed a critical bug in selection operation 2)update the 13 c
DrawCityLine
- 50个城市以内的TSP问题, 用遗传算法, 算子采用了pmx和ox算子。-50 cities within the TSP, genetic algorithm, the operator used pmx and ox operator.
TSPprogrammatlab
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to return to t
myyqtsp
- 用vc++实现的蚁群算法解决50个以内的城市的tsp问题。 -vc used to achieve the ant algorithm within the 50 cities tsp problems.
GATSP48
- 一个遗传算法的程序,实现了48个城市的TSP算法.用VC++环境下使用-a genetic algorithm procedures, the 48 cities in the TSP algorithm. VC environment with the use of
SimulatedAnnealing(TSP)CSHARP
- 运用c＃语言实现模拟退火算法，同时利用该算法解决旅行商（TSP）问题，获得遍历所有城市序号的最优路径。-use c # language simulated annealing, while using the algorithm to solve traveling salesman (TSP). access to the serial numbers of all the cities traverse the optimal path.
ant-tsp-elimcross
- 蚁群算法求解tsp问题后去交叉.数据为att48，48个城市的tsp -Ant Algorithm tsp problems to cross. Att48 data, the 48 cities tsp
TSPproblem
- 遗传算法解决TSP问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-genetic algorithm known TSP n cities between the distance, must present a salesman traveled this n cities, and each city can only be visited once, La
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 of basic run.bat see, see the
TSP
- TSP双种群蚁群算法。还包括了“30城市TSP问题数据与最优解.mat”，“75城市TSP问题数据.mat”，和“442TSP问题数据与算法对比.mat”-TSP-Stocks ant colony algorithm. Also include "30 cities TSP data and the optimal solution. Mat, " "75 cities TSP data. mat, " and "442TSP problem
Tsp
- 使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane
模拟退火算法实现旅行商算法
- 采用的是康力山等人确定的实验参数。 对于n个城市的旅行商问题，其参数如下： 初始温度：t0=280, 每一个温度下采用固定的迭代次数L=100n, 温度的衰减系数alpha=0.92 算法停止的准则是当相邻两个温度得到的解变化很小时算法停止。-used the Stanozolol Hill were determined by the experimental parameters. N cities for the traveling salesman problem, the para
tsp_SA.rar
- 在Visual C++ 编译环境下， 模拟退火算法算法的程序，并利用它们求解了48个城市的TSP问题。,In Visual C++ compiler environment, simulated annealing algorithm algorithm procedures and use them to solve the 48 cities TSP problem.
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
TSP-gene
- 是用遗传算法解决TSP问题，测例包括10个城市和30个城市。使用PMX交叉算子。-Is to use genetic algorithms to solve TSP problems, test cases, including 10 cities and 30 cities. Using the PMX crossover.
GA_TSP
- 利用遗传算法求解TSP问题。TSP问题描述如下：给定一组n个城市和他们两两之间地直达距离，寻找一条闭合的旅程，使得每个城市刚好经过一次而且总的旅行距离最短。 -The use of genetic algorithm to solve TSP problem. TSP problem described as follows: given a set of n cities and they are between 22 to direct the distance of the journey
GA-TSP
- 遗传算法求解TSP问题。包含6个文件。用matlab打开gatsp1.m，点击运行即可以得出结果。distTSP.txt文件包含了城市数据。如果更改了城市数，则须修改gatsp1.m文件中的N参数。-Genetic algorithm for TSP. Contains 6 files. Using matlab to open gatsp1.m, click on the results of running that can be drawn. distTSP.txt file contai
hopfield-for-tsp
- 利用hopfield神经网络解决50个城市tsp问题，适合初学者。-Hopfield neural network using 50 cities tsp solve problems, suitable for beginners.
particle_swarm_optimization-Solve-the-TSP-problem.
- 基于粒子群优化算法（PSO）的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Based on Particle Swarm Optimization (PSO) of the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
genetic_algorithm
- 用matlab编写的求解10城市、31城市、70城市的TSP遗传算法，供大家学习只用，算法简洁明了，注释全，易理解。-Using matlab to solve 10 cities, 31 cities, 70 cities TSP genetic algorithm, only for them to learn the algorithm concise, notes the whole, easy to understand.