scholarly journals An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Yanhong Feng ◽  
Ke Jia ◽  
Yichao He
Keyword(s):  
Optimization Problem ◽  
Feasible Solution ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Genetic Mutation ◽  
Cuckoo Search Algorithm ◽  
Knapsack Problems ◽  
Local Optimum ◽  
Transform Method ◽  
Continuous Space

Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search over a continuous space is transformed into the synchronous evolution search over discrete space. Subsequently, the concept of confidence interval (CI) is introduced; hence, the new position updating is designed and genetic mutation with a small probability is introduced. The former enables the population to move towards the global best solution rapidly in every generation, and the latter can effectively prevent the ICS from trapping into the local optimum. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Experiments with a large number of KP instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions.

scholarly journals An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Yanhong Feng ◽  
Gai-Ge Wang ◽  
Qingjiang Feng ◽  
Xiang-Jun Zhao
Keyword(s):  
Information Exchange ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Genetic Mutation ◽  
Cuckoo Search Algorithm ◽  
Shuffled Frog Leaping Algorithm ◽  
Transform Method ◽  
Shuffled Frog Leaping ◽  
Binary Differential Evolution ◽  
Comparative Results

An effective hybrid cuckoo search algorithm (CS) with improved shuffled frog-leaping algorithm (ISFLA) is put forward for solving 0-1 knapsack problem. First of all, with the framework of SFLA, an improved frog-leap operator is designed with the effect of the global optimal information on the frog leaping and information exchange between frog individuals combined with genetic mutation with a small probability. Subsequently, in order to improve the convergence speed and enhance the exploitation ability, a novel CS model is proposed with considering the specific advantages of Lévy flights and frog-leap operator. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Finally, numerical simulations are carried out on six different types of 0-1 knapsack instances, and the comparative results have shown the effectiveness of the proposed algorithm and its ability to achieve good quality solutions, which outperforms the binary cuckoo search, the binary differential evolution, and the genetic algorithm.

Solving multi-objective optimization problem using cuckoo search algorithm based on decomposition

2020 ◽  
Vol 51 (1) ◽  
pp. 143-160
Author(s):  
Liang Chen ◽  
Wenyan Gan ◽  
Hongwei Li ◽  
Kai Cheng ◽  
Darong Pan ◽  
...  
Keyword(s):  
Optimization Problem ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Multi Objective Optimization ◽  
Multi Objective

Multi-Swarm Cuckoo Search Algorithm with Q-Learning Model

2020 ◽  
Author(s):  
Juan Li ◽  
Dan-dan Xiao ◽  
Ting Zhang ◽  
Chun Liu ◽  
Yuan-xiang Li ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Size Control ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Local Optimum ◽  
Step Size ◽  
Q Learning ◽  
Fitness Value ◽  
The Individual ◽  
Evolution Effect

Abstract As a novel swarm intelligence optimization algorithm, cuckoo search (CS) has been successfully applied to solve diverse problems in the real world. Despite its efficiency and wide use, CS has some disadvantages, such as premature convergence, easy to fall into local optimum and poor balance between exploitation and exploration. In order to improve the optimization performance of the CS algorithm, a new CS extension with multi-swarms and Q-Learning namely MP-QL-CS is proposed. The step size strategy of the CS algorithm is that an individual fitness value is examined based on a one-step evolution effect of an individual instead of evaluating the step size from the multi-step evolution effect. In the MP-QL-CS algorithm, a step size control strategy is considered as action, which is used to examine the individual multi-stepping evolution effect and learn the individual optimal step size by calculating the Q function value. In this way, the MP-QL-CS algorithm can increase the adaptability of individual evolution, and a good balance between diversity and intensification can be achieved. Comparing the MP-QL-CS algorithm with various CS algorithms, variants of differential evolution (DE) and improved particle swarm optimization (PSO) algorithms, the results demonstrate that the MP-QL-CS algorithm is a competitive swarm algorithm.

Discrete Non-Integer Order Differentiator Models Using Moth-Flame Optimization Algorithm

2017 ◽  
Vol 261 ◽  
pp. 394-401 ◽  
Author(s):  
Shibendu Mahata ◽  
Suman Kumar Saha ◽  
Rajib Kar ◽  
Durbadal Mandal
Keyword(s):  
Optimization Problem ◽  
Search Algorithm ◽  
Mapping Function ◽  
Cuckoo Search ◽  
Simplex Algorithm ◽  
Cuckoo Search Algorithm ◽  
Optimization Approach ◽  
Integer Order ◽  
Domain Mapping ◽  
Moth Flame Optimization Algorithm

Discrete rational approximation models to the non-integer order differentiator sλ, where λ ε (0, 1), using Moth-Flame Optimization (MFO) algorithm is proposed in this paper. The proposed metaheuristic optimization approach used to design the discrete non-integer order differentiators (DNODs) does not employ any s-to-z domain mapping function to perform the discretization operation. Frequency domain characteristics of DNODs, solution reliability, and algorithm convergence performances are investigated among MFO and an advanced evolutionary algorithm called Particle Swarm Optimization with adaptive inertia weight (PSO-w). Results demonstrate the effectiveness of MFO in outperforming PSO-w in solving this non-linear and multimodal optimization problem. The proposed DNODs also exhibit better performance in comparison with the designs based on techniques such as Nelder-Mead Simplex algorithm and Cuckoo Search Algorithm published in recent literature.

scholarly journals Evaluation of Fast Evolutionary Programming, Firefly Algorithm and Mutate-Cuckoo Search Algorithm In Single-Objective Optimization

2019 ◽  
Vol 9 (1) ◽  
pp. 1
Author(s):  
Muhammad Zakyizzuddin Bin Rosselan ◽  
Shahril Irwan Bin Sulaiman ◽  
Norhalida Othman
Keyword(s):  
Evolutionary Algorithm ◽  
Firefly Algorithm ◽  
Optimization Problem ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Evolutionary Programming ◽  
Cuckoo Search Algorithm ◽  
Computational Time ◽  
Fitness Value ◽  
Single Objective

In this study proposes an evaluation of different computational intelligences, i.e Fast-Evolutionary Algorithm (FEP), Firefly Algorithm (FA) and Mutate-Cuckoo Search Algorithm (MCSA) for solving single-objective optimization problem. FEP and MCSA are based on the conventional Evolutionary Programming (EP) and Cuckoo Search Algorithm (CSA) with modifications and adjustment to boost up their search ability. In this paper, four different benchmark functions were used to compare the optimization performance of these three algorithms. The results showed that MCSA is better compare with FEP and FA in term of fitness value while FEP is fastest algorithm in term of computational time compare with other two algorithms.

scholarly journals Optimization of the operation of Dokan hydropower development using Cuckoo Search Algorithm

2022 ◽  
Vol 1216 (1) ◽  
pp. 012016
Author(s):  
K Ahmad-Rashid
Keyword(s):  
Optimization Problem ◽  
Initial Level ◽  
Search Algorithm ◽  
Energy Generation ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Metaheuristic Algorithms ◽  
Hydropower Plant ◽  
Hydropower Development

Abstract In this paper one of the recently developed metaheuristic algorithms, the Cuckoo Search algorithm is used for the optimization of the operation of a large hydropower plant in Kurdistan, Iraq. The optimization problem is to realize an annual planned energy generation with monthly imposed fractions. The obtained results are excellent, nevertheless, there are some limitations of the algorithm determined by the initial level into the reservoir and a certain correlation between the type of the year, the starting level and the planned energy to be realized.

Sign in / Sign up

Export Citation Format

Share Document