Regarding the behavior of bison runners within the Bison algorithm

Abstract

This paper proposes a modification of the Bison Algorithm’s running technique, which allows the running group to exploit the areas of discovered promising solutions. It also provides a closer examination of the successful running behavior and its impact on the overall optimization process. The new algorithm is then compared to other optimization algorithms on the IEEE CEC 2017 benchmark solving continuous minimization problems. © 2018, Brno University of Technology. All rights reserved.