main.cpp

遗传算法实现旅行商问题：经典遗传算法解决旅行商问题

#include "global.h"

void evolution();

int main()
{
	srand(unsigned(time(0)));
	clock_t start,finish;
	double totaltime;
	start=clock();
	evolution();
	finish=clock();
	totaltime=(double)(finish-start)/CLOCKS_PER_SEC;
	cout<<"\n此程序运行时间为："<<totaltime<<endl;
	return 0;
}
void evolution()
{
	ofstream groupout("group.txt");
	ofstream bestout("best.txt");
	if (!groupout||!bestout)
	{
		cout<<"no file!"<<endl;
	}
	
	int loop=0;
	int noevo=0;
	Group gp0;
//	ofstream test("test.txt");
//	gp0.printGroup(test);
	Group& parent=gp0;
	Group& next=parent.evolute();
	do 
	{
		loop++;
		next=parent.evolute();
		next.printBestIndividual(cout);
		next.printBestIndividual(bestout);
		next.printGroup(groupout);
		if (next==parent)
		{
			noevo++;
		}
		else
		{
			noevo=0;
		}
		if (noevo==NOEVOLUTE)
		{
			break;
		}
		parent=next;
	}while(loop<TOTALEVOLUTE);
	cout<<"见group.txt"<<endl;
}