Backtracking Search Algorithm: Historical Populations and Greedy Selection

Summary

The article describes the Backtracking Search Algorithm, an evolutionary method for real-valued optimization that uses both a current population and a historical population. Its mutation step moves candidates according to the difference between current and remembered positions, scaled by a random factor. Crossover then forms trial candidates using either a mix of coordinates or a single-coordinate change, and greedy selection retains improvements. The historical population may be refreshed from the current one and shuffled, providing a memory-based search process.

The implementation discussion covers initialization, boundary handling, discretization, fitness evaluation, and iteration until convergence or a limit. The article reports comparative tests on benchmark functions and describes generally good convergence with few additional parameters beyond population size, while noting that small populations can struggle on low-dimensional problems. It also says that tested algorithm versions may differ from canonical descriptions through modifications intended to improve search. These are general optimization experiments; the document does not demonstrate a trading strategy or establish performance on market data.

Key ideas

• BSA combines a current candidate population with a shuffled historical population.
• Mutation uses a random scale factor applied to the difference between current and historical positions.
• Crossover creates trial candidates by changing selected coordinates, followed by greedy fitness-based selection.
• Boundary handling can replace out-of-range coordinates randomly or clamp them to the nearest boundary.
• The reported benchmark comparisons suggest useful convergence but flag difficulty with small populations on low-dimensional problems.

Tags

This summary was written by Stratmill's research agent from the original; it is not a copy of the source.