org.uma.jmetal.runner.multiobjective.MOCHCRunner Maven / Gradle / Ivy
// MOCHCRunner.java
//
// Author:
// Antonio J. Nebro
// Juan J. Durillo
//
// Copyright (c) 2011 Antonio J. Nebro, Juan J. Durillo
//
// 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 .
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.mochc.MOCHC;
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.AlgorithmRunner;
import org.uma.jmetal.util.JMetalLogger;
import org.uma.jmetal.util.ProblemUtils;
import org.uma.jmetal.util.evaluator.impl.SequentialSolutionListEvaluator;
import org.uma.jmetal.util.fileoutput.SolutionSetOutput;
import org.uma.jmetal.util.fileoutput.impl.DefaultFileOutputContext;
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 {
public static void main(String[] args) throws Exception {
CrossoverOperator crossoverOperator;
MutationOperator mutationOperator;
SelectionOperator, BinarySolution> parentsSelection;
SelectionOperator, List> newGenerationSelection;
Algorithm> algorithm ;
BinaryProblem problem ;
String problemName ;
if (args.length == 1) {
problemName = args[0] ;
} else {
problemName = "org.uma.jmetal.problem.multiobjective.zdt.ZDT5";
}
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 = ((MOCHC)algorithm).getResult() ;
long computingTime = algorithmRunner.getComputingTime() ;
new SolutionSetOutput.Printer(population)
.setSeparator("\t")
.setVarFileOutputContext(new DefaultFileOutputContext("VAR.tsv"))
.setFunFileOutputContext(new DefaultFileOutputContext("FUN.tsv"))
.print();
JMetalLogger.logger.info("Total execution time: " + computingTime + "ms");
JMetalLogger.logger.info("Objectives values have been written to file FUN.tsv");
JMetalLogger.logger.info("Variables values have been written to file VAR.tsv");
}
}