Genetic Algorithm for Restrictive Channel Routing Problem.
Vladimir N. Davidenko, Victor M. Kureichik, Victor V. Miagkikh · 1997
This paper presents a genetic algorithm for to the restrictive channel routing problem. The major advance of this algorithm over other GA approaches to this problem is the use of horizontal and vertical constraints in the chromosome encoding which eliminates unfeasible solutions. This representation leads to lower complexity, because repairing procedures become unnecessary; in addition the search space is reduced greatly. Competitive experimental results proving the consistency of the approach were obtained. 1 INTRODUCTION Routing is the final stage in physical design of Integrated Circuits (IC). The aim of routing is to find a topology of connections among elements of an IC in accordance with a given net list, along with other design requirements and preferences. Routing is one of the most highly constrained problems in IC design. There are many approaches such as wave and beam routing algorithms and their various modifications (Burstein1986; Shimamoto and Sakamoto 1989; ...