PaGMO  1.1.5
lavor_maculan.cpp
1 /*****************************************************************************
2  * Copyright (C) 2004-2015 The PaGMO development team, *
3  * Advanced Concepts Team (ACT), European Space Agency (ESA) *
4  * *
5  * https://github.com/esa/pagmo *
6  * *
7  * act@esa.int *
8  * *
9  * This program is free software; you can redistribute it and/or modify *
10  * it under the terms of the GNU General Public License as published by *
11  * the Free Software Foundation; either version 2 of the License, or *
12  * (at your option) any later version. *
13  * *
14  * This program is distributed in the hope that it will be useful, *
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
17  * GNU General Public License for more details. *
18  * *
19  * You should have received a copy of the GNU General Public License *
20  * along with this program; if not, write to the *
21  * Free Software Foundation, Inc., *
22  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
23  *****************************************************************************/
24 
25 #include <string>
26 
27 #include "../exceptions.h"
28 #include "../types.h"
29 #include "base.h"
30 #include <cmath>
31 #include "lavor_maculan.h"
32 
33 namespace pagmo { namespace problem {
34 
36 
43 lavor_maculan::lavor_maculan(int atoms): base(atoms - 3)
44 {
45  if (atoms <= 0 || atoms < 4) {
46  pagmo_throw(value_error, "number of atoms for lavor-maculan problem must be positive and greater than 3");
47  }
48  // Set bounds.
49  set_lb(0.0);
50  set_ub(5.0);
51 
52  // Initialise global minima vector
53  std::vector<decision_vector> best_x(1);
54  // Single global minimum of Lavor Maculan is a repeating sequence of
55  // (1.039195303, 3.141592654, 1.039195303, 3.141592654, 1.039195303, ...)
56  double rep[] = {1.039195303, 3.141592654};
57  for(int i = 0; i < atoms - 3; ++i) {
58  best_x[0].push_back(rep[i % 2]);
59  }
60 
61  set_best_x(best_x);
62 }
63 
66 {
67  return base_ptr(new lavor_maculan(*this));
68 }
69 
72 {
73  const decision_vector::size_type n = x.size();
74  f[0] = 0.0;
75  for (decision_vector::size_type i = 0 ; i < n ; ++i) {
76  f[0] += 1 + cos(3 * x[i]) + (((i % 2 == 1) ? 1 : -1) / (sqrt(10.60099896 - 4.141720682 * cos(x[i]))));
77  }
78 }
79 
80 std::string lavor_maculan::get_name() const
81 {
82  return "Lavor Maculan";
83 }
84 
85 }}
86 
87 BOOST_CLASS_EXPORT_IMPLEMENT(pagmo::problem::lavor_maculan)
Root PaGMO namespace.
boost::shared_ptr< base > base_ptr
Alias for shared pointer to base problem.
Definition: problem/base.h:62
std::vector< double > decision_vector
Decision vector type.
Definition: types.h:40
void set_best_x(const std::vector< decision_vector > &)
Sets the best known decision vectors.
Base problem class.
Definition: problem/base.h:148
base_ptr clone() const
Clone method.
void set_lb(const decision_vector &)
Set lower bounds from pagmo::decision_vector.
std::string get_name() const
Get problem's name.
The Potential Energy of Molecules problem as proposed by Lavor and Maculan.
Definition: lavor_maculan.h:46
lavor_maculan(int=4)
Constructor from dimension.
void set_ub(const decision_vector &)
Set upper bounds from pagmo::decision_vector.
std::vector< double > fitness_vector
Fitness vector type.
Definition: types.h:42
void objfun_impl(fitness_vector &, const decision_vector &) const
Implementation of the objective function.