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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
/* 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 sa_test
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/test/tools/floating_point_comparison.hpp>
#include <iostream>
#include <limits> // std::numeric_limits<double>::infinity();
#include <string>
#include <pagmo/algorithm.hpp>
#include <pagmo/algorithms/simulated_annealing.hpp>
#include <pagmo/population.hpp>
#include <pagmo/problems/hock_schittkowski_71.hpp>
#include <pagmo/problems/inventory.hpp>
#include <pagmo/problems/rosenbrock.hpp>
#include <pagmo/problems/zdt.hpp>
#include <pagmo/rng.hpp>
using namespace pagmo;
BOOST_AUTO_TEST_CASE(simulated_annealing_construction)
{
BOOST_CHECK_NO_THROW(simulated_annealing{});
simulated_annealing user_algo{10, 0.1, 10u, 10u, 10u, 1., 23u};
BOOST_CHECK(user_algo.get_verbosity() == 0u);
BOOST_CHECK(user_algo.get_seed() == 23u);
BOOST_CHECK((user_algo.get_log() == simulated_annealing::log_type{}));
BOOST_CHECK_THROW((simulated_annealing{-1., .1, 10u, 10u, 10u, 1., 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{std::nan(""), 0.1, 10u, 10u, 10u, 1., 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{10, -1., 10u, 10u, 10u, 1., 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{10, std::nan(""), 10u, 10u, 10u, 1., 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{10, .1, 10u, 10u, 10u, 1.1, 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{10, .1, 10u, 10u, 10u, -1.1, 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{10, .1, 0u, 10u, 10u, 1., 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{10, .1, 10u, 0u, 10u, 1., 23u}), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{.1, 10, 10u, 10u, 10u, 1., 23u}), std::invalid_argument);
}
BOOST_AUTO_TEST_CASE(simulated_annealing_evolve_test)
{
// We check that evolution is deterministic if the
// seed is controlled
problem prob{rosenbrock{10u}};
population pop1{prob, 5u, 23u};
simulated_annealing user_algo1{10., 1e-5, 100u, 10u, 10u, 1., 23u};
user_algo1.set_verbosity(200u);
pop1 = user_algo1.evolve(pop1);
population pop2{prob, 5u, 23u};
simulated_annealing user_algo2{10., 1e-5, 100u, 10u, 10u, 1., 23u};
user_algo2.set_verbosity(200u);
pop2 = user_algo2.evolve(pop2);
BOOST_CHECK(user_algo1.get_log() == user_algo2.get_log());
population pop3{prob, 5u, 23u};
user_algo2.set_seed(23u);
pop3 = user_algo2.evolve(pop3);
BOOST_CHECK(user_algo1.get_log() == user_algo2.get_log());
// We check that the problem is checked to be suitable
BOOST_CHECK_THROW((simulated_annealing{}.evolve(population{zdt{}, 5u, 23u})), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{}.evolve(population{inventory{}, 5u, 23u})), std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{}.evolve(population{hock_schittkowski_71{}, 5u, 23u})),
std::invalid_argument);
BOOST_CHECK_THROW((simulated_annealing{}.evolve(population{rosenbrock{}})), std::invalid_argument);
}
BOOST_AUTO_TEST_CASE(sea_setters_getters_test)
{
simulated_annealing user_algo{10., 1e-5, 100u, 10u, 10u, 1., 123u};
user_algo.set_verbosity(200u);
BOOST_CHECK(user_algo.get_verbosity() == 200u);
user_algo.set_seed(23u);
BOOST_CHECK(user_algo.get_seed() == 23u);
BOOST_CHECK(user_algo.get_name().find("Simulated Annealing (Corana's)") != std::string::npos);
BOOST_CHECK(user_algo.get_extra_info().find("Verbosity") != std::string::npos);
BOOST_CHECK_NO_THROW(user_algo.get_log());
}
BOOST_AUTO_TEST_CASE(simulated_annealing_serialization_test)
{
// Make one evolution
problem prob{rosenbrock{25u}};
population pop{prob, 5u, 23u};
algorithm algo{simulated_annealing{10., 1e-5, 100u, 10u, 10u, 1., 23u}};
algo.set_verbosity(200u);
pop = algo.evolve(pop);
// Store the string representation of p.
std::stringstream ss;
auto before_text = boost::lexical_cast<std::string>(algo);
auto before_log = algo.extract<simulated_annealing>()->get_log();
// Now serialize, deserialize and compare the result.
{
boost::archive::binary_oarchive oarchive(ss);
oarchive << algo;
}
// Change the content of p before deserializing.
algo = algorithm{};
{
boost::archive::binary_iarchive iarchive(ss);
iarchive >> algo;
}
auto after_text = boost::lexical_cast<std::string>(algo);
auto after_log = algo.extract<simulated_annealing>()->get_log();
BOOST_CHECK_EQUAL(before_text, after_text);
BOOST_CHECK(before_log == after_log);
// so we implement a close check
for (auto i = 0u; i < before_log.size(); ++i) {
BOOST_CHECK_EQUAL(std::get<0>(before_log[i]), std::get<0>(after_log[i]));
BOOST_CHECK_CLOSE(std::get<1>(before_log[i]), std::get<1>(after_log[i]), 1e-8);
BOOST_CHECK_CLOSE(std::get<2>(before_log[i]), std::get<2>(after_log[i]), 1e-8);
BOOST_CHECK_CLOSE(std::get<3>(before_log[i]), std::get<3>(after_log[i]), 1e-8);
BOOST_CHECK_CLOSE(std::get<4>(before_log[i]), std::get<4>(after_log[i]), 1e-8);
}
}
|
