The task of VLSI physical design is to produce the layout of an integrated circuit. The layout problem in VLSI-design can be broken up into the subtasks partitioning, floor planning, placement and routing. Routing can be classified into two types. One is Global routing and another one is detailed routing. In detailed routing, the Connections betweens blocks or cells, respectively, have to be generated under consideration of certain constraints, e.g., different Nets are not allowed to intersect because such intersections produce short circuits. As routing is NP-complete, in general it cannot be solved exactly within reasonable time bounds for large Problem instances. Some problems are arises during the routing process .The routing constraints are Minimize total wire length, Minimize knees in path, Meet timing budget. To overcome these problems Memetic algorithm has been used. Combining global and local search is a strategy used by many successful hybrid optimization approaches. Memetic Algorithms (MAs) are Evolutionary Algorithms (EAs) that apply some sort of local search to further improve the fitness of individuals in the population. Memetic Algorithms have been shown to be very effective in solving many hard combinatorial optimization problems. This algorithm combines Genetic Algorithms and advanced local search to solve VLSI circuit Routing. The effect of local search, clustering and good initial solution on the overall Memetic algorithm by using the circuit routing as a paradigm.

1. Natalio Krasnogor and Jim Smith, “A Tutorial for competent memetic algorithms: model, taxonomy and design issues”, IEEE transaction on evolutionary computation, vol a, no. b, CCC 200d, 2005. . Nabin ghoshal, university of kalyani, Parlay mitra, Bengal engineering college, Rajat K.pal, university of Calcutta, “A two and three layer dogleg channel routing algorithm for minimizing total wire length” 2004 ieee.
2. Frank Schmiedle, RolfDrechsler, SeniorMember, ieee, and Bernd Becker, SeniorMember, ieee “Exact routing with search space reduction”,: ieee transactions on computers, vol 52, no.6, june 2003.
3. Pralay Mitra “A Graph Theoretic Approach to Minimize Total Wire Length in Channel Routing”, Dept. Of Computer Sc. & Tech. Bengal Engineering College (D.U.) Howrah-711 103, West Bengal, India, 2003.„
4. R. M. Smey, W. Swartz, and P. H. Madden, “Crosstalk Minimization during Detail Routing," Design Automation and Test Europe, March 2003, pp. 862—
5. Hawkiareibi, School of Engineering, University of Guelph, Guelph, Ontario, N1G2W1,Canada, Zhen Yang ,School of Engineering, University of Guelph, Guelph, Ontario, N1G2W1,Canada “Effective Memetic Algorithms for VLSI Design”.
6. Maolin tang, kamran eshraghian and hon nin cheung, centre for very high speed micro electronics systems, Edith Cowan university, joondalup, WA 6027, Australia, “A genetic algorithm for constrained via minimization”, 1999 ieee.
7. Vladimir N. Davidenko, Victor M.Kureichik, Victor V. Miagkikh, “Genetic Algorithm for Restrictive Channel Routing Problem”, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97)
8. Nicole gockel, gregor pudelko, rolf drechsler, bernd becher, “A hybrid genetic algorithm for the channel routing problem”, ieee international symposium on circuits and systems pp.IV:675—IV: 678, Atlanta, 1996
9. Jens lienig and k.Thulasiraman, department of electrical and computer engineering, Concordia university, “A new genetic algorithm for the channel routing problem”1994 IEEE.
10. Jens lienig and K.Thulasiraman, Department of electrical and computer engineering, Concordia University, “A genetic algorithm for channel routing in VLSI circuits”, 1994.
11. B. B. Prahlada Rao, L. M. Patnaik and R. C. Hansdah, Department of Computer Science and Automation Indian Institute of Science , “A Genetic Algorithm for Channel Routing using Inter-Cluster Mutation” 1994 ieee.
12. Haklin Kim, department of math and computer science, university of Tennessee martin, “An application algorithm for the via minimization problem in channel routing”1990 IEEE.
13. Jitender s. deogun and bhargab b.Bhattacharya, “via minimization in VLSI routing with movable terminals”, IEEE transactions on computer aided design, vol. 8, no. 8, august 1989.
14. Michael Burstein, Richard pelavin, “hierarchical wire routing” IEEE transaction on computer aided design, vol, cad-2, no. 4, October 1983

channel routing memetic algorithm wire length minimization crosstalk and via minimization