Evolving search spaces to emphasize the performance difference of real-coded crossovers using genetic programming

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Shirakawa, Shinichi ^a   Yata, Noriko ^a   Nagao, Tomoharu ^a  

^a YOKOHAMA NATIONAL UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK FUNCTIONS; CARTESIAN GENETIC PROGRAMMING; EVOLUTIONARY COMPUTATIONS; REAL-CODED; REAL-CODED GENETIC ALGORITHM; SEARCH PERFORMANCE; SEARCH SPACES;

ARTIFICIAL INTELLIGENCE; CALCULATIONS; EXPERIMENTS; FUNCTION EVALUATION; GENETIC PROGRAMMING;

GENETIC ALGORITHMS;

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

References (19)

1. L. J. Eshelman and J. D. Schaffer, "Real coded genetic algorithms and interval-schemata," in Foundations of Genetic Algorithms 2. Morgan Kaufmann Publishers, 1993, pp. 187-202.
2. I. Ono and S. Kobayashi, "A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover," in Proceedings of the 7th International Conference on Genetic Algorithms (ICGA '97). Morgan Kaufmann Publishers, 1997, pp. 246-253.
3. H. Kita, I. Ono, and S. Kobayashi, "Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms," in Proceedings of the 1998 IEEE Congress on Evolutionary Computation (CEC '98), 1998, pp. 529-534.
4. S. Tsutsui, M. Yamamura, and T. Higuchi, "Multi-parent recombination with simplex crossover in real coded genetic algorithms," in Proceedings of the Genetic and Evolutionary Computation Conference 1999 (GECCO '99). Morgan Kaufmann Publishers, 1999, pp. 657-664.
5. K. Deb, A. Anand, and D. Joshi, "A computationally efficient evolutionary algorithm for real-parameter optimization," Evolutionary Computation, vol. 10, no. 4, pp. 371-395, 2002.
6. N. Hansen and A. Ostermeier, "Completely derandomized self-adaptation in evolution strategies," Evolutionary Computation, vol. 9, no. 2, pp. 159-195, 2001.
7. J. Kennedy and R. Eberhart, "Particle swarm optimization," in Proceedings of the 1995 IEEE International Conference on Neural Networks, 1995, pp. 1942-1948.
8. R. Storn and K. Price, "Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces," Journal of Global Optimization, vol. 11, no. 4, pp. 341-359, 1997.
9. M. Oltean, "Searching for a practical evidence of the no free lunch theorems," in Biologically Inspired Approaches to Advanced Information Technology: First International Workshop, BioADIT 2004, ser. LNCS, vol. 3141. Springer-Verlag, 2004, pp. 472-483.
10. W. B. Langdon and R. Poli, "Evolving problems to learn about particle swarm and other optimisers," in Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC '05), vol. 1, 2005, pp. 81-88.
11. W. B. Langdon and R. Poli, "Evolving problems to learn about particle swarm optimizers and other search algorithms," IEEE Transactions on Evolutionary Computation, vol. 11, no. 5, pp. 561-578, 2007.
12. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
13. R. Poli, W. B. Langdon, and N. F. McPhee, A Field Guide to Genetic Programming. Published via http://lulu.comandfreely available at http://www.gp-field-guide.org.uk, 2008, (With contributions by J. R. Koza).
14. J. I. van Hemert, "Evolving combinatorial problem instances that are difficult to solve," Evolutionary Computation, vol. 14, no. 4, pp. 433-462, 2006.
15. J. F. Miller and P. Thomson, "Cartesian genetic programming," in Genetic Programming: 3rd European Conference, EuroGP 2000, ser. LNCS, vol. 1802. Springer-Verlag, 2000, pp. 121-132.
16. J. F. Miller and S. L. Smith, "Redundancy and computational efficiency in cartesian genetic programming," IEEE Transactions on Evolutionary Computation, vol. 10, no. 2, pp. 167-174, 2006.
17. T. Yu and J. F. Miller, "Neutrality and the evolvability of boolean function landscape," in Genetic Programming: 4th European Conference, EuroGP 2001, ser. LNCS, vol. 2038. Springer-Verlag, 2001, pp. 204-217.
18. H. Satoh, M. Yamamura, and S. Kobayashi, "Minimal generation gap model for considering both exploration and exploitations," in Proceedings of the IIZUKA'96, 1996, pp. 494-497.
19. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the Strength Pareto Evolutionary Algorithm," Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Zurich, Switzerland, Tech. Rep. 103, 2001.