pso1darraysolution.cpp

遗传算法vc++语言版源程序,台湾大学编写。

#include "PSO1DArraySolution.h"
#include "UOFProblem.h"
#include <iostream>
#include <cfloat>
using namespace std;

PSO1DArraySolution::PSO1DArraySolution(size_t length, UOFInitializer *init, UOFEvaluator *eval)
:PopSolution(init,eval)
{
	m_Array.resize(length);
	m_Best.resize(length);
	m_Velo.resize(length);

	if(m_pInit)	SelfInit();
	// set default operator
	static MyPSOMove pm;
	m_pMove = &pm;
}

PSO1DArraySolution::PSO1DArraySolution(UOFInitializer *init, UOFEvaluator *eval)
:PopSolution(init,eval)
{
	size_t length = eval->m_pProblem->GetProblemDim();
	m_Array.resize(length);
	m_Best.resize(length);
	m_Velo.resize(length);

	if(m_pInit)	SelfInit();
	// set default operator
	static MyPSOMove pm;
	m_pMove = &pm;
}
PSO1DArraySolution::PSO1DArraySolution(const PSO1DArraySolution& src)
:PopSolution(src)
{
	m_Array.resize(src.m_Array.size());
	m_Best.resize(src.m_Array.size());
	m_Velo.resize(src.m_Array.size());
	PSO1DArraySolution::copy(src);
}
PSO1DArraySolution& PSO1DArraySolution::operator=(const PSO1DArraySolution& arg)
{
	copy(arg);
	return *this;
}
PSO1DArraySolution::~PSO1DArraySolution()
{
}
PSO1DArraySolution* PSO1DArraySolution::clone() const
{
	return new PSO1DArraySolution(*this);
}
void PSO1DArraySolution::copy(const PSO1DArraySolution& src)
{
	if(&src == this) return;

	if(&src)
	{
		PopSolution::copy(src);
		m_Array = src.m_Array;
		m_Best = src.m_Best;
		m_Velo = src.m_Velo;
		m_pMove	= src.m_pMove;
	}
}
void PSO1DArraySolution::PrintSelf(ostream& os)
{
	for(size_t a=0;a<m_Array.size();a++)
	{
		os << m_Array[a] << ", ";
	}
	os << endl;
}

void PSO1DArraySolution::SelfInit()
{
	(*m_pInit)(static_cast<void*>(&(this->m_Array)), this->GetEval()->m_pProblem);
		
	m_Best = m_Array;
	fill(m_Velo.begin(),m_Velo.end(),0.0);
	m_BestScore = DBL_MAX;
}
int	PSO1DArraySolution::MyPSOMove::operator()(PopSolution* bp, PopSolution* p1, double w, double c1, double c2)
{
	PSO1DArraySolution *best = dynamic_cast<PSO1DArraySolution*>(bp);
	PSO1DArraySolution *cur = dynamic_cast<PSO1DArraySolution*>(p1);

	for(size_t i=0;i<cur->m_Array.size();i++)
		cur->m_Velo[i] = w*cur->m_Velo[i] + c1*(::RG.Random())*(cur->m_Best[i] - cur->m_Array[i])
			+ c1*(::RG.Random())*(best->m_Best[i] - cur->m_Array[i]);

	for(size_t i=0;i<cur->m_Array.size();i++)
		cur->m_Array[i] = cur->m_Array[i] + cur->m_Velo[i];
	return 1;
}