مشخصات پژوهش

Abstract. In recent years, the Cuckoo Optimization Algorithm (COA) has been widely used to solve various optimization problems due to its simplicity, efficacy, and capability to avoid getting trapped in local optima. However, COA has some limitations such as low convergence when it comes to solving constrained optimization problems with many constraints. This study proposes a new modified and adapted version of the Cuckoo optimization algorithm, referred to as MCOA, that overcomes the challenge of solving constrained optimization problems. The proposed adapted version introduces a new coefficient that reduces the egg-laying radius, thereby enabling faster convergence to the optimal solution. Unlike previous methods, the new coefficient does not require any adjustment during the iterative process, as the radius automatically decreases along the iterations. To handle constraints, we employ the Penalty Method, which allows us to incorporate constraints into the optimization problem without altering its formulation. To evaluate the performance of the proposed MCOA, we conduct experiments on five well-known case studies. Experimental results demonstrate that MCOA outperforms COA and other state-of-the-art optimization algorithms in terms of both efficiency and robustness. Furthermore, MCOA can reliably find the global optimal solution for all the tested problems within a reasonable iteration number.