Why is problem-dependent and high-level representation scheme better in a genetic algorithm?

Authors:
Sam Chung;Rafael Perez
Affiliations:
Regenstrief Institute for Health Care, Indiana University Medical Center, 1001 West 10th St., Indianapolis, IN;Dept. of Computer Science & Engineering, University of South Florida, 4202 East Fowler Ave., ENB 118, Tampa, FL
Venue:
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Year:
1997

Finite Markov chain analysis of genetic algorithms

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm144438

Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm144438
An analysis of the effects of different representation schemes on genetic algorithms

An analysis of the effects of different representation schemes on genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Hi-index	0.00