Computational Intelligence in Circuit Synthesis

2007 ◽  
Vol 11 (9) ◽  
pp. 1122-1127 ◽  
Author(s):  
Cecília Reis ◽  
◽  
J. A. Tenreiro Machado
Keyword(s):  
Evolutionary Algorithms ◽  
Computational Intelligence ◽  
Search Algorithm ◽  
Fitness Function ◽  
Population Based ◽  
Statistical Characteristics ◽  
Combinational Logic Circuits ◽  
The Individual ◽  
Population Based Search ◽  
Swarm Intelligence Algorithm

This paper is devoted to the synthesis of combinational logic circuits through computational intelligence or, more precisely, using evolutionary computation techniques. Are studied two evolutionary algorithms, the Genetic and the Memetic Algorithm (GAs, MAs) and one swarm intelligence algorithm, the Particle Swarm Optimization (PSO). GAs are optimization and search techniques based on the principles of genetics and natural selection. MAs are evolutionary algorithms that include a stage of individual optimization as part of its search strategy, being the individual optimization in the form of a local search. The PSO is a population-based search algorithm that starts with a population of random solutions called particles. This paper presents the results for digital circuits design using the three above algorithms. The results show the statistical characteristics of this algorithms with respect to the number of generations required to achieve the solutions. The article analyzes also a new fitness function that includes an error discontinuity measure, which demonstrated to improve significantly the performance of the algorithm.

scholarly journals Firefly-Based Approaches of Image Recognition

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 881
Author(s):  
Catalina-Lucia Cocianu ◽  
Alexandru Daniel Stan ◽  
Mihai Avramescu
Keyword(s):  
Mutual Information ◽  
Firefly Algorithm ◽  
Fitness Function ◽  
Population Based ◽  
Evolutionary Strategy ◽  
Normalized Mutual Information ◽  
Principal Axes ◽  
The One ◽  
Computation Algorithms ◽  
Population Based Search

The main aim of the reported work is to solve the registration problem for recognition purposes. We introduce two new evolutionary algorithms (EA) consisting of population-based search methods, followed by or combined with a local search scheme. We used a variant of the Firefly algorithm to conduct the population-based search, while the local exploration was implemented by the Two-Membered Evolutionary Strategy (2M-ES). Both algorithms use fitness function based on mutual information (MI) to direct the exploration toward an appropriate candidate solution. A good similarity measure is the one that enables us to predict well, and with the symmetric MI we tie similarity between two objects A and B directly to how well A predicts B, and vice versa. Since the search landscape of normalized mutual information proved more amenable for evolutionary computation algorithms than simple MI, we use normalized mutual information (NMI) defined as symmetric uncertainty. The proposed algorithms are tested against the well-known Principal Axes Transformation technique (PAT), a standard evolutionary strategy and a version of the Firefly algorithm developed to align images. The accuracy and the efficiency of the proposed algorithms are experimentally confirmed by our tests, both methods being excellently fitted to registering images.

Neural Network Weight Optimisation Using the Bees Algorithm

2010 ◽  
Author(s):  
Afshin Ghanbarzadeh
Keyword(s):  
Foraging Behaviour ◽  
Search Algorithm ◽  
Random Search ◽  
Identification Problem ◽  
Population Based ◽  
Bees Algorithm ◽  
Defect Identification ◽  
Neighbourhood Search ◽  
Network Weight ◽  
Population Based Search

This paper presents an application of the Bees Algorithm (BA) to the optimisation of weights within neural networks for wood defect detection. This novel population-based search algorithm mimics the natural foraging behaviour of swarms of bees. In its basic version, the algorithm performs a kind of neighbourhood search combined with random search. Following a brief description of the algorithm, the paper gives the results obtained for the wood defect identification problem demonstrating the efficiency and robustness of the new algorithm.

Development and validation of an efficient direct numerical optimisation approach for aerofoil shape design

2010 ◽  
Vol 114 (1160) ◽  
pp. 611-628 ◽  
Author(s):  
M. Khurana ◽  
H. Winarto
Keyword(s):  
Search Algorithm ◽  
Optimal Solution ◽  
Population Based ◽  
Computational Time ◽  
Adaptive Mutation ◽  
Shape Optimisation ◽  
Geometrical Shape ◽  
Data Mining Technique ◽  
Gradient Based ◽  
Population Based Search

Abstract Intelligent shape optimisation architecture is developed, validated and applied in the design of high-altitude long endurance aerofoil (HALE). The direct numeric optimisation (DNO) approach integrating a geometrical shape parameterisation model coupled to a validated flow solver and a population based search algorithm are applied in the design process. The merit of the DNO methodology is measured by computational time efficiency and feasibility of the optimal solution. Gradient based optimisers are not suitable for multi-modal solution topologies. Thus, a novel particle swarm optimiser with adaptive mutation (AM-PSO) is developed. The effect of applying the PARSEC and a modified variant of the original function, as a shape parameterisation model on the global optimal is verified. Optimisation efficiency is addressed by mapping the solution topology for HALE aerofoil designs and by computing the sensitivity of aerofoil shape variables on the objective function. Variables with minimal influence are identified and eliminated from shape optimisation simulations. Variable elimination has a negligible effect on the aerodynamics of the global optima, with a significant reduction in design iterations to convergence. A novel data-mining technique is further applied to verify the accuracy of the AM-PSO solutions. The post-processing analysis, to swarm optimisation solutions, indicates a hybrid optimisation methodology with the integration of global and local gradient based search methods, yields a true optima. The findings are consistent for single and multi-point designs.

Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

Differentiation of endemic areas by incidence rates of tick-borne infectious diseases as the basis for choosing prevention strategy and tactics

2019 ◽  
pp. 56-61
Author(s):  
N.V. Rudakov ◽  
N.A. Penyevskaya ◽  
D.A. Saveliev ◽  
S.A. Rudakova ◽  
C.V. Shtrek ◽  
...  
Keyword(s):  
High Risk ◽  
Infectious Diseases ◽  
Population Based ◽  
Preventive Therapy ◽  
Incidence Rates ◽  
Prevention Strategy ◽  
Individual Risk ◽  
The Individual ◽  
Integral Assessment ◽  
Very High

Research objective. Differentiation of natural focal areas of Western Siberia by integral incidence rates of tick-borne infectious diseases for determination of the strategy and tactics of their comprehensive prevention. Materials and methods. A retrospective analysis of official statistics for the period 2002-2018 for eight sub-federal units in the context of administrative territories was carried out. The criteria of differentiation were determined by means of three evaluation scales, including long-term mean rates of tick-borne encephalitis, tick-borne borreliosis, and Siberian tick-borne typhus. As a scale gradation tool, we used the number of sample elements between the confidence boundaries of the median. The integral assessment was carried out by the sum of points corresponding to the incidence rates for each of the analyzed infections. Results. The areas of low, medium, above average, high and very high risk of tick-borne infectious diseases were determined. Recommendations on the choice of prevention strategy and tactics were given. In areas of very high and high incidence rates, a combination of population-based and individual prevention strategies is preferable while in other areas a combination of high-risk and individual strategies is recommended. Discussion. Epidemiologic zoning should be the basis of a risk-based approach to determining optimal volumes and directions of preventive measures against natural focal infections. It is necessary to improve the means and methods of determining the individual risk of getting infected and developing tick-borne infectious diseases in case of bites, in view of mixed infection of vectors, as well as methods of post-exposure disease prevention (preventive therapy).

Localization of WSN using Distributed Particle Swarm Optimization algorithm with precise references

2016 ◽  
Vol 7 ◽  
pp. 1
Author(s):  
Ravichander Janapati ◽  
Ch. Balaswamy ◽  
K. Soundararajan
Keyword(s):  
Particle Swarm Optimization ◽  
Search Algorithm ◽  
Particle Swarm ◽  
Search Space ◽  
Research Area ◽  
Population Based ◽  
Wireless Sensor ◽  
Cooperative Localization ◽  
Localization Algorithm ◽  
Swarm Optimization

Localization is the key research area in wireless sensor networks. Finding the exact position of the node is known as localization. Different algorithms have been proposed. Here we consider a cooperative localization algorithm with censoring schemes using Crammer Rao bound (CRB). This censoring scheme  can improve the positioning accuracy and reduces computation complexity, traffic and latency. Particle swarm optimization (PSO) is a population based search algorithm based on the swarm intelligence like social behavior of birds, bees or a school of fishes. To improve the algorithm efficiency and localization precision, this paper presents an objective function based on the normal distribution of ranging error and a method of obtaining the search space of particles. In this paper  Distributed localization of wireless sensor networksis proposed using PSO with best censoring technique using CRB. Proposed method shows better results in terms of position accuracy, latency and complexity.  

Automatic Mining of Quantitative Association Rules with Gravitational Search Algorithm

2017 ◽  
Vol 27 (03) ◽  
pp. 343-372 ◽  
Author(s):  
Umit Can ◽  
Bilal Alatas
Keyword(s):  
Association Rules ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Fitness Function ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Search Space ◽  
Search Method ◽  
Quantitative Association Rules ◽  
Gravitational Search

The classical optimization algorithms are not efficient in solving complex search and optimization problems. Thus, some heuristic optimization algorithms have been proposed. In this paper, exploration of association rules within numerical databases with Gravitational Search Algorithm (GSA) has been firstly performed. GSA has been designed as search method for quantitative association rules from the databases which can be regarded as search space. Furthermore, determining the minimum values of confidence and support for every database which is a hard job has been eliminated by GSA. Apart from this, the fitness function used for GSA is very flexible. According to the interested problem, some parameters can be removed from or added to the fitness function. The range values of the attributes have been automatically adjusted during the time of mining of the rules. That is why there is not any requirements for the pre-processing of the data. Attributes interaction problem has also been eliminated with the designed GSA. GSA has been tested with four real databases and promising results have been obtained. GSA seems an effective search method for complex numerical sequential patterns mining, numerical classification rules mining, and clustering rules mining tasks of data mining.

The Need for Personalized Risk-Stratified Approaches to Treatment for Gestational Diabetes: A Narrative Review

2021 ◽  
Author(s):  
Shamil D. Cooray ◽  
Jacqueline A. Boyle ◽  
Georgia Soldatos ◽  
Shakila Thangaratinam ◽  
Helena J. Teede
Keyword(s):  
Gestational Diabetes ◽  
Pregnancy Outcomes ◽  
Population Based ◽  
Adverse Pregnancy Outcomes ◽  
Therapeutic Interventions ◽  
Clinical Prediction Model ◽  
Increased Risk ◽  
Adverse Pregnancy ◽  
The Individual ◽  
Personalized Risk

AbstractGestational diabetes mellitus (GDM) is common and is associated with an increased risk of adverse pregnancy outcomes. However, the prevailing one-size-fits-all approach that treats all women with GDM as having equivalent risk needs revision, given the clinical heterogeneity of GDM, the limitations of a population-based approach to risk, and the need to move beyond a glucocentric focus to address other intersecting risk factors. To address these challenges, we propose using a clinical prediction model for adverse pregnancy outcomes to guide risk-stratified approaches to treatment tailored to the individual needs of women with GDM. This will allow preventative and therapeutic interventions to be delivered to those who will maximally benefit, sparing expense, and harm for those at a lower risk.

scholarly journals A New “Good and Bad Groups-Based Optimizer” for Solving Various Optimization Problems

2021 ◽  
Vol 11 (10) ◽  
pp. 4382
Author(s):  
Ali Sadeghi ◽  
Sajjad Amiri Doumari ◽  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Pavel Trojovský ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Fitness Function ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Gray Wolf ◽  
Good Group ◽  
Good Ability ◽  
Whale Optimization

Optimization is the science that presents a solution among the available solutions considering an optimization problem’s limitations. Optimization algorithms have been introduced as efficient tools for solving optimization problems. These algorithms are designed based on various natural phenomena, behavior, the lifestyle of living beings, physical laws, rules of games, etc. In this paper, a new optimization algorithm called the good and bad groups-based optimizer (GBGBO) is introduced to solve various optimization problems. In GBGBO, population members update under the influence of two groups named the good group and the bad group. The good group consists of a certain number of the population members with better fitness function than other members and the bad group consists of a number of the population members with worse fitness function than other members of the population. GBGBO is mathematically modeled and its performance in solving optimization problems was tested on a set of twenty-three different objective functions. In addition, for further analysis, the results obtained from the proposed algorithm were compared with eight optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching–learning-based optimization (TLBO), gray wolf optimizer (GWO), and the whale optimization algorithm (WOA), tunicate swarm algorithm (TSA), and marine predators algorithm (MPA). The results show that the proposed GBGBO algorithm has a good ability to solve various optimization problems and is more competitive than other similar algorithms.

Sign in / Sign up

Export Citation Format

Share Document