A routing strategy based on genetic algorithms

Microelectronics Journal

Volumn 28, Issue 6-7, 1997, Pages 641-656

  Gómez Albarrán, Ma De Las Mercedes ^a   Fernández Pampillón Cesteros, Ana Ma ^a   Sánchez Pérez, Juan Manuel ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041760402     PISSN: 00262692     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0026-2692(96)00150-4     Document Type: Article

References (21)

1. N.A. Sherwani, Algorithms for VLSI Physical Design Automation, Kluwer, Dordrecht, 1992.
2. R. Joobanni, An Artificial Intelligence Approach to VLSI Routing, Kluwer, Dordrecht, 1986.
3. M. Burstein and R. Pelivan, Hierarchical wire routing. IEEE Trans. Computer-aided Design, CAD-2(4) (1983) 223-224.
4. M.P. Vecchi and S. Kirkpatrick, Global wiring by simulated annealing. IEEE Trans. Computer-aided Design, CAD-2 (4) (1983) 215-222.
5. Z. Randjelovic and V. Litovski, The fast global routing algorithm, Proc. XXXVII Conf. ETAN, Belgrado, 1993, pp.195-200.
6. V. Litovski, Z. Randjelovic and M. Damnjanovic, Routing in standard cells, Proc. 20th Int. Conf. on Microelectronics, (MIEL'95), Vol. 2, 1995.
7. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
8. J.H. Holland, Genetic algorithms, Scientific American, 1992, July, pp. 44-50.
9. Z. Michalewicz, Genetic Algorithms+Data Structure-s=Evaluation Programs, Springer, Berlin, 1994.
10. D. Withley, T. Starkweather and D.A. Fuguay, Scheduling problems and travelling salesman: the genetic edge recombination operator, in J. Schaffer (ed.), Proc. Third Int. Conf. on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 1989, pp. 133-140.
11. L. Soukup, Fast maze router, Proc. 15th Design Automation Conf., 1978, pp. 100-102.
12. F. Hadlock, Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput., 4(3) (1977) 201-225.
13. M. Mayer and F. Ercal, Genetic algorithm for VERTEX splitting in DAGs. Technical report CSC-93-02. Dep. of Computer Science. University of Missouri-Rolla 1993.
14. D. Whitley, A genetic algorithm tutorial, Colorado State University Technical Report CS-93-103, 1993.
15. F. J. Marin, F. Garcia and F. Sandoval, Algoritmos genéticos: una estrategia para la búsqueda y la optimización, Informática y Automátion, 1992.
16. M.E. Srinivas and I. Patnaik, Genetic algorithms: a survey. Computer, 27(26) (1994) 17-26.
17. J. Lanchares, Desarrollo de metodologias, para sintesis y optimización de circuitos lógicos multinivel, Universidad Complutense de Madrid Doctoral Dissertation, 1995.
18. S. Coombs and L. Davis, Genetic algorithms and communication lind speed design: theoretical considerations, Proc. Second Int. Conf. on Genetic Algorithms, Laurence Eilbaum, Hillsdale, NJ, 1987.
19. Y. Davidor, Genetic algorithms and robotics, World Scientific, 1991.
20. C. A. Ankenbrandt, The time complexity of genetic algorithms and the theory of recombination operators, Tulance University Doctoral Dissertation, 1990.
21. C.A. Ankenbrandt, An extension to the theory of congruence and a proof of the time complexity of genetic algorithms, in G.J.E. Rawling (ed.), Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1991.