antsystem.h

一个用VC的蚁群算法解决TSP问题

#pragma once
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
class CAntSystem{
	const int NC_MAX;
	double **m_matrix;
	double **trailIntensity,**d_trail;
	set<int> *tabu;
	vector<int>*road;
	int nu;
	int ants;
	int t;
	double alfa,beita,luo,Q;
	double* L;
	void destroy();
	void start(void);
	double Probability(int i,int j,int k);
	double move(int&);
public:
	CAntSystem(int n,int m,int max=100);
	CAntSystem(int max=100);
	~CAntSystem();
	bool SetData(int i, int j, double v);
	bool ResetSize(int n,int m);
	void Initial(int n,int m);
	void SetCoef(double a, double b, double p, double q);
	double GetRoad(int&);
};