Homogeneous genetic algorithms

International Journal of Computer Mathematics

Volumn 87, Issue 3, 2010, Pages 476-490

  Stanoyevitch, Alexander ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Covariance matrix adaptation evolutionary strategies; Evolutionary computation; Genetic algorithms; Homogeneous genetic algorithms; The p centre problem

Indexed keywords

CROSSOVER OPERATOR; FEASIBLE SOLUTION; GAS USE; P-CENTRE PROBLEM;

EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS;

GENES;

EID: 74949103025     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160801968770     Document Type: Article

References (25)

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