搜索资源列表
ACS(c++)
- 蚁群算法是新近出现的一种智能优化算法，是求解组合优化问题的又一种好的方法！-ant colony algorithm is a newly emerging intelligent optimization algorithm, the solution is the combinatorial optimization problems also a good way!
Python-for-PSO-algorithm
- Python实现的粒子群优化算法源代码，需要引用到Numpy，需要对自定义问题进行优化只需要更改f6函数即可，智能算法本身的参数亦可以自行设定。-Python implementation of the PSO algorithm source code, you need to refer to Numpy, Custom issues need to be optimized to only need to change the f6 function, the smart algorith
Outside-the-penalty-function-method
- 外点罚函数方法，可以用来求解约束优化问题，也可以用来被调用在智能算法中-Point outside the penalty function can be used for solving constrained optimization problems, can also be used in intelligent algorithm called
20103259532692
- 用VB实现的有限智能算法 资源类别： VB源码￤算法 -Using VB intelligent algorithm to achieve the limited categories of resources: VB source ¦ algorithm
20103259509485
- 其中涉及目前流行的智能算法的实现。运行平台： Windows-Involving the popular smart algorithm. Running Platform: Windows
intelligent--location
- 所得税选址的智能算法，智能分区，降低算法复杂度，算法鲁棒性强，和穷举法一样可以获得全局最优解，同时计算量显著降低！-intelligent alogrithm for multi location porblem.
ant
- 蚁群算法是经典的优化智能算法，能找到的最短路径。-The ant colony optimization algorithm is the classic intelligent algorithm can find the shortest path.
half_workingset
- 二分工作集算法源代码,是一个新的智能算法-code of half working set
css
- 用visual basic编译的布谷鸟算法的源代码,是一种很好地启发式智能算法。-Use visual basic compiler cuckoo algorithm source code, is a good heuristic intelligent algorithm.
Dijkstra-algorithm
- Dijkstra算法用于求解包含必经点K短路径问题，算法采用分段拼接逐一替换方式求解，是求解必经点K短路径问题的精确求解算法，用于和群智能算法进行对比。该算法时间复杂度为阶乘级别，耗时较长。算法内建了26个节点和80节点两个网络拓扑用于监测算法性能。-Dijkstra Algorithm for Designated point K shortest path Problem.
cec13-c-code
- cec2013 benechmark函数，可测试群体智能算法的优越性-cec2013 benechmark
PSO
- 用智能算法的粒子群算法进行压缩感知稀疏信号的重构-PSO is used for signal reconstruction
jianjinfenxi
- 函数逼近的现代理论，对于开发智能算法设计的工程人员、学生有很好的指导价值。这是很权威的资料介绍。-Function approximation of the modern theory, the development of intelligent algorithms for the design of the project staff, students have a good guide. This is a very authoritative information.
zuiyouhua-Optimization
- 优化计算领域的最权威的资料，很适合智能算法设计和研究。-Optimization of the field of computing the most authoritative information, it is suitable for the design and research of intelligent algorithms.
zhinengsuanfa
- 对各种智能算法的介绍，用具体的例子说明，通俗易懂-An introduction to a variety of intelligent algorithms, with concrete examples, easily understood
selflearn60
- 关于智能算法方面的书籍，目前很热门的，值得细细学习欣赏品味-About smart algorithm books, currently very popular, worthy of careful study to appreciate the taste
MATLAB智能算法30个案例分析_12947138_史峰
- 这些代码主要是解决数学建模中存在的一些普遍问题的。(These codes mainly deal with some common problems in mathematical modeling)
Chared ICA Code
- 受帝国主义殖民竞争机制的启发，Atashpaz-Gargari和Lucas于2007年提出了一种新的智能优化算法—帝国竞争算法 (ICA)。与GA, PSO, ABC等受生物行为启发的群智能算法不同，ICA受社会行为启发，通过摸拟殖民地同化机制和帝国竞争机制而形成的一种优化方法。ICA也是一种基于群体的优化方法，其解空间由称为国家的个体组成。ICA将国家分为几个子群，称为帝国。在每个帝国内，ICA通过同化机制使非最优的国家(殖民地)向最优国家(帝国主义国家)靠近，该过程类似于PSO。帝国竞争机制
anneal
- 智能优化算法 模拟退火算法具有较好的全局搜索性(Intelligent optimization algorithm-the simulated annealing algorithm has better global search performance)
0带约束的差分进化算法1
- 基于Python编写的差分进化原理的带边界条件约束算法(A band constraint algorithm based on differential evolution algorithm)