Artificial Bee Colony Algorithm—A Novel Tool for VLSI Placement

摘要

The paper discusses a modified algorithm based on the bees' behavior in nature. We suggest to apply this algorithm for solving the element placement problem—one of the most difficult problem in the VLSI design. This problem belongs to the NP-class problem that is there are no precise methods to solve this problem. Also we formulate the placement problem and choose an optimization criterion. The developed artificial bee colony optimization (ABC) algorithm obtains optimal and quasi-optimal solutions during polynomial time. The distinguish feature of the algorithm is to split search space into subareas. After, we activate optimization process for each subarea parallel. To compare obtained results with known analogous algorithms we developed software which allows to carry out experiments on the basis of IBM benchmarks. Conducted experiments shown that the ABC algorithm is better than the other algorithms an average of 8 %.