sa.h

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

// Sa.h: interface for the Sa class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_SA_H__7E0F94C3_E5DE_492D_B827_C669AD439670__INCLUDED_)
#define AFX_SA_H__7E0F94C3_E5DE_492D_B827_C669AD439670__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

class Sa  
{
public:
	long bestTime;
	long times;
	int *xBest;
	int *x;
	int *t;
	double fitness;
	double fitnessBest;
	double fitnessNew;
	int dim;

	double CalFit_sa(int *order);
	void Evaluate();
	void Exchange(int m);
	Sa(int subDim);
	virtual ~Sa();
};


#endif // !defined(AFX_SA_H__7E0F94C3_E5DE_492D_B827_C669AD439670__INCLUDED_)