Discussing the article: "Differential Search Algorithm (DSA)"
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
Check out the new article: Differential Search Algorithm (DSA).
The article discusses the Differential Search Algorithm (DSA), which simulates the migration of a superorganism in search of optimal living conditions. The algorithm uses a Gamma distribution to generate a pseudo-stable random walk and offers four strategies for selecting the direction of movement, along with three coordinate mutation mechanisms. How will this method perform?
In this article, we will examine the Differential Search Algorithm — an optimization algorithm that mimics the migration of a superorganism (a swarm) in search of better conditions. DSA was proposed by Pinar Civicioglu in 2012 as an alternative to classical algorithms such as PSO (Particle Swarm Optimization) and DE (Differential Evolution). It models the behavior of a population of organisms that move within the solution space, simulating natural migration with elements of randomness and directed search. Here is one of the publications on this algorithm.
DSA simulates the migration of a superorganism (a flock or swarm) in search of better conditions. Imagine a flock of birds flying from place to place in search of food; this is a population of solutions moving through the search space. At each iteration, each individual chooses a direction — where to move (toward a random individual, toward top individuals, or toward the best individual) — and takes a step; the step size is determined by a Gamma distribution, which produces many small steps and occasional large jumps.
A step can be negative — in which case the individual moves in the opposite direction. During a partial rollback, randomly selected coordinates are restored to their previous values. This preserves good genes and allows individual parameters to be fine-tuned. The algorithm then decides whether to accept the move: if the new position is better than the old one, the individual stays there; otherwise, it returns to the previous position.
Author: Andrey Dik