Chaotic Cuckoo Search Algorithm for High-dimensional Functions

2014 ◽  
Vol 9 (5) ◽  
Author(s):  
Aijia Ouyang ◽  
Guo Pan ◽  
Guangxue Yue ◽  
Jiayi Du
2021 ◽  
Vol 9 (2) ◽  
pp. 113-123
Author(s):  
T. Mathi Murugan ◽  
◽  
E. Baburaj ◽  

The classification of high-dimensional dataset is challenging as it contains large amount irrelevant and noisy features. Thus, feature selection is performed in the dataset to eliminate these redundant features. It reduces the dimensionality of the dataset and increases the classification accuracy. Hence, for selecting the relevant features in high dimensional data, an improved cuckoo search algorithm (ICSA) was proposed in this paper. After feature selection, the dataset undergo classification using KNN classifier and SVM classifier. The experimental process illustrates that the improved cuckoo search algorithm effectively increases the classification accuracy by reducing the number of features in the dataset. For analysing the proposed algorithm, seven UCI repository dataset have been utilised. Also, the ICS algorithm is compared with other existing algorithms for the given dataset. From the investigation process, it was concluded that the proposed algorithm selects lesser number of features and also enhances the classification accuracy than the other existing algorithms.


Author(s):  
Mohammad Shehab ◽  
Ahamad Tajudin Khader ◽  
Makhlouf Laouchedi

Cuckoo search algorithm is considered one of the promising metaheuristic algorithms applied to solve numerous problems in different fields. However, it undergoes the premature convergence problem for high dimensional problems because the algorithm converges rapidly. Therefore, we proposed a robust approach to solve this issue by hybridizing optimization algorithm, which is a combination of Cuckoo search algorithmand Hill climbing called CSAHC discovers many local optimum traps by using local and global searches, although the local search method is trapped at the local minimum point. In other words, CSAHC has the ability to balance between the global exploration of the CSA and the deep exploitation of the HC method. The validation of the performance is determined by applying 13 benchmarks. The results of experimental simulations prove the improvement in the efficiency and the effect of the cooperation strategy and the promising of CSAHC.  


2021 ◽  
Vol 2129 (1) ◽  
pp. 012025
Author(s):  
Shao Qiang Ye ◽  
Fang Ling Wang ◽  
Kai Qing Zhou

Abstract A modified Cuckoo search algorithm (MCS) is proposed in this paper to improve the accuracy of the algorithm’s convergence by implementing random operators and adapt the adjustment mechanism of the Levy Flight search step length. Comparative experiments reveal that MCS can effectively adjust the search mechanism in the high-dimensional function optimization and converge to the optimal global value.


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.


Author(s):  
Yang Wang ◽  
Feifan Wang ◽  
Yujun Zhu ◽  
Yiyang Liu ◽  
Chuanxin Zhao

AbstractIn wireless rechargeable sensor network, the deployment of charger node directly affects the overall charging utility of sensor network. Aiming at this problem, this paper abstracts the charger deployment problem as a multi-objective optimization problem that maximizes the received power of sensor nodes and minimizes the number of charger nodes. First, a network model that maximizes the sensor node received power and minimizes the number of charger nodes is constructed. Second, an improved cuckoo search (ICS) algorithm is proposed. This algorithm is based on the traditional cuckoo search algorithm (CS) to redefine its step factor, and then use the mutation factor to change the nesting position of the host bird to update the bird’s nest position, and then use ICS to find the ones that maximize the received power of the sensor node and minimize the number of charger nodes optimal solution. Compared with the traditional cuckoo search algorithm and multi-objective particle swarm optimization algorithm, the simulation results show that the algorithm can effectively increase the receiving power of sensor nodes, reduce the number of charger nodes and find the optimal solution to meet the conditions, so as to maximize the network charging utility.


Sign in / Sign up

Export Citation Format

Share Document