jeco.lib.problems.floorplan
Class FloorplanPolish

java.lang.Object
  extended by jeco.kernel.problem.Problem
      extended by jeco.lib.problems.floorplan.FloorplanPolish

public class FloorplanPolish
extends Problem


Field Summary
protected  FloorplanConfiguration data
           
static java.lang.String numLayersProperty
           
protected  java.util.Set<Component> operators
           
 
Fields inherited from class jeco.kernel.problem.Problem
INFINITY, name, numberOfObjectives, numberOfVariables
 
Constructor Summary
FloorplanPolish(java.lang.String name, FloorplanConfiguration data)
           
 
Method Summary
 void allocate(BinaryNode<Component> floorplan, java.lang.Integer layer)
           
static java.util.LinkedList<BinaryNode<Component>> benchmark(FloorplanPolish problem, int num)
          BENCHMARK #0: Comming from Johan Berntsson and Maolin Tang paper (2004) Current floorplan (polish): 3 1 6 8 Z H Z 2 7 Z V 5 4 H V Result must be equal to (inorder): 3 V 2 V 5 H 4 1 H 6 V 7 8 BENCHMARK #1: Comming from myself (2010) Current floorplan (polish): 9 0 2 5 Z H Z 8 H 6 4 V H 10 V 7 H 3 H 1 11 H V Result must be equal to (inorder): 9 H 8 H 6 V 4 V 10 H 7 H 3 V 1 H 11 0 H 2 5 BENCHMARK #2: Comming from myself (2010) Current floorplan (polish): 7 1 H 3 4 V H 5 Z 8 V 6 Z 10 H 9 V 2 Z 0 V 11 V Result must be equal to (inorder): 7 H 1 H 3 V 4 V 8 H 10 V 9 V 0 V 11 2 V 6 V 5 BENCHMARK #3: Comming from myself (2010) Current floorplan (polish): 9 2 7 H 0 V H 1 Z 4 8 6 V H 5 Z H 3 V 10 V 11 Z Result must be equal to (inorder): 9 H 2 H 7 V 0 H 4 H 8 V 6 V 3 V 10 11 V|H 1 V|H 5
static void buildFloorplanFromBenchMark(FloorplanPolish problem, int num)
           
 void evaluate(Solution solution)
           
 java.util.LinkedList<BinaryNode<Component>> findZNodes(BinaryNode<Component> node)
           
static void main(java.lang.String[] args)
           
 Solutions newRandomSetOfSolutions(int size)
           
static void optimize(FloorplanPolish problem, java.lang.Integer numIndi, java.lang.Integer numGene)
           
 void removeLNodes(BinaryNode<Component> node)
           
 java.util.LinkedList<BinaryNode<Component>> splicer(BinaryNode<Component> root)
           
 
Methods inherited from class jeco.kernel.problem.Problem
computeParetoOptimalFront, evaluateConstraints, getName, getNumberOfObjectives, getNumberOfVariables
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

numLayersProperty

public static final java.lang.String numLayersProperty
See Also:
Constant Field Values

operators

protected java.util.Set<Component> operators

data

protected FloorplanConfiguration data
Constructor Detail

FloorplanPolish

public FloorplanPolish(java.lang.String name,
                       FloorplanConfiguration data)
Method Detail

evaluate

public void evaluate(Solution solution)
Specified by:
evaluate in class Problem

newRandomSetOfSolutions

public Solutions newRandomSetOfSolutions(int size)
Specified by:
newRandomSetOfSolutions in class Problem

splicer

public java.util.LinkedList<BinaryNode<Component>> splicer(BinaryNode<Component> root)

findZNodes

public java.util.LinkedList<BinaryNode<Component>> findZNodes(BinaryNode<Component> node)

removeLNodes

public void removeLNodes(BinaryNode<Component> node)

allocate

public void allocate(BinaryNode<Component> floorplan,
                     java.lang.Integer layer)

main

public static void main(java.lang.String[] args)

optimize

public static void optimize(FloorplanPolish problem,
                            java.lang.Integer numIndi,
                            java.lang.Integer numGene)

benchmark

public static java.util.LinkedList<BinaryNode<Component>> benchmark(FloorplanPolish problem,
                                                                    int num)
BENCHMARK #0: Comming from Johan Berntsson and Maolin Tang paper (2004) Current floorplan (polish): 3 1 6 8 Z H Z 2 7 Z V 5 4 H V Result must be equal to (inorder): 3 V 2 V 5 H 4 1 H 6 V 7 8 BENCHMARK #1: Comming from myself (2010) Current floorplan (polish): 9 0 2 5 Z H Z 8 H 6 4 V H 10 V 7 H 3 H 1 11 H V Result must be equal to (inorder): 9 H 8 H 6 V 4 V 10 H 7 H 3 V 1 H 11 0 H 2 5 BENCHMARK #2: Comming from myself (2010) Current floorplan (polish): 7 1 H 3 4 V H 5 Z 8 V 6 Z 10 H 9 V 2 Z 0 V 11 V Result must be equal to (inorder): 7 H 1 H 3 V 4 V 8 H 10 V 9 V 0 V 11 2 V 6 V 5 BENCHMARK #3: Comming from myself (2010) Current floorplan (polish): 9 2 7 H 0 V H 1 Z 4 8 6 V H 5 Z H 3 V 10 V 11 Z Result must be equal to (inorder): 9 H 2 H 7 V 0 H 4 H 8 V 6 V 3 V 10 11 V|H 1 V|H 5


buildFloorplanFromBenchMark

public static void buildFloorplanFromBenchMark(FloorplanPolish problem,
                                               int num)