[go: nahoru, domu]
Skip to content

Commit

Permalink
MOEAD example
Browse files Browse the repository at this point in the history
  • Loading branch information
castellanos94 committed Jul 2, 2021
1 parent 47d66d1 commit ea3d79f
Showing 1 changed file with 229 additions and 0 deletions.
229 changes: 229 additions & 0 deletions src/main/java/com/castellanos94/examples/MOEAD_Example.java
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,229 @@
package com.castellanos94.examples;

import java.io.File;
import java.io.IOException;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.util.ArrayList;

import com.castellanos94.algorithms.multi.MOEAD;
import com.castellanos94.components.Ranking;
import com.castellanos94.components.impl.DominanceComparator;
import com.castellanos94.datatype.Data;
import com.castellanos94.operators.impl.PolynomialMutation;
import com.castellanos94.operators.impl.RepairBoundary;
import com.castellanos94.operators.impl.SBXCrossover;
import com.castellanos94.problems.benchmarks.dtlz.*;
import com.castellanos94.solutions.DoubleSolution;
import com.castellanos94.solutions.Solution;
import com.castellanos94.utils.Plotter;
import com.castellanos94.utils.ReferenceHyperplane;
import com.castellanos94.utils.Scatter3D;
import com.castellanos94.utils.Tools;

import org.apache.logging.log4j.LogManager;
import org.apache.logging.log4j.Logger;

public class MOEAD_Example {
private static final Logger logger = LogManager.getLogger(MOEAD_Example.class);

static final String DIRECTORY = "experiments" + File.separator + "MOEAD";
static final int EXPERIMENT = 31;

public static void main(String[] args) throws IOException {
File f = new File(DIRECTORY);
if (!f.exists())
f.mkdirs();
DTLZ problem = null;
int np = 1;
int nobj = 3;
ArrayList<Long> time = new ArrayList<>();
ArrayList<DoubleSolution> bag = new ArrayList<>();
Ranking<DoubleSolution> compartor = new DominanceComparator<>();
Tools.setSeed(1L);
for (int i = 0; i < EXPERIMENT; i++) {
MOEAD<DoubleSolution> algorithm = loadConfiguration(np, nobj);
if (i == 0) {
logger.info(algorithm.getProblem().toString());
logger.info(algorithm.toString());
}
algorithm.execute();
logger.info(i + " time: " + algorithm.getComputeTime() + " ms.");
time.add(algorithm.getComputeTime());

try {
Solution.writSolutionsToFile(DIRECTORY + File.separator + "execution_" + i,
new ArrayList<>(algorithm.getSolutions()));
} catch (IOException e) {
logger.error(e);
}
bag.addAll(algorithm.getSolutions());
}

long averageTime = time.stream().mapToLong(v -> v.longValue()).sum();
logger.info("Resume " + problem.getName());
logger.info("Total time: " + averageTime);
logger.info("Average time : " + (double) averageTime / EXPERIMENT + " ms.");
logger.info("Solutions in the bag: " + bag.size());

compartor.computeRanking(bag);

logger.info("Fronts : " + compartor.getNumberOfSubFronts());
logger.info("Front 0: " + compartor.getSubFront(0).size());

f = new File(
DIRECTORY + File.separator + "_MOEAD_" + problem.getName() + "_F0_" + problem.getNumberOfObjectives());

ArrayList<String> strings = new ArrayList<>();
for (DoubleSolution solution : compartor.getSubFront(0))
strings.add(solution.toString());

Files.write(f.toPath(), strings, Charset.defaultCharset());
if (problem.getNumberOfObjectives() == 3) {
Plotter plotter = new Scatter3D<>(compartor.getSubFront(0),
DIRECTORY + File.separator + problem.getName() + "_MOEAD");
plotter.plot();
}
}

private static MOEAD<DoubleSolution> loadConfiguration(int numberOfProblem, int numberOfObjectives) {
int maxIterations = 1000;
DTLZ problem = null;
int pop_size;
int T = 20;
int nr = 2;
int h;
if (numberOfObjectives == 3) {
pop_size = 210;
h = 12;
} else if (numberOfObjectives == 5) {
pop_size = 212;
h = 6;
} else {
pop_size = 271;
h = 5;
}
switch (numberOfProblem) {
case 1:
if (numberOfObjectives == 3) {
problem = new DTLZ1();
maxIterations = 400;
} else if (numberOfObjectives == 5) {
problem = new DTLZ1(numberOfObjectives, numberOfObjectives + 5).setK(5);

maxIterations = 600;
} else if (numberOfObjectives == 8) {
problem = new DTLZ1(numberOfObjectives, numberOfObjectives + 5).setK(5);

maxIterations = 750;
} else if (numberOfObjectives == 10) {
problem = new DTLZ1(numberOfObjectives, numberOfObjectives + 5).setK(5);

maxIterations = 1000;
} else if (numberOfObjectives == 15) {
problem = new DTLZ1(numberOfObjectives, numberOfObjectives + 5).setK(5);

maxIterations = 1500;
}
break;
case 2:
if (numberOfObjectives == 3) {
problem = new DTLZ2();
maxIterations = 250;
} else if (numberOfObjectives == 5) {
problem = new DTLZ2(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 350;
} else if (numberOfObjectives == 8) {
problem = new DTLZ2(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 500;
} else if (numberOfObjectives == 10) {
problem = new DTLZ2(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 750;
} else if (numberOfObjectives == 15) {
problem = new DTLZ2(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 1000;
}
break;
case 3:
if (numberOfObjectives == 3) {
problem = new DTLZ3();
maxIterations = 1000;
} else if (numberOfObjectives == 5 || numberOfObjectives == 8) {
problem = new DTLZ3(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 1000;
} else if (numberOfObjectives == 10) {
problem = new DTLZ3(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 1500;
} else if (numberOfObjectives == 15) {
problem = new DTLZ3(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 2000;
}
break;
case 4:
if (numberOfObjectives == 3) {
problem = new DTLZ4();
maxIterations = 600;
} else if (numberOfObjectives == 5) {
problem = new DTLZ4(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 1000;
} else if (numberOfObjectives == 8) {
problem = new DTLZ4(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 1250;
} else if (numberOfObjectives == 10) {
problem = new DTLZ4(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 2000;
} else if (numberOfObjectives == 15) {
problem = new DTLZ4(numberOfObjectives, numberOfObjectives + 10).setK(10);
maxIterations = 3000;
}
break;
default:
if (numberOfProblem == 5) {
problem = new DTLZ5();
} else if (numberOfProblem == 6) {
problem = new DTLZ6();
} else if (numberOfProblem == 7) {
problem = new DTLZ7();
} else if (numberOfProblem == 8) {
problem = new DTLZ8();
} else {
problem = new DTLZ9();
}
if (numberOfObjectives == 3) {
maxIterations = 750;
} else if (numberOfObjectives == 5)
maxIterations = 1000;
else if (numberOfObjectives == 8)
maxIterations = 1250;
else {
maxIterations = 1500;
}
break;
}
ArrayList<ArrayList<Data>> weightVectors = generateWeight(problem,h);
return new MOEAD<>(problem, maxIterations, pop_size, weightVectors, T, new SBXCrossover(),
new PolynomialMutation(), new RepairBoundary(), new DominanceComparator<>(),
MOEAD.APPROACH.TCHEBYCHEFF);
}

private static ArrayList<ArrayList<Data>> generateWeight(DTLZ problem, int h) {
if (problem.getNumberOfObjectives() <= 5) {
ReferenceHyperplane<DoubleSolution> referenceHyperplane = new ReferenceHyperplane<>(
problem.getNumberOfObjectives(), h);
referenceHyperplane.execute();
ArrayList<ArrayList<Data>> data = referenceHyperplane.transformToData();
return data;
}

ReferenceHyperplane<DoubleSolution> referenceHyperplane = new ReferenceHyperplane<>(
problem.getNumberOfObjectives(), 3);
referenceHyperplane.execute();
ArrayList<ArrayList<Data>> data = referenceHyperplane.transformToData();
ReferenceHyperplane<DoubleSolution> referenceHyperplane2 = new ReferenceHyperplane<>(
problem.getNumberOfObjectives(), 2);
referenceHyperplane2.execute();
data.addAll(referenceHyperplane2.transformToData());
return data;
}

}

0 comments on commit ea3d79f

Please sign in to comment.