Billiards Optimization Algorithm: Search Mechanics and Benchmark Trade-offs

Summary

This article presents the Billiards Optimization Algorithm, a population-based method for numerical optimization inspired by balls moving toward pool pockets. It begins with candidate solutions, treats the best candidates as targets, and updates each agent toward a randomly selected target. A random factor determines whether movement is more conservative or can overshoot, offering a simple way to mix local refinement with broader exploration. Candidates are retained when their objective values improve, and the best solutions are used as targets in later iterations.

The article describes an MQL5 implementation and reports comparisons on benchmark functions, noting that performance depends on the problem. It lists good results on small and medium tasks and functions with sharp extrema, but says the method can stagnate on some low-dimensional problems and converges slowly or inaccurately on smooth, high-dimensional ones. It also warns that the implementation may differ from canonical algorithm descriptions and that conclusions come from experiments. BOA is an optimization technique, not a trading strategy, so the benchmarks do not demonstrate trading profitability.

Key ideas

• BOA represents candidate solutions as moving agents and selects leading candidates as targets.
• Each agent moves toward a randomly chosen target with a random multiplier that can encourage refinement or exploration.
• Improved candidates are retained, and top candidates guide subsequent iterations.
• The article reports stronger performance on some small or sharply peaked problems than on smooth, high-dimensional ones.
• The method is a general optimization algorithm, and benchmark results do not establish trading performance.

Tags

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