org.uma.jmetal.runner.multiobjective.WASFGABinaryRunner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.wasfga.WASFGA;
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.*;
import org.uma.jmetal.util.evaluator.impl.SequentialSolutionListEvaluator;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.List;
public class WASFGABinaryRunner extends AbstractAlgorithmRunner {
/**
* @param args Command line arguments.
* @throws JMetalException
* @throws FileNotFoundException
* Invoking command:
java org.uma.jmetal.runner.multiobjective.WASFGARunner problemName [referenceFront]
*/
public static void main(String[] args) throws JMetalException, FileNotFoundException {
BinaryProblem problem;
Algorithm> algorithm;
CrossoverOperator crossover;
MutationOperator mutation;
SelectionOperator, BinarySolution> selection;
String referenceParetoFront = "" ;
List referencePoint = null;
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.ZDT5";
}
problem = (BinaryProblem) ProblemUtils. loadProblem(problemName);
referencePoint = new ArrayList<>();
referencePoint.add(10.0);
referencePoint.add(4.0);
double crossoverProbability = 0.9 ;
crossover = new SinglePointCrossover(crossoverProbability) ;
double mutationProbability = 1.0 / problem.getNumberOfBits(0) ;
mutation = new BitFlipMutation(mutationProbability) ;
selection = new BinaryTournamentSelection() ;
double epsilon = 0.01 ;
algorithm = new WASFGA(problem, 100, 250, crossover, mutation, selection,
new SequentialSolutionListEvaluator(),epsilon, referencePoint) ;
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) ;
}
}
}