搜索资源列表
AS_GA_PSO
- 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。-Genetic algorithm (ga) to solve minimum spanning tree problem, PURFER encoding.Particle swarm algorithm for unconstrained optimization problems.Ant colony algorithm to solve TSP problem.
TSP_GA
- solve the TSP problem by GA
gatsp1
- 采用遗传算法ga解决旅行商问题tsp，是用MATLAB语言编写的，并且注释很详细。-Ga genetic algorithm to solve the traveling salesman problem tsp, with MATLAB language, and very detailed comments.
weka
- tspData <- read.csv( D:\\weka\\hw\\TSP.csv , header = T, sep = , ) #tspData <- `colnames<-`(tspData,c(1:8)) D <- as.matrix(tspData) tourLength <- function(tour, distMatrix) { tour <- c(tour, tour[1]) route <- embed(tou
ga_tsp
- 遗传算法小程序,关于解决TSP问题的遗传算法,仅供参考-GA small program on the settlement of the TSP Genetic Algorithm for reference purposes only and interact more
yichuan
- 使用遗传算法解决旅行商问题，算法清晰，可运行。-GA for solving TSP problem
tspga
- 遗传算法求解tsp问题，可处理tsp95lib中的任意文件。-It is the program use to GA algorithm to slove tsp problem, it can deal tsp95lib s all file.
daimayasuo
- 包含：基于蚁群算法求解对称非对称旅行商问题 粒子群优化算法演示(PSO) 基于遗传算法(GA)的多变量旅行商问题(TSP) 遗传算法优化BP 神经网络在数据预测方面的应用 金融数量分析相关代码-Comprising: Solving Symmetric Asymmetric Traveling Salesman Problem Based on Ant Colony Algorithm Particle Swarm Optimization Demo (PSO) Mult
mdmtspv_ga
- This code is aimed at solving the multiple depots multiple traveling salesman problem by using genetic algorithm.Finding a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for t
Multiple-Traveling-Salesmen-Problem
- 多旅行商matlab实验源码实现了三种多旅行商问题,使用了遗传算法，可以在matlab2010a以上版本运行-MTSPOF_GA Fixed Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Travelling-Salesman-Problem-Genetic-Algorithm--ma
- Solving Tsp using ga in scilab
GA_TSP
- 本程序包含遗传算法主程序，用于解决GA在TSP中的应用问题。包含有cross exchang mutation fit等多个子程序。对于TSP问题可以直接拿来用，其他问题可以稍加修改或利用其中的GA程序。-This program includes the main program, the genetic algorithm (GA) is used to solve the problem of GA in the application of TSP. Contains a cross e
GAforTSP
- VC++ 6.0环境下利用遗传算法求解三十个城市的旅行商（TSP）问题-GA for TSP
GA4TSPProblem-master
- 在matlab上使用遗传算法解决TSP旅行者问题: TSP问题指的是从一个节点开始遍历其他所有节点并回到初始节点，构成一个哈密顿回路，节点与节点之间距离不同，目标是找到一条回路使得总路程最短，也就是走最短的路遍历所有节点回到起点 遗传算法模仿达尔文进化论中优胜劣汰的思想，从随机初始总群开始，不断进化最终选出接近最优解的一代，从而求解出近似最优解-use GA to solve the problem for TSP，which can find the approximate optim
1
- A Performance Comparison of PSO and GA Applied to TSP
Multiple Traveling Salesmen Problem
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exa
GA for TSP - Final
- 用遗传算法实现旅行商问题，可选择城市数量(Traveling salesman problem is realized by genetic algorithm, and the number of cities can be selected.)