The stochastic simplex bisection (SSB) algorithm is evaluated against particle swarm optimization (PSO) on a prominent test set. The original SSB algorithm performs on par with the PSO algorithm and a revised version of the SSB algorithm outperforms both of them. Detailed analysis of the performance on select objective functions brings to light key properties of the three algorithms. The core SSB algorithm is here viewed as a sampling tool for an outer loop that employs statistical pattern recognition. This opens the door for a host of other schemes.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.