1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/* Copyright 2017-2021 PaGMO development team
This file is part of the PaGMO library.
The PaGMO library is free software; you can redistribute it and/or modify
it under the terms of either:
* the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at your
option) any later version.
or
* the GNU General Public License as published by the Free Software
Foundation; either version 3 of the License, or (at your option) any
later version.
or both in parallel, as here.
The PaGMO 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 General Public License
for more details.
You should have received copies of the GNU General Public License and the
GNU Lesser General Public License along with the PaGMO library. If not,
see https://www.gnu.org/licenses/. */
#define BOOST_TEST_MODULE cec2009_test
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include <iostream>
#include <stdexcept>
#include <string>
#include <boost/lexical_cast.hpp>
#include <pagmo/problem.hpp>
#include <pagmo/problems/cec2009.hpp>
#include <pagmo/s11n.hpp>
#include <pagmo/types.hpp>
#include <pagmo/utils/generic.hpp>
using namespace pagmo;
BOOST_AUTO_TEST_CASE(cec2009_construction_test)
{
// We check that all problems can be constructed
for (unsigned i = 1u; i <= 10u; ++i) {
cec2009 udp{i, false};
}
for (unsigned i = 1u; i <= 10u; ++i) {
cec2009 udp{i, true};
}
// We check that wrong problem ids and dimensions cannot be constructed
BOOST_CHECK_THROW((cec2009{0u}), std::invalid_argument);
BOOST_CHECK_THROW((cec2009{11u}), std::invalid_argument);
BOOST_CHECK_THROW((cec2009{1u, false, 0u}), std::invalid_argument);
BOOST_CHECK_THROW((cec2009{8u, true, 0u}), std::invalid_argument);
}
BOOST_AUTO_TEST_CASE(cec2009_fitness_test)
{
std::mt19937 r_engine(32u);
// We check that all problems return a fitness of the correct dims
for (unsigned i = 1u; i <= 10u; ++i) {
cec2009 udp{i, false};
auto x = random_decision_vector(problem(udp), r_engine); // a random vector
auto f = udp.fitness(x);
BOOST_CHECK_EQUAL(f.size(), udp.get_nobj());
BOOST_CHECK((udp.get_name().find("CEC2009 - UF")) != std::string::npos);
}
// We check that all problems return a fitness of the correct dims
for (unsigned i = 1u; i <= 10u; ++i) {
cec2009 udp{i, true};
auto x = random_decision_vector(problem(udp), r_engine); // a random vector
auto f = udp.fitness(x);
BOOST_CHECK((udp.get_name().find("CEC2009 - CF")) != std::string::npos);
}
}
BOOST_AUTO_TEST_CASE(cec2009_getters_test)
{
// We check that all problems return a fitness
for (unsigned i = 1u; i <= 10u; ++i) {
cec2009 udp{i, false};
BOOST_CHECK((udp.get_name().find("CEC2009 - UF")) != std::string::npos);
BOOST_CHECK((udp.get_nic() == 0u));
BOOST_CHECK((problem(udp).get_nec() == 0u));
}
for (unsigned i = 1u; i <= 10u; ++i) {
cec2009 udp{i, true};
BOOST_CHECK((udp.get_name().find("CEC2009 - CF")) != std::string::npos);
BOOST_CHECK((problem(udp).get_nec() == 0u));
}
}
BOOST_AUTO_TEST_CASE(cec2009_serialization_test)
{
problem p{cec2009{1u, false, 30u}};
// Call objfun to increase the internal counters.
p.fitness(vector_double(30u, 0.5));
// Store the string representation of p.
std::stringstream ss;
auto before = boost::lexical_cast<std::string>(p);
// Now serialize, deserialize and compare the result.
{
boost::archive::binary_oarchive oarchive(ss);
oarchive << p;
}
// Change the content of p before deserializing.
p = problem{};
{
boost::archive::binary_iarchive iarchive(ss);
iarchive >> p;
}
auto after = boost::lexical_cast<std::string>(p);
BOOST_CHECK_EQUAL(before, after);
}
|
