＃include <iostream>
＃include <fstream>
＃include <math.h>
＃include <time.h>
using namespace std;
const int iAntCount=34; //ant numbers
const int iCityCount=51;
const int iItCount=2000; //最大迭代次数
const double Q=100;
const double alpha=1;
const double beta=5;
const double rou=0.5;
int besttour[iCityCount]; //最优路径列表
double rnd(int low,double uper) //获得随机数
{
double p=(rand()/(double)RAND_MAX)*((uper)-(low))+(low);
return (p);
};
int rnd(int uper)
{
return (rand()%uper);
};
class GInfo //TSP地图信息，包含信息素，城市距离和信息素变化矩阵
{
public:
double m_dDeltTrial[iCityCount][iCityCount];
double m_dTrial[iCityCount][iCityCount];
double distance[iCityCount][iCityCount];
};
GInfo Map;
class ant
{
private:
int ChooseNextCity(); //选择城市
double prob[iCityCount];
int m_iCityCount;
int AllowedCity[iCityCount]; //没有走过的城市
public:
void addcity(int city);
int tabu[iCityCount];
void Clear();
void UpdateResult();
double m_dLength;
double m_dShortest;
void move();
ant();
void move2last();
};
- 1
- 2
- 3
- 4
前往页