Java tutorial
/* * Copyright (C) 2012 Grupo Integrado de Ingeniera (<a href="www.gii.udc.es">www.gii.udc.es</a>) * * This program is free software: you can redistribute it and/or modify * it under the terms of 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. * * This program 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 a copy of the GNU General Public License * along with this program. If not, see <http://www.gnu.org/licenses/>. */ package es.udc.gii.common.eaf.stoptest; import es.udc.gii.common.eaf.algorithm.EvolutionaryAlgorithm; import es.udc.gii.common.eaf.algorithm.population.Individual; import es.udc.gii.common.eaf.util.ConfWarning; import java.util.Collections; import org.apache.commons.configuration.Configuration; /** * * @author Grupo Integrado de Ingeniera (<a href="www.gii.udc.es">www.gii.udc.es</a>) */ public class TolFunHistStopTest extends SimpleStopTest { private double tol_fun_hist = 1.0e-12; @Override public boolean isReach(EvolutionaryAlgorithm algorithm) { //Fitness value to check in this stop test: double worst_history, best_history; if (algorithm.getGenerations() > algorithm.getFitnessHistory().size()) { worst_history = ((Individual) Collections.max(algorithm.getFitnessHistory(), algorithm.getComparator())) .getFitness(); best_history = ((Individual) Collections.min(algorithm.getFitnessHistory(), algorithm.getComparator())) .getFitness(); if (Math.abs(worst_history - best_history) <= this.tol_fun_hist) { return true; } } return false; } @Override public void configure(Configuration conf) { if (conf.containsKey("TolFunHist")) { tol_fun_hist = conf.getDouble("TolFunHist"); } else { ConfWarning w = new ConfWarning("TolFunHist", this.tol_fun_hist); w.warn(); } } }