PaGMO  1.1.5
Public Member Functions | Protected Member Functions | Friends
pagmo::algorithm::sea Class Reference

(N+1)-EA Simple Evolutionary Algorithm More...

#include <sea.h>

Inheritance diagram for pagmo::algorithm::sea:
Inheritance graph
[legend]

Public Member Functions

 sea (int gen=1)
 Constructor. More...
 
base_ptr clone () const
 Clone method.
 
void evolve (population &) const
 Evolve implementation. More...
 
std::string get_name () const
 Algorithm name.
 
- Public Member Functions inherited from pagmo::algorithm::base
 base ()
 Default constructor. More...
 
virtual ~base ()
 Trivial destructor. More...
 
std::string human_readable () const
 Return human readable representation of the algorithm. More...
 
void set_screen_output (const bool p)
 Setter-Getter for protected m_screen_output data. More...
 
bool get_screen_output () const
 Gets screen output. More...
 
void reset_rngs (const unsigned int) const
 Resets the seed of the internal rngs using a user-provided seed. More...
 

Protected Member Functions

std::string human_readable_extra () const
 Extra human readable algorithm info. More...
 

Friends

class boost::serialization::access
 

Additional Inherited Members

- Protected Attributes inherited from pagmo::algorithm::base
bool m_screen_output
 Indicates to the derived class whether to print stuff on screen.
 
rng_double m_drng
 Random number generator for double-precision floating point values.
 
rng_uint32 m_urng
 Random number generator for unsigned integer values.
 
unsigned int m_fevals
 A counter for the number of function evaluations.
 

Detailed Description

(N+1)-EA Simple Evolutionary Algorithm

Used in many works dealing with

At each generation the best individual is selected and offspring is generated performing a global mutation on it (for each dimension of the problem the gene is forced to a random gene inside the contrains).

This particular implementation of EA is able to solve integer box-contrained single-objective problems.

See also
Oliveto, Pietro S., Jun He, and Xin Yao. "Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results." International Journal of Automation and Computing 4.3 (2007): 281-293.
Author
Andrea Mambrini (andre.nosp@m.a.ma.nosp@m.mbrin.nosp@m.i@gm.nosp@m.ail.c.nosp@m.om)

Definition at line 53 of file sea.h.

Constructor & Destructor Documentation

pagmo::algorithm::sea::sea ( int  gen = 1)

Constructor.

Allows to specify in detail all the parameters of the algorithm.

Parameters
[in]genNumber of generations to evolve.
Exceptions
value_errorif gen is negative, or the problem i not integer, box contrained and single-objective

Definition at line 46 of file sea.cpp.

Member Function Documentation

void pagmo::algorithm::sea::evolve ( population pop) const
virtual

Evolve implementation.

Run the EA for the number of generations specified in the constructors.

Parameters
[in,out]popinput/output pagmo::population to be evolved.

Implements pagmo::algorithm::base.

Definition at line 67 of file sea.cpp.

std::string pagmo::algorithm::sea::human_readable_extra ( ) const
protectedvirtual

Extra human readable algorithm info.

Will return a formatted string displaying the parameters of the algorithm.

Reimplemented from pagmo::algorithm::base.

Definition at line 124 of file sea.cpp.


The documentation for this class was generated from the following files: