Computational Model Library

MGA - Minimal Genetic Algorithm (1.1.0)

Genetic algorithms try to solve a computational problem following some principles of organic evolution. This model has educational purposes; it can give us an answer to the simple arithmetic problem on how to find the highest natural number composed by a given number of digits. We approach the task using a genetic algorithm, where the candidate solutions to the problem are represented by agents, that in logo programming environment are usually known as “turtles”.

MinGA_GUI.png

Release Notes

For the purpose of demonstration, a web-app version of the model can be accessed via the following URL:
http://modelingcommons.org/browse/one_model/5742#model_tabs_browse_nlw

Associated Publications

MGA - Minimal Genetic Algorithm 1.1.0

Genetic algorithms try to solve a computational problem following some principles of organic evolution. This model has educational purposes; it can give us an answer to the simple arithmetic problem on how to find the highest natural number composed by a given number of digits. We approach the task using a genetic algorithm, where the candidate solutions to the problem are represented by agents, that in logo programming environment are usually known as “turtles”.

Release Notes

For the purpose of demonstration, a web-app version of the model can be accessed via the following URL:
http://modelingcommons.org/browse/one_model/5742#model_tabs_browse_nlw

Version Submitter First published Last modified Status
1.1.0 Cosimo Leuci Thu Jan 30 08:42:08 2020 Tue Oct 24 11:35:49 2023 Published Peer Reviewed https://doi.org/10.25937/db7w-zt41
1.0.0 Cosimo Leuci Tue Sep 3 07:52:29 2019 Mon Jan 20 05:46:29 2020 Published Peer Reviewed https://doi.org/10.25937/7kta-pf44

Discussion

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept