搜索资源列表
GeneticAlgorithm
- 包含一个简单的带实码变量的用于任意函数最大化的遗传算法（GA）程序-This function is a simple GA with real coding of variables that can be used for maximization of any function
ga
- 本程序是一个用C++模板实现的遗传算法库，包括了基本遗传算法，自适应遗传算法和分层遗传算法，具有优秀的通用性和可复用性。 main函数是一个对建筑能耗作分析的例子，需要安装Energy plus 6.0才能正确运行，否则报错。 附有说明文档。 -The program is a C++ template implementation genetic algorithm library, including the basic genetic algorithm, adaptive g
GA
- 用遗传算法求取函数的最大值。遗传算法的每一步骤都用子函数的形式给出。适合对遗传算法的入门级选手学习、参考。-Using genetic algorithms to strike a function of the maximum. Each step of the genetic algorithm is given in the form of a subfunction. Suitable for entry-level players genetic algorithm learning,
ga
- this code implements a genetic algorithm that finds the maximum of a function
GA
- 遗传算法求解函数的极值，使用“轮盘赌”选择法-Genetic algorithm for solving the extreme value of function
GA
- 隔离的遗传算法，主程序，目标函数，约束分得很清楚。-Isolated genetic algorithm, the main program, the objective function, constraints are clearly divided.
GA
- 基于遗传算法的函数极值求解，就是通过遗传算法求解函数极大极小值-use the GA algorithm to get the min or max vaual of the function
SimpleGeneticAlgorithm
- this a simple Genetic Algorithm (GA) testing the optimal solution for a simple function.-this is a simple Genetic Algorithm (GA) testing the optimal solution for a simple function.
GA_optimization_max_function
- GA APPLICATION Maximization a function: y = 21.5 + maximum[ x1 * sin (4 * pi * x1) + x2 * sin (20 * pi * x2)] using GA and ellitism
EHO
- In this paper, a new kind of swarm-based metaheuristic search method, called Elephant Herding Optimization (EHO), is proposed for solving global optimization tasks. EHO is inspired by the herding behavior of elephant group. These behaviors can be mod
GA
- 用VC++实现，遗传算法求函数的最大值。代码能直接运行，不要调试。(With the vc + + implementation, the genetic algorithm takes the maximum value of the function.The code can run directly, not debugging.)
GA-DF2
- 利用GA遗传算法解决欺骗函数最优问题，具体问题描述如下，如有问题请与我联系(The deceptive functions are a family of functions in which there exists low-order building blocks that do not combine to form the higher-order building blocks. Here, a deceptive problem that consists of 25 copies