📄 fuzzy-programming-1.cpp
字号:
// Fuzzy Programming, Expected Value Model
// Written by Microsoft Visual C++
// Copyright by UTLab @ Tsinghua University
// http://orsc.edu.cn/UTLab
#include <math.h>
#include <stdlib.h>
#include <stdio.h>
#include <conio.h>
#include "UTLab.h"
#define N 3 // number of input neurons (decision variables)
#define H 5 // number of hidden neurons
#define O 1 // number of output neurons
#define D 2000 // number of training data
#define R 6000 // number of generating random points
#define M 1 // number of objectives
#define TYPE 1 // 1=max; -1=min
#define GEN 1600
#define POP_SIZE 30
#define P_MUTATION 0.2
#define P_CROSSOVER 0.3
#define SIMU_PRINT_NUMBER 100
#define GA_PRINT_NUMBER 100
static double BOUND[N+O+1][2], WH[H+1][N+1], WO[O+1][H+1];
static double OBJECTIVE[POP_SIZE+1][M+1], q[POP_SIZE+1], CHROMOSOME[POP_SIZE+1][N+1];
static void Simu(double x[D+1][N+1], double y[D+1][O+1]);
static void Input_Output(double x[N+1], double y[O+1]);
static void Train(double original_x[D+1][N+1], double original_y[D+1][O+1],
double standard_x[D+1][N+1], double standard_y[D+1][O+1]);
static void Standarlize(double original_x[D+1][N+1], double original_y[D+1][O+1],
double standard_x[D+1][N+1], double standard_y[D+1][O+1]);
static void BPA(double standard_x[D+1][N+1], double standard_y[D+1][O+1]);
static void Init_NN(void);
static void NN(double x[N+1], double y[O+1]);
static void Init_GA(void);
static void evaluation(int gen);
static void selection(void);
static void crossover(void);
static void mutation(void);
static void Objectives(void);
static int constraint_check(double x);
static void Input_Output(double x[N+1], double y[O+1])
{
int i;
double aa, bb, cc, f[R+1], m[R+1], mm;
for(i=1; i<=N; i++) x[i]=myu(-3.3, 3.3);
for(i=1; i<=R; i++) {
aa = myu(1,3);
bb = myu(2,4);
cc = myu(3,5);
f[i] = sqrt(fabs(x[1]+aa)+fabs(x[2]+bb)+fabs(x[3]+cc));
m[i] = triangle(aa, 1,2,3);
mm = triangle(bb, 2,3,4);
if(m[i]>mm) m[i]=mm;
mm = triangle(cc, 3,4,5);
if(m[i]>mm) m[i]=mm;
}
y[1]=fuzzymean(f,m,R);
}
static void Objectives(void)
{
double x[4], y[2];
int i;
for(i=1; i<=POP_SIZE; i++) {
x[1] = CHROMOSOME[i][1];
x[2] = CHROMOSOME[i][2];
x[3] = CHROMOSOME[i][3];
NN(x,y);
OBJECTIVE[i][1] = y[1];
}
for(i=1; i<=POP_SIZE; i++)
OBJECTIVE[i][0]= OBJECTIVE[i][1];
}
static int constraint_check(double x[])
{
if((x[1]*x[1]+x[2]*x[2]+x[3]*x[3])>10) return 0;
return 1;
}
static void Init_GA(void)
{
double x[N+1];
int i,j;
for(i=1; i<=POP_SIZE; i++) {
mark:
for(j=1; j<=N; j++) x[j] = myu(-3.2, 3.2);
if(constraint_check(x) == 0) goto mark;
for(j=1; j<=N; j++) CHROMOSOME[i][j] = x[j];
}
}
int main( void )
{
int i, j;
double a, x[D+1][N+1], y[D+1][O+1], standard_x[D+1][N+1], standard_y[D+1][O+1];
FILE *fp;
srand(100);
Simu(x,y);
Standarlize(x,y,standard_x,standard_y);
Train(x,y,standard_x,standard_y);
q[0]=0.05; a = 0.05;
for(i=1;i<=POP_SIZE;i++) {a=a*0.95; q[i]=q[i-1]+a;}
fp=fopen("RESULT.dat","w");
Init_GA();
evaluation(0);
for(i=1; i<=GEN; i++) {
selection();
crossover();
mutation();
evaluation(i);
if(i%GA_PRINT_NUMBER != 0) continue;
fprintf(fp,"%5d ",i);
for(j=1; j<=N; j++) fprintf(fp,"%3.4f ",CHROMOSOME[0][j]);
for(j=1; j<=M; j++) fprintf(fp,"%3.4f ",OBJECTIVE[0][j]);
fprintf(fp,"%3.4f\n",OBJECTIVE[0][0]);
printf("\nGeneration NO.%d\n", i);
printf("x=(");
for(j=1; j<=N; j++) {
if(j<N) printf("%3.4f,",CHROMOSOME[0][j]);
else printf("%3.4f",CHROMOSOME[0][j]);
}
if(M==1) printf(")\nf=%3.6f\n", OBJECTIVE[0][1]);
else {
printf(")\nf=(");
for(j=1; j<=M; j++) {
if(j<M) printf("%3.4f,", OBJECTIVE[0][j]);
else printf("%3.4f", OBJECTIVE[0][j]);
}
printf(") Aggregating Value=%3.4f\n",OBJECTIVE[0][0]);
}
}
printf("\nThe final result has been written in RESULT.dat.\n\n");
fclose(fp);
return 1;
}
static void BPA(double x[D+1][N+1],double y[D+1][O+1])
{
double E0 = 0.01;
double EE0 = 0.003;
double TOLERANCE=0.0001*((N+1+O)*H+O);
int i,j,k,step=0;
double ALPHA=0.05;
double BETA=4./3;
double ETA=0.5;
double MU=1.;
double DETA_WH[H+1][N+1],DETA_WO[O+1][H+1];
double E_WO[O+1],E_WH[H+1],h[H+1],NN_y[O+1];
double e[O+1],lambda,E,EE,TD,temp;
Init_NN();
for( i=1; i<=H; i++ )
for( j=0; j<=N; j++ )
DETA_WH[i][j] = 0.;
for( i=1; i<=O; i++ )
for( j=0; j<=H; j++ )
DETA_WO[i][j] = 0.;
lambda=1.;
do
{ step++;
E=0.;
TD=0.;
EE=0.;
for( k=1; k<=D; k++)
{ /*calculate the output of the hidden neurons*/
h[0]=1.;
for( i=1; i<=H; i++ )
{ h[i] = WH[i][0];
for( j=1; j<=N; j++ )
h[i] += WH[i][j] * x[k][j];
h[i] = tanh(h[i]);
}
/*calculate the output of the outlayer neurons*/
for( i=1; i<=O; i++ )
{ NN_y[i] = WO[i][0];
for( j=1; j<=H; j++)
NN_y[i] += WO[i][j] * h[j];
}
/*adjust the weights of WO:*/
for( i=1; i<=O; i++ )
{ e[i] = y[k][i] - NN_y[i];
E_WO[i] = lambda*e[i] + (1-lambda)*tanh(BETA*e[i]);
for( j=0; j<=H; j++ )
{ DETA_WO[i][j] = ETA*DETA_WO[i][j] + ALPHA*E_WO[i]*h[j];
TD += fabs(DETA_WO[i][j]);
WO[i][j] += DETA_WO[i][j];
}
}
/*adjust the weights of WH:*/
for( j=1; j<=H; j++ )
{ for( i=1,temp=0.; i<=O; i++ )
temp += E_WO[i] * WO[i][j];
E_WH[j] = ( 1-h[j]*h[j])*temp;
DETA_WH[j][0] = ETA*DETA_WH[j][0] +ALPHA*E_WH[j];
TD += fabs(DETA_WH[j][0]);
WH[j][0] += DETA_WH[j][0];
for( i=1; i<=N; i++ )
{ DETA_WH[j][i]= ETA*DETA_WH[j][i] +ALPHA*E_WH[j]*x[k][i];
TD += fabs(DETA_WH[j][i]);
WH[j][i] += DETA_WH[j][i];
}
}
/*calculate the total errors*/
for( i=1; i<=H; i++ )
{ h[i] = WH[i][0];
for( j=1; j<=N; j++ )
h[i] += WH[i][j]*x[k][j];
h[i] = tanh(h[i]);
}
for( i=1; i<=O; i++ )
{ NN_y[i] = WO[i][0];
for( j=1; j<=H; j++)
NN_y[i] += WO[i][j] * h[j];
}
for( i=1; i<=O; i++ )
{ e[i] = y[k][i] - NN_y[i];
EE += fabs(e[i])/D;
E += 0.5*e[i]*e[i];
}
}
lambda = exp( -MU/(E*E));
TD=TD/D;
if(step%100==0) printf("\nBPA_%d (Std)Sum-squared-E=%f Average-E=%f Gradient=%f;",step,E,EE,TD);
} while ( step<2000 && TD>TOLERANCE && E>E0 && EE>EE0);
printf("\nBPA_%d (Std)Sum-squared-E=%f Average-E=%f Gradient=%f;",step,E,EE,TD);
}
static void Simu(double x[D+1][N+1], double y[D+1][O+1])
{
int i, j;
double xx[N+1], yy[O+1];
float read;
FILE *fp;
if((fp=fopen("TRAIN.dat","r"))==NULL) {
mark:
fp=fopen("TRAIN.dat","w");
for(i=1; i<=D; i++) {
Input_Output(xx, yy);
if(i%SIMU_PRINT_NUMBER==0)
printf("\n%d input-output Data have been generated",i);
for(j=1; j<=N; j++) {
x[i][j]=xx[j];
fprintf(fp,"%3.6f ",xx[j]);
}
for(j=1; j<=O; j++) {
y[i][j]=yy[j];
fprintf(fp,"%3.6f ",yy[j]);
}
fprintf(fp,"\n");
}
fclose(fp);
}
else {
printf("The training data <<TRAIN.dat>> already exists. Renew it? (y/n)");
if(getche()=='y') goto mark;
for(i=1; i<=D; i++) {
for(j=1; j<=N; j++) {
fscanf(fp,"%f",&read);
x[i][j]=read;
}
for(j=1; j<=O; j++) {
fscanf(fp,"%f",&read);
y[i][j]=read;
}
}
}
fclose(fp);
}
static void Train(double x[D+1][N+1], double y[D+1][O+1],double standard_x[D+1][N+1], double standard_y[D+1][O+1])
{
int i, j, k;
double E1, E2, a, xx[N+1], yy[O+1];
float read;
FILE *fp;
if((fp=fopen("WEIGHT.dat","r"))==NULL) {
mark:
BPA(standard_x,standard_y);
E1=0;
E2=0;
for(i=1; i<=D; i++) {
for(j=1; j<=N; j++) xx[j]=x[i][j];
NN(xx,yy);
a=0;
for(j=1; j<=O; j++) a += (yy[j]-y[i][j])*(yy[j]-y[i][j]);
E1=E1+a;
E2=E2+sqrt(a);
}
E1=E1/2;
E2=E2/D;
printf("\n\nSum-Squared Error = %3.4f",E1);
printf("\nAverage Error = %3.4f\n\n",E2);
for(i=1; i<=18; i++){
k=(int)myu(1,D);
for(j=1; j<=N; j++) xx[j]=x[k][j];
NN(xx,yy);
printf("Sample %2d: y=(",i);
for(j=1; j<=O; j++) {
if(j<O) printf("%3.4f,",y[k][j]);
else printf("%3.4f",y[k][j]);
}
printf(") Dif.=(");
for(j=1; j<=O; j++) {
if(j<O) printf("%3.4f,",yy[j]-y[k][j]);
else printf("%3.4f",yy[j]-y[k][j]);
}
printf(")\n");
}
printf("\nAre you satisfactory?(y/n)");
if(getche()=='n') goto mark;
printf("\n");
fp=fopen("WEIGHT.dat","w");
for(i=1; i<=H; i++) {
for(j=0; j<=N; j++) fprintf(fp,"%3.4f ",WH[i][j]);
fprintf(fp,"\n");
}
for(i=1; i<=O; i++) {
for(j=0; j<=H; j++) fprintf(fp,"%3.4f ",WO[i][j]);
fprintf(fp,"\n");
}
fclose(fp);
}
else {
printf("\n\nThe weight data <<WEIGHT.dat>> already exists. Renew it? (y/n)");
if(getche()=='y') goto mark;
for(i=1; i<=H; i++)
for(j=0; j<=N; j++) {
fscanf(fp, "%f", &read);
WH[i][j]=read;
}
for(i=1; i<=O; i++)
for(j=0; j<=H; j++) {
fscanf(fp,"%f", &read);
WO[i][j]=read;
}
fclose(fp);
}
}
static void evaluation(int gen)
{
double a;
int i, j, k, label;
Objectives();
if(gen == 0){
for(k=0; k<=M; k++) OBJECTIVE[0][k] = OBJECTIVE[1][k];
for(j = 1; j <= N; j++) CHROMOSOME[0][j] = CHROMOSOME[1][j];
}
for(i=0; i<POP_SIZE; i++){
label = 0; a = OBJECTIVE[i][0];
for(j=i+1; j<=POP_SIZE; j++)
if((TYPE*a)<(TYPE*OBJECTIVE[j][0])) {
a = OBJECTIVE[j][0];
label = j;
}
if(label != 0) {
for(k=0; k<=M;k++) {
a = OBJECTIVE[i][k];
OBJECTIVE[i][k] = OBJECTIVE[label][k];
OBJECTIVE[label][k] = a;
}
for(j = 1; j <= N; j++) {
a = CHROMOSOME[i][j];
CHROMOSOME[i][j] = CHROMOSOME[label][j];
CHROMOSOME[label][j] = a;
}
}
}
}
static void selection()
{
double r, temp[POP_SIZE+1][N+1];
int i, j, k;
for(i=1; i<=POP_SIZE; i++) {
r = myu(0, q[POP_SIZE]);
for(j=0; j<=POP_SIZE; j++) {
if(r <= q[j]) {
for(k=1; k<=N; k++) temp[i][k] = CHROMOSOME[j][k];
break;
}
}
}
for(i=1; i<=POP_SIZE; i++)
for(k=1; k<=N; k++)
CHROMOSOME[i][k] = temp[i][k];
}
static void crossover()
{
int i, j, jj, k;
double r, x[N+1], y[N+1];
for(i = 1; i <= POP_SIZE/2; i++) {
if(myu(0,1)>P_CROSSOVER) continue;
j = (int)myu(1,POP_SIZE);
jj = (int)myu(1,POP_SIZE);
r = myu(0,1);
for(k = 1; k <= N; k++) {
x[k] = r*CHROMOSOME[j][k]+(1-r)*CHROMOSOME[jj][k];
y[k] = r*CHROMOSOME[jj][k]+(1-r)*CHROMOSOME[j][k];
}
if(constraint_check(x) == 1)
for(k=1; k<=N; k++) CHROMOSOME[j][k] = x[k];
if(constraint_check(y) == 1)
for(k=1; k<=N; k++) CHROMOSOME[jj][k] = y[k];
}
}
static void mutation(void)
{
int i, j;
double y[N+1], infty, direction[N+1];
double precision = 0.0001;
double INFTY = 10;
for(i=1; i<=POP_SIZE; i++) {
if(myu(0,1)>P_MUTATION) continue;
for(j=1; j<=N; j++) direction[j] = myu(-1,1);
infty = myu(0,INFTY);
while(infty>precision) {
for(j=1; j<=N; j++) y[j] = CHROMOSOME[i][j]+infty*direction[j];
if(constraint_check(y) == 1) {
for(j=1; j<=N; j++) CHROMOSOME[i][j] = y[j];
break;
}
infty = myu(0,infty);
}
}
}
static void Standarlize(double x[D+1][N+1],double y[D+1][O+1],double xx[D+1][N+1],double yy[D+1][O+1])
{
int i,k;
for(i=1; i<=N; i++) {
BOUND[i][0]=x[1][i];
BOUND[i][1]=x[1][i];
}
for( i=1; i<=O; i++ ) {
BOUND[N+i][0]=y[1][i];
BOUND[N+i][1]=y[1][i];
}
for( k=2; k<=D; k++ ) {
for( i=1; i<=N; i++ )
{ if(BOUND[i][0]>x[k][i])
BOUND[i][0]=x[k][i];
if(BOUND[i][1]<x[k][i])
BOUND[i][1]=x[k][i];
}
for( i=1; i<=O; i++ )
{ if(BOUND[N+i][0]>y[k][i])
BOUND[N+i][0]=y[k][i];
if(BOUND[N+i][1]<y[k][i])
BOUND[N+i][1]=y[k][i];
}
}
for( i=1; i<=N+O; i++ )
BOUND[i][1]=BOUND[i][1] - BOUND[i][0];
for( k=1; k<=D; k++ )
{ for( i=1; i<=N; i++ )
xx[k][i]=(x[k][i]-BOUND[i][0])/BOUND[i][1];
for( i=1; i<=O; i++ )
yy[k][i]=(y[k][i]-BOUND[N+i][0])/BOUND[N+i][1];
}
}
static void NN( double x[], double y[] )
{
double h[H+1];
int i,j;
for( i=1; i<=H; i++ )
{ h[i] = WH[i][0];
for( j=1; j<=N; j++ )
h[i] += WH[i][j] * (x[j]-BOUND[j][0])/BOUND[j][1];
h[i] = tanh( h[i] );
}
for( i=1; i<=O; i++ )
{ y[i] = WO[i][0];
for( j=1; j<=H; j++)
y[i] += WO[i][j] * h[j];
y[i] = y[i]*BOUND[N+i][1] + BOUND[N+i][0];
}
}
static void Init_NN(void)
{
int i, j;
for(i=1; i<=H; i++)
for(j=0; j<=N; j++)
WH[i][j]= myu(-0.3,0.3);
for(i=1; i<=O; i++)
for(j=0; j<=H; j++)
WO[i][j]= myu(-0.3,0.3);
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -