mypso.cpp

蚁群算法解决车辆最优路径问题

// MyPso.cpp: implementation of the MyPso class.
//
//////////////////////////////////////////////////////////////////////

#include "MyPso.h"
#include "MyDPso.h"
#include "Sa.h"
#include "Particle.h"

//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////

extern int vehicleNum;
extern double T;
extern double B;
extern double TEND;
extern int pDim;

double MyPso::GetFit_all(Particle &pp)
{
	double f = 0;
	//分车
	for(int vehicle_number =1; vehicle_number<vehicleNum+1; vehicle_number++)
	{
		int subDim = 0;
		for(int j=0; j<pp.pDim; j++)
		{
			if(pp.x[j] == vehicle_number)
			{
	 			subDim = subDim + 1;
			}
		}
        
		int *temp;
		temp = new int[subDim];

		int t = 0;
		for(int subdim=0; subdim < subDim; subdim++)
		{
			for(j=t; j<pp.pDim; j++)
			{
				if(pp.x[j] == vehicle_number)
				{
					temp[subdim] = j+1;
						break;
				}
			}
			t = j+1;
		}//可能还有问题;

		//判断是否满足容量约束;
		double car_capacity = 0;
		double all_car_capacity[8] ={1,2,1,2,1,4,2,2};//改动6
		for(int i=0; i<subDim; i++)
			car_capacity += all_car_capacity[temp[i]-1];
		
		if(car_capacity>8)//改动5
		{
			f += 50000;
		}
		else if(subDim==0)
		{
			f += 0;
		}
		else
		{
//			MyDPSO dPso(subDim, 40 ,temp);
//			dPso.Run(10);
			
			Sa sa(subDim);
			for(int i=0; i<subDim; i++)
			{
				sa.x[i] = temp[i];
				sa.xBest[i] = sa.x[i];
			}
			sa.fitness = sa.CalFit_sa(temp);
			sa.fitnessBest = sa.fitness;
        
			T = 3;
			while (T>TEND)
				{
					sa.times = sa.times+1;
					for(int j=0; j<sa.dim-1; j++)
					{
						sa.Exchange(j);
						sa.Evaluate();
					}
					T=B*T;
				}
			
			f = f + sa.fitnessBest;
			
			//把结果存到subResult里,这里可能还是有问题的!
			for(j=0; j<subDim; j++)
				pp.subResult[(vehicle_number-1)*(pp.pDim) + j] = sa.xBest[j];
			for(j=subdim; j<pDim; j++)
				pp.subResult[(vehicle_number-1)*(pp.pDim) + j] = 0;
		}
	
		delete []temp;
	    temp = NULL;
	}
	
	return f;
}