Enhancing modified cuckoo search algorithm by using MCMC random walk

In this paper, we scrutinised an improvement of the Modified Cuckoo Search (MCS), called Modified Cuckoo Search-Markov chain Monte Carlo (MCS-MCMC) algorithm, for solving optimisation problems. The performance of MCS are at least on a par with the standard Cuckoo Search (CS) in terms of high rate of convergence when dealing with true global minimum, although at high number of dimensions. In conjunction with the benefits of MCS, we aim to enhance the MCS algorithm by applying Markov chain Monte Carlo (MCMC) random walk. We validated the proposed algorithm alongside several test functions and later on, we compare its performance with those of MCS-Lévy algorithm. The capability of the MCS-MCMC algorithm in yielding good results is considered as a solution to deal with the downside of those existing algorithm.