We have collection of more than 1 Million open source products ranging from Enterprise product to
small libraries in all platforms. We aggregate information from all open source repositories.
Search and find the best for your needs. Check out projects section.
In these tutorials, we will demonstrate and visualize algorithms like Genetic Algorithm, Evolution Strategy, NEAT etc. All methods mentioned below have their video and text tutorial in Chinese. Visit 莫烦 Python for more.
This project is about minimizing costs in garbage collection in Montevideo (city and state), Uruguay, using Evolutionary Algorithms techniques. This was presented as a project in 2014 in the course Algoritmos Evolutivos (Evolutionary Algorithms) of the Facultad de Ingeniería (Faculty of Engineering), Universidad de la República (University of the Republic). Is based in real and open data (as of 2014), but also makes some assumptions. Read this file for information. For more information take a look at the final report or see the initial proposal, which are both in Spanish. The authors are Santiago Castro and Matías Mansilla, and the supervisor is Sergio Nesmachnow. The code is written in C++ and uses Malva framework.
NOTE: The ecr package v2 is the official follow-up package to my package ecr v1. I was unsatisfied with some design choices and thus decided to restructure and rewrite a lot. Changes are that manifold and fundamental, that I decided to set up a new repository, since most of the ecr v1 functions are either deprecated, renamed, deleted or underlie substantial interface changes. We decide to use an evolutionary (30 + 5)-strategy, i.e., an algorithm that keeps a population of size mu = 30, in each generation creates lambda = 5 offspring by variation and selects the best mu out of mu + lambda individuals to survive. First, we define some variables.
If you would like to fund future work then donations are welcome via Open Collective or Patreon. NEAT is NeuroEvolution of Augmenting Topologies; an evolutionary algorithm devised by Kenneth O. Stanley.
Goga is a computer library for developing evolutionary algorithms based on the differential evolution and/or genetic algorithm concepts. The goal of these algorithms is to solve optimisation problems with (or not) many constraints and many objectives. Also, problems with mixed-type representations with real numbers and integers are considered by Goga. See the documentation for more details (e.g. how to call functions and use structures).