// NSGAIIRunner.java // // Author: // Antonio J. Nebro <antonio@lcc.uma.es> // // Copyright (c) 2014 Antonio J. Nebro // // 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 <http://www.gnu.org/licenses/>. package org.uma.jmetal.runner.multiobjective; import org.uma.jmetal.algorithm.Algorithm; import org.uma.jmetal.algorithm.multiobjective.nsgaii.NSGAIIBuilder; 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.IntegerSBXCrossover; import org.uma.jmetal.operator.impl.mutation.IntegerPolynomialMutation; import org.uma.jmetal.operator.impl.selection.BinaryTournamentSelection; import org.uma.jmetal.problem.Problem; import org.uma.jmetal.runner.AbstractAlgorithmRunner; import org.uma.jmetal.solution.IntegerSolution; import org.uma.jmetal.util.AlgorithmRunner; import org.uma.jmetal.util.JMetalLogger; import org.uma.jmetal.util.ProblemUtils; import java.io.FileNotFoundException; import java.util.List; /** * Class for configuring and running the NSGA-II algorithm (integer encoding) * * @author Antonio J. Nebro <antonio@lcc.uma.es> */ public class NSGAIIIntegerRunner extends AbstractAlgorithmRunner { /** * @param args Command line arguments. * @throws org.uma.jmetal.util.JMetalException * @throws java.io.IOException * @throws SecurityException * @throws ClassNotFoundException * Invoking command: java org.uma.jmetal.runner.multiobjective.NSGAIIIntegerRunner problemName [referenceFront] */ public static void main(String[] args) throws FileNotFoundException { Problem<IntegerSolution> problem; Algorithm<List<IntegerSolution>> algorithm; CrossoverOperator<IntegerSolution> crossover; MutationOperator<IntegerSolution> mutation; SelectionOperator<List<IntegerSolution>, IntegerSolution> selection; String problemName ; String referenceParetoFront = "" ; 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.NMMin" ; referenceParetoFront = ""; } problem = ProblemUtils.<IntegerSolution> loadProblem(problemName); double crossoverProbability = 0.9 ; double crossoverDistributionIndex = 20.0 ; crossover = new IntegerSBXCrossover(crossoverProbability, crossoverDistributionIndex) ; double mutationProbability = 1.0 / problem.getNumberOfVariables() ; double mutationDistributionIndex = 20.0 ; mutation = new IntegerPolynomialMutation(mutationProbability, mutationDistributionIndex) ; selection = new BinaryTournamentSelection<IntegerSolution>() ; algorithm = new NSGAIIBuilder<IntegerSolution>(problem, crossover, mutation) .setSelectionOperator(selection) .setMaxEvaluations(25000) .setPopulationSize(100) .build() ; AlgorithmRunner algorithmRunner = new AlgorithmRunner.Executor(algorithm) .execute() ; List<IntegerSolution> population = algorithm.getResult() ; long computingTime = algorithmRunner.getComputingTime() ; JMetalLogger.logger.info("Total execution time: " + computingTime + "ms"); printFinalSolutionSet(population); if (!referenceParetoFront.equals("")) { printQualityIndicators(population, referenceParetoFront) ; } } }