org.uma.jmetal.runner.multiobjective.NSGAIIMeasuresWithHypervolumeRunner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.nsgaii.NSGAIIBuilder;
import org.uma.jmetal.algorithm.multiobjective.nsgaii.NSGAIIMeasures;
import org.uma.jmetal.measure.MeasureListener;
import org.uma.jmetal.measure.MeasureManager;
import org.uma.jmetal.measure.impl.BasicMeasure;
import org.uma.jmetal.measure.impl.DurationMeasure;
import org.uma.jmetal.operator.CrossoverOperator;
import org.uma.jmetal.operator.MutationOperator;
import org.uma.jmetal.operator.SelectionOperator;
import org.uma.jmetal.operator.impl.crossover.SBXCrossover;
import org.uma.jmetal.operator.impl.mutation.PolynomialMutation;
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.JMetalException;
import org.uma.jmetal.util.JMetalLogger;
import org.uma.jmetal.util.ProblemUtils;
import org.uma.jmetal.util.comparator.RankingAndCrowdingDistanceComparator;
import org.uma.jmetal.util.front.imp.ArrayFront;
import java.io.FileNotFoundException;
import java.util.List;
/**
* Class to configure and run the NSGA-II algorithm (variant with measures)
*/
public class NSGAIIMeasuresWithHypervolumeRunner extends AbstractAlgorithmRunner {
/**
* @param args Command line arguments.
* @throws SecurityException
* Invoking command:
java org.uma.jmetal.runner.multiobjective.NSGAIIMeasuresRunner problemName [referenceFront]
*/
public static void main(String[] args)
throws JMetalException, InterruptedException, FileNotFoundException {
Problem problem;
Algorithm> algorithm;
CrossoverOperator crossover;
MutationOperator mutation;
SelectionOperator, DoubleSolution> selection;
String referenceParetoFront = "" ;
String problemName ;
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 crossoverProbability = 0.9 ;
double crossoverDistributionIndex = 20.0 ;
crossover = new SBXCrossover(crossoverProbability, crossoverDistributionIndex) ;
double mutationProbability = 1.0 / problem.getNumberOfVariables() ;
double mutationDistributionIndex = 20.0 ;
mutation = new PolynomialMutation(mutationProbability, mutationDistributionIndex) ;
selection = new BinaryTournamentSelection(new RankingAndCrowdingDistanceComparator());
int maxEvaluations = 25000 ;
int populationSize = 100 ;
algorithm = new NSGAIIBuilder(problem, crossover, mutation)
.setSelectionOperator(selection)
.setMaxEvaluations(maxEvaluations)
.setPopulationSize(populationSize)
.setVariant(NSGAIIBuilder.NSGAIIVariant.Measures)
.build() ;
((NSGAIIMeasures)algorithm).setReferenceFront(new ArrayFront(referenceParetoFront));
/* Measure management */
MeasureManager measureManager = ((NSGAIIMeasures)algorithm).getMeasureManager() ;
DurationMeasure currentComputingTime =
(DurationMeasure) measureManager.getPullMeasure("currentExecutionTime");
BasicMeasure hypervolumeMeasure =
(BasicMeasure) measureManager.getPushMeasure("hypervolume");
hypervolumeMeasure.register(new Listener());
/* End of measure management */
Thread algorithmThread = new Thread(algorithm) ;
algorithmThread.start();
algorithmThread.join();
List population = algorithm.getResult() ;
long computingTime = currentComputingTime.get() ;
JMetalLogger.logger.info("Total execution time: " + computingTime + "ms");
printFinalSolutionSet(population);
if (!referenceParetoFront.equals("")) {
printQualityIndicators(population, referenceParetoFront) ;
}
}
private static class Listener implements MeasureListener {
private static int counter = 0 ;
@Override synchronized public void measureGenerated(Double value) {
if ((counter++ % 10 == 0)) {
System.out.println("Hypervolume: " + value) ;
}
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy