inisialdlg.cpp

本遗传算法是保留大量状态种群的随机爬山搜索算法

// InisialDlg.cpp : implementation file
//

#include "stdafx.h"
#include "yichuansuanfa.h"
#include "InisialDlg.h"

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

/////////////////////////////////////////////////////////////////////////////
// CInisialDlg dialog


CInisialDlg::CInisialDlg(CWnd* pParent /*=NULL*/)
	: CDialog(CInisialDlg::IDD, pParent)
{
	//{{AFX_DATA_INIT(CInisialDlg)
	m_nbianyigailv = 0.0f;
	m_ndiedai = 0;
	m_njiaocha = 0.0f;
	m_nqunti = 0;
	m_nShiyingdu = 0.0;
	//}}AFX_DATA_INIT
}


void CInisialDlg::DoDataExchange(CDataExchange* pDX)
{
	CDialog::DoDataExchange(pDX);
	//{{AFX_DATA_MAP(CInisialDlg)
	DDX_Control(pDX, IDC_FORMULAR_EDIT, m_nformular);
	DDX_Text(pDX, IDC_Bianyi_EDIT, m_nbianyigailv);
	DDX_Text(pDX, IDC_Diedai_EDIT, m_ndiedai);
	DDX_Text(pDX, IDC_Jiaocha_EDIT, m_njiaocha);
	DDX_Text(pDX, IDC_Qunti_EDIT, m_nqunti);
	DDX_Text(pDX, IDC_SHIYINGDU, m_nShiyingdu);
	//}}AFX_DATA_MAP
}


BEGIN_MESSAGE_MAP(CInisialDlg, CDialog)
	//{{AFX_MSG_MAP(CInisialDlg)
	//}}AFX_MSG_MAP
END_MESSAGE_MAP()

/////////////////////////////////////////////////////////////////////////////
// CInisialDlg message handlers

void CInisialDlg::OnOK() 
{
	// TODO: Add extra validation here
	
    extern int num;
    UpdateData();
	m_nformular.GetWindowText(str);
	mformular.SetFormula(str.GetBuffer(str.GetLength()));
	num=mformular.GetVariantTableSize();
	if(num==0)
	{
	 AfxMessageBox("变量数目为0，请从新输入！");
     return;
	}
	
	if(!(m_njiaocha>=0 && m_njiaocha<=1))
	{
      AfxMessageBox("交叉概率应在0~1之间，请从新输入！");
      return;
	}
    if(m_nbianyigailv<0 ||m_nbianyigailv>1)
	{
      AfxMessageBox("变异概率应在0~1之间，请从新输入！");
      return;
	}
	if(m_nqunti<0)
	{
      AfxMessageBox("群体大小应大于0，请从新输入！");
      return;
	}
	if(m_ndiedai<0)
	{
     AfxMessageBox("叠代次数应大于0，请从新输入！");
      return;
	}

	CDialog::OnOK();
}