搜索资源列表
基因算法
- 基于MATLAB的基因算法工具。用于数值的全局寻优计算。-MATLAB-based genetic algorithm tool. The overall situation for numerical optimization.
SimplexMethod
- 用labview编写的基于单纯形寻优算法。用来搜索高斯函数的极值点。-prepared using PC-based simplex optimization algorithms. Search Gaussian function to the extreme point.
yichuansuanfaGA
- 遗传算法求最大值（任意多元高阶次寻优），在vc＋＋平台下开发
SOA1
- 种子优化算法，能实现全局寻优，具有很高的效率。-Seed optimization, global optimization can be achieved with high efficiency.
pro2
- 泊位岸桥联合调度，SWO算法在构造解的基础上不断寻优，直至最优解不发生变化-berth and quay crane allocation
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
One-dimensional
- 基于GWBASIC实现的一维线性寻优算法，内附GWBASIC主程序和说明-Based GWBASIC achieve one-dimensional linear 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.
GENIC
- 以C++语言编写的基于复合形法的寻优算法,结果较为理想.-Write C++ language-based optimization algorithm of the complex method, results are better.
SPSA
- 经典的SPSA算法,该算法寻优较快,算法效率高,特别是对高维的函数求最优解有独特的优势.-Classic SPSA algorithm, the algorithm optimization and faster, the high efficiency of the algorithm, the optimal solution for high-dimensional function has a unique advantage.
samplesfsaf
- PSO算法进行多目标寻优，主要包括主程序和算例说明。-PSO algorithm for multi-objective optimization, includes the main program and a numerical example.
MATLAB_gaDemo1Eeval
- matlab 下的遗传算法源码，可以应用到大部分情况的全局寻优。-By using matlab ，I have provided a genetic algorithm source code, which can be applied to most cases of global optimization.
tlbo20170207_ok
- 教与学算法，局部优化算法，收敛快，精度高。可与差分进化等全局寻优算法配合使用，这个算法的特点就是局部收敛速度快。-56/5000 Jiào yǔ xué suànfǎ, júbù yōuhuà suànfǎ, shōuliǎn kuài, jīngdù gāo. Kě yǔ chāfēn jìnhuà děng quánjú xún yōu suànfǎ pèihé shǐyòng, zhège suànfǎ de tèdiǎn jiùshì júbù shōuliǎn sùdù kuài.
35460349yiqun-tuxing
- 蚂蚁算法，路径寻优的一种算法，已经实现了运行。可以一试。(Ant algorithm, a path optimization algorithm, has been implemented. Yes, you can.)
禁忌算法 C++
- 禁忌搜索算法是一种全局性邻域搜索算法，模拟人类具有记忆功能的寻优特征。它通过局部邻域搜索机制和相应的禁忌准则来避免迂回搜索，并通过破禁水平来释放一些被禁忌的优良状态，进而保证多样化的有效探索，以最终实现全局优化(Tabu search algorithm)
模拟退火算法及其在求解TSP中的应用
- 模拟退火算法(Simulated Annealing，SA)最早的思想是由N. Metropolis [1] 等人于1953年提出。1983 年,S. Kirkpatrick 等成功地将退火思想引入到组合优化领域。它是基于Monte-Carlo迭代求解策略的一种随机寻优算法，其出发点是基于物理中固体物质的退火过程与一般组合优化问题之间的相似性。(The earliest idea of Simulated Annealing (SA) was put forward by N. Metropo