/*********************************************************************** This file is part of KEEL-software, the Data Mining tool for regression, classification, clustering, pattern mining and so on. Copyright (C) 2004-2010 F. Herrera (herrera@decsai.ugr.es) L. S�nchez (luciano@uniovi.es) J. Alcal�-Fdez (jalcala@decsai.ugr.es) S. Garc�a (sglopez@ujaen.es) A. Fern�ndez (alberto.fernandez@ujaen.es) J. Luengo (julianlm@decsai.ugr.es) 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 keel.Algorithms.Genetic_Rule_Learning.PSO_ACO; import java.util.Comparator; /** * <p>T�tulo: Hibridaci�n Pso Aco</p> * <p>Descripci�n: Hibridacion entre los dos algoritmos Pso y Aco</p> * <p>Copyright: Copyright (c) 2008</p> * <p>Empresa: </p> * @author Vicente Rub�n del Pino * @version 1.0 */ public class ComparadorParticulas implements Comparator { public ComparadorParticulas() { } /** * Compara dos reglas * * @param o1 Object Regla a comparar * @param o2 Object Regla a comparar * @return int Devuelve 0 si tienen la misma posicion, 1 si el primero esta * antes, -1 si el primero esta despues. * * */ public int compare(Object o1, Object o2) { float calidad1; float calidad2; float calidadS1; float calidadS2; Particula p1; Particula p2; int devolver = 0; p1 = (Particula) o1; p2 = (Particula) o2; calidad1 = p1.obtenerCalidadPosicionActual(); calidad2 = p2.obtenerCalidadPosicionActual(); calidadS1 = p1.obtenerCalidadMejorPosicion(); calidadS2 = p2.obtenerCalidadMejorPosicion(); if (calidad1 < calidad2) { devolver = 1; } else { if (calidad1 > calidad2) { devolver = -1; } else if (calidadS1 < calidadS2) { devolver = 1; } else { devolver = -1; } } return devolver; } }