src/eva2/server/go/operators/selection/replacement/ReplacementNondominatedSortingDistanceCrowding.java

@@ -0,0 +1,106 @@
+package eva2.server.go.operators.selection.replacement;
+
+import java.util.Collections;
+import java.util.Comparator;
+
+import eva2.server.go.individuals.AbstractEAIndividual;
+import eva2.server.go.operators.archiving.ArchivingNSGAII;
+import eva2.server.go.operators.distancemetric.PhenotypeMetric;
+import eva2.server.go.operators.selection.SelectRandom;
+import eva2.server.go.populations.Population;
+
+
+/** This crowding method replaces the most similar individual from a random group if better.
+ * Created by IntelliJ IDEA.
+ * User: streiche
+ * Date: 19.07.2005
+ * Time: 15:25:15
+ * To change this template use File | Settings | File Templates.
+ */
+public class ReplacementNondominatedSortingDistanceCrowding implements InterfaceReplacement, java.io.Serializable {
+
+	public class HypervolumeComperator implements Comparator<AbstractEAIndividual>{
+		public int compare(AbstractEAIndividual arg0, AbstractEAIndividual arg1) {
+			// TODO Auto-generated method stub
+			Double a0=(Double) arg0.getData("HyperCube");
+			Double a1=(Double) arg1.getData("HyperCube");
+			if(a0!=null&a1!=null){
+				return a1.compareTo(a0);
+			}else return 0;		
+		}	
+	}
+	
+	ArchivingNSGAII dummyArchive=new ArchivingNSGAII();
+    
+    SelectRandom    random = new SelectRandom();
+   
+
+    public ReplacementNondominatedSortingDistanceCrowding() {
+
+    }
+
+    public ReplacementNondominatedSortingDistanceCrowding(ReplacementNondominatedSortingDistanceCrowding b) {
+    	this.dummyArchive=new ArchivingNSGAII();
+
+    }
+
+
+    
+    /** The ever present clone method
+     */
+    public Object clone() {
+        return new ReplaceRandom();
+    }
+
+    /** 
+     * From a random subset of size C, the closest is replaced by the given individual. 
+     * The sub parameter is not regarded.
+     * 
+     * @param indy      The individual to insert
+     * @param pop       The population
+     * @param sub       The subset
+     */
+    @SuppressWarnings("unchecked")
+	public void insertIndividual(AbstractEAIndividual indy, Population pop, Population sub) {
+        
+    
+    	pop.add(indy);
+    	Population []store=dummyArchive.getNonDomiatedSortedFronts(pop);
+		dummyArchive.calculateCrowdingDistance(store);//TODO die f<>r das gesamte Archiv am St<53>ck berechnen und nicht f<>r die Einzelfronten!
+		for(int i=0;i<store.length;i++){
+			synchronized (store[i]) {
+				
+			
+			try{
+				Collections.sort(store[i],new HypervolumeComperator());
+			}catch(java.util.ConcurrentModificationException e){
+				
+			
+			}
+			}
+		}
+    	
+		pop.clear();
+		for(int i=0;i<store.length&&pop.size()<pop.getTargetSize();i++){
+			for(int j=0;j<store[i].size()&&pop.size()<pop.getTargetSize();j++){
+				pop.add(store[i].getEAIndividual(j));
+			}
+		}
+    }
+    /**********************************************************************************************************************
+     * These are for GUI
+     */
+    /** This method returns a global info string
+     * @return description
+     */
+    public String globalInfo() {
+        return "This method replaces the individual with the worsr paretorank and crowding factor";
+    }
+    /** This method will return a naming String
+     * @return The name of the algorithm
+     */
+    public String getName() {
+        return "Crowding";
+    }
+    
+}