15,256 research outputs found

    A Brief Review of Cuckoo Search Algorithm (CSA) Research Progression from 2010 to 2013

    Get PDF
    Cuckoo Search Algorithm is a new swarm intelligence algorithm which based on breeding behavior of the Cuckoo bird. This paper gives a brief insight of the advancement of the Cuckoo Search Algorithm from 2010 to 2013. The first half of this paper presents the publication trend of Cuckoo Search Algorithm. The remaining of this paper briefly explains the contribution of the individual publication related to Cuckoo Search Algorithm. It is believed that this paper will greatly benefit the reader who needs a bird-eyes view of the Cuckoo Search Algorithm’s publications trend

    Cuckoo Search via Levy Flights

    Full text link
    In this paper, we intend to formulate a new metaheuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Levy flight behaviour of some birds and fruit flies. We validate the proposed algorithm against test functions and then compare its performance with those of genetic algorithms and particle swarm optimization. Finally, we discuss the implication of the results and suggestion for further research

    Cuckoo Search Approach for Cutting Stock Problem

    Get PDF
    Cutting Stock Problem has been used in many industries like paper, glass, wood and etc. Cutting Stock Problem has helped industries to reduce trim loss and at the same time meets the customer’s requirement. The purpose of this paper is to develop a new approach which is Cuckoo Search Algorithm in Cutting Stock Problem. Cutting Stock Problem with Linear Programming based method has been improved down the years to the point that it reaches limitation that it cannot achieve a reasonable time in searching for solution. Therefore, many researchers have to turn to metaheuristic algorithms as a solution to the problem which also makes these algorithms become famous. Cuckoo Search Algorithm is selected because it is a new algorithm and outperforms many algorithms. Hence, this paper intends to experiment the performance of Cuckoo Search in Cutting Stock Problem

    Improved cuckoo search for loss allocation in transmission line/ Nur Atiqah Abdul Rahman

    Get PDF
    Electricity market reformation often involes the process of liberalisation, deregulation and privatisation. Privatisation has often resulted in competition between market participants in order to reduce cost and increase efficiency. Researchers have gained interest to allocate the transmission loss in transmission line which will lead to fair allocation of cost among market participants. Thus this paper proposed a new technique called Improved Cuckoo Search (ICS) as an approach to allocate transmission loss in transmission line. This technique is an improvement from previous technique called Cuckoo Search (CS), where cauchy distribution based on mutation technique is used instead of Levy Flight for its searching operator. The technique has been tested with IEEE 30 bus system in normal condition and showed improvement in terms of computational time and accuracy. Comparison between Cuckoo Search (CS) and Genetic Algorithm (GA) are also presented in this paper

    Path Planning and Energy Efficiency of Heterogeneous Mobile Robots Using Cuckoo–Beetle Swarm Search Algorithms with Applications in UGV Obstacle Avoidance

    Get PDF
    In this paper, a new meta-heuristic path planning algorithm, the cuckoo–beetle swarm search (CBSS) algorithm, is introduced to solve the path planning problems of heterogeneous mobile robots. Traditional meta-heuristic algorithms, e.g., genetic algorithms (GA), particle swarm search (PSO), beetle swarm optimization (BSO), and cuckoo search (CS), have problems such as the tenancy to become trapped in local minima because of premature convergence and a weakness in global search capability in path planning. Note that the CBSS algorithm imitates the biological habits of cuckoo and beetle herds and thus has good robustness and global optimization ability. In addition, computer simulations verify the accuracy, search speed, energy efficiency and stability of the CBSS algorithm. The results of the real-world experiment prove that the proposed CBSS algorithm is much better than its counterparts. Finally, the CBSS algorithm is applied to 2D path planning and 3D path planning in heterogeneous mobile robots. In contrast to its counterparts, the CBSS algorithm is guaranteed to find the shortest global optimal path in different sizes and types of maps

    Cuckoo Search Algorithm for Congestion Alleviation with Incorporation of Wind Farm

    Get PDF
    The issue to alleviate congestion in the power system framework has emerged as an alluring field for the power system researchers. The research conducted in this article proposes a cuckoo search algorithm based congestion alleviation strategy with the incorporation of wind farm. The bus sensitivity factor data are computed and utilized to sort out the sutiable position for the installation of the wind farm. The generators contributing in the real power rescheduleing process are selected as per the generator sensitivity values. The cuckoo search algorithm is implemented to minimize the congestion cost with the embodiment of the wind farm.The proposed method is tested on 39 bus New England framework and the results obtained with the cuckoo search based congestion management approach outperforms the results opted with other heuristic optimization techniques in the past research literatures

    Diagnosis of Faulty Elements in Array Antenna using Nature Inspired Cuckoo Search Algorithm

    Get PDF
    Detection and correction of faulty elements in a linear array have great importance in radar, sonar, mobile communications and satellite. Due to single element failure, the whole radiation pattern damage in terms of side lobes level and nulls. Once we have detect the position of defective element, then correction method is applied to achieve the desired pattern. In this work, we introduce a nature inspired meta-heuristic cuckoo search algorithm to diagnose the position of defective elements in a linear array. The nature inspired cuckoo search algorithm is new to the optimization family and is used first time for fault detection in an array antenna. Cuckoo search algorithm is a global search optimization technique. The cost function is used as a fitness function which defines an error between the degraded far field power pattern and the estimated one. The proposed technique is used effectively for the diagnosis of complete, as well as, for partial faulty elements position. Different simulation results are evaluated for 40 elements Taylor pattern to validate and check the performance of the proposed technique

    Comparison of new metaheuristics, for the solution of an integrated jobs-maintenance scheduling problem

    Get PDF
    This paper presents and compares new metaheuristics to solve an integrated jobs-maintenance scheduling problem, on a single machine subjected to aging and failures. The problem, introduced by Zammori et al. (2014), was originally solved using the Modified Harmony Search (MHS) metaheuristic. However, an extensive numerical analysis brought to light some structural limits of the MHS, as the analysis revealed that the MHS is outperformed by the simpler Simulated Annealing by Ishibuchi et al. (1995). Aiming to solve the problem in a more effective way, we integrated the MHS with local minima escaping procedures and we also developed a new Cuckoo Search metaheuristic, based on an innovative Levy Flight. A thorough comparison confirmed the superiority of the newly developed Cuckoo Search, which is capable to find better solutions in a smaller amount of time. This an important result, both for academics and practitioners, since the integrated job-maintenance scheduling problem has a high operational relevance, but it is known to be extremely hard to be solved, especially in a reasonable amount of time. Also, the developed Cuckoo Search has been designed in an extremely flexible way and it can be easily readapted and applied to a wide range of combinatorial problems. (C) 2018 Elsevier Ltd. All rights reserved
    • …
    corecore