org.uma.jmetal.runner.multiobjective.MOCHCRunner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.mochc.MOCHCBuilder;
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.HUXCrossover;
import org.uma.jmetal.operator.impl.mutation.BitFlipMutation;
import org.uma.jmetal.operator.impl.selection.RandomSelection;
import org.uma.jmetal.operator.impl.selection.RankingAndCrowdingSelection;
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.JMetalLogger;
import org.uma.jmetal.util.ProblemUtils;
import org.uma.jmetal.util.evaluator.impl.SequentialSolutionListEvaluator;
import java.util.List;
/**
* This class executes the algorithm described in:
* A.J. Nebro, E. Alba, G. Molina, F. Chicano, F. Luna, J.J. Durillo
* "Optimal antenna placement using a new multi-objective chc algorithm".
* GECCO '07: Proceedings of the 9th annual conference on Genetic and
* evolutionary computation. London, England. July 2007.
*/
public class MOCHCRunner extends AbstractAlgorithmRunner {
public static void main(String[] args) throws Exception {
CrossoverOperator crossoverOperator;
MutationOperator mutationOperator;
SelectionOperator, BinarySolution> parentsSelection;
SelectionOperator, List> newGenerationSelection;
Algorithm> algorithm ;
BinaryProblem problem ;
String problemName ;
String referenceParetoFront = "" ;
if (args.length == 1) {
problemName = args[0] ;
} else {
problemName = "org.uma.jmetal.problem.multiobjective.zdt.ZDT5";
referenceParetoFront = "" ;
}
problem = (BinaryProblem) ProblemUtils. loadProblem(problemName);
crossoverOperator = new HUXCrossover(1.0) ;
parentsSelection = new RandomSelection() ;
newGenerationSelection = new RankingAndCrowdingSelection(100) ;
mutationOperator = new BitFlipMutation(0.35) ;
algorithm = new MOCHCBuilder(problem)
.setInitialConvergenceCount(0.25)
.setConvergenceValue(3)
.setPreservedPopulation(0.05)
.setPopulationSize(100)
.setMaxEvaluations(25000)
.setCrossover(crossoverOperator)
.setNewGenerationSelection(newGenerationSelection)
.setCataclysmicMutation(mutationOperator)
.setParentSelection(parentsSelection)
.setEvaluator(new SequentialSolutionListEvaluator())
.build() ;
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) ;
}
}
}