| 📰 Title: | Evolving Objects | 🕹️ / 🛠️ Type: | Tool |
|---|---|---|---|
| 🗃️ Genre: | Development | 🚦 Status: | 04. Released (status) |
| 🏷️ Category: | Development ➤ Framework & Tool ➤ Misc. | 🌍️ Browser version: | |
| 🔖 Tags: | Development; Framework; C/C++; Multi-platform | 📦️ Package Name: | |
| 🐣️ Approx. start: | 📦️ Arch package: | ||
| 🐓️ Latest: | 2012-02-10 | 📦️ RPM package: | |
| 📍️ Version: | Latest: 1.3.1 / Dev: 7e4bc9 | 📦️ Deb package: | |
| 🏛️ License type: | 🕊️ Libre | 📦️ Flatpak package: | |
| 🏛️ License: | LGPL-3 | 📦️ AppImage package: | |
| 🏝️ Perspective: | Third person | 📦️ Snap package: | |
| 👁️ Visual: | Text | ⚙️ Generic binary: | |
| ⏱️ Pacing: | Real Time | 📄️ Source: |  |
| 👫️ Played: | Single & Multi | 📱️ PDA support: | |
| 🎖️ This record: |  |
🕳️ Not used: | |
| 🎀️ Game design: | 👫️ Contrib.: | goupildb & Louis | |
| 🎰️ ID: | 14213 | 🐛️ Created: | 2014-03-08 |
| 🐜️ Updated: | 2021-11-14 |
| [en]: | An evolutionary computation library which helps you to write your own stochastic optimization algorithms insanely fast | [fr]: | Une bibliothèque de calcul évolutionniste permettant de concevoir des algorithmes d'optimisation stochastique |
|---|
🏡️ Website & videos
[Homepage] [Dev site 1 2] [Features/About] [Screenshots] [Videos t(202xxx) gd(202xxx) gu(202xxx) r(202xxx) lp(202xxx) g(202xxx) g[fr](202xxx) g[de](202xxx) g[ru](202xxx) g[pl](202xxx) g[cz](202xxx) g[sp](202xxx) g[pt](202xxx) g[it](202xxx) g[tr](202xxx)] [WIKI 1 2] [FAQ] [RSS] [Changelog 1 2 3]
💰 Commercial: (empty)
🍩️ Resources
• (empty, license): [Homepage] [Dev site] 🎬️ g(202xxx)
🛠️ Technical informations
[Open Hub] [PCGamingWiki] [MobyGames]
🦣️ Social
Devs (Evolving Objects Team [fr] [en]): [Site 1 2] [Chat] [mastodon] [PeerTube] [YouTube] [PressKit] [Interview 1(202xxx) 2(202xxx)]
The Project: [Blog] [Chat] [Forums] [mastodon] [PeerTube] [YouTube] [PressKit] [reddit] [Discord]
🐝️ Related
[Wikipedia (Evolutionary algorithm) [fr] [en]]
[Wikipedia (Stochastique / Stochastic) [fr] [en]]
📦️ Misc. repositories
[Repology] [pkgs.org] [Generic binary] [Arch Linux / AUR] [openSUSE] [Debian/Ubuntu] [Flatpak] [AppImage(author's repo)] [Snap] [PortableLinuxGames]
🕵️ Reviews
[HowLongToBeat] [metacritic] [OpenCritic] [iGDB]
🕊️ Source of this Entry: [Site (date)]
🦣️ Social Networking Update (on mastodon)
🛠️ Title:
🦊️ What's:
🏡️
🐣️
🔖
📦️
📖 Our entry: https://www.lebottindesjeuxlinux.tuxfamily.org/en/online/lights-on/
🥁️ Update:
⚗️
📌️ Changes:
🦣️ From: 📶️
🏝️ https://www.youtube.com/embed/
🦉️ https://www.youtube.com/embed/
🦝️ https://www.youtube.com/embed/
🦝️ https://www.youtube.com/embed/
🕵️ https://www.youtube.com/embed/
🕯️ https://www.youtube.com/embed/
🕯️ https://www.youtube.com/embed/
🎲️ https://www.youtube.com/embed/
🎲️ https://www.youtube.com/embed/
🎲️ https://www.youtube.com/embed/
🎲️[fr] https://www.youtube.com/embed/
🎮️ https://www.youtube.com/embed/
🎮️ https://www.youtube.com/embed/
🐧 https://www.youtube.com/embed/
🐧 https://www.youtube.com/embed/
📕🐧"blabla"🐧📕
EO is a template-based, ANSI-C++ evolutionary computation library which helps you to write your own stochastic optimization algorithms insanely fast.
Evolutionary algorithms forms a family of algorithms inspired by the theory of evolution, that solve various problems. They evolve a set of solutions to a given problem, in order to produce the best results. These are stochastic algorithms, because they iteratively use random processes. The vast majority of these methods are used to solve optimization problems, and may be also called "metaheuristics". They are also ranked among computational intelligence methods, a domain close to artificial intelligence.
With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems, from continuous to combinatorial ones.
Introduction
EO is a template-based, ANSI-C++ evolutionary computation library which helps you to write your own stochastic optimization algorithms insanely fast.
It contains classes for almost any kind of evolutionary computation you might come up to - at least for the ones we could think of. It is component-based, so that if you don't find the class you need in it, it is very easy to subclass existing abstract or concrete classes.
Designing an algorithm with EO consists in choosing what components you want to use for your specific needs, just as building a structure with Lego blocks.
If you have a classical problem for which available code exists (for example if you have a black-box problem with real-valued variables), you will just choose components to form an algorithm and connect it to your fitness function (which computes the quality of a given solution).
If your problem is a bit more exotic, you will have to code a class that represents how your individuals (a solution to your problem) are represented, and perhaps some variations operators, but most of the other operators (selection, replacement, stopping criteria, command-line interface, etc.) are already available in EO.
Overall Design
EO is a framework. It is oriented toward facilitating the design of adhoc evolutionary algorithms. It is not (at the moment) a complete library of algorithms ready to use on canonical problems.
If you have a well-known problem and want to solve it as soon as possible, try another software. If you have a real problem and want to build the best evolutionary algorithm to solve it, you've made the good choice.
Bascially, EO manipulate "individuals" with a "fitness", that is objects encoding a solution to a given optimization problem, associated with the quality of this solution. The fitness is defined in the EO class, but the representation of a solution cannot be as generic. Thus, EO massively use templates, so that you will not be limited by interfaces when using your own representation.
Once you have a representation, you will build your own evolutionary algorithm by assembling Evolutionary Operators in Algorithms. In EO, most of the objects are functors, that is classes with an operator(), that you can call just as if they were classical functions. For example, an algorithm is a functor, that manipulate a population of individuals, it will be implemented as a functor, with a member like: operator()(eoPop
Generally, operators are instanciated once and then binded in an algorithm by reference. Thus, you can easily build your own algorithm by trying several combination of operators.
Une bibliothèque de calcul évolutionniste permettant de concevoir des algorithmes d'optimisation stochastique, par la Evolving Objects Team.
En C++
Evolving Objects (EO) est une bibliothèque ANSI-C++ de calcul évolutionniste basée sur des templates, permettant de concevoir des algorithmes d'optimisation stochastique incroyablement rapide.
Les algorithmes évolutionnaires forment une famille d'algorithmes inspirés par la théorie de l'évolution, qui permettent de résoudre divers problèmes. Ils évoluent en un ensemble de solutions à un problème donné, afin de produire les meilleurs résultats. Ce sont des algorithmes stochastiques, car ils utilisent de manière itérative des processus aléatoires. La grande majorité de ces méthodes sont utilisées pour résoudre des problèmes d'optimisation, et peuvent également être appelées "métaheuristiques". Elles sont également classées parmi les méthodes de l'intelligence informatique, un domaine proche de l'intelligence artificielle.
Avec EO, vous pouvez facilement concevoir des algorithmes évolutionnaires qui trouveront des solutions à pratiquement tous les difficiles problèmes d'optimisation, des problèmes continus aux problèmes combinatoires.
Utilisé par ces jeux / Used by these games: GeneticInvasion,