Training neural networks is a complex task that is important for supervised learning. A few metaheuristic optimization techniques have been applied to increase the effectiveness of the training process. The Cuckoo Search (CS) algorithm is a recently developed meta-heuristic optimization algorithm which is suitable for solving optimization problems. In this paper, Cuckoo search is implemented in...

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

In this paper, Hybridization of Cuckoo Search algorithm with Powell Search (HCSPS) is used to solve optimal reactive power problem. Cuckoo search (CS) has been recently projected as a population-based optimization algorithm and it is has so far been efficaciously applied in a variety of fields. The inertia weight of Levy flights is presented to balance the capability of global and local search....

The standard cuckoo search algorithm is of low accuracy and easy to fall into local optimal value in the later evolution. In this paper, an improved cuckoo algorithm is proposed. Dynamic change of parameter of probability is introduced to improve the convergence speed. Complex method is quoted to improve the capabilities of local search algorithm. A non-fixed multi-segment mapping penalty funct...

In this paper, Optimization is considered as the main impact of insight problem and heuristic methods. A proposed method is represented by using two optimization algorithms; cuckoo optimization; is heuristic method and Genetic algorithm; is meta-heuristic method in order to increase the optimization level and speed of calculation as possible. The proposed methodology and technique still a subje...

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

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

To handle scheduling of tasks on heterogeneous systems, an algorithm is proposed to reduce execution time while allowing for maximum parallelization. The algorithm is based on multi-objective scheduling cuckoo optimization algorithm (MOSCOA). In this algorithm, each cuckoo represents a scheduling solution in which the ordering of tasks and processors allocated to them are considered. In additio...

Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algori...

Constrained Nonlinear programming problems are hard problems, and one of the most widely used and common problems for production planning problem to optimize. In this study, one of the mathematical models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is efficient method to solve continues non linear problem. Moreover, mentioned models of productio...