Efficient VLSI routing optimization employing discrete differential evolution technique

Global routing in VLSI design is a difficult discrete optimization problem. This paper describes the global VLSI routing using Differential Evolution based optimization technique to find out the minimum routing wire length. The routing process determines the precise paths to interconnect the chip components. The geometrical layout of the path connected in the chip must be satisfied its design requirements. This paper proposes a novel approach to apply of Differential Evolution algorithm for solving the optimization problems in discrete spaces. Performance of this approach in VLSI routing is effective and it can be efficiently used in other discrete optimization problems. The results obtained in this work are compared with other evolutionary computing techniques like Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC) and FLUTE algorithm which are frequently used in routing problems.