搜索资源列表
yqsfmatlab.rar
- 强大的蚁群算法matlab程序源代码，可以迅速求解vrp等np难问题。,Ant colony algorithm matlab powerful source code, you can quickly solve the difficult problem of np such vrp.
PSO-TSP.rar
- 本程序是一个用POS来求解NP难问题，比图TSP问题，实际仿真效果证明改算法合理,This procedure is a POS to use NP hard problem to solve than the TSP problem graph, the actual simulation results prove that a reasonable change algorithm
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.
QoSRoute-GA
- 带有QoS约束的组播路由问题是一个NP完全问题，遗传模拟退火算法是遗传算法和模拟退火算法的一种融合，可以为这类问题提供一个解决方案-With QoS constraint multicast routing problem is an NP-complete problem, genetic simulated annealing algorithm is a genetic algorithm and simulated annealing algorithm as a fusion, you
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
tabu_search-Solve-the-TSP-problem
- 基于禁忌搜索算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Tabu search algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
genetic_algorithm-Solve-the-TSP-problem
- 基于遗传算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Genetic Algorithm Based on 50 cities TSP problem solving can be extended to a similar NP-hard problem.
detectors
- application of Bayes detector and NP detector examples with matlab
anp
- NP是美国匹兹堡大学的T.L.Saaty 教授于1996年提出了一种适应非独立的递阶层次结构的决策方法，它是在网络分析法（AHP）基础上发展而形成的一种新的实用决策方法。其关键步骤有以下几个： 1 确定因素，并建立网络层和控制层模型。 2 创建比较矩阵。 3 按照指标类型针对每列进行规范化。 4 求出每个比较矩阵的最大特征值和对应的特征向量。 5 一致性检验。如果不满足，则调整相应的比较矩阵中的元素。 6 将各个特征向量单位化(归一化)
swarm_optimization-Solve-the-TSP-problem
- 一个基于粒子群优化算法源码,（PSO）的50个城市TSP问题的求解，可推广至类似NP.-A source code based on particle swarm optimization, (PSO) of the 50 cities TSP problem solving, can be extended to similar NP.
NP
- 基于模拟退火的粒子群算法，基于自然选择的粒子群算法，基于杂交的粒子群算法-Based on simulated annealing particle swarm algorithm, based on natural selection, particle swarm optimization, particle swarm optimization based on hybrid
SAarithmetic
- A SA arithmetic desolve a NP problem of TSP。The result is not bad
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
Neyman_Pearson
- Neyman_Pearson 根据NP原理对软木塞进行分类的完整函数。部分如下： function []=Neyman_Pearson(opt) 从excel中读进数据 [source,txt]=xlsread( CORK_STOPPERS.xls , Data ) 读取CORK_STOPPERS.xls文件里Data sheet里的数据， 数据存放在source变量里，文本存放在txt变量里 data=[source(:,3:4),source(:,9)] 将用到的三
matlab
- 基于遗传算法的投影寻踪代码，提供大家下载，方便查阅-【研学堂】【代码】投影寻踪代码，请验用！！ function Qa=Project_Pursuit(X,a,Alpha) 输入参数列表 X 本指标矩阵，n×p的矩阵，每一行为一个样本， Xij表示第i行第j列指标，X是否已经归一化均可 a 投影向量，1×p的矩阵，元素取值范围-1～1，要求其元素平方和等于1 Alpha 窗口半径系数，典型取值0.1
matlab-np-solve
- 各类实现np问题的matlab算法，本人做4年数学建模累积的，内有蚁群，bintlp，弗洛伊德，kruskal等等程序-Np problem matlab realize all kinds of algorithms, mathematical modeling I did four years of accumulation, there colony, bintlp, Freud, kruskal etc. Program
tsp-matlab
- The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and retu
npcsma-protocol-matlab-simulation
- 此源码目的在于非持续性载波监听np-CSMA协议的matlab仿真。非持续性CSMA是一种冲突避免的CSMA协议。-np-csma protocol matlab simulation
NP-hard-problem
- matlab模拟退火算法，处理背包问题，相比较与遗传算法模拟退火原理简单，编译容易-matlab simulated annealing algorithm to handle the knapsack problem, compared with the genetic simulated annealing algorithm is simple, easy to compile
Matlab-ALOHA
- Matlab仿真ALOHA代码,包括纯aloha，时隙aloha，np-CSMA aloha算法 -matlab aloha