travelspdoc.cpp

用遗传算法实现巡回旅行商（邮差问题）的程序。可自由设置城市位置及数目

// travelSPDoc.cpp : implementation of the CTravelSPDoc class
//

#include "stdafx.h"
#include "travelSP.h"
#include "travelSPDoc.h"



#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif

/////////////////////////////////////////////////////////////////////////////
// CTravelSPDoc

IMPLEMENT_DYNCREATE(CTravelSPDoc, CDocument)

BEGIN_MESSAGE_MAP(CTravelSPDoc, CDocument)
	//{{AFX_MSG_MAP(CTravelSPDoc)
		// NOTE - the ClassWizard will add and remove mapping macros here.
		//    DO NOT EDIT what you see in these blocks of generated code!
	//}}AFX_MSG_MAP
END_MESSAGE_MAP()

/////////////////////////////////////////////////////////////////////////////
// CTravelSPDoc construction/destruction

CTravelSPDoc::CTravelSPDoc()
{
	// TODO: add one-time construction code here

	maxindiv=80;
	maxgen=100;
	citysum=0;
	crossrate=0.46;
	best_s=0;
	complete_run=0;
}

CTravelSPDoc::~CTravelSPDoc()
{
}

BOOL CTravelSPDoc::OnNewDocument()
{
	if (!CDocument::OnNewDocument())
		return FALSE;

	// TODO: add reinitialization code here
	// (SDI documents will reuse this document)

	return TRUE;
}



/////////////////////////////////////////////////////////////////////////////
// CTravelSPDoc serialization

void CTravelSPDoc::Serialize(CArchive& ar)
{
	int i;
	if (ar.IsStoring())
	{
		// TODO: add storing code here
		ar<<citysum;
		for(i=0;i<citysum;i++)
			ar<<citysite[i];
	}
	else
	{
		// TODO: add loading code here
		ar>>citysum;
		for(i=0;i<citysum;i++)
			ar>>citysite[i];

	}
}

/////////////////////////////////////////////////////////////////////////////
// CTravelSPDoc diagnostics

#ifdef _DEBUG
void CTravelSPDoc::AssertValid() const
{
	CDocument::AssertValid();
}

void CTravelSPDoc::Dump(CDumpContext& dc) const
{
	CDocument::Dump(dc);
}
#endif //_DEBUG

/////////////////////////////////////////////////////////////////////////////
// CTravelSPDoc commands


/*void CTravelSPDoc::preinit()
{
	pcount->maxgen=maxgen;
	pcount->citysum=citysum;
	pcount->maxindiv=maxindiv;

	
}
*/