org.uma.jmetal.runner.multiobjective.ABYSSRunner Maven / Gradle / Ivy
package org.uma.jmetal.runner.multiobjective;
import org.uma.jmetal.algorithm.Algorithm;
import org.uma.jmetal.algorithm.multiobjective.abyss.ABYSSBuilder;
import org.uma.jmetal.problem.DoubleProblem;
import org.uma.jmetal.runner.AbstractAlgorithmRunner;
import org.uma.jmetal.solution.DoubleSolution;
import org.uma.jmetal.util.AlgorithmRunner;
import org.uma.jmetal.util.JMetalException;
import org.uma.jmetal.util.JMetalLogger;
import org.uma.jmetal.util.ProblemUtils;
import org.uma.jmetal.util.archive.Archive;
import org.uma.jmetal.util.archive.impl.CrowdingDistanceArchive;
import java.io.FileNotFoundException;
import java.util.List;
/**
* This class is the main program used to configure and run AbYSS, a
* multiobjective scatter search metaheuristics, which is described in:
* A.J. Nebro, F. Luna, E. Alba, B. Dorronsoro, J.J. Durillo, A. Beham
* "AbYSS: Adapting Scatter Search to Multiobjective Optimization."
* IEEE Transactions on Evolutionary Computation. Vol. 12,
* No. 4 (August 2008), pp. 439-457
*
* @author Antonio J. Nebro
*/
public class ABYSSRunner extends AbstractAlgorithmRunner {
/**
* @param args Command line arguments.
* @throws JMetalException
* @throws FileNotFoundException
* Invoking command:
java org.uma.jmetal.runner.multiobjective.AbYSSRunner problemName [referenceFront]
*/
public static void main(String[] args) throws Exception {
DoubleProblem problem;
Algorithm> algorithm;
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.zdt.ZDT1";
referenceParetoFront = "jmetal-problem/src/test/resources/pareto_fronts/ZDT1.pf" ;
}
problem = (DoubleProblem) ProblemUtils. loadProblem(problemName);
Archive archive = new CrowdingDistanceArchive(100) ;
algorithm = new ABYSSBuilder(problem, archive)
.setMaxEvaluations(25000)
.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) ;
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy