CEC 2013 Problem Suite (box-bound, single objective)#

class cec2013#

The CEC 2013 problems: Real-Parameter Single Objective Optimization Competition.

../../../_images/cec2013.png

The 28 problems of the competition on real-parameter single objective optimization problems that was organized for the 2013 IEEE Congress on Evolutionary Computation.

Note

The code for these UDAs is adapted from the original C code distributed during the competition and linked below.

Note

All problems are box-bounded, continuous, single objective problems.

Public Functions

cec2013(unsigned prob_id = 1u, unsigned dim = 2u)#

Constructor.

Will construct one of the 28 CEC2013 problems

Parameters
  • prob_id – The problem id. One of [1,2,…,28]

  • dim – problem dimension. One of [2,5,10,20,30,…,100]

Throws

invalid_argument – if prob_id is not in [1,18] or if dim is not one of [2,5,10,20,30,40,50,60,70,80,90,100]

vector_double fitness(const vector_double&) const#

Fitness computation.

Computes the fitness for this UDP

Parameters

x – the decision vector.

Returns

the fitness of x.

std::pair<vector_double, vector_double> get_bounds() const#

Box-bounds.

It returns the box-bounds for this UDP.

Returns

the lower and upper bounds for each of the decision vector components

std::string get_name() const#

Problem name.

Returns

a string containing the problem name