搜索资源列表
yichuan
- 遗传算法求旅行商，送货商，邮递员，灾情巡视等问题，是一种近似算法。-Genetic algorithm to solve the traveling salesman, delivery companies, mail carriers, disaster inspections and other issues, is an approximation algorithm.
genic_traveller
- 遗传算法解决旅行商问题，程序中附有注释，可以帮助你理解程序-Genetic algorithm to solve traveling salesman problem
Cgan
- 改进的遗传算法求解旅行商问题~改进了遗传算子~-C language interface of genetic algorithms are ~ ~
monituihuo_GA
- 用模拟退火算法和遗传算法的混合算法求解旅行商问题-By simulated annealing algorithm and genetic algorithm hybrid algorithm for Traveling Salesman Problems
tsp
- 用遗传算法求解tsp旅行商的源代码 有详细过程及注解-Tsp TSP by genetic algorithm source code for a detailed process and comments
TSP_aco
- 用遗传算法解决旅行商问题，是比较简单的一个程序，但可以运行。-a procedure about GA applied in solving TSP problem
TSP
- ＪＡＶＡ语言实现的遗传算法解决TSP（旅行商问题），主要有三个简单的Java类。-JAVA language of the genetic algorithm to solve TSP (traveling salesman problem), there are three simple Java class.
31townGA
- 一个旅行商的问题，关于31个城市的遗传算法-A traveling salesman problem, in 31 cities on the genetic algorithm
rounter
- 多旅行商问题的遗传算法解决，内附数据和题目。适合要求不高的路径优化。-Multiple traveling salesman problem genetic algorithm, containing data and topics. Suitable for less demanding path optimization.
AI_TSP_GA
- 用遗传算法解决旅行商问题，算法结构简单、清晰、明了。-Using genetic algorithm to solve traveling salesman problem.
mtspv_ga
- 基于遗传算法对旅行商问题的求解、包括图表的输出-Based on genetic algorithm for solving the traveling salesman problem, including the output of the chart
program
- 基于遗传算法的旅行商问题求解 旅行商问题：假设有一个推销员，要到 n 个城市推销商品，他要找出一个包含所有 n 个城市的具有最小开销的环路-Traveling Salesman Problem Based on Genetic Algorithm for Traveling Salesman Problem: Suppose a salesman, to sell goods to the n cities, he has to find a city that contains all n
TSPsolver
- 用遗传算法解决TSP（旅行商）问题的程序-Using Genetic Algorithm for TSP (traveling salesman problem) program
traveling-salesman-problem
- 遗传算法解决旅行商问题,遗传算法对解决NP问题.-Genetic algorithm to solve traveling salesman problem, genetic algorithm to solve the NP problem.
ga_tsp
- 遗传算法解决旅行商问题 很好的解决了TSP 这个 典型的NP-HARD问题-Genetic algorithm for TSP
tsp
- 遗传算法在求解旅行商问题中的应用，采用二进制Gray编码,采用基于轮盘赌法的非线性排名选择, 均匀交叉,变异操作,而且还引入了倒位操作!-Genetic Algorithm for Traveling Salesman Problem, using a binary Gray code, roulette method based on linear ranking selection, uniform crossover and mutation operators, but also in
gatsp
- 应用遗传算法解决旅行商问题，其中在本程序中是10个城市的TSP，并仿真结果表明本例中遗传算法各个环节所采用的方法都是先进而有效的。-Application of genetic algorithm to solve traveling salesman problem, which is in the program in 10 cities TSP, and simulation results show that the genetic algorithm in this case all
yichuan
- 本程序利用遗传算法实现对31个城市的旅行商为题的遍历-The program uses genetic algorithms to achieve the 31 cities traversed the theme of traveling salesman
src
- 利用遗传算法求解旅行商问题。 使用C++语言编程。使用VS2008编译环境，没有使用额外的库，运 行环境为w7操作系统。-Genetic Algorithm for Traveling Salesman Problem. Use C++ programming language. Using the VS2008 compiler environment, without using additional libraries, the operating system runtime e
a
- 用遗传算法解决旅行商问题(附源代码)，遗传算法其实是一种求函数极值的随机搜索算法。-Solving the traveling salesman problem using genetic algorithms (with source code), genetic algorithm is a kind of extreme demand function of random search algorithm.