Wirelength Minimization in Partitioning and Floorplanning Using Evolutionary Algorithms

Algorithm 1

 

Begin

 Initialize population P;

 For i:= 1 To size of(P) Do

    Individual:= P_i;

    Individual:= Local_Search (Individual);

 Repeat Until (terminate=True) Do

   For i:= 1 To #recombination Do

    Select two parents i_a, i_bε P randomly;

     i_c:= Recombination(i_a,i_b);

     i_c:= Local Search(i_c);

 Add individual i_c to P;

 P:= Select(P);

 If (P converged Then

   For i:= 1 To size of(P), i != index(Best) Do

   Individual:= P_i

Individual:= Local_Search(Mutate(Individual));

 End