每年520节日画图实现源码.zip

// Experiment.java // // Authors: // Antonio J. Nebro <antonio@lcc.uma.es> // Juan J. Durillo <durillo@lcc.uma.es> // // 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 <http://www.gnu.org/licenses/>. package jmetal.experiments; import java.io.BufferedReader; import java.io.File; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.util.Collections; import java.util.HashMap; import java.util.Locale; import java.util.Map; import java.util.Properties; import java.util.Vector; import java.util.logging.Level; import java.util.logging.Logger; import jmetal.core.Algorithm; import jmetal.core.Problem; import jmetal.experiments.util.RBoxplot; import jmetal.experiments.util.RWilcoxon; import jmetal.experiments.util.Statistics; import jmetal.experiments.util.RunExperiment; import jmetal.util.JMException; /** * Abstract class representing jMetal experiments */ public abstract class Experiment { public String experimentName_; public String[] algorithmNameList_; // List of the names of the algorithms to be executed public String[] problemList_; // List of problems to be solved public String[] paretoFrontFile_; // List of the files containing the pareto fronts // corresponding to the problems in problemList_ public String[] indicatorList_; // List of the quality indicators to be applied public String experimentBaseDirectory_; // Directory to store the results public String latexDirectory_; // Directory to store the latex files public String paretoFrontDirectory_; // Directory containing the Pareto front files public String outputParetoFrontFile_; // Name of the file containing the output // Pareto front public String outputParetoSetFile_; // Name of the file containing the output // Pareto set public int independentRuns_; // Number of independent runs per algorithm public Settings[] algorithmSettings_; // Paremeter settings of each algorithm //Algorithm[] algorithm_; // jMetal algorithms to be executed HashMap<String, Object> map_; // Map used to send experiment parameters to threads public HashMap<String, Boolean> indicatorMinimize_; // To indicate whether an indicator // is to be minimized. Hard-coded // in the constructor public Properties [] problemsSettings_ ; /** * Constructor * * Contains default settings */ public Experiment() { experimentName_ = "noName"; problemsSettings_ = null ; map_ = new HashMap<String, Object>(); algorithmNameList_ = null; problemList_ = null; paretoFrontFile_ = null; indicatorList_ = null; experimentBaseDirectory_ = ""; paretoFrontDirectory_ = ""; latexDirectory_ = "latex"; outputParetoFrontFile_ = "FUN"; outputParetoSetFile_ = "VAR"; algorithmSettings_ = null; //algorithm_ = null; independentRuns_ = 0; indicatorMinimize_ = new HashMap<String, Boolean>(); indicatorMinimize_.put("HV", false); indicatorMinimize_.put("EPSILON", true); indicatorMinimize_.put("SPREAD", true); indicatorMinimize_.put("GD", true); indicatorMinimize_.put("IGD", true); } // Constructor /** * Runs the experiment */ public void runExperiment(int numberOfThreads) throws JMException, IOException { // Step 1: check experiment base directory checkExperimentDirectory(); map_.put("experimentDirectory", experimentBaseDirectory_); map_.put("algorithmNameList", algorithmNameList_); map_.put("problemList", problemList_); map_.put("indicatorList", indicatorList_); map_.put("paretoFrontDirectory", paretoFrontDirectory_); map_.put("paretoFrontFile", paretoFrontFile_); map_.put("independentRuns", independentRuns_); map_.put("outputParetoFrontFile", outputParetoFrontFile_); map_.put("outputParetoSetFile", outputParetoSetFile_); map_.put("problemsSettings", problemsSettings_); //SolutionSet[] resultFront = new SolutionSet[algorithmNameList_.length]; if (problemList_.length < numberOfThreads) { numberOfThreads = problemList_.length; System.out.println("Experiments: list of problems is shorter than the " + "of requested threads. Creating " + numberOfThreads); } // if else { System.out.println("Experiments: creating " + numberOfThreads + " threads"); } Thread[] p = new RunExperiment[numberOfThreads]; for (int i = 0; i < numberOfThreads; i++) { //p[i] = new Experiment(map_, i, numberOfThreads, problemList_.length); p[i] = new RunExperiment(this, map_, i, numberOfThreads, problemList_.length); p[i].start(); } try { for (int i = 0; i < numberOfThreads; i++) { p[i].join(); } } catch (InterruptedException ex) { Logger.getLogger(Experiment.class.getName()).log(Level.SEVERE, null, ex); } } /** * Runs the experiment */ public void runExperiment() throws JMException, IOException { runExperiment(1); } // runExperiment public void checkExperimentDirectory() { File experimentDirectory; experimentDirectory = new File(experimentBaseDirectory_); if (experimentDirectory.exists()) { System.out.println("Experiment directory exists"); if (experimentDirectory.isDirectory()) { System.out.println("Experiment directory is a directory"); } else { System.out.println("Experiment directory is not a directory. Deleting file and creating directory"); } experimentDirectory.delete(); new File(experimentBaseDirectory_).mkdirs(); } // if else { System.out.println("Experiment directory does NOT exist. Creating"); new File(experimentBaseDirectory_).mkdirs(); } // else } // checkDirectories /** * Especifies the settings of each algorith. This method is checked in each * experiment run * @param problem Problem to solve * @param problemId Index of the problem in problemList_ * @param algorithm Array containing the algorithms to execute * @throws ClassNotFoundException */ public abstract void algorithmSettings(String problemName, int problemId, Algorithm[] algorithm) throws ClassNotFoundException; public static void main(String[] args) throws JMException, IOException { } ; public void generateLatexTables() throws FileNotFoundException, IOException { latexDirectory_ = experimentBaseDirectory_ + "/" + latexDirectory_; System.out.println("latex directory: " + latexDirectory_); Vector[][][] data = new Vector[indicatorList_.length][][]; for (int indicator = 0; indicator < indicatorList_.length; indicator++) { // A data vector per problem data[indicator] = new Vector[problemList_.length][]; for (int problem = 0; problem < problemList_.length; problem++) { data[indicator][problem] = new Vector[algorithmNameList_.length]; for (int algorithm = 0; algorithm < algorithmNameList_.length; algorithm++) { data[indicator][problem][algorithm] = new Vector(); String directory = experimentBaseDirectory_; directory += "/data/"; directory += "/" + algorithmNameList_[algorithm]; directory += "/" + problemList_[problem]; directory += "/" + indicatorList_[indicato