Research Article
Wirelength Minimization in Partitioning and Floorplanning Using Evolutionary Algorithms
Begin | Initialize population P; | For i:= 1 To size of(P) Do | Individual:= Pi; | Individual:= Local_Search (Individual); | Repeat Until (terminate=True) Do | For i:= 1 To #recombination Do | Select two parents ia, ibε P randomly; | ic:= Recombination(ia,ib); | ic:= Local Search(ic); | Add individual ic to P; | P:= Select(P); | If (P converged Then | For i:= 1 To size of(P), i != index(Best) Do | Individual:= Pi | Individual:= Local_Search(Mutate(Individual)); | End |
|