An epistasis measure based on the analysis of variance for the real-coded representation in genetic algorithms

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 1, Issue , 2003, Pages 297-304

  Chan, K Y ^a   Aydin, M E ^a   Fogarty, T C ^a  

^a LONDON SOUTH BANK UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS OF VARIANCE (ANOVA); GENETIC ALGORITHMS;

PROBLEM DIFFICULTY; REAL-CODED;

ALGORITHMS;

EID: 84901460146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299588     Document Type: Conference Paper

References (23)

1. M. E. Aydin, V. Yigit, O. Turkbey, T. C. Fogarty, An evolutionary approach to simulated annealing for uncapacitated facility location problems". Computers & Operations Research, 2003. (Under reviewing)
2. th International Conference on'Genetic Algorithms, pp. 2-8, 1993.
3. J. E. Beasley and P. C. Chu, A genetic algorithm for the set covering problem, European Journal of Operational Research, vol. 94, pp. 392-404, 1996.
4. th European Conference on Genetic Programming, pp. 22-23, 2003.
5. Y. Davidor, Epistasis variance: a viewpoint on GA-hardness. Foundations of Genetic Algorithms I, pp. 23-35, 1991.
6. K. Deb and H. G. Beyer, Self-adaptation in real-parameter genetic algorithms with simulated binary crossover. Proceedings of the Genetic and Evolutionary Computation Conference. Vol. 1, pp. 172-179. 1999..
7. rd International Conferences on Genetic Algorithms. - PP. 104-109, 1989.
8. th International Conference on Parallel Problem Solving from Nature - PPSN V, pp. 47-56, 1998.
9. D. E. Goldberg, Genetic algorithms and Walsh functions: Part I, a gentle introduction, Complex Systems, vol. 3, pp. 129-152, 1989.
10. D. E. Goldberg. Genetic algorithms and Walsh functions: Part II, deception and its analysis, Complex Systems, vol. 3, pp. 153-171, 1989.
11. R. B. Heckendorn and D. Whitley, Predicting epistasis directly from mathematical models, Evolutionary Computation, vol. 7, no. 1, pp. 69-101, 1999.
12. th International Conference on Parallel Problem' Solving from Nature - PPSN V, pp. 57-64, 1992.
13. D. C. Montgomery, Design and Analysis of Experiments. New York: John Wiley and Sons, Inc, 1997
14. H. Muhlenbein and D. S. Voosen, Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization. Evolutionary Compulation, vol. 1, no. 1, pp. 25-49, 1993..
15. th International Conference on Genetic Algorithms, pp. 65-72, 1997.
16. B. Naudts and L. Kallel, A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Transactions on Evolutionaiy Computation, vol. 4. no. I, pp. 1-15, April 2000.
17. C. R. Reeves and C. C. Wright, Epistasis in Genetic Algorithms: An Experimental Design Perspective. Proceedings of the 6th International Conference on Genetic Algorithms, pp. 217-224, 1995.
18. C. Reeves and C. Wright, An experimental design perspective on genetic algorithms. Foundation of Genetic Algorithms 3, pp. 7-12, 1995.
19. C. Reeves, Predictive measure for problem difficulty, Proceedings of the IEEE Congress on Evolutionary Computation, vol. 1, pp. 736-743, 1999.
20. S. Rochet, M. Slimane and G. Venturini, Epistasis for real encoding in geneiic algorithms, Proceeding of the IEEE International Conference on Intelligent Information Systems, pp. 268-271, 1996.
21. S. Rochet, G. Venturini, M. Slimane, M. E. Kharoubi, A critical and empirical study of epistasis measures for predicting GA performances: a summary. Proceedings of the Third European Conference on Artificial Evolution, pp. 287-299. 1997.
22. G. P. Wagner, M. D. Laubichler and H. Bagheri-Chaichian, Genetic measurement theory of epistatic effects. Genetica. Vol. 102/103, pp. 569-580, 1997.
23. A. H, Wright, Genetic algorithms for real parameter optimisation. Foundation of Genetic Algorithms I, pp. 205-518, 1991.