triangle.cpp

这是一个遗传算法

// Triangle.cpp : implementation file
//

#include "stdafx.h"
#include "CProgramTested.h"

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

/////////////////////////////////////////////////////////////////////////////
// CTriangle

CProgramTested::CPragramTested()
{
}

CProgramTested::~CPragramTested()
{
}


BEGIN_MESSAGE_MAP(CProgramTested, CWnd)
	//{{AFX_MSG_MAP(CPragramTested)
		// NOTE - the ClassWizard will add and remove mapping macros here.
	//}}AFX_MSG_MAP
END_MESSAGE_MAP()


/////////////////////////////////////////////////////////////////////////////
// CPragramTested message handlers
unsigned CProgramTested::Triangle()
{

	int SideA=0, SideB=0, SideC=0;
	GALib.Pops[i].sum=0;
	SideA = GALib.Pops[i].IntValues[0];
	SideB = GALib.Pops[i].IntValues[1];
	SideC = GALib.Pops[i].IntValues[2];
	if ((SideA + SideB > SideC) && (SideB + SideC > SideA)
		&& (SideC + SideA > SideB))
	{ 
		GALib.Pops[i].PathValues[0] = 1;
		if ((SideA != SideB) && (SideB != SideC)
			&& (SideC != SideA))
		{ 
			GALib.Pops[i].PathValues[1] = 1;
		}
		else
		{
			GALib.Pops[i].PathValues[2] = 1;
			if (((SideA ==SideB) && (SideB != SideC))
				|| ((SideB == SideC) && (SideC != SideA))
				|| ((SideC == SideA) && (SideA != SideB)))
			{ 
				GALib.Pops[i].PathValues[3] = 1;
			}
			else
			{ 
				GALib.Pops[i].PathValues[4] = 1;
			}
		}
	}
	else 
	{
		GALib.Pops[i].PathValues[5] = 1;
	}	


	for(int j=0;j<6;j++)
	{
		GALib.Pops[i].sum+=GALib.Pops[i].PathValues[j];
	}
	if(wPopulations[i].sum>GALib.Pops[i].sum) 
	{
		return 0;   //父代适应度高
	}
		else return 1; //子代适应度高
}