org.uma.jmetal.runner.multiobjective.NSGAIIMeasuresRunner Maven / Gradle / Ivy
// NSGAIIRunner.java
//
// Author:
// Antonio J. Nebro
//
// Copyright (c) 2014 Antonio J. Nebro
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see problem;
Algorithm> algorithm;
CrossoverOperator crossover;
MutationOperator mutation;
SelectionOperator, DoubleSolution> selection;
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 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 maxIterations = 250 ;
int populationSize = 100 ;
algorithm = new NSGAIIBuilder(problem, crossover, mutation)
.setSelectionOperator(selection)
.setMaxIterations(maxIterations)
.setPopulationSize(populationSize)
.setVariant(NSGAIIBuilder.NSGAIIVariant.Measures)
.build() ;
/* Measure management */
MeasureManager measureManager = ((NSGAIIMeasures)algorithm).getMeasureManager() ;
CountingMeasure iteration =
(CountingMeasure) measureManager.getPullMeasure("currentIteration");
DurationMeasure currentComputingTime =
(DurationMeasure) measureManager.getPullMeasure("currentExecutionTime");
BasicMeasure nonDominatedSolutions =
(BasicMeasure) measureManager.getPullMeasure("numberOfNonDominatedSolutionsInPopulation");
BasicMeasure> solutionListMeasure =
(BasicMeasure>) measureManager.> getPushMeasure("currentPopulation");
CountingMeasure iteration2 =
(CountingMeasure) measureManager.getPushMeasure("currentIteration");
solutionListMeasure.register(new Listener());
iteration2.register(new Listener2());
/* End of measure management */
Thread algorithmThread = new Thread(algorithm) ;
algorithmThread.start();
/* Using the measures */
int i = 0 ;
while(iteration.get() < maxIterations) {
TimeUnit.SECONDS.sleep(5);
System.out.println("Iteration (" + i + ") : " + iteration.get()) ;
System.out.println("Computing time (" + i + ") : " + currentComputingTime.get()) ;
System.out.println("Number of Nondominated solutions (" + i + "): " + nonDominatedSolutions.get()) ;
i++ ;
}
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 int counter = 0 ;
@Override synchronized public void measureGenerated(List solutions) {
if ((counter % 10 == 0)) {
System.out.println("PUSH MEASURE. Counter = " + counter+ " First solution: " + solutions.get(0)) ;
}
counter ++ ;
}
}
private static class Listener2 implements MeasureListener {
@Override synchronized public void measureGenerated(Long value) {
if ((value % 50 == 0)) {
System.out.println("PUSH MEASURE. Iteration: " + value) ;
}
}
}
}