The article focuses on the Nawa–Furuhashi Bacterial Evolutionary Algorithm (BEA) and its two key operators: segmental bacterial mutation for local optimization and horizontal gene transfer for the exchange of successful solution fragments. We implement BEA within the C_AO framework as a finite-state machine with a fixed evaluation budget, test it on Hilly, Forest, and Megacity, and explain the terminological distinction from the Numaoka model.
For centuries, populations of living organisms facing limited resources have been solving the same problem: finding, within the space of possible forms, those that ensure survival and preserving them. That is precisely why biology remains a rich source of metaphors for population-based algorithms: natural selection gave rise to genetic algorithms; swarm behavior — to swarm intelligence methods; and predators’ hunting behavior and flock migrations — to dozens of specific schemes that we’ve explored in this series. Today, we are turning our attention to the organisms that evolve faster than any others on the planet — and according to rules that differ significantly from the parent-offspring pattern we are familiar with. Let's talk about bacteria.
Bacterial evolution is interesting because it involves a mechanism that is almost entirely absent in higher organisms. This is horizontal gene transfer. Bacteria transfer useful DNA fragments to one another directly, bypassing reproduction: through conjugation, plasmids, and the uptake of free genes from the environment. In a single exchange, a neighboring cell can acquire a ready-made, selection-tested segment of the genome — such as an antibiotic resistance gene — and put it to use immediately. This is the secret behind the phenomenal speed of bacterial adaptation: a beneficial discovery spreads throughout the population not over generations, but almost instantly. From an optimization perspective, this idea is appealing: if a successful part of a solution can be copied directly between individuals, the search can accelerate in situations where a classical genetic algorithm would otherwise have to wait for a series of crossovers.
Allow the use of cookies to log in to the MQL5.com website.
Please enable the necessary setting in your browser, otherwise you will not be able to log in.
You are signed in. Two-factor authentication has been disabled. Set it up again and scan a new QR code, or continue with two-factor authentication disabled.
Check out the new article: Bacterial Evolutionary Algorithm (BEA).
For centuries, populations of living organisms facing limited resources have been solving the same problem: finding, within the space of possible forms, those that ensure survival and preserving them. That is precisely why biology remains a rich source of metaphors for population-based algorithms: natural selection gave rise to genetic algorithms; swarm behavior — to swarm intelligence methods; and predators’ hunting behavior and flock migrations — to dozens of specific schemes that we’ve explored in this series. Today, we are turning our attention to the organisms that evolve faster than any others on the planet — and according to rules that differ significantly from the parent-offspring pattern we are familiar with. Let's talk about bacteria.
Bacterial evolution is interesting because it involves a mechanism that is almost entirely absent in higher organisms. This is horizontal gene transfer. Bacteria transfer useful DNA fragments to one another directly, bypassing reproduction: through conjugation, plasmids, and the uptake of free genes from the environment. In a single exchange, a neighboring cell can acquire a ready-made, selection-tested segment of the genome — such as an antibiotic resistance gene — and put it to use immediately. This is the secret behind the phenomenal speed of bacterial adaptation: a beneficial discovery spreads throughout the population not over generations, but almost instantly. From an optimization perspective, this idea is appealing: if a successful part of a solution can be copied directly between individuals, the search can accelerate in situations where a classical genetic algorithm would otherwise have to wait for a series of crossovers.
Author: Andrey Dik