Gene-Machine, a new search heuristic algorithm
Alfredo Garcia Woods

TL;DR
Gene-Machine is a novel search heuristic inspired by natural evolution that outperforms traditional genetic algorithms in optimization tasks without using population or mutation concepts.
Contribution
It introduces a new evolutionary-inspired heuristic that simplifies genetic algorithm principles while maintaining high performance in search and optimization problems.
Findings
Outperforms traditional genetic algorithms in experiments
Does not rely on population, mutation, or generation concepts
Effective for various optimization and search problems
Abstract
This paper introduces Gene-Machine, an efficient and new search heuristic algorithm, based in the building-block hypothesis. It is inspired by natural evolution, but does not use some of the concepts present in genetic algorithms like population, mutation and generation. This heuristic exhibits good performance in comparison with genetic algorithms, and can be used to generate useful solutions to optimization and search problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications
