nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

added new multi-objective support

Browse source
This commit is contained in:
maartenkeijzer 2007-08-31 10:57:05 +00:00
commit 553586d55f
12 changed files with 1049 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

85
eo/src/moo/eoFrontSorter.h Normal file
View file

@ -0,0 +1,85 @@
/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
-----------------------------------------------------------------------------
eoNDSorting.h
(c) Maarten Keijzer, Marc Schoenauer, 2001
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Contact: todos@geneura.ugr.es, http://geneura.ugr.es
Marc.Schoenauer@polytechnique.fr
mkeijzer@dhi.dk
*/
//-----------------------------------------------------------------------------
#ifndef eoFrontSorter_h
#define eoFrontSorter_h
#include <EO.h>
#include <algorithm>
#include <eoPop.h>
#include <cassert>
namespace detail {
// small helper structs to store the multi-objective information. To be used in the implementation
struct FitnessInfo {
std::vector<double> fitness; // preprocessed fitness -> all maximizing
unsigned index; // index into population
FitnessInfo() {}
FitnessInfo(const std::vector<double>& fitness_, unsigned index_) : fitness(fitness_), index(index_) {}
};
extern void front_sorter_impl(std::vector<FitnessInfo>& fitness, std::vector< std::vector<FitnessInfo> >& fronts);
} // namespace detail
/**
* Reassembles population into a set of fronts;
*/
template <class EOT>
class eoFrontSorter : public eoUF< const eoPop<EOT>&, const std::vector< std::vector<detail::FitnessInfo> >& >
{
std::vector<detail::FitnessInfo > fitness;
std::vector< std::vector<detail::FitnessInfo> > fronts;
public :
typedef typename EOT::Fitness::fitness_traits Traits;
typedef std::vector< std::vector<detail::FitnessInfo> > front_t;
const std::vector<std::vector<detail::FitnessInfo> >& operator()(const eoPop<EOT>& _pop)
{
fitness.resize(_pop.size());
for (unsigned i = 0; i < _pop.size(); ++i) {
std::vector<double> f;
for (unsigned j = 0; j < Traits::nObjectives(); ++j) {
if (Traits::maximizing(j) != 0) f.push_back( Traits::maximizing(j) * _pop[i].fitness()[j]);
}
fitness[i] = detail::FitnessInfo(f, i);
}
detail::front_sorter_impl(fitness, fronts);
return fronts;
}
};
#endif