Performance Comparison of Two Modified Krill Herd Algorithms

Abstract

The krill herd algorithm is one of the heuristic search methods to find globally optimal solutions inspired by nature. This paper presents a comparison between the Chaotic Krill Herd (CKH) algorithm and Chaotic Particle-swarm Krill Herd (CPKH) algorithm as modifications of the Krill Herd algorithm. Performance measures of the three algorithms can be seen from the results obtained from the results of tests carried out on 14 benchmark functions. The best algorithm is the one that produces the minimum value for each benchmark function. The result of the performance of the CPKH Algorithm is that it has succeeded in obtaining the minimum point on thirteen benchmark functions. The results of the performance of the CKH Algorithm managed to get the minimum value on eleven benchmark functions. The results of the performance of the KH Algorithm managed to reach the minimum point on two benchmark functions. Based on these results, it can be concluded that the Chaotic Particle-swarm Krill Herd (CPKH) algorithm is more efficient than the Chaotic Krill Herd (CKH) and Krill Herd (KH) algorithms for finding the minimum point of the function.