Cuckoo Search via Lévy Flights and a Comparison with Genetic Algorithms

2014 ◽  
pp. 91-103 ◽  
Author(s):  
Maribel Guerrero ◽  
Oscar Castillo ◽  
Mario García
Keyword(s):  
Genetic Algorithms ◽  
Cuckoo Search ◽  
Lévy Flights ◽  
Levy Flights

scholarly journals Cuckoo search via Lévy flights for the capacitated vehicle routing problem

2017 ◽  
Vol 14 (2) ◽  
pp. 293-304 ◽  
Author(s):  
Jon Henly Santillan ◽  
Samantha Tapucar ◽  
Cinmayii Manliguez ◽  
Vicente Calag
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Cuckoo Search ◽  
Lévy Flights ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Levy Flights ◽  
Capacitated Vehicle

Inter-species Cuckoo Search via Different Levy Flights

2013 ◽  
pp. 515-526 ◽  
Author(s):  
Swagatam Das ◽  
Preetam Dasgupta ◽  
Bijaya Ketan Panigrahi
Keyword(s):  
Cuckoo Search ◽  
Lévy Flights ◽  
Levy Flights

scholarly journals Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Ozgur Baskan
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Search Algorithm ◽  
Road Networks ◽  
Cuckoo Search ◽  
User Equilibrium ◽  
Network Design Problem ◽  
Lévy Flights ◽  
Link Capacity ◽  
Levy Flights

During the last two decades, Continuous Network Design Problem (CNDP) has received much more attention because of increasing trend of traffic congestion in road networks. In the CNDP, the problem is to find optimal link capacity expansions by minimizing the sum of total travel time and investment cost of capacity expansions in a road network. Considering both increasing traffic congestion and limited budgets of local authorities, the CNDP deserves to receive more attention in order to use available budget economically and to mitigate traffic congestion. The CNDP can generally be formulated as bilevel programming model in which the upper level deals with finding optimal link capacity expansions, whereas at the lower level, User Equilibrium (UE) link flows are determined by Wardrop’s first principle. In this paper, cuckoo search (CS) algorithm with Lévy flights is introduced for finding optimal link capacity expansions because of its recent successful applications in solving such complex problems. CS is applied to the 16-link and Sioux Falls networks and compared with available methods in the literature. Results show the potential of CS for finding optimal or near optimal link capacity expansions in a given road network.

scholarly journals Cuckoo Search Algorithm with Lévy Flights for Global-Support Parametric Surface Approximation in Reverse Engineering

Symmetry ◽  
2018 ◽  
Vol 10 (3) ◽  
pp. 58 ◽  
Author(s):  
Andrés Iglesias ◽  
Akemi Gálvez ◽  
Patricia Suárez ◽  
Mikio Shinya ◽  
Norimasa Yoshida ◽  
...  
Keyword(s):  
Reverse Engineering ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Parametric Surface ◽  
Lévy Flights ◽  
Surface Approximation ◽  
Levy Flights

Improving Cuckoo Search Algorithm With Mittag-Leffler Distribution

2019 ◽  
Author(s):  
Jiamin Wei ◽  
YangQuan Chen ◽  
Yongguang Yu ◽  
Yuquan Chen
Keyword(s):  
Search Algorithm ◽  
Cuckoo Search ◽  
Search Space ◽  
Cuckoo Search Algorithm ◽  
Lévy Flights ◽  
Lévy Distribution ◽  
Levy Flights ◽  
Levy Distribution ◽  
Heavy Tailed ◽  
The Impact

Abstract Cuckoo search (CS), as one of the recent nature-inspired metaheuristic algorithms, has proved to be an efficient approach due to the combination of Lévy flights, local search capabilities and guaranteed global convergence. CS uses Lévy flights in global random walk to explore the search space. The Lévy step is taken from the Lévy distribution which is a heavy-tailed probability distribution. In this case, a fraction of large steps are generated, which plays an important role in enhancing search capability of CS. Besides, although many foragers and wandering animals have been shown to follow a Lévy distribution of steps, investigation into the impact of other different heavy-tailed probability distributions on CS is still insufficient up to now. Based on the above considerations, we are motivated to apply the well-known Mittag-Leffler distribution to the standard CS algorithm, and proposed an improved cuckoo search algorithm (CSML) in this paper, where a more efficient search is supposed to take place in the search space thanks to the long jumps. In order to verify the performance of CSML, experiments are carried out on a test suite of 20 benchmark functions. In terms of the observations and results analysis, CSML can be regarded as a new potentially promising algorithm for solving optimization problems.

scholarly journals Cuckoo search via Levy flights applied to uncapacitated facility location problem

2017 ◽  
Vol 14 (3) ◽  
pp. 585-592 ◽  
Author(s):  
Armacheska Mesa ◽  
Kris Castromayor ◽  
Cinmayii Garillos-Manliguez ◽  
Vicente Calag
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Cuckoo Search ◽  
Lévy Flights ◽  
Uncapacitated Facility Location Problem ◽  
Levy Flights
Sign in / Sign up

Export Citation Format

Share Document