Cuckoo Search: A Brief Literature Review

Fister, Iztok; Yang, Xin‐She; Fister, Dušan

doi:10.1007/978-3-319-02141-6_3

Cited by 115 publications

(53 citation statements)

References 86 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As a robust and computationally efficient algorithm, ODCDM has been adopted by state-of-the-art industrial products and has been applied in real distribution networks [6,13,14]. Cuckoo Search is one of the most advanced meta-heuristic algorithms, and it has been successfully applied in almost every area and domain of optimization problems [15]. Previous research demonstrated that CS outperforms some popular meta-heuristic algorithms, such as GA and Particle Swarm Optimization (PSO) in different areas [16].…”

Section: Algorithm Selection and Implementationmentioning

confidence: 99%

“…There is a chance that some generated solutions are far enough from the current best solution, which can make sure the system will not be trapped in a local optimum. The original CS algorithm was developed to solve the optimization problems with continuous variables only, and it can be revised to solve combinatorial problems and mixed integer optimization problems [15]. Basically, the progress for continuous variables is kept the same, and for discrete variables, the step size is rounded off before being used to generate the new values for the discrete variables.…”

Section: Cuckoo Search Via Lévy Flightsmentioning

confidence: 99%

See 1 more Smart Citation

Evaluation of Voltage Control Approaches for Future Smart Distribution Networks

Wang¹,

Zangiabadi

et al. 2017

Energies

View full text Add to dashboard Cite

show abstract

Section: Algorithm Selection and Implementationmentioning

confidence: 99%

Section: Cuckoo Search Via Lévy Flightsmentioning

confidence: 99%

Evaluation of Voltage Control Approaches for Future Smart Distribution Networks

Wang¹,

Zangiabadi

et al. 2017

Energies

View full text Add to dashboard Cite

show abstract

“…For example, if a host bird discovers the eggs which are not their own, it will either throw these alien eggs away or simply abandon its nest and build a new nest elsewhere. Some cuckoo species such as the New World broodparasitic Tapera have evolved in such a way that female parasitic cuckoos are often very specialized in the mimicry in colors and pattern of the eggs of a few chosen host species [14].…”

Section: Particle Swarm Optimizationmentioning

confidence: 99%

Hybridization of soft computing techniques for flow shop scheduling problem

2016

IJLTET

View full text Add to dashboard Cite

--Since the last two decades, metaheuristic algorithms were developed in almost every aspect of various problems, where computational intelligence is used. In the field of computer science and operation research, PSO is used which is an optimization algorithm inspired by the social behaviour of birds flocking and fishes shoaling with its group. The original PSO was used to solve continuous optimization problems. Crossover and mutation of the particle is modified due to the discrete solution spaces of scheduling the optimization problems. Cuckoo search idealized such as breeding behaviour can be applied for optimization problems and it is successfully applied to various paths mostly continuous optimization problems. Swarm intelligence systems are typically made up of a population of simple agents or boids interacting locally with one another and with their environment. The job scheduling problem is used for assigning the Flexible job shops in a way that will optimize the overall performance of the application, while assuring the correctness of the result. PSO and CS algorithm is proposed in this paper, for solving the Flexible job shop scheduling problem with an intention to decrease the maximum completion time. This paper has modifications to the PSO algorithm, which is based on Genetic Algorithm (GA) of crossover and mutation operators. Such modifications applied to the creation of new candidate solutions to improve the performance of the algorithm. Thus the use of the advantages of particle swarm optimization (PSO) and cuckoo search (CS) algorithm, a hybrid optimization algorithm of PSO and CS is proposed to solve the Flexible job shop scheduling problem. This paper shows that the proposed algorithm exhibits more outstanding performance than PSO-GA.

show abstract

“…Some applications of metaheuristic algorithms include neural networks, data mining, industrial, mechanical, electrical, and software engineering, as well as certain problems from location theory [14][15][16][17][18][19][20][21]. The most interesting and most widely used metaheuristic algorithms are swarm-intelligence algorithms which are based on a collective intelligence of colonies of ants, termites, bees, flock of birds, and so forth [22].…”

Section: Introductionmentioning

confidence: 99%

Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs

Stojanović

Brajević

Stanimirović

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The continuous planar facility location problem with the connected region of feasible solutions bounded by arcs is a particular case of the constrained Weber problem. This problem is a continuous optimization problem which has a nonconvex feasible set of constraints. This paper suggests appropriate modifications of four metaheuristic algorithms which are defined with the aim of solving this type of nonconvex optimization problems. Also, a comparison of these algorithms to each other as well as to the heuristic algorithm is presented. The artificial bee colony algorithm, firefly algorithm, and their recently proposed improved versions for constrained optimization are appropriately modified and applied to the case study. The heuristic algorithm based on modified Weiszfeld procedure is also implemented for the purpose of comparison with the metaheuristic approaches. Obtained numerical results show that metaheuristic algorithms can be successfully applied to solve the instances of this problem of up to 500 constraints. Among these four algorithms, the improved version of artificial bee algorithm is the most efficient with respect to the quality of the solution, robustness, and the computational efficiency.

show abstract

Cuckoo Search: A Brief Literature Review

Cited by 115 publications

References 86 publications

Evaluation of Voltage Control Approaches for Future Smart Distribution Networks

Evaluation of Voltage Control Approaches for Future Smart Distribution Networks

Hybridization of soft computing techniques for flow shop scheduling problem

Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs

Contact Info

Product

Resources

About