75 lines
1.5 KiB
C
75 lines
1.5 KiB
C
|
|
#include <stdio.h>
|
|
#include <math.h>
|
|
#define TFACTR 0.9
|
|
#define ALEN(a,b,c,d) sqrt(((b)-(a))*((b)-(a))+((d)-(c))*((d)-(c)))
|
|
|
|
void anneal(x,y,iorder,ncity)
|
|
float x[],y[];
|
|
int iorder[],ncity;
|
|
{
|
|
float ran3(),revcst(),trncst();
|
|
int irbit1(),metrop();
|
|
void reverse(),trnspt();
|
|
int ans,nover,nlimit,i1,i2;
|
|
int i,j,k,nsucc,nn,idec;
|
|
static int n[7];
|
|
long idum;
|
|
unsigned long iseed;
|
|
float path,de,t;
|
|
|
|
nover=100*ncity;
|
|
nlimit=10*ncity;
|
|
path=0.0;
|
|
t=0.5;
|
|
for (i=1;i<ncity;i++) {
|
|
i1=iorder[i];
|
|
i2=iorder[i+1];
|
|
path += ALEN(x[i1],x[i2],y[i1],y[i2]);
|
|
}
|
|
i1=iorder[ncity];
|
|
i2=iorder[1];
|
|
path += ALEN(x[i1],x[i2],y[i1],y[i2]);
|
|
idum = -1;
|
|
iseed=111;
|
|
for (j=1;j<=100;j++) {
|
|
nsucc=0;
|
|
for (k=1;k<=nover;k++) {
|
|
do {
|
|
n[1]=1+(int) (ncity*ran3(&idum));
|
|
n[2]=1+(int) ((ncity-1)*ran3(&idum));
|
|
if (n[2] >= n[1]) ++n[2];
|
|
nn=1+((n[1]-n[2]+ncity-1) % ncity);
|
|
} while (nn<3);
|
|
idec=irbit1(&iseed);
|
|
if (idec == 0) {
|
|
n[3]=n[2]+(int) (abs(nn-2)*ran3(&idum))+1;
|
|
n[3]=1+((n[3]-1) % ncity);
|
|
de=trncst(x,y,iorder,ncity,n);
|
|
ans=metrop(de,t);
|
|
if (ans) {
|
|
++nsucc;
|
|
path += de;
|
|
trnspt(iorder,ncity,n);
|
|
}
|
|
} else {
|
|
de=revcst(x,y,iorder,ncity,n);
|
|
ans=metrop(de,t);
|
|
if (ans) {
|
|
++nsucc;
|
|
path += de;
|
|
reverse(iorder,ncity,n);
|
|
}
|
|
}
|
|
if (nsucc >= nlimit) break;
|
|
}
|
|
printf("\n %s %10.6f %s %12.6f \n","T =",t,
|
|
" Path Length =",path);
|
|
printf("Successful Moves: %6d\n",nsucc);
|
|
t *= TFACTR;
|
|
if (nsucc == 0) return;
|
|
}
|
|
}
|
|
#undef TFACTR
|
|
#undef ALEN
|