scholarly journals Improved Grey Particle Swarm Optimization and New Luus-Jaakola Hybrid Algorithm Optimized IMC-PID Controller for Diverse Wing Vibration Systems

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-21
Author(s):  
Nailu Li ◽  
Hua Yang ◽  
Anle Mu

The PID control plays important role in wing vibration control systems. However, how to efficiently optimize the PID parameters for different kinds of wing vibration systems is still an open issue for control designers. The problem of PID control optimization is first converted into internal mode control based PID (IMC-PID) parameters optimization problem for complex wing vibration systems. To solve this problem, a novel optimization technique, called GNPSO is proposed based on the hybridization of improved grey particle swarm optimization (GPSO) and new Luus-Jaakola algorithm (NLJ). The original GPSO is modified by using small population size/iteration number, employing new grey analysis rule and designing new updating formula of acceleration coefficients. The hybrid GNPSO benefits improved global exploration of GPSO and strong local search of new Luus-Jaakola (NLJ), so as to avoid arbitrary and inefficient search of global optimum and prevent the trap in local optimum. Diverse wing vibration systems, including linear system, nonlinear system and multiple-input-multiple-output system are considered to verify the effectiveness of proposed method. Simulation results show that GNPSO optimized method obtains improved vibration control performance, stronger robustness and wide applicability on all system cases, compared to existing evolutionary algorithm based tuning methods. Enhanced optimization convergence and computation efficiency obtained by GNPSO tuning technique are also verified by statistical analysis.

Kursor ◽  
2016 ◽  
Vol 8 (1) ◽  
pp. 33
Author(s):  
Alrijadjis Alrijadjis

Particle Swarm Optimization (PSO) is a popular optimization technique which is inspired by the social behavior of birds flocking or fishes schooling for finding food. It is a new metaheuristic search algorithm developed by Eberhart and Kennedy in 1995. However, the standard PSO has a shortcoming, i.e., premature convergence and easy to get stack or fall into local optimum. Inertia weight is an important parameter in PSO, which significantly affect the performance of PSO. There are many variations of inertia weight strategies have been proposed in order to overcome the shortcoming. In this paper, a new modified PSO with random activation to increase exploration ability, help trapped particles for jumping-out from local optimum and avoid premature convergence is proposed. In the proposed method, an inertia weight is decreased linearly until half of iteration, and then a random number for an inertia weight is applied until the end of iteration. To emphasis the role of this new inertia weight adjustment, the modified PSO paradigm is named Modified PSO with random activation (MPSO-RA). The experiments with three famous benchmark functions show that the accuracy and success rate of the proposed MPSO-RA increase of 43.23% and 32.95% compared with the standard PSO.


2018 ◽  
Vol 18 (3) ◽  
pp. 62-74 ◽  
Author(s):  
Romasevych Yuriy ◽  
Loveikin Viatcheslav

Abstract Since canonical PSO method has many disadvantages which do not allow to effectively reach the global minima of various functions it needs to be improved. The article refers to a novel Multi-Epoch Particle Swarm Optimization (ME-PSO) technique which has been developed by authors. ME-PSO algorithm is based on reinitializing of the stagnant swarm with low exploration efficiency. This approach provides a high rate of global best changing. As a result ME-PSO has great possibility of finding good local (or even global) optimum and does not trap in bad local optimum. In order to prove the advantages of the ME-PSO technique numerical experiments have been carried out with ten uni- and multimodal benchmark functions. Analysis of the obtained results convincingly showed significant superiority of ME-PSO over PSO and IA-PSO algorithms. It has been set that canonical PSO is a special case of ME-PSO.


Author(s):  
Troudi Ahmed ◽  
Bouzbida Mohamed ◽  
Chaari Abdelkader

Many clustering algorithms have been proposed in literature to identify the parameters involved in the Takagi–Sugeno fuzzy model, we can quote as an example the Fuzzy C-Means algorithm (FCM), the Possibilistic C-Means algorithm (PCM), the Allied Fuzzy C-Means algorithm (AFCM), the NEPCM algorithm and the KNEPCM algorithm. The main drawback of these algorithms is the sensitivity to initialization and the convergence to a local optimum of the objective function. In order to overcome these problems, the particle swarm optimization is proposed. Indeed, the particle swarm optimization is a global optimization technique. Thus, the incorporation of local research capacity of the KNEPCM algorithm and the global optimization ability of the PSO algorithm can solve these problems. In this paper, a new clustering algorithm called KNEPCM-PSO is proposed. This algorithm is a combination between Kernel New Extended Possibilistic C-Means algorithm (KNEPCM) and Particle Swarm Optimization (PSO). The effectiveness of this algorithm is tested on nonlinear systems and on an electro-hydraulic system.


Author(s):  
Midde Venkateswarlu Naik ◽  
D. Vasumathi ◽  
A.P. Siva Kumar

Aims: The proposed research work is on an evolutionary enhanced method for sentiment or emotion classification on unstructured review text in the big data field. The sentiment analysis plays a vital role for current generation of people for extracting valid decision points about any aspect such as movie ratings, education institute or politics ratings, etc. The proposed hybrid approach combined the optimal feature selection using Particle Swarm Optimization (PSO) and sentiment classification through Support Vector Machine (SVM). The current approach performance is evaluated with statistical measures, such as precision, recall, sensitivity, specificity, and was compared with the existing approaches. The earlier authors have achieved an accuracy of sentiment classifier in the English text up to 94% as of now. In the proposed scheme, an average accuracy of sentiment classifier on distinguishing datasets outperformed as 99% by tuning various parameters of SVM, such as constant c value and kernel gamma value in association with PSO optimization technique. The proposed method utilized three datasets, such as airline sentiment data, weather, and global warming datasets, that are publically available. The current experiment produced results that are trained and tested based on 10- Fold Cross-Validations (FCV) and confusion matrix for predicting sentiment classifier accuracy. Background: The sentiment analysis plays a vital role for current generation people for extracting valid decisions about any aspect such as movie rating, education institute or even politics ratings, etc. Sentiment Analysis (SA) or opinion mining has become fascinated scientifically as a research domain for the present environment. The key area is sentiment classification on semi-structured or unstructured data in distinguish languages, which has become a major research aspect. User-Generated Content [UGC] from distinguishing sources has been hiked significantly with rapid growth in a web environment. The huge user-generated data over social media provides substantial value for discovering hidden knowledge or correlations, patterns, and trends or sentiment extraction about any specific entity. SA is a computational analysis to determine the actual opinion of an entity which is expressed in terms of text. SA is also called as computation of emotional polarity expressed over social media as natural text in miscellaneous languages. Usually, the automatic superlative sentiment classifier model depends on feature selection and classification algorithms. Methods: The proposed work used Support vector machine as classification technique and particle swarm optimization technique as feature selection purpose. In this methodology, we tune various permutations and combination parameters in order to obtain expected desired results with kernel and without kernel technique for sentiment classification on three datasets, including airline, global warming, weather sentiment datasets, that are freely hosted for research practices. Results: In the proposed scheme, The proposed method has outperformed with 99.2% of average accuracy to classify the sentiment on different datasets, among other machine learning techniques. The attained high accuracy in classifying sentiment or opinion about review text proves superior effectiveness over existing sentiment classifiers. The current experiment produced results that are trained and tested based on 10- Fold Cross-Validations (FCV) and confusion matrix for predicting sentiment classifier accuracy. Conclusion: The objective of the research issue sentiment classifier accuracy has been hiked with the help of Kernel-based Support Vector Machine (SVM) based on parameter optimization. The optimal feature selection to classify sentiment or opinion towards review documents has been determined with the help of a particle swarm optimization approach. The proposed method utilized three datasets to simulate the results, such as airline sentiment data, weather sentiment data, and global warming data that are freely available datasets.


2013 ◽  
Vol 760-762 ◽  
pp. 2194-2198 ◽  
Author(s):  
Xue Mei Wang ◽  
Yi Zhuo Guo ◽  
Gui Jun Liu

Adaptive Particle Swarm Optimization algorithm with mutation operation based on K-means is proposed in this paper, this algorithm Combined the local searching optimization ability of K-means with the gobal searching optimization ability of Particle Swarm Optimization, the algorithm self-adaptively adjusted inertia weight according to fitness variance of population. Mutation operation was peocessed for the poor performative particle in population. The results showed that the algorithm had solved the poblems of slow convergence speed of traditional Particle Swarm Optimization algorithm and easy falling into the local optimum of K-Means, and more effectively improved clustering quality.


Sign in / Sign up

Export Citation Format

Share Document