Genetic Algorithms (GAs)
Genetic Algorithms (GAs) are Evolutionary Algorithms (EAs) applied to bit-string based search spaces. In other words, a GA is basically an EA specialized to search spaces ${\mathbb{X}}={0,1}^n$.
Posts
Why research in Computational Intelligence should be less nature-inspired.
The inspiration gleaned from observing nature has led to several important advances in the field of optimization. Still, it seems to me that a lot of work is mainly based on such inspiration alone. This might divert attention away from practical and algorithmic concerns. As a result, there is a growing number of specialized terminologies used in the field of Evolutionary Computation (EC) and Swarm Intelligence (SI), which I consider as a problem for clarity in research. With this article, I would like to formulate my thoughts with the hope to contribute to a fruitful debate.
Publications
- Kristian Verduin, Ruben Horn, Okke van Eck, Reitze Jansen, Thomas Weise (汤卫思), and Daan van den Berg: The Traveling Tournament Problem: Rows-First versus Columns-First. 26th International Conference on Enterprise Information Systems (ICEIS'2024), April 28-30, 2024, Angers, France, pages 447-455. Setúbal, Portugal: SciTePress.
- Kristian Verduin, Thomas Weise (汤卫思), and Daan van den Berg: Why is the Traveling Tournament Problem not Solved with Genetic Algorithms? Late-Breaking Abstracts of EvoStar'2023, April 12-14, 2023, Brno, Czech Republic.