Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-540-48584-1_15
Title: A multi-objective evolutionary algorithm for channel routing problems
Authors: Goh, C.K.
Lim, W.L.
Chew, Y.H.
Tan, K.C. 
Issue Date: 2007
Source: Goh, C.K.,Lim, W.L.,Chew, Y.H.,Tan, K.C. (2007). A multi-objective evolutionary algorithm for channel routing problems. Studies in Computational Intelligence 49 : 405-436. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-48584-1_15
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. © Springer-Verlag Berlin Heidelberg 2007.
Source Title: Studies in Computational Intelligence
URI: http://scholarbank.nus.edu.sg/handle/10635/54453
ISBN: 3540485821
ISSN: 1860949X
DOI: 10.1007/978-3-540-48584-1_15
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

31
checked on Dec 15, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.