display_position_tsp.c

用C编写的粒子群寻优的优化算法

/*------------------------------------------------------------------- DISPLAY_POSITION */
void display_position(struct particle p,int type)
{
int 	i;
float 	x;

printf("\n particle %i: ",p.rank+1);

if (type>1) goto best_previous;

for (i=0;i<p.x.size+1;i++)
	printf(" %i",p.x.s[i]+1);

if (trace>1)
	{
	printf("\n arc values: ");
	for (i=0;i<p.x.size;i++)
		{
		x=G.v[p.x.s[i]][p.x.s[i+1]];
		if (x<0) printf("? "); else printf("%f ",x);	
		}
	}

	 printf(" f value:%f",p.f);
	printf(" v.size: %i,",p.v.size);

   if (trace>2)
	display_velocity(p.v);

return;

best_previous:
	printf("\n best previous: ");
	for (i=0;i<p.best_x.size+1;i++)
		printf(" %i",p.best_x.s[i]+1);

      if (trace>1)
	{
	printf("\n arc values: ");
	for (i=0;i<p.best_x.size;i++)
		{
		x=G.v[p.best_x.s[i]][p.best_x.s[i+1]];
		if (x<0) printf("? "); else printf("%f ",x);
		}
	}
 
   	 printf(" f value:%f",p.best_f);

}