C++中蚁群优化算法的实现
来源:互联网 发布:php fopen函数的用法 编辑:程序博客网 时间:2024/06/05 13:28
#include <ctime>
#include <cstdlib>
#include <memory>
#define frand() ((double)rand()/(double)RAND_MAX)
#define MAXLONG (2147483647)
double * pso_optimization(int s, int p, int d, int T, double c1, double c2, double *vmax, double wmax, double wmin, double *domax, double *domin, CAL_FIT cal_fit, void *adds)
{
srand(time(NULL));
double *swm_v = (double*)malloc(s*p*d*sizeof(double));
double *swm_d = (double*)malloc(s*p*d*sizeof(double));
double *sbest = (double*)malloc(s*d*sizeof(double));
double *gbest = (double*)malloc(d*sizeof(double));
double *fswm_v = swm_v, *fswm_d = swm_d;
memset(swm_v, 0, sizeof(swm_v));
double *fdomax = domax, *fdomin = domin, *fvmax = vmax;
for (int i = 0; i < s; i++)
for (int j = 0; j < p; j++)
{
fdomax = domax; fdomin = domin;
for (int k = 0; k < d; k++, fdomax++, fdomin++, fswm_d++)
*fswm_d = (frand()*(*fdomax-*fdomin))+*fdomin;
}
double *fsbest = sbest, fitness = 0;
double nowbest = 0, *nowidx = NULL;
double nowsbest = 0, *nowsidx = NULL;
double *ffsbest = NULL, *fgbest = NULL;
double w = 0;
for (int t = 0; t < T; t++)
{
w = wmax-(double)t*(wmax-wmin)/(double)T;
fswm_d = swm_d; fsbest = sbest;
nowidx = NULL; nowbest = -MAXLONG;
for (int i = 0; i < s; i++, fsbest+=d)
{
nowsbest = -MAXLONG; nowsidx = NULL;
for (int j = 0; j < p; j++, fswm_d+=d)
{
fitness = cal_fit(fswm_d, d, adds);
if (fitness >= nowsbest)
{
nowsbest = fitness;
nowsidx = fswm_d;
}
}
memcpy(fsbest, nowsidx, d*sizeof(double));
if (nowsbest >= nowbest)
{
nowbest = nowsbest;
nowidx = fsbest;
}
}
memcpy(gbest, nowidx, d*sizeof(double));
if (t >= T) break;
fsbest = sbest; fswm_v = swm_v; fswm_d = swm_d;
for (int i = 0; i < s; i++)
{
for (int j = 0; j < p; j++)
{
fgbest = gbest; ffsbest = fsbest;
fdomax = domax; fdomin = domin; fvmax = vmax;
for (int k = 0; k < d; k++, fgbest++, ffsbest++, fswm_v++, fswm_d++, fdomax++, fdomin++, fvmax++)
{
*fswm_v = max(-*fvmax, min(*fswm_v*w+c1*frand()*(*ffsbest-*fswm_d)+c2*frand()*(*fgbest-*fswm_d), *fvmax));
*fswm_d = max(*fdomin, min(*fswm_d+*fswm_v, *fdomax));
}
}
fsbest = ffsbest;
}
}
free(swm_v); free(swm_d); free(sbest);
return gbest;
}
#include <cstdlib>
#include <memory>
#define frand() ((double)rand()/(double)RAND_MAX)
#define MAXLONG (2147483647)
double * pso_optimization(int s, int p, int d, int T, double c1, double c2, double *vmax, double wmax, double wmin, double *domax, double *domin, CAL_FIT cal_fit, void *adds)
{
srand(time(NULL));
double *swm_v = (double*)malloc(s*p*d*sizeof(double));
double *swm_d = (double*)malloc(s*p*d*sizeof(double));
double *sbest = (double*)malloc(s*d*sizeof(double));
double *gbest = (double*)malloc(d*sizeof(double));
double *fswm_v = swm_v, *fswm_d = swm_d;
memset(swm_v, 0, sizeof(swm_v));
double *fdomax = domax, *fdomin = domin, *fvmax = vmax;
for (int i = 0; i < s; i++)
for (int j = 0; j < p; j++)
{
fdomax = domax; fdomin = domin;
for (int k = 0; k < d; k++, fdomax++, fdomin++, fswm_d++)
*fswm_d = (frand()*(*fdomax-*fdomin))+*fdomin;
}
double *fsbest = sbest, fitness = 0;
double nowbest = 0, *nowidx = NULL;
double nowsbest = 0, *nowsidx = NULL;
double *ffsbest = NULL, *fgbest = NULL;
double w = 0;
for (int t = 0; t < T; t++)
{
w = wmax-(double)t*(wmax-wmin)/(double)T;
fswm_d = swm_d; fsbest = sbest;
nowidx = NULL; nowbest = -MAXLONG;
for (int i = 0; i < s; i++, fsbest+=d)
{
nowsbest = -MAXLONG; nowsidx = NULL;
for (int j = 0; j < p; j++, fswm_d+=d)
{
fitness = cal_fit(fswm_d, d, adds);
if (fitness >= nowsbest)
{
nowsbest = fitness;
nowsidx = fswm_d;
}
}
memcpy(fsbest, nowsidx, d*sizeof(double));
if (nowsbest >= nowbest)
{
nowbest = nowsbest;
nowidx = fsbest;
}
}
memcpy(gbest, nowidx, d*sizeof(double));
if (t >= T) break;
fsbest = sbest; fswm_v = swm_v; fswm_d = swm_d;
for (int i = 0; i < s; i++)
{
for (int j = 0; j < p; j++)
{
fgbest = gbest; ffsbest = fsbest;
fdomax = domax; fdomin = domin; fvmax = vmax;
for (int k = 0; k < d; k++, fgbest++, ffsbest++, fswm_v++, fswm_d++, fdomax++, fdomin++, fvmax++)
{
*fswm_v = max(-*fvmax, min(*fswm_v*w+c1*frand()*(*ffsbest-*fswm_d)+c2*frand()*(*fgbest-*fswm_d), *fvmax));
*fswm_d = max(*fdomin, min(*fswm_d+*fswm_v, *fdomax));
}
}
fsbest = ffsbest;
}
}
free(swm_v); free(swm_d); free(sbest);
return gbest;
}
- 算法的优化实现
- C++中蚁群优化算法的实现
- C++中蚁群优化算法的实现
- c实现的算法
- PID算法的C语言实现五 积分分离的PID优化
- PID算法的C语言实现六 抗积分饱和的PID优化
- PID算法的C语言实现七 梯形积分的PID优化
- PID算法的C语言实现八 变积分的PID优化
- 经典插入排序算法分析 未优化的版本 C语言实现
- Firm C下的优化算法
- 未优化的冒泡排序算法.c
- 冒泡排序算法及其优化C语言实现
- 粒子群算法求解优化问题(c实现)
- 蚁群优化算法的JAVA实现
- 粒子群优化算法的JAVA实现
- 优化后的Levensthein distance算法实现
- FreeRTOS的任务调度算法优化实现
- A-priori算法的优化实现
- 如何使用资源文件
- 行业门户搜索引擎方案
- 手指与戒指
- C++中反向传播算法的简单实现
- Java中将long格式化成网卡地址
- C++中蚁群优化算法的实现
- 作为一个合格程序员每天该做的事
- 使OutLook最小化到托盘
- 将一个电脑加入域活动目录(Vbscript脚本语言)
- 2006年最失败的事,2007年必须做的事
- c#中静态成员与非静态成员的调用
- 意外关闭浏览器时弹出提示
- 智力题
- 非类型模板参数限制——不可以使用内部链接对象