Homogeneous genetic algorithms

References

• Bäck , T. and Khuri , S. An evolutionary heuristic for the maximum independent set problem . Proceedings of the IEEE World Congress on Computational Intelligence . Vol. 2 , pp. 531 – 535 . Piscataway, NJ : IEEE Service Center .
   Google Scholar
• Beigel , R. Finding maximum independent sets in sparse and general graphs . Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms . January 1999 , Baltimore, MD. Philadelphia, PA : SIAM Publishing .
   Google Scholar
• Brown , E. C. and Sumichrast , R. T. 2001 . CF-GGA: a grouping genetic algorithm for the cell formation problem . Int. J. Prod. Res. , 39 ( 16 ) : 3651 – 3669 .
   Web of Science ®Google Scholar
• Chung , F. L. , Fu , T.-C. , Ng , V. and Luk , R. W.P. 2004 . An evolutionary approach to pattern-based time series segmentation . IEEE Trans. Evol. Comput. , 8 : 471 – 489 .
   Google Scholar
• De Jong , K. A. 2006 . Evolutionary Algorithms, A Unified Approach , Cambridge, MA : MIT Press .
   Google Scholar
• Falkenauer , E. 1992 . The grouping genetic algorithms: widening the scope of the GAs . Belg. J. Oper. Res. Stat. Compu. Sci. , 33 : 79 – 102 .
   Google Scholar
• Fogel , D. B. 2005 . Evolutionary Computation: Toward a New Philosophy of Machine Intelligence , 3 , Hoboken, NJ : John Wiley & Sons, IEEE Press .
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1975 . Computers and Intractability , San Francisco : W. H. Freeman and Company .
   Google Scholar
• Goldberg , D. E. 1989 . Genetic Algorithms in Search, Optimization, and Machine Learning , Reading, MA : Addison Wesley .
   Google Scholar
• Hansen , N. and Ostermeier , A. 2001 . Completely derandomized self-adaptation in evolution strategies . Evol. Comput. , 9 ( 2 ) : 159 – 195 .
   PubMed Web of Science ®Google Scholar
• Hansen , N. , Müller , S. D. and Koumoutsakos , P. 2003 . Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES) . Evol. Comput. , 11 ( 1 ) : 1 – 18 .
   PubMed Web of Science ®Google Scholar
• Holland , J. H. 1975 . Adaptation in Natural and Artificial Systems , Ann Arbor : University of Michigan Press .
   Google Scholar
• Michalewicz , Z. 1994 . Genetic Algorithms + Data Structures = Evolution Programs , 2 , New York : Springer-Verlag .
   Google Scholar
• Miettinen , K. , Mäkelä , M. M. and Toivanen , J. 2003 . Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms . J. Glob. Optim. , 27 : 427 – 446 .
   Web of Science ®Google Scholar
• Mitchell , M. 1996 . An Introduction to Genetic Algorithms , Cambridge, MA : MIT Press .
   Google Scholar
• Montgomery , D. C. 2005 . Design and Analysis of Experiments , New York : John Wiley & Sons Inc .
   Google Scholar
• Myers , R. H. and Montgomery , D. C. 2002 . Response Surface Methodology, Process and Product Optimization Using Designed Experiments , 2 , New York : John Wiley & Sons Inc .
   Google Scholar
• Nayeem , S. M.A. and Pal , M. 2005 . A genetic algorithm to solve the p-center and p-radius problem on a network . Int. J. Comput. Math. , 82 ( 5 ) : 541 – 550 .
   Google Scholar
• Richardson , J. M. , Palmer , M. R. , Liepins , G. E. and Hilliard , M. R. Some guidelines for genetic algorithms with penalty functions . Proceedings of the Third International Conference on Genetic Algorithms . Edited by: Schaffer , J. D. San Mateo, CA : Morgan Kaufmann Publishers .
   Google Scholar
• Ridge , E. and Kudenko , D. Analyzing heuristic performance with response surface models: prediction, optimization, and robustness . Proceedings of the 2007 Genetic and Evolutionary Computation Conference held in London, UK . pp. 150 – 157 . New York : Association of Computing Machinery (ACM) .
   Google Scholar
• Rudolf , G. 1988 . Finite Markov chain results in evolutionary computation, a tour d'horizon . Fund. Inform. , 35 : 67 – 89 .
   Google Scholar
• Smith , A. E. and Tate , D. M. Genetic optimization using a penalty function . Proceedings of the 5th International Conference on Genetic Algorithms . Edited by: Forrest , S. San Mateo, CA : Morgan Kaufmann Publishers .
   Google Scholar
• Tamir , A. 1988 . Improved complexity bounds for the center location problems on networks by using dynamic data structures . SIAM J. Discrete Math. , 1 : 377 – 396 .
   Google Scholar
• Tarjan , R. E. and Trojanowski , A. E. 1977 . Finding a maximum independent set . SIAM J. Comput. , 6 : 537 – 546 .
   Google Scholar
• West , D. B. 2001 . Introduction to Graph Theory , 2 , Upper Saddle River, NJ : Prentice-Hall .
   Google Scholar