Kocer, Baris2020-03-262020-03-2620171582-74451844-7600https://dx.doi.org/10.4316/AECE.2017.03011https://hdl.handle.net/20.500.12395/35436ABC is a well-known nature inspired algorithm. In short ABC algorithm mimics the foraging behavior of the bee colonies. ABC is very intensively worked algorithm. It has many variants. The base algorithm and most of the variants uses an update equation to improve the solutions. The update equation finds a feasible movement based on neighbor solutions and adds that movement to current to create a mutant solution. If the mutant solution is better than the original one then original solution is updated. None of the ABC variant use a successful movement again. In this work when a successful move found then it is used again. Proposed approach is applied to ABCVSS algorithm which is a recently proposed ABC variant and that modified ABCVSS algorithm (ABCVSSRSM) is tested on numerical benchmark functions and results compared the well-known ABC variants. Results show that proposed method is superior under multiple criteria.en10.4316/AECE.2017.03011info:eu-repo/semantics/openAccessartificial intelligencemachine learningevolutionary computationparticle swarm optimizationmachine intelligenceArticle1738594Q3WOS:000410369500011Q4