Using reproductive evaluation to improve genetic search and heuristic discovery
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
Intelligence through simulated evolution: forty years of evolutionary programming
Intelligence through simulated evolution: forty years of evolutionary programming
Genetic Algorithms Plus Data Structures Equals Evolution Programs
Genetic Algorithms Plus Data Structures Equals Evolution Programs
Utilizing Dynastically Optimal Forma Recombination in Hybrid Genetic Algorithms
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
| Hi-index | 0.00 |
The application of a heuristic recombination operator to epistatic problems is discussed in this paper. This operator uses an A*-like mechanism to intelligently explore the dynastic potential (set of possible offspring) of recombined solutions, exploiting partial knowledge about the epistatic relation of variables. Two case studies (the design of a brachystochrone and the Rosenbrock function) are presented, providing experimental results. The scalability of the operator for increasing problem sizes is also considered.