搜索资源列表
GA_PID
- 此程序代码为基于遗传算法的PID整定，利用MATLAB编程实现。该程序通过遗传算法实现参数寻优，是一种不需要任何初始信息并可以寻求全局最优解的、高效的优化组合方法。-this procedure code based on genetic algorithms for PID tuning, using MATLAB programming. The procedures through genetic algorithm optimization of the parameters. is a
SAMATLAB
- SA是源于对固体退火过程的直接简单模拟而建立的一种通用的额随机搜索技术。它能以100 的概率收敛于全局最优解，
yiqunsuanfa
- 用蚁群算法进行移动机器人路径规划，快速有效的得到了全局最优解。-Ant colony algorithm for mobile robot path planning, quickly and effectively to get the global optimal solution.
path-planning4
- 用matlab编写的程序用来求解动态规划最短路径问题，该方法能够快速有效的收敛到全局最优解。-Programs written using matlab to solve the dynamic programming shortest path problem, the method can converge quickly and effectively to the global optimal solution.
Simulated-annealing-algorithm
- 模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程，来寻找全局最优解的有效方法之一。-Simulated Annealing algorithm (Simulated Annealing algorithm, hereinafter referred to as SA) is simulation heating the molten metal the Annealing process, to search for the optimal so
PsoProcess
- 粒子群算法OptSwarm记录每个粒子的历史最优解（粒子历史最好的适应度）以及全部粒子搜索到的全局最优解。用Wg代表全局最优解，W.,1代表每个粒子的历史最优解。粒子群初始化阶段表OptSwarm的前N行与表ParSwarm中的相同，而Wg的值为表ParSwarm中适应度值的最大值对应的行。-Particle swarm algorithm OptSwarm record the history of each particle the optimal solution (particles h
BBExample
- 本文件主要是关于分支定界算法的MATLAB程序，采用分支定界法来求取线性规划与非线性规划等问题的全局最优解。-This document is a MATLAB program on the branch and bound algorithm using the branch and bound method to strike a global optimal solution of linear programming and nonlinear programming problems.
Cultural-algorithms
- 文化算法解决非线性无约束函数优化程序，结果可得到全局最优解-Cultural algorithms solve nonlinear unconstrained function optimization program
Genetic-algorithms
- 遗传算法：人工智能算法，用于求解复杂的函数的全局最优解-Genetic algorithms: artificial intelligence algorithms for solving complex function global optimal solution
aca
- 蚁群算法,路径规划问题，通过迭代寻找全局最优解-Ant colony algorithm, path planning problem, find the global optimal solution through iteration
CPSO
- 为了加强全局搜索能力和收敛到全局最优解，给出了同步变化和异步变化学习因子改进的粒子群算法.通过对同一个多元复杂函数求最小值对比分析两种方法。-In order to strengthen the global search ability and convergence to the global optimal solution, given changes in synchronous and asynchronous learning factor changes improved par
yicuansuanfa
- 遗传算法可以通过多次迭代寻找全局最优解，功能交一般的线性规划求解模型更强大-Genetic algorithms are available through several iterations to find the global optimal solution, cross-functional general linear programming model is more powerful
NGA
- 小生境遗传算法，该算法易于找出优化问题的所有局部最优解和全局最优解-Niche Genetic Algorithm. The algorithm is easy to find the optimization problem in all local optimal solution and the global optimal solution
HarmonySearch
- 和声搜索算法是一种智能优化计算方法，它能寻找优化函数的全局最优解-Harmony Search Algorithm
anneal_NM
- 模拟退火和单纯形法相结合的混合算法，用于求解最优化问题中的全局最优解。-Hybrid simulated annealing algorithm and simplex Combination for solving optimization problems in the global optimal solution.
新建文件夹
- 利用MATLAB语言对该算法寻优过程进行了仿真，仿真结果表明该算法可以找出全局最优解。(The optimization process of the algorithm is simulated by using MATLAB language. The simulation results show that the algorithm can find the global optimal solution.)
PSO
- 在群智能优化算法里面，粒子群算法简称PSO，能够模拟动物寻找食物的搜索方法去逼近全局最优解。(n swarm intelligence optimization algorithm, particle swarm optimization (PSO) can simulate animal search for food to approximate the global optimal solution.)
模拟退火算法
- 模拟退火算法属于现代优化算法的一种，，实现NP-hard组优化问题的全局最优解，解决大量的实际问题(The simulated annealing algorithm is one of the modern optimization algorithms, which can solve the global optimal solution of the NP-hard group optimization problem and solve a lot of practical probl
遗传算法
- 遗传算法matlab实现，寻找目标函数全局最优解。(Implementation of genetic algorithm)
全局最优求解
- 利用matlab的globalsearch求解器寻求微分方程的局部最优解，从而得到微分方程的全局最优解