File size: 2,914 Bytes
c574d3a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 |
import java.util.ArrayList;
public class Individual implements Comparable<Individual> {
private ArrayList<Segment> segments;
private double overallDeviation;
private double edgeValue;
private int rank;
private double crowdingDistance;
public Individual(ArrayList<Segment> segments, ArrayList<ArrayList<Node>> nodes){
this.segments = segments;
this.overallDeviation = 0.1 * sumOverallDeviation(segments);
this.edgeValue = (-1) * sumEdgeValue(segments, nodes);
this.rank = 0;
this.crowdingDistance = 0;
}
double sumOverallDeviation(ArrayList<Segment> segments){
double totalFitness = 0;
for (Segment segment : segments) {
totalFitness += overallDeviation(segment);
}
return totalFitness;
}
double sumEdgeValue(ArrayList<Segment> segments, ArrayList<ArrayList<Node>> nodes){
double totalFitness = 0;
for(Segment segment : segments) {
totalFitness -= edgeValue(segment, nodes); //Trying to minimize this value, therefore it is the minus value. TODO: Test if we are correct.
}
return totalFitness;
}
/*
We want to minimize this
*/
private double overallDeviation(Segment segment){
double fitness = 0;
for (Node node : segment.getNodes()) {
fitness += Helpers.rgbDistance(node.getColor(), segment.getNodes().get(0).getColor());
}
//segment.setOverallDeviation(fitness);
return fitness;
}
/*
We want to maximize this
*/
private double edgeValue(Segment segment, ArrayList<ArrayList<Node>> nodes) {
double fitness = 0;
for (Node node : segment.getNodes()) {
for (Node neighbour : Helpers.getNodeNeighbours(node, nodes)) {
if (node.getSegment() == neighbour.getSegment()) {
continue;
}
node.setEdge(true);
//node.setColor(Color.BLACK);
fitness += Helpers.rgbDistance(node.getColor(), neighbour.getColor());
}
}
return fitness;
}
public double getEdgeValue() {
return edgeValue;
}
public double getOverallDeviation() {
return overallDeviation;
}
public int compareTo(Individual o) {
return this.getRank() - o.getRank();
}
public int getRank() {
return rank;
}
public void setRank(int rank) {
this.rank = rank;
}
public double getCrowdingDistance() {
return crowdingDistance;
}
public void setCrowdingDistance(double crowdingDistance) {
this.crowdingDistance = crowdingDistance;
}
public ArrayList<Segment> getSegments() {
return segments;
}
public void setSegments(ArrayList<Segment> segments) {
this.segments = segments;
}
}
|