//TSP
#include<math.h>
#include<iostream>
#include<ctime>
#include <cstdlib>
#include<vector>
#include<fstream>
#include<string>
#include<sstream>
#include<stdio.h>
#include<stdlib.h>
#include <windows.h>
using namespace std;
//求适应度算法
inline int TSPfit(int** city,int cityNum,int ant[])
{
int result=0;
for(int i=0;i<cityNum-1;i++)//共有cityNum个路径
{
result+=city[ant[i]][ant[i+1]];
}
result+=city[ant[i]][0];
return result;
}
template <class T>
inline void cpyln(T a[],T b[],int num)
{
for(int i=0;i<num;i++)
{
a[i]=b[i];
}
}
void crawl(int ant[],double **pheromone,int cityNum,int** city)
{
vector<int> rest;
int i=0;
//初始化剩余城市选择系统rest
/**/ for(i=1;i<cityNum;i++)
{
// rest[i]=i;
rest.push_back(i);
}
//轮盘选择,直到选取所有城市
vector<int>::iterator iter;
double total=0;
/* for(iter=rest.begin();iter!=rest.end();++iter)
{
cout<<*iter<<' ';
}cout<<endl;*/
ant[0]=0;
/* ant[0]=rand()%cityNum;
// cout<<ant[0]<<endl;
for(i=1;i<cityNum;i++)
{
if(i!=ant[0])
rest.push_back(i);
}*/
i=0;
while(!rest.empty()) //每次循环选中一个城市,循环cityNum次
{
total=0;
for(iter=rest.begin();iter!=rest.end();++iter)
{
total+=pheromone[ant[i]][*iter]*1/city[ant[i]][*iter];//
}
// cout<<total<<" i:"<<i<<endl;
double choose=(double)rand()/RAND_MAX*total;//产生0到total之间的小数
for(iter=rest.begin();iter!=rest.end();++iter)
{
double temp=pheromone[ant[i]][*iter]*1/city[ant[i]][*iter];
if(choose-temp<0)
{
ant[i+1]=*iter;
rest.erase(iter);
break;
}
choose-=temp;
}
i++;
}
/* for(i=0;i<cityNum;i++)
{
cout<<ant[i]<<' ';
}cout<<endl;*/
return;
}
void ACOforTSP(int** city,int antNum,int searchNum,float p,int cityNum)
{ clock_t start_time=clock();
double max_phm=1;
int i=0,j=0,k=0;
//初始化信息素,每个城市的初始信息素是平均的,信息素的总和为1
double **pheromone=new double*[cityNum];
for(i=0;i<cityNum;i++)
{
pheromone[i]=new double[cityNum];
}
for(i=0;i<cityNum;i++)
{
for(j=0;j<cityNum;j++)
{
pheromone[i][j]=1;//(i==j)?0:1.0/(cityNum-1); //从城市i到剩下的n-1个省市概率相等
}
}
/* for(j=0;j<cityNum;j++)
{
for(k=0;k<cityNum;k++)
{
cout<<pheromone[j][k]<<'\t';
}cout<<endl;
}cout<<endl;*/
//为了节省内存,多个蚂蚁,但是只记录效果最好的蚂蚁
int *ant=new int[cityNum]; //里面储存的是城市的序列号
int *bestant=new int[cityNum];
int bestTSP=INT_MAX;
int *ibant=new int[cityNum];
int ibTSP=INT_MAX;
for(i=0;i<cityNum;i++)
{
ant[i]=bestant[i]=ibant[i]=INT_MAX;
}
//蚂蚁爬取
for(i=0;i<searchNum;i++)
{
ibTSP=INT_MAX;
for(j=0;j<antNum;j++)
{
crawl(ant,pheromone,cityNum,city);
/* for(k=0;k<cityNum;k++)
{
cout<<ant[k]<<' ';
}
cout<<endl;*/
int temp=TSPfit(city,cityNum,ant);
if(ibTSP>temp)
{
ibTSP=temp;
cpyln(ibant,ant,cityNum);
}
// cout<<bestTSP<<endl;
/* for(j=0;j<cityNum;j++)
{
for(k=0;k<cityNum;k++)
{
if(k==(j==cityNum-1?ant[0]:ant[j+1]))
{
pheromone[ant[j]][k]=p*pheromone[ant[j]][k]+1000/TSPfit(city,48,ant);//p*10/(cityNum-1);
if(pheromone[ant[j]][k]>max_phm)
pheromone[ant[j]][k]=max_phm;
}
else
{
pheromone[ant[j]][k]=p*pheromone[ant[j]][k];
// if(pheromone[ibant[j]][k]<0)
// pheromone[ibant[j]][k]=0;
}
}
}*/
}
if(bestTSP>ibTSP)
{
bestTSP=ibTSP;
cpyln(bestant,ibant,cityNum);
}
// cout<<bestTSP<<endl;
//更新信息素
// cout<<"update"<<endl;
for(j=0;j<cityNum;j++)
{
for(k=0;k<cityNum;k++)
{
if(k==(j==cityNum-1?ibant[0]:ibant[j+1]))
{//cout<<500/((double)ibTSP/cityNum)<<endl;
pheromone[ibant[j]][k]=p*pheromone[ibant[j]][k]+0.15*((double)bestTSP/ibTSP);//350/((double)ibTSP/cityNum);//p*10/(cityNum-1);
if(pheromone[ibant[j]][k]>max_phm)
pheromone[ibant[j]][k]=max_phm;
}
else
{
pheromone[ibant[j]][k]=p*pheromone[ibant[j]][k];
// if(pheromone[ibant[j]][k]<0)
// pheromone[ibant[j]][k]=0;
}
}
}/*
for(i=1;i<cityNum;i++)
{cout.precision(2);
cout<<pheromone[bestant[i-1]][bestant[i]]<<' ';
}cout.precision(2);
cout<<pheromone[bestant[i-1]][bestant[0]]<<endl;*/
}
/* for(j=0;j<cityNum;j++)
{
for(k=0;k<cityNum;k++)
{
cout<<pheromone[j][k]<<'\t';
}cout<<endl;
}*/
for(j=0;j<cityNum;j++)
{
cout<<bestant[j]<<' ';
}cout<<endl;
cout<<bestTSP<<endl;
/* for(i=1;i<cityNum;i++)
{
cout<<pheromone[bestant[i-1]][bestant[i]]<<' ';
}cout<<pheromone[bestant[i-1]][bestant[0]]<<endl;*/
clock_t end_time=clock();
cout<< "Running time is: "<<static_cast<double>(end_time-start_time)/CLOCKS_PER_SEC*1000<<"ms"<<endl;//输出运行时间
}
void main()
{
srand(::GetTickCount());
ifstream in("input");
string s;
int i=0,j=0;
/**/ int cityNum=48;
int** city = new int*[cityNum];
for (i = 0; i < cityNum; i ++)
city[i] = new int[cityNum];
for(i=0;i<cityNum;i++){
getline(in,s);
j=0;
for(istringstream sin(s);sin>>city[i][j];j++);
}
int *best=new int[cityNum];
i=0;
ifstream bestin("bestresult");
while(!bestin.eof())
{
bestin>>best[i];
best[i]--;
i++;
}
/**/
/* for(j=0;j<cityNum;j++)
{
for(int k=0;k<cityNum;k++)
{
cout<<city[j][k]<<' ';
}cout<<endl;
}*/
cout<<"best"<<TSPfit(city,cityNum,best)<<endl;
ACOforTSP(city,100,100,0.9,cityNum);
ACOforTSP(city,100,100,0.85,cityNum);
ACOforTSP(city,100,100,0.7,cityNum);
ACOforTSP(city,100,100,0.75,cityNum);
ACOforTSP(city,100,100,0.96,cityNum);
// cout<<"--------modify---------"<<endl;
// modify(city,1,1,0.5,cityNum);
return;
}
ACO解TSP
最新推荐文章于 2024-04-10 09:50:42 发布