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 ...

optimization of cutting conditions is a non-linear optimization with constraint and it is very important to the increase of productivity and the reduction of costs. in recent years, several evolutionary and meta-heuristic optimization algorithms were introduced. the cuckoo optimization algorithm (coa) is one of several recent and powerful meta-heuristics which is inspired by the cuckoos and the...

this paper presents a cuckoo optimization algorithm (coa) model for the cost optimization of the one-way and two-way reinforced concrete (rc) slabs according to aci code. the objective function is the total cost of the slabs including the cost of the concrete and that of the reinforcing steel. in this paper, one-way and two-way slabs with various end conditions are formulated as aci code. the t...

In this paper a new evolutionary algorithm, for continuous nonlinear optimization problems, is surveyed. This method is inspired by the life of a bird, called Cuckoo. The Cuckoo Optimization Algorithm (COA) is evaluated by using the Rastrigin function. The problem is a non-linear continuous function which is used for evaluating optimization algorithms. The efficiency of the COA has been studied...

This paper presents a Cuckoo Optimization Algorithm (COA) model for the cost optimization of the one-way and two-way reinforced concrete (RC) slabs according to ACI code. The objective function is the total cost of the slabs including the cost of the concrete and that of the reinforcing steel. In this paper, One-way and two-way slabs with various end conditions are formulated as ACI code. The t...

In this paper a new efficient approach to solving the balanced connected partitioning is presented. The graph partitioning problem has been used in many areas of computer science like LSI design; electrical power networks (EPNs) and ect. The problem aims to obtaining sub graphs of a graph which include balance connected vertices. The proposed solution is based on Cuckoo Optimization Algorithm (...

Cuckoo optimization Algorithm (COA) is employed for the optimization of linear and nonuniform circular antenna arrays. COA is a novel nature inspired computing algorithm which is motivated by the life of Cuckoo. Like other nature-inspired algorithms, COA is also a population-based method and uses a population of solutions to proceed to the global solution. The method of COA is used to determine...

the cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. to enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. normally, the parametersof the cuckoo search are kept constant. this may lead todecreasing the efficiency of the algorithm. to cop...

Cuckoo Optimization Algorithm (COA) and Cuckoo Search Algorithm (CS) are two population-based metaheuristics. They are based on the cuckoo’s behavior in their lifestyle and their characteristics in egg laying and breeding. Both algorithms are proposed for continuous optimization problems. In this paper, we propose a comparative study of COA and CS. For this we have proposed a binary version of ...

The Cuckoo optimization algorithm (COA) is developed for solving single-objective problems and it cannot be used for solving multi-objective problems. So the multi-objective cuckoo optimization algorithm based on data envelopment analysis (DEA) is developed in this paper and it can gain the efficient Pareto frontiers. This algorithm is presented by the CCR model of DEA and the output-oriented a...