Improved evolvability in genetic programming with polyandry

摘要: This strategy is employed by a similar algorithm, Brood Recombination. We conduct experiments to compare Polyandry with the canonical GP. Our demonstrate that consistently exhibits better evolvability than As consequence, achieves higher success rates and discovers globally optimal solutions in signicantly fewer generations latter. The result of these observations given certain brood size settings, requires less computational eort arrive at global optimum solution also analogous nature-inspired modication GP, adoption Recombination order improve ubiquitous GP literature. results Recombination, due more explorative nature algorithm both genotype tness space. result, although two algorithms exhibit rates, key advantage over therefore faster discovery. consequence compared Further, we establish exerted competitively low, relative other Evolutionary Algorithm (EA) methodologies conclude alternative as well regards achievement maintenance evolvability.