Classes | |
class | SymArgsImpl |
class | SymArgs |
class | SymKey |
struct | SymValue |
struct | FitnessInfo |
struct | CompareOn |
Functions | |
void | one_objective (std::vector< FitnessInfo > &fitness, std::vector< std::vector< FitnessInfo > > &front, double tol) |
void | two_objectives (std::vector< FitnessInfo > &fitness, std::vector< std::vector< FitnessInfo > > &front, double tol) |
Optimization for two objectives. | |
bool | dominates (const FitnessInfo &a, const FitnessInfo &b, double tol) |
void | m_objectives (std::vector< FitnessInfo > &fitness, std::vector< std::vector< FitnessInfo > > &front, double tol) |
void | front_sorter_impl (std::vector< FitnessInfo > &fitness, std::vector< std::vector< FitnessInfo > > &front_indices, double tol) |
Variables | |
const int | nprimes = 4 |
const unsigned long | primes [] = {3221225473ul, 201326611ul, 1610612741ul, 805306457ul} |
----------------------------------------------------------------------------- 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
void detail::two_objectives | ( | std::vector< FitnessInfo > & | fitness, | |
std::vector< std::vector< FitnessInfo > > & | front, | |||
double | tol | |||
) |
Optimization for two objectives.
Makes the algorithm run in complexity O(n log n) where n is the population size
Definition at line 30 of file eoFrontSorter.cpp.