Discussing the article: "Backtracking Search Algorithm (BSA)"

New comment
 

Check out the new article: Backtracking Search Algorithm (BSA).

What if an optimization algorithm could remember its past journeys and use that memory to find better solutions? BSA does just that – balancing exploration with revisiting the tried and true. In this article, we reveal the secrets of the algorithm. A simple idea, minimum parameters and a stable result.

In the endless labyrinth of possibilities, where every turn can lead to either triumph or a dead end, the wise traveler leaves behind invisible traces —something ephemeral, yet more reliable: the memory of the paths traveled. This idea (looking back to see the future) lies at the heart of the optimization algorithm. Every step into the unknown is taken with an eye on past experience, where history becomes a compass, and memory becomes a map.

In this article, I will consider the algorithm that I found very interesting due to its search concept. The Backtracking Search Algorithm (BSA) is a new evolutionary algorithm (EA) for solving real-valued numerical optimization problems, proposed by Pinar Civicioglu in 2013. It is a method of finding the best solution that can "learn from past experience". 


Author: Andrey Dik

New comment