搜索资源列表
Binding-directly-to-search
- 基于GWBASIC实现的有约束直接寻优算法，内附GWBASIC主程序和说明-There are constraints on GWBASIC achieve direct optimization algorithm, the main program included GWBASIC
Constrained-converted
- 基于GWBASIC实现的有约束转换寻优算法，内附GWBASIC主程序和说明-There are constraints on GWBASIC achieve conversion optimization algorithm, the main program and instructions included GWBASIC
Unconstrained-directly
- 基于GWBASIC实现的无约束寻优算法，内附GWBASIC主程序和说明-Non-binding on GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC
Unconstrained-analysis
- 基于GWBASIC实现的无约束解析寻优算法，内附GWBASIC主程序和说明-Based GWBASIC non-binding resolution to achieve optimization algorithm, the main program and instructions included GWBASIC
Linear-Programming
- 基于GWBASIC实现的线性规划寻优算法，内附GWBASIC主程序和说明-Linear programming based GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC
cmaes_c.tar
- 一种新的寻优算法，CMA，寻优速度很快，并且很稳定。-A new optimization algorithm, CMA, optimization fast and very stable.
Particle-swarm-optimization-
- 粒子群算法的寻优算法，PSO算法是从生物种群行为特征中得到启发并用于求解最有问题，本程序以一案例说明PSO的运用。-Particle swarm optimization algorithm, PSO algorithm is population from biological and behavioral characteristics of the inspiration for solving most problems, this case illustrates the proced
2
- 一个智能算法，杂草算法，很强大的一种智能寻优算法，-An intelligent algorithm, weeds algorithm, very powerful a kind of intelligent optimization algorithm,
lizisuanfa
- 粒子群算法的寻优算法，matlab，神经网络，非线性函数极值寻优-Particle swarm optimization algorithm, matlab, neural networks, nonlinear optimization function extremum
pso_2D
- 很好地二维粒子群寻优算法以及其寻优过程的动态演示。-To two-dimensional particle swarm optimization algorithm and the dynamic presentation of its optimization process....
genetic-algorithm-and-nonlinea
- 基于遗传算法和非线性规划的函数寻优算法在一组等式或者不等式的约束下求极值。 基于遗传算法和非线性规划的函数寻优算法 在一组等式或者不等式的约束下求极值。-Based on genetic algorithm and nonlinear programming function optimization algorithm in a set of equations or inequality constraints for extreme value. Based on geneti
Simulated-Annealing
- 模拟退火算法(Simulated Annealing，SA)，基于Mente-Carlo迭代求解策略的一种随机寻优算法-Simulated Annealing algrithm
8b04659cfe77
- 细菌寻优算法 对目标函数在约束条件小寻找最优值-Bacterial optimization algorithm small constraints to find the optimal value of the objective function in
ga
- 遗传算法（多项式求最小值），一种快速而有效的寻优算法，在工业控制，经济决策，交通规则得到广泛应用-Genetic algorithm (Polynomial minimum), a fast and efficient optimization algorithm, widely used in industrial control, economic decision-making rules of the road
DEOABODPSO
- 人工智能的经典算法：基于动态粒子群算法的动态环境寻优算法-Classic artificial intelligence algorithms: dynamic particle swarm optimization-based dynamic environment optimization algorithm
GENIC
- 以C++语言编写的基于复合形法的寻优算法,结果较为理想.-Write C++ language-based optimization algorithm of the complex method, results are better.
liziqunxunyou
- 粒子群寻优算法matlab程序，附实验数据，调试通过-Particle swarm optimization algorithm matlab program, with experimental data, debugging through
214545535242
- 基于混沌序列的多峰函数微粒群寻优算法的目标就是找到多峰函数的所有局部优化峰值。在分析微粒群优化 算法中各个参数对微粒运动影响的基础上，对微粒群算法进行改造，让微粒运动从初始位置沿优化函数曲线向优化峰值 方向爬行．直至找到所在区域的局部优化峰值；要想求得尽可能多的局部优化峰值，就要求微粒群中微粒的初始位置分 布具有随机性和遍历性。为此采用混沌序列设置微粒初始位置；为使每一个局部最优值点都可能有微粒群中的微粒经过， 采用变步长的迭代计算；为防止优化函数曲线的某些局部峰附近没有
362465378
- 工程应用中的多峰寻优问题要求搜索目标函数的多个极值点，现有的多峰优化方法难以直接利用应用 问题的先验知识引导算法过程，多峰寻优效率较低。基于粒子群优化算法设计一种面向应用的多峰寻优算法， 能有效利用易于获得的先验参数，如峰间分辨率、峰位置精度、峰值个数等实现快速多峰搜索。该算法保持了粒 子群算法的简单性并改善了搜索多样性，使其可控地收敛到多个峰值上。将该算法与几种典型的多峰寻优方法 进行了对比测试和分析，结果表明，对复杂多峰函数，该算法能以最快的收敛速度实现多峰搜索-Mu
chaos-ptimization-and-atrracter
- 混沌粒子群寻优算法和各种常见的混沌吸引子程序-Chaotic particle swarm optimization algorithm, and a variety of common chaotic attractor subroutine