Description: 本程序是一个基本的简单遗传算法示范程序，其优化目标是在〔0，2*pi〕上搜索函数sin(x)*sin(x)的最大值-this procedure is a basic and simple genetic algorithm model procedures, optimizing their goal is [0, 2 * pi] search function sin (x) * sin (x) maximum Platform: |
Size: 2648 |
Author:堂木 |
Hits:
Description: X(t)=Asin(2*pi *f *t+ q)+n(t)
估计其中的参数为A，f， q。n(t)为随机噪声，服从正态分布。
其他的具体见附件中的程序
-X (t) = 4sin (2* pi* f* t q) n (t) is estimated parameters A, f, q. N (t) of random noise, subject to normal. Other specific see annex to the proceedings Platform: |
Size: 6144 |
Author:戴朝华 |
Hits:
Description: 本程序是一个基本的简单遗传算法示范程序，其优化目标是在〔0，2*pi〕上搜索函数sin(x)*sin(x)的最大值-this procedure is a basic and simple genetic algorithm model procedures, optimizing their goal is [0, 2* pi] search function sin (x)* sin (x) maximum Platform: |
Size: 2048 |
Author:堂木 |
Hits:
Description: matlab遗传算法工具箱函数及实例讲解2
【问题】在－5<=Xi<=5,i=1,2区间内，求解
f(x1,x2)=-20*exp(-0.2*sqrt(0.5*(x1.^2+x2.^2)))-exp(0.5*(cos(2*pi*x1)+cos(2*pi*x2)))+22.71282的最小值。 -matlab genetic algorithm toolbox function and examples to explain the problem [2] in-5 Platform: |
Size: 1024 |
Author:xjk |
Hits:
Description: 简单一元函数优化实例，利用遗传算法计算函数f(x)=x*sin(10pi*x)+2.0,-1<=x<=2的最大值-One dollar a simple example of function optimization using genetic algorithm function f (x) = x* sin (10pi* x)+ 2.0,-1 <= x <= 2 the maximum value of Platform: |
Size: 1024 |
Author:杜勇 |
Hits:
Description: 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm to solve the 01 knapsack problem. In the 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. From the n-items, select the items into the backpack, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight can not exceed the capacity of backpack, the best load is the value of the items loaded the highest. Platform: |
Size: 1024 |
Author:周薇 |
Hits:
Description: 遗传算法
求下列函数的最大值
obj(x)=x.*(10-x).*sin(2*pi*x), x\in[0,10].-Optimization problem by genetic algorithm of a function
obj(x)=x.*(10-x).*sin(2*pi*x), x\in[0,10]. Platform: |
Size: 5120 |
Author:HU |
Hits:
Description: 已知函数y=x*sin(10*Pi*x)+2.0。利用人工智能中的遗传算法（GA），计算y在区间（0，2）上的极大值。对于想学习GA的网友们来说，是个很好的Demo。而且对于基因类，已经按照面向对象的思想进行了封装，稍微修改参数就可以用在实际项目中。-Known function y = x* sin (10* Pi* x)+2.0. The use of artificial intelligence in the genetic algorithm (GA), calculating y in the interval (0,2) on the maximum value. For the netizens who want to learn for the GA is a good Demo. But also for gene class, object-oriented thinking has been carried out according to the package, slightly modified parameters can be used in the actual project. Platform: |
Size: 44032 |
Author:skyfrog |
Hits:
Description: 已知函数y=x*sin(10*Pi*x)+2.0。利用人工智能中的遗传算法（GA），计算y在区间（0，2）上的极大值。对于想学习GA的网友们来说，是个很好的Demo。而且对于基因类，已经按照面向对象的思想进行了封装，稍微修改参数就可以用在实际项目中。
实现环境：Visual C++ 6.0. -Known function y = x* sin (10* Pi* x)+2.0. The use of artificial intelligence in the genetic algorithm (GA), calculating y in the interval (0,2) on the maximum value. For the netizens who want to learn for the GA is a good Demo. But also for gene class, object-oriented thinking has been carried out in accordance with the package, slightly modified parameters can be used in the actual project. To achieve environmental: Visual C++ 6.0. Platform: |
Size: 47104 |
Author:zsy |
Hits:
Description: AN EFFICIENT GENETIC ALGORITHM CODE TO FIND OPTIMAL VALUES(MAXIMUM) OF SIN(X) FUNCTION IN THE RANGE OF 0 TO 2*PI Platform: |
Size: 1024 |
Author:raviteja |
Hits:
Description: 提出了一种基于遗传算法和小波神经网络的 PI 参数整定方法。首先 ,利用具有自然进化的遗传算法对小波神经网络的初始权值进行优化训练 ,解决了控制器网络初始权系数对控制效果产生的影响 其次 ,利用小波神经网络对PID参数进行在线调节 最后将此算法运用到电机控制系统的 P I D参数寻优中。-A new-type controller based on genetic algorithm andwavelet neural net work was presented.The genetic algorithm was
utilized to train and optimize the initia weights of wavelet neuralnet work, the method solved the influence of the initial weights of wavelet neural net work on the control effectiveness. Platform: |
Size: 241664 |
Author:楚风 |
Hits:
Description: 取各障碍物顶点连线的中点为路径点，相互连接各路径点，将机器人移动的起点和终点限制在各路径点上，利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动，利用Pi= Pi1+ti×(Pi2-Pi1)（ti∈[0,1] i=1,2,…n）即可确定相应的Pi，即为新的路径点，连接此路径点为最优路径。-Take the midpoint of each obstacle vertex point for the path, the path of each connection point, move the robot start and end points of each path on the limited use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 from the Pn the shortest path to the end, because the algorithm uses the midpoint of the conditions of cable, not the entire optimal path planning of space, and then use genetic algorithm to find the shortest path of each path points Pi (i = 1,2, ... n ) adjusted to the path of obstacles in the corresponding endpoint connection point slide, using Pi = Pi1+ ti × (Pi2-Pi1) (ti ∈ [0,1] i = 1,2, ... n) to determine the appropriate of Pi, is the new path point, the connection point for the optimal path for this path. Platform: |
Size: 2048 |
Author:biaoshi |
Hits:
Description: 利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动-Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide Platform: |
Size: 9216 |
Author:jack |
Hits:
Search - genetic algorithm pi