scholarly journals An Adaptive Genetic Algorithm-based Background Elimination Model for English Text

2021 ◽  
Author(s):  
Tang Xiaohui
Keyword(s):  
Genetic Algorithm ◽  
Feature Extraction ◽  
Differential Evolution ◽  
Recognition Accuracy ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
English Text ◽  
Adaptive Genetic Algorithm ◽  
Feature Sets ◽  
Background Elimination

Abstract In this paper, an adaptive genetic algorithm is used to conduct an in-depth study and analysis of English text background elimination, and a corresponding model is designed. The curve results after the initial character editorialization are curved and transformed, and the adaptive genetic algorithm is used for the transformation to solve the influence of multiple inflection points of curve images on feature extraction. Then, using the minimum deviation method, the error values of the input characters and the sample set in the spatial coordinate system are calculated, and the deviation values of the angle and the straight line are used to match the characters with the smallest deviation value to match the highest degree. A genetic algorithm is introduced to iterate the feature sets of angles and line segments, and the optimal features are finally derived in the process of cross evolution of generations to improve the recognition accuracy. And the character library is used as input items for average grouping for experiments, and the obtained feature sets are put into the position matrix and compared with the samples in the database one by one. It is found that the improved stroke-structure feature extraction algorithm based on a genetic algorithm can improve the recognition accuracy and better accomplish the recognition task with better results compared to others. Finally, by analyzing the limitations and characteristics of traditional particle swarm optimization algorithm and differential evolution algorithm, and giving full play to the advantages and applicability of different algorithms, a new differential evolution particle swarm algorithm with better performance and more stable performance is proposed. The algorithm is based on the PSO algorithm, and when the population update of the PSO algorithm is stagnant and the search space is limited, the crossover and mutation operations of the DE algorithm are used to perturb the population, increase the diversity of the population, and improve the global optimization ability of the algorithm. The algorithm is tested on a common dataset for text mining to verify the effectiveness and feasibility of the algorithm.

Vehicle Path Planning Method Based on Particle Swarm Optimization Algorithm

2012 ◽  
Vol 468-471 ◽  
pp. 2745-2748
Author(s):  
Sheng Long Yu ◽  
Yu Ming Bo ◽  
Zhi Min Chen ◽  
Kai Zhu
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Path Planning ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Adaptive Genetic Algorithm ◽  
Swarm Optimization ◽  
Vehicle Path

A particle swarm optimization algorithm (PSO) is presented for vehicle path planning in the paper. Particle swarm optimization proposed by Kennedy and Eberhart is derived from the social behavior of the birds foraging. Particle swarm optimization algorithm a kind of swarm-based optimization method.The simulation experiments performed in this study show the better vehicle path planning ability of PSO than that of adaptive genetic algorithm and genetic algorithm. The experimental results show that the vehicle path planning by using PSO algorithm has the least cost and it is indicated that PSO algorithm has more excellent vehicle path planning ability than adaptive genetic algorithm,genetic algorithm.

scholarly journals Service Composition in IoT using Genetic algorithm and Particle swarm optimization

2020 ◽  
Vol 10 (1) ◽  
pp. 56-64 ◽  
Author(s):  
Neeti Kashyap ◽  
A. Charan Kumari ◽  
Rita Chhikara
Keyword(s):  
Genetic Algorithm ◽  
Quality Of Service ◽  
Particle Swarm Optimization ◽  
Service Composition ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Critical Issue ◽  
Swarm Optimization

AbstractWeb service compositions are commendable in structuring innovative applications for different Internet-based business solutions. The existing services can be reused by the other applications via the web. Due to the availability of services that can serve similar functionality, suitable Service Composition (SC) is required. There is a set of candidates for each service in SC from which a suitable candidate service is picked based on certain criteria. Quality of service (QoS) is one of the criteria to select the appropriate service. A standout amongst the most important functionality presented by services in the Internet of Things (IoT) based system is the dynamic composability. In this paper, two of the metaheuristic algorithms namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are utilized to tackle QoS based service composition issues. QoS has turned into a critical issue in the management of web services because of the immense number of services that furnish similar functionality yet with various characteristics. Quality of service in service composition comprises of different non-functional factors, for example, service cost, execution time, availability, throughput, and reliability. Choosing appropriate SC for IoT based applications in order to optimize the QoS parameters with the fulfillment of user’s necessities has turned into a critical issue that is addressed in this paper. To obtain results via simulation, the PSO algorithm is used to solve the SC problem in IoT. This is further assessed and contrasted with GA. Experimental results demonstrate that GA can enhance the proficiency of solutions for SC problem in IoT. It can also help in identifying the optimal solution and also shows preferable outcomes over PSO.

scholarly journals Parameters Optimization and Application of SVM Based on PCA-Particle Swarm Algorithm

2019 ◽  
pp. 325-330 ◽  
Author(s):  
Qingmi Yang
Keyword(s):  
Parameter Optimization ◽  
Recognition Accuracy ◽  
Recognition Rate ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Principal Component ◽  
Pso Algorithm ◽  
Parameters Optimization ◽  
Support Vector ◽  
Particle Swarm Algorithm

The parameter optimization of Support Vector Machine (SVM) has been a hot research direction. To improve the optimization rate and classification performance of SVM, the Principal Component Analysis (PCA) - Particle Swarm Optimization (PSO) algorithm was used to optimize the penalty parameters and kernel parameters of SVM. PSO which is to find the optimal solution through continuous iteration combined with PCA that eliminates linear redundancy between data, effectively enhance the generalization ability of the model, reduce the optimization time of parameters, and improve the recognition accuracy. The simulation comparison experiments on 6 UCI datasets illustrate that the excellent performance of the PCA-PSO-SVM model. The results show that the proposed algorithm has higher recognition accuracy and better recognition rate than simple PSO algorithm in the parameter optimization of SVM. It is an effective parameter optimization method.

Mathematical Optimization by Using Particle Swarm Optimization, Genetic Algorithm, and Differential Evolution and Its Similarities

2021 ◽  
pp. 1-34
Author(s):  
Shailendra Aote ◽  
Mukesh M. Raghuwanshi
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Mathematical Optimization ◽  
Evolutionary Computing ◽  
Swarm Optimization

To solve the problems of optimization, various methods are provided in different domain. Evolutionary computing (EC) is one of the methods to solve these problems. Mostly used EC techniques are available like Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Differential Evolution (DE). These techniques have different working structure but the inner working structure is same. Different names and formulae are given for different task but ultimately all do the same. Here we tried to find out the similarities among these techniques and give the working structure in each step. All the steps are provided with proper example and code written in MATLAB, for better understanding. Here we started our discussion with introduction about optimization and solution to optimization problems by PSO, GA and DE. Finally, we have given brief comparison of these.

Research on an Improved Coordinating Method Based on Genetic Algorithms and Particle Swarm Optimization

2019 ◽  
Vol 13 (2) ◽  
pp. 18-29
Author(s):  
Rongrong Li ◽  
Linrun Qiu ◽  
Dongbo Zhang
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Bottom Layer ◽  
Pso Algorithm ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Elite Group ◽  
Searching Ability

In this article, a hierarchical cooperative algorithm based on the genetic algorithm and the particle swarm optimization is proposed that the paper should utilize the global searching ability of genetic algorithm and the fast convergence speed of particle swarm optimization. The proposed algorithm starts from Individual organizational structure of subgroups and takes full advantage of the merits of the particle swarm optimization algorithm and the genetic algorithm (HCGA-PSO). The algorithm uses a layered structure with two layers. The bottom layer is composed of a series of genetic algorithm by subgroup that contributes to the global searching ability of the algorithm. The upper layer is an elite group consisting of the best individuals of each subgroup and the particle swarm algorithm is used to perform precise local search. The experimental results demonstrate that the HCGA-PSO algorithm has better convergence and stronger continuous search capability, which makes it suitable for solving complex optimization problems.

ESTIMATING PARAMETERS OF MUSKINGUM MODEL USING AN ADAPTIVE HYBRID PSO ALGORITHM

2014 ◽  
Vol 28 (01) ◽  
pp. 1459003 ◽  
Author(s):  
AIJIA OUYANG ◽  
ZHUO TANG ◽  
KENLI LI ◽  
AHMED SALLAM ◽  
EDWIN SHA
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Dynamic Models ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Test Method ◽  
Swarm Optimization ◽  
Muskingum Model ◽  
Hybrid Particle Swarm Optimization ◽  
Nonlinear Programming Method

In order to accelerate the convergence and improve the calculation accuracy for parameter optimization of the Muskingum model, we propose a novel, adaptive hybrid particle swarm optimization (AHPSO) algorithm. With the decreasing of inertial weight factor proposed, this method can gradually converge to a global optimal with elite individuals obtained by hybrid PSO. In the paper, we analyzed the feasibility and the advantages of the AHPSO algorithm. Then, we verified its efficiency and superiority by application of the Muskingum model. We intensively evaluated the error fitting degree based on the comparison with four known formulas: the test method (TM), the least residual square method (LRSM), the nonlinear programming method (NPM), and the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method. The results show that the AHPSO has a higher precision. In addition, we compared the AHPSO algorithm with the binary-encoded genetic algorithm (BGA), the Gray genetic algorithm (GGA), the Gray-encoded accelerating genetic algorithm (GAGA) and the particle swarm optimization (PSO), and results show that AHPSO has faster convergent speed. Moreover, AHPSO has a competitive advantage compared with the above eight methods in terms of robustness. With the efficiency of this approach it can be extended to estimate parameters of other dynamic models.

scholarly journals Hybrid method for achieving Pareto front on economic emission dispatch

2020 ◽  
Vol 10 (4) ◽  
pp. 3358
Author(s):  
Kummari Rajesh ◽  
N. Visali
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Hybrid Method ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Test System ◽  
Swarm Optimization ◽  
Metaheuristic Methods

In this paper hybrid method, Modified Nondominated Sorted Genetic Algorithm (MNSGA-II) and Modified Population Variant Differential Evolution(MPVDE) have been placed in effect in achieving the best optimal solution of Multiobjective economic emission load dispatch optimization problem. In this technique latter, one is used to enforce the assigned percent of the population and the remaining with the former one. To overcome the premature convergence in an optimization problem diversity preserving operator is employed, from the tradeoff curve the best optimal solution is predicted using fuzzy set theory. This methodology validated on IEEE 30 bus test system with six generators, IEEE 118 bus test system with fourteen generators and with a forty generators test system. The solutions are dissimilitude with the existing metaheuristic methods like Strength Pareto Evolutionary Algorithm-II, Multiobjective differential evolution, Multi-objective Particle Swarm optimization, Fuzzy clustering particle swarm optimization, Nondominated sorting genetic algorithm-II.

Sign in / Sign up

Export Citation Format

Share Document