A Mimetic Algorithm for Refinement of Lower Bound of Number of Tracks in Channel Routing Problem

  • Debasri Saha
  • Rajat K. Pal
  • Samar Sen Sarma
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 228)


Study of algorithms and its design can be progressed in various dimensions. In this paper, we have a definite refinement of lower bound on the number of tracks required to route a channel. The attack is from a complementary viewpoint. Our algorithm succeeds to avoid all kind of approximation. The approach performs exact mapping of the problem into graphical presentation and analyzes the graph taking help of mimetic algorithm, which uses combination of sequential and GA based vertex coloring. Performance of the algorithm depends on how effectively mimetic approach can applied selecting appropriate values for the parameters to evaluate the graphical presentation of the problem. This viewpoint has immense contribution against sticking at local minima for this optimization problem. The finer result clearly exemplifies instances, which give better or at least the same lower bound in VLSI channel routing problem.

Key words

Manhattan Routing model Channel routing problem Constraint graphs Maximum Independent set Mimetic algorithm 


  1. [1]
    A.S. LaPaugh, Algorithm for integrated circuit layout: An analytic approach, Ph.D.dissertation, MIT Laboratory for Computer Science, Nov. 1980.Google Scholar
  2. [2]
    R.K Pal, S.P. Pal, A. Pal, On the Computational complexity of multiplayer channel routing, Technical Report: TR/IIT/CSE/92/02, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur 721 302, India, 1992Google Scholar
  3. [3]
    R.K Pal, S.P. Pal, A.K. Datta, A. Pal, NP-completeness of multi-layer no-dogleg channel routing and an efficient heuristic, Proc. 6th Int. Conf. On VLSI Design, 1993, pp.80–83.Google Scholar
  4. [4]
    G.A. Scaper, Multi-layer channel routing, Ph.D. dissertation, Computer Science Department, University of Central Florida, Orlando, Fla., Aug. 1989.Google Scholar
  5. [5]
    M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980zbMATHGoogle Scholar
  6. [6]
    Ricardo Blanco-vega, Jose Hernandez Orallo, Analyzing the Trade-off between comprehensibility & accuracy in Mimetic Models, Dept of System Informatics & ComputationGoogle Scholar
  7. [7]
    Integration, the VLSI journal 25(1998) pp. 71–84.Google Scholar
  8. [8]
    Optimization for Engineering Design, Kalyanmoy Deb.Google Scholar
  9. [9]
    Pinaki Mazumder, Elizabeth M. Rudnick, Genetic Algorithms for VLSI Design, Layout & Test automation.Google Scholar
  10. [10]
    R.K. Pal, Multi-layer Channel Routing. Narosa Publishing House, India.Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Debasri Saha
    • 1
  • Rajat K. Pal
    • 1
  • Samar Sen Sarma
    • 1
  1. 1.Department of Computer ScienceUniversity of CalcuttaCalcutta

Personalised recommendations