A multiple-population evolutionary approach to gate matrix layout

References

• Cantú-Paz E 1999 Topologies, Migration Rates and Multi-Population Parallel Genetic Algorithms Technical Report No. 97007, Illinois Genetic Algorithms Laboratory (ILLIGAL) University of Illinios USA
   Google Scholar
• Cantú-Paz E 2000 Efficient and Accurate Parallel Genetic Algorithms Dordrecht Kluwer Academic
   Google Scholar
• Darwin CR 1993 The Origin of the Species (Random House)
   Google Scholar
• Dawkins R 1976 The Selfish Gene Oxford Oxford University Press
   Google Scholar
• Downey , RG and Fellows , MR . 1995 . Fixed parameter tractability and completeness 1. Basic results . SIAM Journal on Computing , 24 : 873 – 921 .
   Google Scholar
• Fellows , MR and Langston , MA . 1987 . Non-constructive advances in polynomial-time complexity . Information Processing Letters , 26 : 157 – 162 .
   Google Scholar
• Foo , SK , 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 .
   Web of Science ®Google Scholar
• França , PM , 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 .
   Web of Science ®Google Scholar
• Hashimoto A Stevens J 1971 Wire routing by optimising channel assignment within large apertures Proceedings of the 8^th Design Automation Conference pp. 155–169
   Google Scholar
• Hu , YH and Chen , SJ . 1990 . GM_Plan: A gate matrix layout algorithm based on artificial intelligence planning techniques . IEEE Transactions on Computer-Aided Design , 9 : 836 – 845 .
   Web of Science ®Google Scholar
• Lengauer T 1990 Combinatorial Algorithms for Integrated Circuit Layout New York John Wiley
   Google Scholar
• Linhares , A . 1999 . Synthesizing a predatory search strategy for VLSI layouts . IEEE Transactions on Evolutionary Computation , 3 : 147 – 152 .
   Google Scholar
• Linhares , A and Yanasse , HH . 2002a . Connections between cutting-pattern sequencing, VLSI design, and flexible machines . Computers & Operations Research , 29 : 1759 – 1772 .
   Web of Science ®Google Scholar
• Linhares A Yanasse HH 2002b Local search intensity versus local search diversity: a false trade-off? Manuscript submitted for publication
   Google Scholar
• 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 .
   Google Scholar
• Luk , BL , 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 .
   Web of Science ®Google Scholar
• Mendes AS França PM 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
   Google Scholar
• Mendes , AS , Müller , FM , França , PM and Moscato , P . 2002 . Comparing meta-heuristic approaches for parallel machine scheduling problems . Production Planning & Control , 13 : 143 – 154 .
   Web of Science ®Google Scholar
• Möhring , RH . 1990 . Graph problems related to gate matrix layout and PLA folding . Computing , 7 : 17 – 51 .
   Google Scholar
• Moscato P 1989 On evolution, search, optimisation, genetic algorithms and martial arts: towards memetic algorithms Caltech Concurrent Computation Program, C3P Report 826
   Google Scholar
• Moscato P Norman MG 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
   Google Scholar
• Nakatani K FujIi T Kikuno T Yoshida N 1986 A heuristic algorithm for gate matrix layout Proceedings of International Conference of Computer-Aided Design pp. 324–327
   Google Scholar
• Syswerda G 1991 Schedule optimization using genetic algorithms In Handbook of Genetic Algorithms New York Van Nostrand Reinhold pp. 332–349
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Weiner J 1995 The Beak of the Finch New York Vintage Books
   Google Scholar
• Wing , O , Huang , S and Wang , R . 1985 . Gate matrix layout . IEEE Transactions on Computer-Aided Design , 4 : 220 – 231 .
   Google Scholar
• Xiong , N . 2001 . Evolutionary learning of rule promises for fuzzy modelling . International Journal of Systems Science , 32 : 1109 – 1118 .
   Web of Science ®Google Scholar
• Yanasse , HH . 1997 . On a pattern-sequencing problem to minimize the number of open stacks . European Journal of Operational Research , 100 : 454 – 463 .
   Google Scholar