#include <COptMethodDE.h>

Inheritance diagram for COptMethodDE:

Collaboration diagram for COptMethodDE:

Public Member Functions
	COptMethodDE (const COptMethodDE &src, const CCopasiContainer *pParent=NULL)

virtual bool	optimise ()

virtual	~COptMethodDE ()

Public Member Functions inherited from COptMethod
	COptMethod (const COptMethod &src, const CCopasiContainer *pParent=NULL)

bool	isBounded (void)

virtual bool	isValidProblem (const CCopasiProblem *pProblem)

void	setProblem (COptProblem *problem)

virtual	~COptMethod ()

Public Member Functions inherited from CCopasiMethod
	CCopasiMethod (const CCopasiMethod &src, const CCopasiContainer *pParent=NULL)

const CCopasiMethod::SubType &	getSubType () const

const CCopasiTask::Type &	getType () const

virtual void	load (CReadConfig &configBuffer, CReadConfig::Mode mode=CReadConfig::SEARCH)

virtual void	print (std::ostream *ostream) const

virtual void	printResult (std::ostream *ostream) const

virtual bool	setCallBack (CProcessReport *pCallBack)

virtual	~CCopasiMethod ()

Public Member Functions inherited from CCopasiParameterGroup
bool	addGroup (const std::string &name)

bool	addParameter (const CCopasiParameter &parameter)

bool	addParameter (const std::string &name, const CCopasiParameter::Type type)

template<class CType >
bool	addParameter (const std::string &name, const CCopasiParameter::Type type, const CType &value)

void	addParameter (CCopasiParameter *pParameter)

CCopasiParameterGroup *	assertGroup (const std::string &name)

template<class CType >
CCopasiParameter *	assertParameter (const std::string &name, const CCopasiParameter::Type type, const CType &defaultValue)

index_iterator	beginIndex () const

name_iterator	beginName () const

	CCopasiParameterGroup (const CCopasiParameterGroup &src, const CCopasiContainer *pParent=NULL)

	CCopasiParameterGroup (const std::string &name, const CCopasiContainer *pParent=NULL, const std::string &objectType="ParameterGroup")

void	clear ()

virtual bool	elevateChildren ()

index_iterator	endIndex () const

name_iterator	endName () const

CCopasiParameterGroup *	getGroup (const std::string &name)

const CCopasiParameterGroup *	getGroup (const std::string &name) const

CCopasiParameterGroup *	getGroup (const size_t &index)

const CCopasiParameterGroup *	getGroup (const size_t &index) const

size_t	getIndex (const std::string &name) const

std::string	getKey (const std::string &name) const

std::string	getKey (const size_t &index) const

virtual const std::string &	getName (const size_t &index) const

virtual const CObjectInterface *	getObject (const CCopasiObjectName &cn) const

CCopasiParameter *	getParameter (const std::string &name)

const CCopasiParameter *	getParameter (const std::string &name) const

CCopasiParameter *	getParameter (const size_t &index)

const CCopasiParameter *	getParameter (const size_t &index) const

CCopasiParameter::Type	getType (const std::string &name) const

CCopasiParameter::Type	getType (const size_t &index) const

std::string	getUniqueParameterName (const CCopasiParameter *pParameter) const

const CCopasiParameter::Value &	getValue (const std::string &name) const

const CCopasiParameter::Value &	getValue (const size_t &index) const

CCopasiParameter::Value &	getValue (const std::string &name)

CCopasiParameter::Value &	getValue (const size_t &index)

CCopasiParameterGroup &	operator= (const CCopasiParameterGroup &rhs)

bool	removeParameter (const std::string &name)

bool	removeParameter (const size_t &index)

template<class CType >
bool	setValue (const std::string &name, const CType &value)

template<class CType >
bool	setValue (const size_t &index, const CType &value)

size_t	size () const

bool	swap (const size_t &iFrom, const size_t &iTo)

bool	swap (index_iterator &from, index_iterator &to)

virtual	~CCopasiParameterGroup ()

Public Member Functions inherited from CCopasiParameter
	CCopasiParameter (const CCopasiParameter &src, const CCopasiContainer *pParent=NULL)

	CCopasiParameter (const std::string &name, const Type &type, const void pValue=NULL, const CCopasiContainer pParent=NULL, const std::string &objectType="Parameter")

virtual CCopasiObjectName	getCN () const

virtual const std::string &	getKey () const

virtual std::string	getObjectDisplayName (bool regular=true, bool richtext=false) const

const CCopasiParameter::Type &	getType () const

const Value &	getValue () const

Value &	getValue ()

virtual void *	getValuePointer () const

CCopasiObject *	getValueReference () const

bool	isValidValue (const C_FLOAT64 &value) const

bool	isValidValue (const C_INT32 &value) const

bool	isValidValue (const unsigned C_INT32 &value) const

bool	isValidValue (const bool &value) const

bool	isValidValue (const std::string &value) const

bool	isValidValue (const CCopasiObjectName &value) const

bool	isValidValue (const std::vector< CCopasiParameter * > &value) const

CCopasiParameter &	operator= (const CCopasiParameter &rhs)

template<class CType >
bool	setValue (const CType &value)

bool	setValue (const std::vector< CCopasiParameter * > &value)

virtual	~CCopasiParameter ()

Public Member Functions inherited from CCopasiContainer
virtual bool	add (CCopasiObject *pObject, const bool &adopt=true)

	CCopasiContainer (const std::string &name, const CCopasiContainer *pParent=NULL, const std::string &type="CN", const unsigned C_INT32 &flag=CCopasiObject::Container)

	CCopasiContainer (const CCopasiContainer &src, const CCopasiContainer *pParent=NULL)

virtual std::string	getChildObjectUnits (const CCopasiObject *pObject) const

virtual const objectMap &	getObjects () const

virtual std::string	getUnits () const

virtual const CCopasiObject *	getValueObject () const

virtual bool	remove (CCopasiObject *pObject)

virtual	~CCopasiContainer ()

Public Member Functions inherited from CCopasiObject
void	addDirectDependency (const CCopasiObject *pObject)

	CCopasiObject (const CCopasiObject &src, const CCopasiContainer *pParent=NULL)

void	clearDirectDependencies ()

void	clearRefresh ()

bool	dependsOn (DataObjectSet candidates, const DataObjectSet &context=DataObjectSet()) const

void	getAllDependencies (DataObjectSet &dependencies, const DataObjectSet &context) const

virtual const DataObjectSet &	getDirectDependencies (const DataObjectSet &context=DataObjectSet()) const

CCopasiContainer *	getObjectAncestor (const std::string &type) const

CCopasiDataModel *	getObjectDataModel ()

const CCopasiDataModel *	getObjectDataModel () const

const std::string &	getObjectName () const

CCopasiContainer *	getObjectParent () const

const std::string &	getObjectType () const

virtual const CObjectInterface::ObjectSet &	getPrerequisites () const

virtual Refresh *	getRefresh () const

UpdateMethod *	getUpdateMethod () const

bool	hasCircularDependencies (DataObjectSet &candidates, DataObjectSet &verified, const DataObjectSet &context) const

bool	hasUpdateMethod () const

bool	isArray () const

bool	isContainer () const

bool	isDataModel () const

bool	isMatrix () const

bool	isNameVector () const

bool	isNonUniqueName () const

virtual bool	isPrerequisiteForContext (const CObjectInterface *pObject, const CMath::SimulationContextFlag &context, const CObjectInterface::ObjectSet &changedObjects) const

bool	isReference () const

bool	isRoot () const

bool	isSeparator () const

bool	isStaticString () const

bool	isValueBool () const

bool	isValueDbl () const

bool	isValueInt () const

bool	isValueInt64 () const

bool	isValueString () const

bool	isVector () const

virtual bool	mustBeDeleted (const DataObjectSet &deletedObjects) const

void	removeDirectDependency (const CCopasiObject *pObject)

void	setDirectDependencies (const DataObjectSet &directDependencies)

bool	setObjectName (const std::string &name)

virtual bool	setObjectParent (const CCopasiContainer *pParent)

void	setObjectValue (const C_FLOAT64 &value)

void	setObjectValue (const C_INT32 &value)

void	setObjectValue (const bool &value)

template<class CType >
void	setRefresh (CType pType, void(CType::method)(void))

template<class CType >
void	setUpdateMethod (CType pType, void(CType::method)(const C_FLOAT64 &))

template<class CType >
void	setUpdateMethod (CType pType, void(CType::method)(const C_INT32 &))

template<class CType >
void	setUpdateMethod (CType pType, void(CType::method)(const bool &))

virtual	~CCopasiObject ()

Public Member Functions inherited from CObjectInterface
	CObjectInterface ()

virtual	~CObjectInterface ()

Private Member Functions
void	boost ()

virtual bool	cleanup ()

	COptMethodDE (const CCopasiContainer *pParent=NULL)

bool	creation (size_t first, size_t last=std::numeric_limits< size_t >::max())

bool	evaluate (const CVector< C_FLOAT64 > &individual)

size_t	fittest ()

virtual bool	initialize ()

void	initObjects ()

bool	replicate ()

Private Attributes
size_t	mBestIndex

C_FLOAT64	mBestValue

C_FLOAT64	mEvaluationValue

unsigned C_INT32	mGeneration

unsigned C_INT32	mGenerations

size_t	mhGenerations

std::vector< CVector < C_FLOAT64 > * >	mIndividual

C_FLOAT64	mMutationVarians

unsigned C_INT32	mPopulationSize

CPermutation *	mpPermutation

CRandom *	mpRandom

CVector< C_FLOAT64 >	mValue

size_t	mVariableSize

Friends
COptMethod *	COptMethod::createMethod (CCopasiMethod::SubType subType)

Additional Inherited Members
Public Types inherited from CCopasiMethod
enum	SubType { unset = 0, RandomSearch, RandomSearchMaster, SimulatedAnnealing, CoranaWalk, DifferentialEvolution, ScatterSearch, GeneticAlgorithm, EvolutionaryProgram, SteepestDescent, HybridGASA, GeneticAlgorithmSR, HookeJeeves, LevenbergMarquardt, NelderMead, SRES, Statistics, ParticleSwarm, Praxis, TruncatedNewton, Newton, deterministic, LSODAR, directMethod, stochastic, tauLeap, adaptiveSA, hybrid, hybridLSODA, hybridODE45, DsaLsodar, tssILDM, tssILDMModified, tssCSP, mcaMethodReder, scanMethod, lyapWolf, sensMethod, EFMAlgorithm, EFMBitPatternTreeAlgorithm, EFMBitPatternAlgorithm, Householder, crossSectionMethod, linearNoiseApproximation }

Public Types inherited from CCopasiParameterGroup
typedef parameterGroup::iterator	index_iterator

typedef CCopasiContainer::objectMap::iterator	name_iterator

typedef std::vector < CCopasiParameter * >	parameterGroup

Public Types inherited from CCopasiParameter
enum	Type { DOUBLE = 0, UDOUBLE, INT, UINT, BOOL, GROUP, STRING, CN, KEY, FILE, EXPRESSION, INVALID }

Public Types inherited from CCopasiContainer
typedef std::multimap < std::string, CCopasiObject * >	objectMap

Public Types inherited from CCopasiObject
typedef std::set< const CCopasiObject * >	DataObjectSet

typedef std::vector< Refresh * >	DataUpdateSequence

Public Types inherited from CObjectInterface
typedef std::set< const CObjectInterface * >	ObjectSet

typedef std::vector < CObjectInterface * >	UpdateSequence

Static Public Member Functions inherited from COptMethod
static COptMethod *	createMethod (CCopasiMethod::SubType subType=CCopasiMethod::RandomSearch)

Static Public Member Functions inherited from CCopasiObject
static std::vector< Refresh * >	buildUpdateSequence (const DataObjectSet &objects, const DataObjectSet &uptoDateObjects, const DataObjectSet &context=DataObjectSet())

static void	setRenameHandler (CRenameHandler *rh)

Static Public Attributes inherited from CCopasiMethod
static const std::string	SubTypeName []

static const char *	XMLSubType []

Static Public Attributes inherited from CCopasiParameter
static const std::string	TypeName []

static const char *	XMLType []

Static Public Attributes inherited from CCopasiContainer
static const std::vector < CCopasiContainer * >	EmptyList

Protected Types inherited from CCopasiObject
enum	Flag { Container = 0x1, Vector = 0x2, Matrix = 0x4, NameVector = 0x8, Reference = 0x10, ValueBool = 0x20, ValueInt = 0x40, ValueInt64 = 0x80, ValueDbl = 0x100, NonUniqueName = 0x200, StaticString = 0x400, ValueString = 0x800, Separator = 0x1000, ModelEntity = 0x2000, Array = 0x4000, DataModel = 0x8000, Root = 0x10000, Gui = 0x20000 }

Protected Member Functions inherited from COptMethod
	COptMethod (const CCopasiTask::Type &taskType, const SubType &subType, const CCopasiContainer *pParent=NULL)

Protected Member Functions inherited from CCopasiMethod
	CCopasiMethod (const CCopasiTask::Type &taskType, const SubType &subType, const CCopasiContainer *pParent=NULL)

Protected Member Functions inherited from CCopasiParameterGroup
	CCopasiParameterGroup ()

Protected Member Functions inherited from CCopasiContainer
template<class CType >
CCopasiObject *	addMatrixReference (const std::string &name, CType &reference, const unsigned C_INT32 &flag=0)

template<class CType >
CCopasiObject *	addObjectReference (const std::string &name, CType &reference, const unsigned C_INT32 &flag=0)

template<class CType >
CCopasiObject *	addVectorReference (const std::string &name, CType &reference, const unsigned C_INT32 &flag=0)

void	initObjects ()

Protected Member Functions inherited from CCopasiObject
	CCopasiObject ()

	CCopasiObject (const std::string &name, const CCopasiContainer *pParent=NULL, const std::string &type="CN", const unsigned C_INT32 &flag=0)

Protected Attributes inherited from COptMethod
const bool	mBounds

const std::vector< COptItem * > *	mpOptContraints

const std::vector< COptItem * > *	mpOptItem

COptProblem *	mpOptProblem

COptTask *	mpParentTask

const std::vector < UpdateMethod * > *	mpSetCalculateVariable

Protected Attributes inherited from CCopasiMethod
CProcessReport *	mpCallBack

Protected Attributes inherited from CCopasiParameter
std::string	mKey

CCopasiObject *	mpValueReference

size_t	mSize

Value	mValue

Protected Attributes inherited from CCopasiContainer
objectMap	mObjects

Static Protected Attributes inherited from CCopasiObject
static CRenameHandler *	smpRenameHandler = NULL

Detailed Description

Definition at line 20 of file COptMethodDE.h.

Constructor & Destructor Documentation

COptMethodDE::COptMethodDE	(	const COptMethodDE &	src,
		const CCopasiContainer *	pParent = `NULL`
	)

Copy Constructor

Parameters

const	COptMethodDE & src
const	CCopasiContainer * pParent (default: NULL)

Definition at line 46 of file COptMethodDE.cpp.

References initObjects().

                                                             :
   COptMethod(src, pParent),
   mGenerations(0),
   mPopulationSize(0),
   mpRandom(NULL),
   mVariableSize(0),
   mIndividual(0),
   mpPermutation(NULL),
   mEvaluationValue(std::numeric_limits< C_FLOAT64 >::max()),
   mValue(0),
   mMutationVarians(0.1),
   mBestValue(std::numeric_limits< C_FLOAT64 >::max()),
   mBestIndex(C_INVALID_INDEX),
   mGeneration(0)
 {initObjects();}

COptMethodDE::~COptMethodDE ( )

virtual

Destructor

Definition at line 63 of file COptMethodDE.cpp.

References cleanup().

64 {cleanup();}

COptMethodDE::cleanup

virtual bool cleanup()

Definition: COptMethodDE.cpp:380

COptMethodDE::COptMethodDE ( const CCopasiContainer * pParent = NULL )

private

Default Constructor

Parameters

const CCopasiContainer * pParent (default: NULL)

Definition at line 22 of file COptMethodDE.cpp.

References CCopasiParameterGroup::addParameter(), C_INT32, initObjects(), CRandom::mt19937, and CCopasiParameter::UINT.

                                                           :
   COptMethod(CCopasiTask::optimization, CCopasiMethod::DifferentialEvolution, pParent),
   mGenerations(0),
   mPopulationSize(0),
   mpRandom(NULL),
   mVariableSize(0),
   mIndividual(0),
   mpPermutation(NULL),
   mEvaluationValue(std::numeric_limits< C_FLOAT64 >::max()),
   mValue(0),
   mMutationVarians(0.1),
   mBestValue(std::numeric_limits< C_FLOAT64 >::max()),
   mBestIndex(C_INVALID_INDEX),
   mGeneration(0)
 
 {
   addParameter("Number of Generations", CCopasiParameter::UINT, (unsigned C_INT32) 2000);
   addParameter("Population Size", CCopasiParameter::UINT, (unsigned C_INT32) 10);
   addParameter("Random Number Generator", CCopasiParameter::UINT, (unsigned C_INT32) CRandom::mt19937);
   addParameter("Seed", CCopasiParameter::UINT, (unsigned C_INT32) 0);
 
   initObjects();
 }

Member Function Documentation

void COptMethodDE::boost ( )

private

Definition at line 237 of file COptMethodDE.cpp.

References mIndividual, mPopulationSize, and mValue.

 {
   size_t i;
 
   for (i = 2 * mPopulationSize; i < 3 * mPopulationSize; i++)
     if (mValue[i] < mValue[i - 2 * mPopulationSize])
       {
         *mIndividual[i - 2 * mPopulationSize] = *mIndividual[i];
         mValue[i - 2 * mPopulationSize] = mValue[i];
       }
 }

bool COptMethodDE::cleanup ( )

privatevirtual

Cleanup arrays and pointers.

Returns: bool success

Reimplemented from COptMethod.

Definition at line 380 of file COptMethodDE.cpp.

References mIndividual, mpPermutation, mpRandom, and pdelete.

Referenced by initialize(), optimise(), and ~COptMethodDE().

 {
   size_t i;
 
   pdelete(mpRandom);
   pdelete(mpPermutation);
 
   for (i = 0; i < mIndividual.size(); i++)
     pdelete(mIndividual[i]);
 
   return true;
 }

bool COptMethodDE::creation	(	size_t	first,
		size_t	last = `std::numeric_limits<size_t>::max()`
	)

private

Initialise the population

Parameters

size_t	first
size_t	last (default: population size)

Returns: bool continue

Definition at line 250 of file COptMethodDE.cpp.

References C_FLOAT64, COptItem::checkConstraint(), evaluate(), COptItem::getLowerBoundValue(), CRandom::getRandomCC(), COptItem::getUpperBoundValue(), max, mBestIndex, mEvaluationValue, min, mIndividual, mPopulationSize, mpRandom, mValue, and mVariableSize.

Referenced by optimise().

 {
   size_t Last = std::min(last, (size_t) mPopulationSize);
   size_t i, j;
 
   C_FLOAT64 mn;
   C_FLOAT64 mx;
   C_FLOAT64 la;
 
   bool Continue = true;
 
   for (i = first; i < Last && Continue; i++)
     {
       // We do not want to loose the best individual;
       if (mBestIndex != i)
         for (j = 0; j < mVariableSize; j++)
           {
             // calculate lower and upper bounds
             COptItem & OptItem = *(*mpOptItem)[j];
             mn = *OptItem.getLowerBoundValue();
             mx = *OptItem.getUpperBoundValue();
 
             C_FLOAT64 & mut = (*mIndividual[i])[j];
 
             try
               {
                 // determine if linear or log scale
                 if ((mn < 0.0) || (mx <= 0.0))
                   mut = mn + mpRandom->getRandomCC() * (mx - mn);
                 else
                   {
                     la = log10(mx) - log10(std::max(mn, std::numeric_limits< C_FLOAT64 >::min()));
 
                     if (la < 1.8)
                       mut = mn + mpRandom->getRandomCC() * (mx - mn);
                     else
                       mut = pow(10.0, log10(std::max(mn, std::numeric_limits< C_FLOAT64 >::min())) + la * mpRandom->getRandomCC());
                   }
               }
 
             catch (...)
               {
                 mut = (mx + mn) * 0.5;
               }
 
             // force it to be within the bounds
             switch (OptItem.checkConstraint(mut))
               {
                 case - 1:
                   mut = *OptItem.getLowerBoundValue();
                   break;
 
                 case 1:
                   mut = *OptItem.getUpperBoundValue();
                   break;
               }
 
             // We need to set the value here so that further checks take
             // account of the value.
             (*(*mpSetCalculateVariable)[j])(mut);
           }
 
       // calculate its fitness
       Continue &= evaluate(*mIndividual[i]);
       mValue[i] = mEvaluationValue;
     }
 
   return Continue;
 }

bool COptMethodDE::evaluate ( const CVector< C_FLOAT64 > & individual )

private

Evaluate the fitness of one individual

Parameters

const CVector< C_FLOAT64 > & individual

Returns: bool continue

Definition at line 67 of file COptMethodDE.cpp.

References COptProblem::calculate(), COptProblem::checkFunctionalConstraints(), COptProblem::getCalculateValue(), mEvaluationValue, and COptMethod::mpOptProblem.

Referenced by creation(), optimise(), and replicate().

 {
   bool Continue = true;
 
   // We do not need to check whether the parametric constraints are fulfilled
   // since the parameters are created within the bounds.
 
   // evaluate the fitness
   Continue &= mpOptProblem->calculate();
 
   // check whether the functional constraints are fulfilled
   if (!mpOptProblem->checkFunctionalConstraints())
     mEvaluationValue = std::numeric_limits<C_FLOAT64>::infinity();
   else
     mEvaluationValue = mpOptProblem->getCalculateValue();
 
   return Continue;
 }

size_t COptMethodDE::fittest ( void )

private

Find the best individual at this generation

Returns: size_t fittest

Definition at line 221 of file COptMethodDE.cpp.

References C_FLOAT64, C_INVALID_INDEX, max, mPopulationSize, and mValue.

Referenced by optimise().

 {
   size_t i, BestIndex = C_INVALID_INDEX;
   C_FLOAT64 BestValue = std::numeric_limits< C_FLOAT64 >::max();
 
   for (i = 0; i < mPopulationSize; i++)
     if (mValue[i] < BestValue)
       {
         BestIndex = i;
         BestValue = mValue[i];
       }
 
   return BestIndex;
 }

bool COptMethodDE::initialize ( )

privatevirtual

Initialize arrays and pointer.

Returns: bool success

Reimplemented from COptMethod.

Definition at line 325 of file COptMethodDE.cpp.

References CProcessReport::addItem(), cleanup(), CRandom::createGenerator(), CProcessReport::finishItem(), CCopasiParameter::getValue(), COptMethod::initialize(), mBestValue, mGeneration, mGenerations, mhGenerations, mIndividual, mMutationVarians, CCopasiMethod::mpCallBack, COptMethod::mpOptItem, mPopulationSize, mpPermutation, mpRandom, mValue, mVariableSize, CCopasiParameter::Value::pUINT, CVector< CType >::resize(), and CCopasiParameterGroup::setValue().

Referenced by optimise().

 {
   cleanup();
 
   size_t i;
 
   if (!COptMethod::initialize())
     {
       if (mpCallBack)
         mpCallBack->finishItem(mhGenerations);
 
       return false;
     }
 
   mGenerations = * getValue("Number of Generations").pUINT;
   mGeneration = 0;
 
   if (mpCallBack)
     mhGenerations =
       mpCallBack->addItem("Current Generation",
                           mGeneration,
                           & mGenerations);
 
   mGeneration++;
 
   mPopulationSize = * getValue("Population Size").pUINT;
 
   if (mPopulationSize < 4)
     {
       mPopulationSize = 4;
       setValue("Population Size", mPopulationSize);
     }
 
   mpRandom =
     CRandom::createGenerator(* (CRandom::Type *) getValue("Random Number Generator").pUINT,
                              * getValue("Seed").pUINT);
 
   mpPermutation = new CPermutation(mpRandom, mPopulationSize);
 
   mVariableSize = mpOptItem->size();
 
   mIndividual.resize(3 * mPopulationSize);
 
   for (i = 0; i < 3 * mPopulationSize; i++)
     mIndividual[i] = new CVector< C_FLOAT64 >(mVariableSize);
 
   mValue.resize(3 * mPopulationSize);
   mValue = std::numeric_limits<C_FLOAT64>::infinity();
   mBestValue = std::numeric_limits<C_FLOAT64>::infinity();
 
   mMutationVarians = 0.1;
 
   return true;
 }

void COptMethodDE::initObjects ( )

private

Initialize contained objects.

Definition at line 320 of file COptMethodDE.cpp.

References CCopasiContainer::addObjectReference(), mGeneration, and CCopasiObject::ValueInt.

Referenced by COptMethodDE().

 {
   addObjectReference("Current Generation", mGeneration, CCopasiObject::ValueInt);
 }

bool COptMethodDE::optimise ( void )

virtual

Execute the optimization algorithm calling simulation routine when needed. It is noted that this procedure can give feedback of its progress by the callback function set with SetCallback. @ return success;

Reimplemented from COptMethod.

Definition at line 393 of file COptMethodDE.cpp.

References C_FLOAT64, C_INVALID_INDEX, COptItem::checkConstraint(), cleanup(), creation(), COutputInterface::DURING, evaluate(), CProcessReport::finishItem(), fittest(), COptItem::getLowerBoundValue(), COptItem::getStartValue(), COptItem::getUpperBoundValue(), initialize(), mBestIndex, mBestValue, mEvaluationValue, mGeneration, mGenerations, mhGenerations, mIndividual, CCopasiMethod::mpCallBack, COptMethod::mpOptProblem, mPopulationSize, COptMethod::mpParentTask, mValue, mVariableSize, CCopasiTask::output(), CProcessReport::progressItem(), replicate(), and COptProblem::setSolution().

 {
   bool Continue = true;
 
   if (!initialize())
     {
       if (mpCallBack)
         mpCallBack->finishItem(mhGenerations);
 
       return false;
     }
 
   size_t i;
 
   // initialise the population
   // first individual is the initial guess
   for (i = 0; i < mVariableSize; i++)
     {
       C_FLOAT64 & mut = (*mIndividual[0])[i];
       COptItem & OptItem = *(*mpOptItem)[i];
 
       mut = OptItem.getStartValue();
 
       // force it to be within the bounds
       switch (OptItem.checkConstraint(mut))
         {
           case - 1:
             mut = *OptItem.getLowerBoundValue();
             break;
 
           case 1:
             mut = *OptItem.getUpperBoundValue();
             break;
         }
 
       // We need to set the value here so that further checks take
       // account of the value.
       (*(*mpSetCalculateVariable)[i])(mut);
     }
 
   Continue &= evaluate(*mIndividual[0]);
   mValue[0] = mEvaluationValue;
 
   if (!isnan(mEvaluationValue))
     {
       // and store that value
       mBestValue = mValue[0];
       Continue &= mpOptProblem->setSolution(mBestValue, *mIndividual[0]);
 
       // We found a new best value lets report it.
       mpParentTask->output(COutputInterface::DURING);
     }
 
   // the others are random
   Continue &= creation(1, mPopulationSize);
 
   mBestIndex = fittest();
 
   if (mBestIndex != C_INVALID_INDEX &&
       mValue[mBestIndex] < mBestValue)
     {
       // and store that value
       mBestValue = mValue[mBestIndex];
       Continue = mpOptProblem->setSolution(mBestValue, *mIndividual[mBestIndex]);
 
       // We found a new best value lets report it.
       mpParentTask->output(COutputInterface::DURING);
     }
 
   if (!Continue)
     {
       if (mpCallBack)
         mpCallBack->finishItem(mhGenerations);
 
       cleanup();
       return true;
     }
 
   size_t Stalled = 0;
 
   // ITERATE FOR gener GENERATIONS
   for (mGeneration = 2;
        mGeneration <= mGenerations && Continue;
        mGeneration++, Stalled++)
     {
       if (Stalled > 10)
         {
           Continue &= creation((size_t) 0.4 * mPopulationSize, (size_t) 0.8 * mPopulationSize);
         }
 
       // perturb the population a bit
       Continue &= creation((size_t)(mPopulationSize * 0.9), mPopulationSize);
 
       Continue &= replicate();
 
       // get the index of the fittest
       mBestIndex = fittest();
 
       if (mBestIndex != C_INVALID_INDEX &&
           mValue[mBestIndex] < mBestValue)
         {
           Stalled = 0;
           mBestValue = mValue[mBestIndex];
 
           Continue &= mpOptProblem->setSolution(mBestValue, *mIndividual[mBestIndex]);
 
           // We found a new best value lets report it.
           //if (mpReport) mpReport->printBody();
           mpParentTask->output(COutputInterface::DURING);
         }
 
       if (mpCallBack)
         Continue &= mpCallBack->progressItem(mhGenerations);
     }
 
   if (mpCallBack)
     mpCallBack->finishItem(mhGenerations);
 
   cleanup();
 
   return true;
 }

bool COptMethodDE::replicate ( void )

private

Replicate the individuals with crossover

Returns: bool continue

Definition at line 86 of file COptMethodDE.cpp.

References C_FLOAT64, C_INVALID_INDEX, COptItem::checkConstraint(), evaluate(), COptItem::getLowerBoundValue(), CRandom::getRandomNormal(), CRandom::getRandomU(), COptItem::getUpperBoundValue(), mBestIndex, mEvaluationValue, mIndividual, mMutationVarians, mPopulationSize, mpPermutation, mpRandom, mValue, mVariableSize, CPermutation::next(), CPermutation::pick(), and CPermutation::shuffle().

Referenced by optimise().

 {
   size_t i, j;
   size_t a, b, c;
 
   bool Continue = true;
 
   for (i = mPopulationSize; i < 2 * mPopulationSize && Continue; i++)
     {
       mpPermutation->shuffle(3);
 
       // MUTATION a, b, c in [0, mPopulationSize - 1]
       a = mpPermutation->pick();
       // b is guaranteed to be different from a
       b = mpPermutation->next();
       // c is guaranteed to be different from a and b
       c = mpPermutation->next();
 
       // MUTATE CURRENT GENERATION
       for (j = 0; j < mVariableSize; j++)
         {
           COptItem & OptItem = *(*mpOptItem)[j];
           C_FLOAT64 & mut = (*mIndividual[i])[j];
 
           mut = (*mIndividual[c])[j] + 2 * ((*mIndividual[a])[j] - (*mIndividual[b])[j]);
 
           // force it to be within the bounds
           switch (OptItem.checkConstraint(mut))
             {
               case - 1:
                 mut = *OptItem.getLowerBoundValue();
                 break;
 
               case 1:
                 mut = *OptItem.getUpperBoundValue();
                 break;
             }
 
           // We need to set the value here so that further checks take
           // account of the value.
           (*(*mpSetCalculateVariable)[j])(mut);
         }
 
       Continue &= evaluate(*mIndividual[i]);
       mValue[i] = mEvaluationValue;
     }
 
   //CROSSOVER MUTATED GENERATION WITH THE CURRENT ONE
   for (i = 2 * mPopulationSize; i < 3 * mPopulationSize && Continue; i++)
     {
       for (j = 0; j < mVariableSize; j++)
         {
 
           COptItem & OptItem = *(*mpOptItem)[j];
           C_FLOAT64 & mut = (*mIndividual[i])[j];
 
           size_t r = mpRandom->getRandomU(mPopulationSize - 1);
 
           if (r < 0.6 * mPopulationSize)
             {
               mut = (*mIndividual[i - mPopulationSize])[j] *
                     mpRandom->getRandomNormal(1, mMutationVarians);
             }
 
           else
             mut = (*mIndividual[i - 2 * mPopulationSize])[j];
 
           // force it to be within the bounds
           switch (OptItem.checkConstraint(mut))
             {
               case - 1:
                 mut = *OptItem.getLowerBoundValue();
                 break;
 
               case 1:
                 mut = *OptItem.getUpperBoundValue();
                 break;
             }
 
           (*(*mpSetCalculateVariable)[j])(mut);
         }
 
       Continue &= evaluate(*mIndividual[i]);
       mValue[i] = mEvaluationValue;
     }
 
   //SELECT NEXT GENERATION
   for (i = 2 * mPopulationSize; i < 3 * mPopulationSize && Continue; i++)
     {
       if (mValue[i - mPopulationSize] > mValue[i] && mValue[i - 2 * mPopulationSize] > mValue[i])
         {
           *mIndividual[i - 2 * mPopulationSize] = *mIndividual[i];
           mValue[i - 2 * mPopulationSize] = mValue[i];
         }
       else if (mValue[i - mPopulationSize] < mValue[i - 2 * mPopulationSize])
         {
           *mIndividual[i - 2 * mPopulationSize] = *mIndividual[i - mPopulationSize];
           mValue[i - 2 * mPopulationSize] = mValue[i - mPopulationSize];
         }
       else if (mBestIndex != i && mBestIndex == C_INVALID_INDEX)
         {
           for (j = 0; j < mVariableSize; j++)
             {
               COptItem & OptItem = *(*mpOptItem)[j];
               C_FLOAT64 & mut = (*mIndividual[i - 2 * mPopulationSize])[j];
 
               size_t r = mpRandom->getRandomU(mPopulationSize - 1);
 
               if (r < 0.6 * mPopulationSize)
                 mut *= mpRandom->getRandomNormal(1, mMutationVarians);
 
               // force it to be within the bounds
               switch (OptItem.checkConstraint(mut))
                 {
                   case - 1:
                     mut = *OptItem.getLowerBoundValue();
                     break;
 
                   case 1:
                     mut = *OptItem.getUpperBoundValue();
                     break;
                 }
 
               (*(*mpSetCalculateVariable)[j])(mut);
             }
 
           Continue &= evaluate(*mIndividual[i - 2 * mPopulationSize]);
           mValue[i - 2 * mPopulationSize] = mEvaluationValue;
         }
     }
 
   return Continue;
 }