Chaotic crow search algorithm for fractional optimization problems

Abstract

This paper presents a chaotic crow search algorithm (CCSA) for solving fractional optimization problems (FOPs). To refine the global convergence speed and enhance the exploration/exploitation tendencies, the proposed CCSA integrates chaos theory (CT) into the CSA. CT is introduced to tune the parameters of the standard CSA, yielding four variants, with the best chaotic variant being investigated. The performance of the proposed CCSA is validated on twenty well-known fractional benchmark problems. Moreover, it is validated on a fractional economic environmental power dispatch problem by attempting to minimize the ratio of total emissions to total fuel cost. Finally, the proposed CCSA is compared with the standard CSA, particle swarm optimization (PSO), firefly algorithm (FFA), dragonfly algorithm (DA) and grey wolf algorithm (GWA). Additionally, the efficiency of the proposed CCSA is justified using the non parametric Wilcoxon signed-rank test. The experimental results prove that the proposed CCSA outperforms other algorithms in terms of quality and reliability.