maxfctesevalop.hpp

非常好的进化算法EC 实现平台 可以实现多种算法 GA GP

/*
 *  Open BEAGLE
 *  Copyright (C) 2001-2005 by Christian Gagne and Marc Parizeau
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License as published by the Free Software Foundation; either
 *  version 2.1 of the License, or (at your option) any later version.
 *
 *  This library is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *  Contact:
 *  Laboratoire de Vision et Systemes Numeriques
 *  Departement de genie electrique et de genie informatique
 *  Universite Laval, Quebec, Canada, G1K 7P4
 *  http://vision.gel.ulaval.ca
 *
 */

/*!
 *  \file   MaxFctESEvalOp.hpp
 *  \brief  Definition of the type MaxFctESEvalOp.
 *  \author Christian Gagne
 *  \author Marc Parizeau
 *  $Revision: 1.8 $
 *  $Date: 2005/10/04 09:32:54 $
 */

/*!
 *  \defgroup MaxFctES Function Maximization with Evolution Strategy Example
 *  \brief Function maximization with Evolution Strategy (maxfctes):
 *    An ES example with Open BEAGLE
 *
 *  \par Objective
 *  Find the maximum of the following 5D function:
 *  \f$f(x) = \frac{161.8}{(u_N^2 \sum_{k=0}^{N-1}(x_k^2 + u_k^2))}\f$
 *  with \f$x = <x_0, x_1, ..., x_{N-1}>\f$, \f$u_{k+1} = x_k + u_k\f$, \f$x_k\f$
 *  in \f$[-200,200]\f$ for all \f$k\f$, \f$N = 5\f$ and \f$u_0 = 10\f$.
 *
 *  \par Representation
 *  Vector of five ES pairs, each pair being an association of a value
 *  and a mutation strategy parameter. The values represents the function's
 *  five arguments \f$x_i\f$. They are limited in the interval
 *  \f$[-200,200]\f$ at the evaluation time.
 *
 *  \par Fitness
 *  Value of \f$f(x_1,x_2,x_3,x_4,x_5)\f$.
 *
 */

#ifndef MaxFctESEvalOp_hpp
#define MaxFctESEvalOp_hpp

#include "beagle/GA.hpp"
#include <vector>

/*!
 *  \class MaxFctESEvalOp MaxFctESEvalOp.hpp "MaxFctESEvalOp.hpp"
 *  \brief The individual evaluation class operator for the problem of ES
 *    function maximisation.
 *  \ingroup MaxFctES
 */
class MaxFctESEvalOp : public Beagle::EvaluationOp {

public:

  //! MaxFctESEvalOp allocator type.
  typedef Beagle::AllocatorT<MaxFctESEvalOp,Beagle::EvaluationOp::Alloc>
          Alloc;
  //!< MaxFctESEvalOp handle type.
  typedef Beagle::PointerT<MaxFctESEvalOp,Beagle::EvaluationOp::Handle>
          Handle;
  //!< MaxFctESEvalOp bag type.
  typedef Beagle::ContainerT<MaxFctESEvalOp,Beagle::EvaluationOp::Bag>
          Bag;

  explicit MaxFctESEvalOp();

  virtual Beagle::Fitness::Handle evaluate(Beagle::Individual& inIndividual,
                                           Beagle::Context& ioContext);

};

#endif // MaxFctESEvalOp_hpp