A Differential Evolution algorithm for restrictive channel routing problem in VLSI circuit design

Differential evolution (DE) algorithm is a heuristic approach that gains more interest in today´s research. It finds the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithm using similar operators; crossover, mutation and selection. This paper addresses the restrictive channel routing problem based on the differential evolution algorithm. This algorithm advances over other approaches to this problem by using the horizontal and vertical constraints in the solution vector 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.