Parallel evolutionary algorithms with SOM-like migration and its application to VLSI-design

We introduce a multiple subpopulation approach for parallel evolutionary algorithms the migration scheme of which follows a SOM-like dynamics. We successfully apply this approach to clustering in VLSI-design. The advantages of the approach are shown which consist in a reduced communication overhead between the subpopulations preserving a non-vanishing information flow.