org.uma.jmetal.runner.multiobjective.GDE3Runner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.gde3.GDE3Builder;
import org.uma.jmetal.operator.impl.crossover.DifferentialEvolutionCrossover;
import org.uma.jmetal.operator.impl.selection.DifferentialEvolutionSelection;
import org.uma.jmetal.problem.DoubleProblem;
import org.uma.jmetal.solution.DoubleSolution;
import org.uma.jmetal.util.AbstractAlgorithmRunner;
import org.uma.jmetal.util.AlgorithmRunner;
import org.uma.jmetal.util.JMetalLogger;
import org.uma.jmetal.util.ProblemUtils;
import org.uma.jmetal.util.evaluator.impl.SequentialSolutionListEvaluator;
import java.io.FileNotFoundException;
import java.util.List;
/**
* Class for configuring and running the GDE3 algorithm
*
* @author Antonio J. Nebro
*/
public class GDE3Runner extends AbstractAlgorithmRunner {
/**
* @param args Command line arguments.
* @throws SecurityException Invoking command: java org.uma.jmetal.runner.multiobjective.GDE3Runner
* problemName [referenceFront]
*/
public static void main(String[] args) throws FileNotFoundException {
DoubleProblem problem;
Algorithm> algorithm;
DifferentialEvolutionSelection selection;
DifferentialEvolutionCrossover crossover;
String problemName;
String referenceParetoFront = "";
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 = (DoubleProblem) ProblemUtils.loadProblem(problemName);
double cr = 0.5;
double f = 0.5;
crossover = new DifferentialEvolutionCrossover(cr, f, "rand/1/bin");
selection = new DifferentialEvolutionSelection();
algorithm = new GDE3Builder(problem)
.setCrossover(crossover)
.setSelection(selection)
.setMaxEvaluations(25000)
.setPopulationSize(100)
.setSolutionSetEvaluator(new SequentialSolutionListEvaluator<>())
.build();
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