org.uma.jmetal.runner.multiobjective.ParallelSMPSORunner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.smpso.SMPSOBuilder;
import org.uma.jmetal.operator.MutationOperator;
import org.uma.jmetal.operator.impl.mutation.PolynomialMutation;
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.archive.BoundedArchive;
import org.uma.jmetal.util.archive.impl.CrowdingDistanceArchive;
import org.uma.jmetal.util.evaluator.SolutionListEvaluator;
import org.uma.jmetal.util.evaluator.impl.MultithreadedSolutionListEvaluator;
import java.util.List;
/**
* Class for configuring and running the SMPSO algorithm (parallel version)
*
* @author Antonio J. Nebro
*/
public class ParallelSMPSORunner extends AbstractAlgorithmRunner {
/**
* @param args Command line arguments. The first (optional) argument specifies
* the problem to solve.
* @throws org.uma.jmetal.util.JMetalException
* @throws java.io.IOException
* @throws SecurityException
* Invoking command:
java org.uma.jmetal.runner.multiobjective.ParallelSMPSORunner problemName [referenceFront]
*/
public static void main(String[] args) throws Exception {
DoubleProblem problem;
Algorithm> algorithm;
MutationOperator mutation;
SolutionListEvaluator evaluator ;
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 = (DoubleProblem) ProblemUtils. loadProblem(problemName);
BoundedArchive archive = new CrowdingDistanceArchive(100) ;
double mutationProbability = 1.0 / problem.getNumberOfVariables() ;
double mutationDistributionIndex = 20.0 ;
mutation = new PolynomialMutation(mutationProbability, mutationDistributionIndex) ;
evaluator = new MultithreadedSolutionListEvaluator(0, problem) ;
algorithm = new SMPSOBuilder(problem, archive)
.setMutation(mutation)
.setMaxIterations(250)
.setSwarmSize(100)
.setSolutionListEvaluator(evaluator)
.build();
AlgorithmRunner algorithmRunner = new AlgorithmRunner.Executor(algorithm)
.execute();
List population = algorithm.getResult();
long computingTime = algorithmRunner.getComputingTime();
evaluator.shutdown();
JMetalLogger.logger.info("Total execution time: " + computingTime + "ms");
printFinalSolutionSet(population);
if (!referenceParetoFront.equals("")) {
printQualityIndicators(population, referenceParetoFront) ;
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy