A COMPARISON OF GENETIC/MEMETIC ALGORITHMS AND OTHER HEURISTIC SEARCH TECHNIQUES

摘要

Iterative improvement techniques based on module interchange are the most robust, simple and successful heuristics in solving the partitioning and placement problems. Interchange methods fail to converge to "optimal" or "near optimal" solutions unless they initially begin from "good" initial starting points. In this paper we compare the performance of several constucti ve based techniques for the circuit partitioning problem.