modulecompressop.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   beagle/GP/ModuleCompressOp.hpp
 *  \brief  Definition of ModuleCompressOp.
 *  \author Matthew Walker <[e-mail]>
 *  \author Christian Gagne <[e-mail]>
 *  $Revision: 1.3 $
 *  $Date: 2005/09/30 15:04:53 $
 */

#ifndef Beagle_GP_ModuleCompressOp_hpp
#define Beagle_GP_ModuleCompressOp_hpp

#include <string>

#include "beagle/config.hpp"
#include "beagle/macros.hpp"
#include "beagle/Object.hpp"
#include "beagle/PointerT.hpp"
#include "beagle/AllocatorT.hpp"
#include "beagle/ContainerT.hpp"
#include "beagle/Operator.hpp"
#include "beagle/System.hpp"
#include "beagle/Context.hpp"
#include "beagle/Float.hpp"
#include "beagle/String.hpp"
#include "beagle/GP/System.hpp"
#include "beagle/GP/Context.hpp"
#include "beagle/GP/Tree.hpp"
#include "beagle/GP/Individual.hpp"
#include "beagle/GP/Deme.hpp"

namespace Beagle {
namespace GP {


/*!
 *  \brief Compress operator for evolutionary module acquisition.
 *  \ingroup GPF
 *  \ingroup EMA
 */
class ModuleCompressOp : public Operator {

public:

  //! ModuleCompressOp allocator type.
  typedef AbstractAllocT<ModuleCompressOp,Operator::Alloc>
          Alloc;
  //! ModuleCompressOp handle type.
  typedef PointerT<ModuleCompressOp,Operator::Handle>
          Handle;
  //! ModuleCompressOp bag type.
  typedef ContainerT<ModuleCompressOp,Operator::Bag>
          Bag;

  explicit ModuleCompressOp(string inName="GP-ModuleCompressOp");
  virtual ~ModuleCompressOp() { }

  virtual void initialize(Beagle::System& ioSystem);
  virtual void cleanup(GP::Vivarium& ioVivarium, GP::Context& ioContext);
  virtual bool compress(unsigned int inModuleIndex, GP::Tree& ioTree, GP::Context& ioContext);
  virtual void operate(Beagle::Deme& ioDeme, Beagle::Context& ioContext);

protected:

  bool listCompressionCandidates(std::vector< unsigned int,BEAGLE_STLALLOCATOR<unsigned int> >& outCandidates,
                                 unsigned int inNodeIndex,
                                 const GP::Tree& inTree) const;

  String::Handle mModulePrimitName;     //!< Name of modules primitives.
  UInt::Handle   mMaxModulesVectorSize; //!< Maximum number of modules.
  UInt::Handle   mMaxModulesArgs;       //!< Maximum number of arguments to modules.
  Float::Handle  mCompressProba;        //!< Probability of compressing a given module in tree.

};

}
}

#endif // Beagle_GP_ModuleCompressOp_hpp