7,414 research outputs found

    Performance Evaluation of Evolutionary Algorithms for Analog Integrated Circuit Design Optimisation

    Full text link
    An automated sizing approach for analog circuits using evolutionary algorithms is presented in this paper. A targeted search of the search space has been implemented using a particle generation function and a repair-bounds function that has resulted in faster convergence to the optimal solution. The algorithms are tuned and modified to converge to a better optimal solution with less standard deviation for multiple runs compared to standard versions. Modified versions of the artificial bee colony optimisation algorithm, genetic algorithm, grey wolf optimisation algorithm, and particle swarm optimisation algorithm are tested and compared for the optimal sizing of two operational amplifier topologies. An extensive performance evaluation of all the modified algorithms showed that the modifications have resulted in consistent performance with improved convergence for all the algorithms. The implementation of parallel computation in the algorithms has reduced run time. Among the considered algorithms, the modified artificial bee colony optimisation algorithm gave the most optimal solution with consistent results across multiple runs

    Solving Economic Dispatch Problem with Valve-Point Effect using a Modified ABC Algorithm

    Get PDF
    This paper presents a new approach for solving economic dispatch (ED) problem with valve-point effect using a modified artificial bee colony (MABC) algorithm. Artificial bee colony algorithm is a recent population-based optimization method which has been successfully used in many complex problems. This paper proposes a novel best mechanism algorithm based on a modified ABC algorithm, in which a new mutation strategy inspired from the differential evolution (DE) is introduced in order to improve the exploitation process. To demonstrate the effectiveness of the proposed method, the numerical studies have been performed for two different sample systems. The results of the proposed method are compared with other techniques reported in recent literature. The results clearly show that the proposed MABC algorithm outperforms other state-of-the-art algorithms in solving ED problem with the valve-point effect.DOI:http://dx.doi.org/10.11591/ijece.v3i3.251

    A Binomial Crossover Based Artificial Bee Colony Algorithm for Cryptanalysis of Polyalphabetic Cipher

    Get PDF
    Cryptography is one of the common approaches to secure private data and cryptanalysis involves breaking down a coded cipher text without having the key. Cryptanalysis by brute force cannot be accepted as an effective approach and hence, metaheuristic algorithms performing systematic search can be applied to derive the optimal key. In this study, our aim is to examine the overall suitability of Artificial Bee Colony algorithm in the cryptanalysis of polyalphabetic cipher. For this purpose, using a number of different key lengths in both English and Turkish languages, basic Artificial Bee Colony algorithm (ABC) is applied in the cryptanalysis of Vigenere cipher. In order to improve the ABC algorithm\u27s convergence speed, a modified binomial crossover based Artificial Bee Colony algorithm (BCABC) is proposed by introducing a binomial crossoverbased phase after employed bee phase for a precise search of global optimal solution. Different keys in various sizes, various cipher texts in both English and Turkish languages are used in the experiments. It is shown that optimal cryptanalysis keys produced by BCABC are notably competitive and better than those produced by basic ABC for Vigenere cipher analysis

    A Modified ABC Algorithm for Solving Non-Convex Dynamic Economic Dispatch Problems

    Get PDF
    In this paper, a modified artificial bee colony (MABC) algorithm is presented to solve non-convex dynamic economic dispatch (DED) problems considering valve-point effects, the ramp rate limits and transmission losses. Artificial bee colony algorithm is a recent population-based optimization method which has been successfully used in many complex problems. A new mutation strategy inspired from the differential evolution (DE) is introduced in order to improve the exploitation process. The feasibility of the proposed method is validated on 5 and 10 units test system for a 24 h time interval. The results are compared with the results reported in the literature. It is shown that the optimum results can be obtained more economically and quickly using the proposed method in comparison with the earlier methods

    STATISTICALLY GUIDED ARTIFICIAL BEE COLONY ALGORITHM

    Get PDF
    Artificial Bee Colony algorithm is one of the naturally inspired meta heuristic method. As usual, in a meta heuristic method, intuitively appealing way to have better results is extending calculation time or increasing the fitness evaluation count. But the desired way is acquiring better results with less computation. So in this work a modified Artificial Bee Colony algorithm which can find better results with same computation is developed by benefiting statistical observations

    a swarm intelligence-based optimizer for molecular geometry

    Get PDF
    We present a stochastic, swarm intelligence-based optimization algorithm for the prediction of global minima on potential energy surfaces of molecular clusterstructures. Our optimization approach is a modification of the artificial bee colony (ABC) algorithm which is inspired by the foraging behavior of honey bees. We apply our modified ABC algorithm to the problem of global geometryoptimization of molecular clusterstructures and show its performance for clusters with 2–57 particles and different interatomic interaction potentials

    ENHANCED SEEKER OPTIMIZATION ALGORITHM FOR REDUCTION OF ACTIVE POWER LOSS

    Get PDF
    This paper projects Enhanced Seeker Optimization (ESO) algorithm for solving optimal reactive power problem. Seeker optimization algorithm (SOA) models the deeds of human search population based on their memory, experience, uncertainty reasoning and communication with each other. In Artificial Bee Colony (ABC) algorithm the colony consists of three groups of bees: employed bees, onlookers and scouts. All bees that are presently exploiting a food source are known as employed bees. The number of the employed bees is equal to the number of food sources and an employed bee is allocated to one of the sources. In this paper hybridization of the seeker optimization algorithm with artificial bee colony (ABC) algorithm has been done to solve the optimal reactive power problem. Enhanced Seeker Optimization (ESO) algorithm combines two different solution exploration equations of the ABC algorithm and solution exploration equation of the SOA in order to progress the performance of SOA and ABC algorithms. At certain period’s seeker’s location are modified by search principles obtained from the ABC algorithm, also it adjust the inter-subpopulation learning phase by using the binomial crossover operator. In order to evaluate the efficiency of proposed Enhanced Seeker Optimization (ESO) algorithm it has been tested in standard IEEE 57,118 bus systems and compared to other specified algorithms. Simulation results clearly indicate the best performance of the proposed Enhanced Seeker Optimization (ESO) algorithm in reducing the real power loss and voltage profiles are within the limits

    A wavelet thresholding method for vibration signals denoising of high-piled wharf structure based on a modified artificial bee colony algorithm

    Get PDF
    Vibration monitoring signals are widely used for damage alarming among the structural health monitoring system. However, these signals are easily corrupted by the environmental noise in the collecting that hampers the accuracy and reliability of measured results. In this paper, a modified artificial bee colony (MABC) algorithm-based wavelet thresholding method has been proposed for noise reduction in the real measured vibration signals. Kent chaotic map and general opposition-based learning strategies are firstly adopted to initialize the colony. Tournament selection mechanism is then employed to choose the food source. Finally, the Kent chaotic search is applied to exploit the global optimum solution according to the current optimal value. Moreover, a generalized cross validation (GCV) based fitness function is constructed without requiring foreknowledge of the noise-free signals. A physical model experiment for a high-piled wharf structure is implemented to verify the feasibility of the proposed signal denoising approach. Particle swarm optimization (PSO) algorithm, basic artificial bee colony (BABC) algorithm and Logistic chaos artificial bee colony (LABC) algorithm and are also taken as contrast tests. Comparison results demonstrate that the proposed algorithm outperforms the other algorithms in terms of convergence speed and precision, and can effectively reduce the noise from the measured vibration signals of the high-piled wharf structure

    A modified scout bee for artificial bee colony algorithm and its performance on optimization problems

    Get PDF
    The artificial bee colony (ABC) is one of the swarm intelligence algorithms used to solve optimization problems which is inspired by the foraging behaviour of the honey bees. In this paper, artificial bee colony with the rate of change technique which models the behaviour of scout bee to improve the performance of the standard ABC in terms of exploration is introduced. The technique is called artificial bee colony rate of change (ABC-ROC) because the scout bee process depends on the rate of change on the performance graph, replace the parameter limit. The performance of ABC-ROC is analysed on a set of benchmark problems and also on the effect of the parameter colony size. Furthermore, the performance of ABC-ROC is compared with the state of the art algorithms
    corecore