cuckoo optimization algorithm(coa)

Permanent magnet synchronous generators (PMSG) have a huge potential for direct-drive wind power applications. Therefore, optimal design of these generators is necessary to maximize their efficiency and to reduce their manufacturing cost and total volume. In this paper, an optimal design of a six-phase 3.5 KW direct-drive PMSG to generate electricity for domestic needs is performed. The aim of optimal design is to reduce the manufacturing cost, losses and total volume of PMSG. To find the best design, single/multi-objective design optimization is carried out. Cuckoo optimization algorithm (COA) is adopted to solve the optimization problem. Comparison between the results of the single-objective and multi-objective models shows that simultaneous optimization of manufacturing cost, losses and total volume leads to more suitable design for PMSG. Finally, finite-element method (FEM) is employed to validate the optimal design, which show a good agreement between the theoretical work and simulation results.

A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages such as fast convergence rate, intelligent operators and simultaneous local and global search which are the motivations behind choosing this algorithm. In the Extended Cuckoo Algorithm, we have enhanced the operators in the classical version of the Cuckoo algorithm. The proposed operator of production of the initial population is based on a Chaos trail whereas in the classical version, it is based on randomized trail. Moreover, allocating the number of eggs to each cuckoo in the revised algorithm is done based on its fitness. Another improvement is in cuckoos’ migration which is performed with different deviation degrees. The proposed method is evaluated on several standard data sets at UCI database and its performance is compared with those of Black Hole (BH), Big Bang Big Crunch (BBBC), Cuckoo Search Algorithm (CSA), traditional Cuckoo Optimization Algorithm (COA) and K-means algorithm. The results obtained are compared in terms of purity degree, coefficient of variance, convergence rate and time complexity. The simulation results show that the proposed algorithm is capable of yielding the optimized solution with higher purity degree, faster convergence rate and stability in comparison to the other compared algorithms.