tsp_as.h

来自「TSP的智能算法」· C头文件 代码 · 共 67 行

///////////////////////////////////////////////////////////
// This virsion is AntSystem 1.0
// author: zhaochaoqing ChongQing University
//
//the author can be contacted at:
//   Email: [e-mail]
//
////////////////////////////////////////////////////////////

//
// TSP_AS.h :interface for TPS_AS class
////////////////////////////////////////////////////////////

#if !defined (TSP_AS_IHK_KHFK_KJFHL_KDHFLKDH_DHFIO_)
#define TSP_AS_IHK_KHFK_KJFHL_KDHFLKDH_DHFIO_

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

#include"TSP_Generic.h"

class TSP_AS:public TSP_Generic
{
public:
	TSP_AS();
	virtual ~TSP_AS();
public:
	virtual void Initialize();
	virtual void ComputeTour();

	double	GetTauAt(int i, int j)				{return m_aTau[i][j];}
	double		GetDistAt(int i, int j)				{return m_aDist[i][j];}
	double	GetVisAt(int i, int j)				{return m_aVis[i][j];}
	void	SetTauAt(int i, int j, double dTau)	{m_aTau[i][j] = dTau;}
	void	SetDistAt(int i, int j, double nDist)	{m_aDist[i][j] = nDist;}
	void	SetVisAt(int i, int j, double dVis)	{m_aVis[i][j] = dVis;}

	double	GetTau0()	{return m_dTau0;}
	int		GetBeta()	{return m_nBeta;}
	int		GetAlpha()	{return m_nAlpha;}
	int		GetQ()		{return m_nQ;}
	int		GetE()		{return m_nE;}
	double	GetRho()	{return m_dRho;}
	int		GetM()		{return m_nM;}
	int		GetTMax()	{return m_nTMax;}

private:
	// tau, dist and vis matrices
	double** m_aTau;
	int**	 m_aDist;
	double** m_aVis;

	// other constants
	int		m_nAlpha;
	int		m_nBeta;
	double	m_dRho;
	int		m_nQ;
	int		m_nE;
	int		m_nM;
	double	m_dTau0;

	int		m_nTMax;	// how many times to repeat

};

#endif  //!defined (TSP_AS_IHK_KHFK_KJFHL_KDHFLKDH_DHFIO_)