OptimizationResults

A S4 class storing all relevant data from an optimization with EmiR.

A C++ implementation of the following evolutionary
algorithms: Bat Algorithm (Yang, 2010 <doi:10.1007/978-3-642-12538-6_6>),
Cuckoo Search (Yang, 2009 <doi:10.1109/nabic.2009.5393690>),
Genetic Algorithms (Holland, 1992, ISBN:978-0262581110),
Gravitational Search Algorithm (Rashedi et al., 2009 <doi:10.1016/j.ins.2009.03.004>),
Grey Wolf Optimization (Mirjalili et al., 2014 <doi:10.1016/j.advengsoft.2013.12.007>),
Harmony Search (Geem et al., 2001 <doi:10.1177/003754970107600201>),
Improved Harmony Search (Mahdavi et al., 2007 <doi:10.1016/j.amc.2006.11.033>),
Moth-flame Optimization (Mirjalili, 2015 <doi:10.1016/j.knosys.2015.07.006>),
Particle Swarm Optimization (Kennedy et al., 2001 ISBN:1558605959),
Simulated Annealing (Kirkpatrick et al., 1983 <doi:10.1126/science.220.4598.671>),
Whale Optimization Algorithm (Mirjalili and Lewis, 2016 <doi:10.1016/j.advengsoft.2016.01.008>).
'EmiR' can be used not only for unconstrained optimization problems, but also
in presence of inequality constrains, and variables restricted to be integers.

Lorenzo Sostero

EmiR

Evolutionary Minimizer for R

Davide Pagano

OptimizationResults function

<dl>
<dt><code>algorithm</code></dt>
<dd>the name of the algorithm.</dd></dl>
<dt><code>iterations</code></dt>
<dd>the number of iterations.</dd>
<dt><code>population_size</code></dt>
<dd>the number of individuals in the population.</dd>
<dt><code>obj_function</code></dt>
<dd>the minimized/maximized objective function.</dd>
<dt><code>constraints</code></dt>
<dd>the constraints the objective function is subjected to.</dd>
<dt><code>best_cost</code></dt>
<dd>the best value of the objective function found.</dd>
<dt><code>best_parameters</code></dt>
<dd>the parameter values for which the best cost was obtained.</dd>
<dt><code>parameter_range</code></dt>
<dd>the range on the parameters.</dd>
<dt><code>pop_history</code></dt>
<dd>list containing the positions of all individuals in the
population at each iteration. The list is filled only if <code>save_pop_history</code>
is <code>TRUE</code> in the options of the minimizer (see MinimizerOpts).</dd>
<dt><code>cost_history</code></dt>
<dd>the vector storing the best value of the objective function at
each iteration.</dd>
<dt><code>exec_time_sec</code></dt>
<dd>the execution time in seconds.</dd>
<dt><code>is_maximization</code></dt>
<dd>if <code>TRUE</code> the objective function has been maximized insted of
being minimized.</dd>

Slots

EmiR optimization results — OptimizationResults

<dl>
<dt><code>algorithm</code></dt>
<dd>the name of the algorithm.</dd>


<dt><code>iterations</code></dt>
<dd>the number of iterations.</dd>


<dt><code>population_size</code></dt>
<dd>the number of individuals in the population.</dd>


<dt><code>obj_function</code></dt>
<dd>the minimized/maximized objective function.</dd>


<dt><code>constraints</code></dt>
<dd>the constraints the objective function is subjected to.</dd>


<dt><code>best_cost</code></dt>
<dd>the best value of the objective function found.</dd>


<dt><code>best_parameters</code></dt>
<dd>the parameter values for which the best cost was obtained.</dd>


<dt><code>parameter_range</code></dt>
<dd>the range on the parameters.</dd>


<dt><code>pop_history</code></dt>
<dd>list containing the positions of all individuals in the
population at each iteration. The list is filled only if <code>save_pop_history</code>
is <code>TRUE</code> in the options of the minimizer (see MinimizerOpts).</dd>


<dt><code>cost_history</code></dt>
<dd>the vector storing the best value of the objective function at
each iteration.</dd>


<dt><code>exec_time_sec</code></dt>
<dd>the execution time in seconds.</dd>


<dt><code>is_maximization</code></dt>
<dd>if <code>TRUE</code> the objective function has been maximized insted of
being minimized.</dd>


</dl>

OptimizationResults: EmiR optimization results

Description

Arguments

Slots