Skip to main navigation Skip to search Skip to main content

A Multi-Objective Evolutionary Algorithm for Channel Routing Problems

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 12 - Chapter in an edited book (Author)peer-review

Abstract

The channel routing problem (CRP) is derived from detailed routing model in VLSI design. The objectives of the problem can vary from reducing the number of horizontal tracks to minimizing the number of vias, length of wires used etc. It is not known how these objectives interact with one another, although it is believed that they are conflicting in nature. Unlike traditional single-objective optimization approaches, this paper presents a multiobjective evolutionary algorithm (MOEA) for CRP. Specialized genetic operators for solving the CRP are devised. In addition, a new method of random routing is introduced for better routing performance. Some standard benchmark problems are solved in this paper using the proposed algorithm to validate its performance. It is shown that the proposed algorithm is consistent and is able to obtain very competitive results as compared to well-known approaches.
Original languageEnglish
Title of host publicationEvolutionary Scheduling
EditorsKeshav P. Dahal, Kay Chen Tan, Peter I. Cowling
Pages405-436
ISBN (Electronic)978-3-540-48584-1
DOIs
Publication statusPublished - 2007
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
PublisherSpringer
Volume49
ISSN (Print)1860-949X
ISSN (Electronic)1860-9503

Fingerprint

Dive into the research topics of 'A Multi-Objective Evolutionary Algorithm for Channel Routing Problems'. Together they form a unique fingerprint.

Cite this