A multiple-population evolutionary approach to gate matrix layout

International Journal of Systems Science

Volumn 35, Issue 1, 2004, Pages 13-23

  Mendes, A ^a   Linhares, A ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b FUNDAÇÃO GETÚLIO VARGAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; INTEGRATED CIRCUIT LAYOUT; MATRIX ALGEBRA; OPTIMIZATION;

CHIP MANUFACTURING INDUSTRY; GATE MATRIX LAYOUT;

VLSI CIRCUITS;

EID: 1642360001     PISSN: 00207721     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207720310001657054     Document Type: Article

References (28)

1. Cantú-Paz, E., 1999, Topologies, Migration Rates and Multi-Population Parallel Genetic Algorithms. Technical Report No. 97007, Illinois Genetic Algorithms Laboratory (ILLIGAL), University of Illinois, USA.
2. Cantú-Paz, E., 2000, Efficient and Accurate Parallel Genetic Algorithms (Dordrecht: Kluwer Academic).
3. Darwin, C. R., 1993, The Origin of the Species (Random House).
4. Dawkins, R., 1976, The Selfish Gene (Oxford: Oxford University Press).
5. Downey, R. G., and Fellows, M. R., 1995, Fixed parameter tractability and completeness 1. Basic results. SIAM Journal on Computing, 24, 873-921.
6. Fellows, M. R., Langston, M. A., 1987, Non-constructive advances in polynomial-time complexity. Information Processing Letters, 26, 157-162.
7. Foo, S. K., Saratchandran, P., and Sundararajan, N., 1999, An evolutionary algorithm for parallel mapping of backpropagation learning on heterogeneous processors. International Journal of Systems Science, 30, 309-321.
8. França, P. M., Mendes, A., and Moscato, P., 2001, A memetic algorithm for the total tardiness single machine Scheduling problem. European Journal of Operational Research, 132, 224-242.
9. Hashimoto, A., and Stevens, J., 1971, Wire routing by optimising channel assignment within large apertures. Proceedings of the 8th Design Automation Conference, pp. 155-169.
10. Hu, Y. H., and Chen, S. J., 1990, GM_Plan: A gate matrix layout algorithm based on artificial intelligence planning techniques. IEEE Transactions on Computer-Aided Design, 9, 836-845.
11. Lengauer, T., 1990, Combinatorial Algorithms for Integrated Circuit Layout (New York: John Wiley).
12. Linhares, A., 1999, Synthesizing a predatory search strategy for VLSI layouts. IEEE Transactions on Evolutionary Computation, 3, 147-152.
13. Linhares, A., and Yanasse, H. H., 2002a, Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Computers & Operations Research, 29, 1759-1772.
14. Linhares, A., and Yanasse, H. H., 2002b, Local search intensity versus local search diversity: a false trade-off? Manuscript submitted for publication.
15. Linhares, A., Yanasse, H., and Torreão, J., 1999, Linear Gate Assignment: a fast statistical mechanics approach. IEEE Transactions on Computer-Aided Design on Integrated Circuits and Systems, 18, 1750-1758.
16. Luk, B. L., Galt, S., and Chen, S., 2001, Using genetic algorithms to establish efficient walking gaits for an eight-legged robot. International Journal of Systems Science, 32, 703-713.
17. Mendes, A. S., França, P. M., and Moscato, P., 2001, NP-Opt: an optimisation framework for NP problems. Proceedings of POM2001-International Conference of the Production and Operations Management Society, pp. 82-89.
18. Mendes, A. S., Müller, F. M., França, P. M., and Moscato, P., 2002, Comparing meta-heuristic approaches for parallel machine scheduling problems. Production Planning & Control, 13, 143-154.
19. Möhring, R. H., 1990, Graph problems related to gate matrix layout and PLA folding. Computing, 7, 17-51.
20. Moscato, P., 1989, On evolution, search, optimisation, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826.
21. Moscato, P., and Norman, M. G., 1992, A 'memetic' approach for the travelling Salesman Problem. Implementation of a computational ecology for combinatorial optimisation on message-passing systems. In M. Valero, E. Onate, M. Jane, J. L. Larriba, and B. Suarez (eds.) Parallel Computing and Transputer Applications (Amsterdam: IOS Press), pp. 187-194.
22. Nakatani, K., Fujii, T., Kikuno, T., and Yoshida, N., 1986, A heuristic algorithm for gate matrix layout. Proceedings of International Conference of Computer-Aided Design, pp. 324-327.
23. Syswerda, G., 1991, Schedule optimization using genetic algorithms. In Handbook of Genetic Algorithms (New York: Van Nostrand Reinhold), pp. 332-349.
24. Viennet, R., Fonteix, C., and Marc, I., 1996, Multicriteria optimisation using a genetic algorithm for determining a pareto set. International Journal of Systems Science, 27, 255-260.
25. Weiner, J., 1995, The Beak of the Finch (New York: Vintage Books).
26. Wing, O., Huang, S., and Wang, R., 1985, Gate matrix layout. IEEE Transactions on Computer-Aided Design, 4, 220-231.
27. Xiong, N., 2001, Evolutionary learning of rule promises for fuzzy modelling. International Journal of Systems Science, 32, 1109-1118.
28. Yanasse, H. H., 1997, On a pattern-sequencing problem to minimize the number of open stacks. European Journal of Operational Research, 100, 454-463.