Black Hole Algorithm for Population-Based Optimization

Summary

The document explains the Black Hole Algorithm (BHA), a population-based method for optimizing continuous or discrete search problems. It initializes candidate solutions as randomly placed stars, selects the current best candidate as the black hole, and moves the other candidates toward it by a random fraction of their distance. An event-horizon rule replaces candidates that enter a radius based on the best fitness and total population fitness with new random candidates, maintaining some exploration of the search space.

The article outlines an implementation that respects coordinate bounds and discretization steps, and describes how the algorithm tracks its best solution. It reports a test score of 50 for the presented variant and summarizes comparative test results, but the excerpt does not provide enough detail to assess the test functions, settings, or statistical reliability. The method is presented as simple, fast, and requiring only population size as an external parameter. The author also cautions that results can vary widely on low-dimensional problems and that the method may become trapped there; the implementation may differ from the canonical algorithm.

Key ideas

• BHA represents candidate solutions as stars and the best current candidate as a black hole.
• Other candidates move toward the black hole by a random fraction of their distance.
• Candidates inside the event horizon are replaced with random solutions to encourage renewed exploration.
• The implementation supports bounded and discretized search coordinates.
• The article reports weaker reliability on low-dimensional problems and notes that its variant may differ from the canonical method.

Tags

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