• Title/Summary/Keyword: Improved cuckoo search

Search Result 6, Processing Time 0.022 seconds

Improved Global Maximum Power Point Tracking for Photovoltaic System via Cuckoo Search under Partial Shaded Conditions

  • Shi, Ji-Ying;Xue, Fei;Qin, Zi-Jian;Zhang, Wen;Ling, Le-Tao;Yang, Ting
    • Journal of Power Electronics
    • /
    • v.16 no.1
    • /
    • pp.287-296
    • /
    • 2016
  • Conventional maximum power point tracking (MPPT) methods are ineffective under partially shaded conditions because multiple local maximum can be exhibited on power-voltage characteristic curve. This study proposes an improved cuckoo search (ICS) MPPT method after investigating the cuckoo search (CS) algorithm applied in solving multiple MPPT. The algorithm eliminates the random step in the original CS algorithm, and the conception of low-power, high-power, normal and marked zones are introduced. The adaptive step adjustment is also realized according to the different stages of the nest position. This algorithm adopts the large step in low-power and marked zones to reduce search time, and a small step in high-power zone is used to improve search accuracy. Finally, simulation and experiment results indicate that the promoted ICS algorithm can immediately and accurately track the global maximum under partially shaded conditions, and the array output efficiency can be improved.

Trust Predicated Routing Framework with Optimized Cluster Head Selection using Cuckoo Search Algorithm for MANET

  • Sekhar, J. Chandra;Prasad, Ramineni Sivarama
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.2
    • /
    • pp.115-125
    • /
    • 2015
  • This paper presents a Cuckoo search algorithm to secure adversaries misdirecting multi-hop routing in Mobile ad hoc networks (MANETs) using a robust Trust Predicated Routing Framework with an optimized cluster head selection. The clustering technique designed in this framework leads to efficient routing in MANETs. The heavy work load in the node causes an energy drop in cluster head, which leads to re-clustering of the group, and another cluster head is selected to avoid packet loss during data transmission. The problem in the re-clustering process is that the overall efficiency of the routing process is reduced and the processing time is increased. A Cuckoo search based optimization algorithm is proposed to solve the problem of re-clustering by selecting the secondary cluster head within the initially formed cluster group and eliminating the reclustering process. The proposed framework enables a node to select a reliable and secure route for MANET and the performance can be evaluated by comparing the simulated results with the AODV routing protocol, which shows that the performance of the proposed routing protocol are improved significantly.

Redundancy Allocation in A Multi-Level Series System by Cuckoo Search (뻐꾸기 탐색 방법을 활용한 다계층 시스템의 중복 할당 최적화)

  • Chung, Il-Han
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.4
    • /
    • pp.334-340
    • /
    • 2017
  • Reliability is considered a particularly important design factor for systems that have critical results once a failure occurs in a system, such as trains, airplanes, and passenger ships. The reliability of the system can be improved in several ways, but in a system that requires considerable reliability, the redundancy of parts is efficient in improving the system reliability. In the case of duplicating parts to improve reliability, the kind of parts and the number of duplicating parts should be determined under the system reliability, part costs, and resources. This study examined the redundancy allocation of multi-level systems with serial structures. This paper describes the definition of a multi-system and how to optimize the kind of parts and number of duplications to maximize the system reliability. To optimize the redundancy, the cuckoo search algorithm was applied. The search procedure, the solution representation and the development of the neighborhood solution were proposed to optimize the redundancy allocation of a multi-level system. The results of numerical experiments were compared with the genetic algorithm and cuckoo search algorithm.

On the Performance of Cuckoo Search and Bat Algorithms Based Instance Selection Techniques for SVM Speed Optimization with Application to e-Fraud Detection

  • AKINYELU, Andronicus Ayobami;ADEWUMI, Aderemi Oluyinka
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1348-1375
    • /
    • 2018
  • Support Vector Machine (SVM) is a well-known machine learning classification algorithm, which has been widely applied to many data mining problems, with good accuracy. However, SVM classification speed decreases with increase in dataset size. Some applications, like video surveillance and intrusion detection, requires a classifier to be trained very quickly, and on large datasets. Hence, this paper introduces two filter-based instance selection techniques for optimizing SVM training speed. Fast classification is often achieved at the expense of classification accuracy, and some applications, such as phishing and spam email classifiers, are very sensitive to slight drop in classification accuracy. Hence, this paper also introduces two wrapper-based instance selection techniques for improving SVM predictive accuracy and training speed. The wrapper and filter based techniques are inspired by Cuckoo Search Algorithm and Bat Algorithm. The proposed techniques are validated on three popular e-fraud types: credit card fraud, spam email and phishing email. In addition, the proposed techniques are validated on 20 other datasets provided by UCI data repository. Moreover, statistical analysis is performed and experimental results reveals that the filter-based and wrapper-based techniques significantly improved SVM classification speed. Also, results reveal that the wrapper-based techniques improved SVM predictive accuracy in most cases.

Active Distribution System Planning for Low-carbon Objective using Cuckoo Search Algorithm

  • Zeng, Bo;Zhang, Jianhua;Zhang, Yuying;Yang, Xu;Dong, Jun;Liu, Wenxia
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.433-440
    • /
    • 2014
  • In this study, a method for the low-carbon active distribution system (ADS) planning is proposed. It takes into account the impacts of both network capacity and demand correlation to the renewable energy accommodation, and incorporates demand response (DR) as an available resource in the ADS planning. The problem is formulated as a mixed integer nonlinear programming model, whereby the optimal allocation of renewable energy sources and the design of DR contract (i.e. payment incentives and default penalties) are determined simultaneously, in order to achieve the minimization of total cost and $CO_2$ emissions subjected to the system constraints. The uncertainties that involved are also considered by using the scenario synthesis method with the improved Taguchi's orthogonal array testing for reducing information redundancy. A novel cuckoo search (CS) is applied for the planning optimization. The case study results confirm the effectiveness and superiority of the proposed method.

Improved Feature Selection Techniques for Image Retrieval based on Metaheuristic Optimization

  • Johari, Punit Kumar;Gupta, Rajendra Kumar
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.40-48
    • /
    • 2021
  • Content-Based Image Retrieval (CBIR) system plays a vital role to retrieve the relevant images as per the user perception from the huge database is a challenging task. Images are represented is to employ a combination of low-level features as per their visual content to form a feature vector. To reduce the search time of a large database while retrieving images, a novel image retrieval technique based on feature dimensionality reduction is being proposed with the exploit of metaheuristic optimization techniques based on Genetic Algorithm (GA), Extended Binary Cuckoo Search (EBCS) and Whale Optimization Algorithm (WOA). Each image in the database is indexed using a feature vector comprising of fuzzified based color histogram descriptor for color and Median binary pattern were derived in the color space from HSI for texture feature variants respectively. Finally, results are being compared in terms of Precision, Recall, F-measure, Accuracy, and error rate with benchmark classification algorithms (Linear discriminant analysis, CatBoost, Extra Trees, Random Forest, Naive Bayes, light gradient boosting, Extreme gradient boosting, k-NN, and Ridge) to validate the efficiency of the proposed approach. Finally, a ranking of the techniques using TOPSIS has been considered choosing the best feature selection technique based on different model parameters.