org.uma.jmetal.runner.multiobjective.SPEA2BinaryRunner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.spea2.SPEA2Builder;
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.SinglePointCrossover;
import org.uma.jmetal.operator.impl.mutation.BitFlipMutation;
import org.uma.jmetal.operator.impl.selection.BinaryTournamentSelection;
import org.uma.jmetal.problem.BinaryProblem;
import org.uma.jmetal.solution.BinarySolution;
import org.uma.jmetal.util.AbstractAlgorithmRunner;
import org.uma.jmetal.util.AlgorithmRunner;
import org.uma.jmetal.util.JMetalException;
import org.uma.jmetal.util.ProblemUtils;
import org.uma.jmetal.util.comparator.RankingAndCrowdingDistanceComparator;
import java.io.FileNotFoundException;
import java.util.List;
/**
* Class for configuring and running the SPEA2 algorithm (binary encoding)
*
* @author Antonio J. Nebro
*/
public class SPEA2BinaryRunner extends AbstractAlgorithmRunner {
/**
* @param args Command line arguments.
* @throws SecurityException
* Invoking command:
java org.uma.jmetal.runner.multiobjective.SPEA2BinaryRunner problemName [referenceFront]
*/
public static void main(String[] args) throws JMetalException, FileNotFoundException {
BinaryProblem problem;
Algorithm> algorithm;
CrossoverOperator crossover;
MutationOperator mutation;
SelectionOperator, BinarySolution> 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.OneZeroMax";
referenceParetoFront = "" ;
}
problem = (BinaryProblem)ProblemUtils. loadProblem(problemName);
double crossoverProbability = 0.9 ;
crossover = new SinglePointCrossover(crossoverProbability) ;
double mutationProbability = 1.0 / problem.getTotalNumberOfBits() ;
mutation = new BitFlipMutation(mutationProbability) ;
selection = new BinaryTournamentSelection(new RankingAndCrowdingDistanceComparator());
algorithm = new SPEA2Builder<>(problem, crossover, mutation)
.setSelectionOperator(selection)
.setMaxIterations(250)
.setPopulationSize(100)
.build() ;
new AlgorithmRunner.Executor(algorithm).execute() ;
List population = algorithm.getResult();
printFinalSolutionSet(population);
if (!referenceParetoFront.equals("")) {
printQualityIndicators(population, referenceParetoFront) ;
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy