org.uma.jmetal.runner.multiobjective.CellDERunner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.cellde.CellDE45;
import org.uma.jmetal.operator.SelectionOperator;
import org.uma.jmetal.operator.impl.crossover.DifferentialEvolutionCrossover;
import org.uma.jmetal.operator.impl.selection.BinaryTournamentSelection;
import org.uma.jmetal.problem.Problem;
import org.uma.jmetal.runner.AbstractAlgorithmRunner;
import org.uma.jmetal.solution.DoubleSolution;
import org.uma.jmetal.util.AlgorithmRunner;
import org.uma.jmetal.util.JMetalException;
import org.uma.jmetal.util.JMetalLogger;
import org.uma.jmetal.util.ProblemUtils;
import org.uma.jmetal.util.archive.impl.CrowdingDistanceArchive;
import org.uma.jmetal.util.comparator.RankingAndCrowdingDistanceComparator;
import org.uma.jmetal.util.evaluator.impl.SequentialSolutionListEvaluator;
import org.uma.jmetal.util.neighborhood.impl.C9;
import java.io.FileNotFoundException;
import java.util.List;
/**
* Class to configure and run the MOCell algorithm
*
* @author Antonio J. Nebro
*/
public class CellDERunner extends AbstractAlgorithmRunner {
/**
* @param args Command line arguments.
* @throws JMetalException
* @throws FileNotFoundException
* Invoking command:
java org.uma.jmetal.runner.multiobjective.MOCellRunner problemName [referenceFront]
*/
public static void main(String[] args) throws JMetalException, FileNotFoundException {
Problem problem;
Algorithm> algorithm;
SelectionOperator, DoubleSolution> selection;
DifferentialEvolutionCrossover crossover;
String referenceParetoFront = "" ;
String problemName ;
if (args.length == 1) {
problemName = args[0];
} else if (args.length == 2) {
problemName = args[0] ;
referenceParetoFront = args[1] ;
} else {
problemName = "org.uma.jmetal.problem.multiobjective.zdt.ZDT1";
referenceParetoFront = "jmetal-problem/src/test/resources/pareto_fronts/ZDT1.pf" ;
}
problem = ProblemUtils. loadProblem(problemName);
double cr = 0.5 ;
double f = 0.5 ;
crossover = new DifferentialEvolutionCrossover(cr, f, "rand/1/bin") ;
selection = new BinaryTournamentSelection(new RankingAndCrowdingDistanceComparator());
algorithm = new CellDE45(
problem,
25000,
100,
new CrowdingDistanceArchive(100),
new C9((int)Math.sqrt(100), (int)Math.sqrt(100)),
selection,
crossover,
20,
new SequentialSolutionListEvaluator()
) ;
AlgorithmRunner algorithmRunner = new AlgorithmRunner.Executor(algorithm)
.execute() ;
List population = algorithm.getResult() ;
long computingTime = algorithmRunner.getComputingTime() ;
JMetalLogger.logger.info("Total execution time: " + computingTime + "ms");
printFinalSolutionSet(population);
if (!referenceParetoFront.equals("")) {
printQualityIndicators(population, referenceParetoFront) ;
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy