Nonlinear Inertia Weigh Particle Swarm Optimization Combines Simulated Annealing Algorithm and Application in Function and SVM Optimization

2011 ◽  
Vol 130-134 ◽  
pp. 3467-3471 ◽  
Author(s):  
Bin Jiao ◽  
Zhi Xiang Xu
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Local Equilibrium ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Classification Performance ◽  
Support Vector ◽  
Swarm Optimization ◽  
Searching Ability

This paper proposes an improved particle swarm optimization algorithm (PSO) for the global and local equilibrium problem of searching ability. It improves the iterative way of inertia weight in PSO, using non-linear decreasing algorithm to balance, then PSO combines with simulated annealing (SA). Finally, the optimization test experiments are carried out for the typical functions with the algorithm (ULWPSO-SA), and compare with the basic PSO algorithm. Simulation experiments show that local search ability of algorithm, convergence speed, stability and accuracy have been significantly improved. In addition, the novel algorithm is used in the parameter optimization of support vector machines (ULWPSOSA-SVM), and the experimental results indicate that it gets a better classification performance compared with SVM and PSO-SVM.

CREDIT SCORING USING MULTI-KERNEL SUPPORT VECTOR MACHINE AND CHAOS PARTICLE SWARM OPTIMIZATION

2012 ◽  
Vol 11 (03) ◽  
pp. 1250019 ◽  
Author(s):  
YUN LING ◽  
QIUYAN CAO ◽  
HUA ZHANG
Keyword(s):  
Particle Swarm Optimization ◽  
Kernel Function ◽  
Credit Scoring ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Classification Problem ◽  
Classification Performance ◽  
Kernel Functions ◽  
Support Vector ◽  
Swarm Optimization

Consumer credit scoring is considered as a crucial issue in the credit industry. SVM has been successfully utilized for classification in many areas including credit scoring. Kernel function is vital when applying SVM to classification problem for enhancing the prediction performance. Currently, most of kernel functions used in SVM are single kernel functions such as the radial basis function (RBF) which has been widely used. On the basis of the existing kernel functions, this paper proposes a multi-kernel function to improve the learning and generalization ability of SVM by integrating several single kernel functions. Chaos particle swarm optimization (CPSO) which is a kind of improved PSO algorithm is utilized to optimize parameters and to select features simultaneously. Two UCI credit data sets are used as the experimental data to evaluate the classification performance of the proposed method.

Study on Multi-Depot Vehicle Routing Problem Based on Cloud Adaptive Particle Swarm Optimization

2012 ◽  
Vol 253-255 ◽  
pp. 1369-1373
Author(s):  
Tie Jun Wang ◽  
Kai Jun Wu
Keyword(s):  
Particle Swarm Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Cloud Model ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Routing Problem ◽  
Adaptive Particle Swarm Optimization ◽  
Searching Ability

Multi-depots vehicle routing problem (MDVRP) is a kind of NP combination problem which possesses important practical value. In order to overcome PSO’s premature convergence and slow astringe, a Cloud Adaptive Particle Swarm Optimization(CAPSO) is put forward, it uses the randomicity and stable tendentiousness characteristics of cloud model, adopts different inertia weight generating methods in different groups, the searching ability of the algorithm in local and overall situation is balanced effectively. In this paper, the algorithm is used to solve MDVRP, a kind of new particles coding method is constructed and the solution algorithm is developed. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability than GA and the PSO algorithm.

An integrated fuzzy support vector regression and the particle swarm optimization algorithm to predict indoor thermal comfort

2016 ◽  
Vol 25 (8) ◽  
pp. 1248-1258 ◽  
Author(s):  
Fayçal Megri ◽  
Ahmed Cherif Megri ◽  
Riadh Djabri
Keyword(s):  
Particle Swarm Optimization ◽  
Thermal Comfort ◽  
Support Vector Regression ◽  
Thermal Sensation ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Support Vector ◽  
Statistical Regression ◽  
Swarm Optimization ◽  
Comfort Indices

The thermal comfort indices are usually identified using empirical thermal models based on the human balanced equations and experimentations. In our paper, we propose a statistical regression method to predict these indices. To achieve this goal, first, the fuzzy support vector regression (FSVR) identification approach was integrated with the particle swarm optimization (PSO) algorithm. Then PSO was used as a global optimizer to optimize and select the hyper-parameters needed for the FSVR model. The radial basis function (RBF) kernel was used within the FSVR model. Afterward, these optimal hyper-parameters were used to forecast the thermal comfort indices: predicted mean vote (PMV), predicted percentage dissatisfied (PPD), new standard effective temperature (SET*), thermal discomfort (DISC), thermal sensation (TSENS) and predicted percent dissatisfied due to draft (PD). The application of the proposed approach on different data sets gave successful prediction and promising results. Moreover, the comparisons between the traditional Fanger model and the new model further demonstrate that the proposed model achieves even better identification performance than the original FSVR technique.

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.

scholarly journals Application of Simulated Annealing Particle Swarm Optimization Based on Correlation in Parameter Identification of Induction Motor

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Lei Wang ◽  
Yongqiang Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Optimization Algorithm ◽  
Simulated Annealing Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Correlation Algorithm ◽  
Annealing Algorithm

The strengths and weaknesses of correlation algorithm, simulated annealing algorithm, and particle swarm optimization algorithm are studied in this paper. A hybrid optimization algorithm is proposed by drawing upon the three algorithms, and the specific application processes are given. To extract the current fundamental signal, the correlation algorithm is used. To identify the motor dynamic parameter, the filtered stator current signal is simulated using simulated annealing particle swarm algorithm. The simulated annealing particle swarm optimization algorithm effectively incorporates the global optimization ability of simulated annealing algorithm with the fast convergence of particle swarm optimization by comparing the identification results of asynchronous motor with constant torque load and step load.

A New Improved Adaptive Hybrid Particle Swarm Optimization Algorithm

2013 ◽  
Vol 427-429 ◽  
pp. 1710-1713
Author(s):  
Xiang Tian ◽  
Yue Lin Gao
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Hybrid Particle ◽  
Hybrid Particle Swarm Optimization ◽  
Searching Ability ◽  
Learning Factors

This paper introduces the principles and characteristics of Particle Swarm Optimization algorithm, and aims at the shortcoming of PSO algorithm, which is easily plunging into the local minimum, then we proposes a new improved adaptive hybrid particle swarm optimization algorithm. It adopts dynamically changing inertia weight and variable learning factors, which is based on the mechanism of natural selection. The numerical results of classical functions illustrate that this hybrid algorithm improves global searching ability and the success rate.

scholarly journals Forecasting Initial Public Offering Pricing Using Particle Swarm Optimization (PSO) Algorithm and Support Vector Machine (SVM) In Iran

2017 ◽  
Vol 7 (1) ◽  
pp. 336 ◽  
Author(s):  
Shaho Heidari Gandoman ◽  
Navab Kiamehr ◽  
Mahmood Hemetfar
Keyword(s):  
Support Vector Machine ◽  
Particle Swarm Optimization ◽  
Initial Public Offering ◽  
Stock Exchange ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Economic Benefits ◽  
Support Vector ◽  
Swarm Optimization ◽  
Public Offering

The present study compares the ability of neural networks, support vector machine, and model derived from combining particles swarm optimization (PSO) algorithm and support vector machine (SVM) to forecast the initial public offering pricing. The purpose of this research is to design a model that helps investors recognize the validity of the initial public offering pricing and hunt profitable opportunities. The variables used in this study are selected among those variables which are in the disposal of investors who have limited access to information before the offering. On the other hand, these results can be useful for publishing companies, admissions consultant, underwriting and legislators of the stock exchange. We have considered the ninth day offering prices, since volatilities are gone and prices seem to be more realistic. The results show that the combination of particle swarm optimization (PSO) algorithm and support vector machine (SVM) markedly increases the forecasting power. As a result, support vector machine models can increase the accuracy of initial public offering pricing and provide significant economic benefits as reducing less than real pricing costs.

Monopole-Gear Design Based on Neural Network and Modified Particle Swarm Optimization

2013 ◽  
Vol 477-478 ◽  
pp. 368-373 ◽  
Author(s):  
Hai Rong Fang
Keyword(s):  
Neural Network ◽  
Particle Swarm Optimization ◽  
Simulated Annealing Algorithm ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Test Results ◽  
Swarm Optimization ◽  
Modified Particle Swarm Optimization ◽  
Gear Design ◽  
Annealing Algorithm

In order to raise the design efficiency and get the most excellent design effect, this paper combined Particle Swarm Optimization (PSO) algorithm and put forward a new kind of neural network, which based on PSO algorithm, and the implementing framework of PSO and NARMA model. It gives the basic theory, steps and algorithm; The test results show that rapid global convergence and reached the lesser mean square error MSE) when compared with Genetic Algorithm, Simulated Annealing Algorithm, the BP algorithm with momentum term.

scholarly journals Optimal Design of Multimissile Formation Based on an Adaptive SA-PSO Algorithm

Aerospace ◽  
2021 ◽  
Vol 9 (1) ◽  
pp. 21
Author(s):  
Shuangxi Liu ◽  
Fengping Huang ◽  
Binbin Yan ◽  
Tong Zhang ◽  
Ruifan Liu ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Index System ◽  
Fitness Function ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Evaluation Index System ◽  
Design Parameters ◽  
Swarm Optimization ◽  
Adaptive Pso

In an effort to maximize the combat effectiveness of multimissile groups, this paper proposes an adaptive simulated annealing–particle swarm optimization (SA-PSO) algorithm to enhance the design parameters of multimissile formations based on the concept of missile cooperative engagement. Firstly, considering actual battlefield circumstances, we establish an effectiveness evaluation index system for the cooperative engagement of missile formations based on the analytic hierarchy process (AHP). In doing so, we adopt a partial triangular fuzzy number method based on authoritative assessments by experts to ascertain the weight of each index. Then, considering given constraints on missile performance, by selecting the relative distances and angles of the leader and follower missiles as formation parameters, we design a fitness function corresponding to the established index system. Finally, we introduce an adaptive capability into the traditional particle swarm optimization (PSO) algorithm and propose an adaptive SA-PSO algorithm based on the simulated annealing (SA) algorithm to calculate the optimal formation parameters. A simulation example is presented for the scenario of optimizing the formation parameters of three missiles, and comparative experiments conducted with the traditional and adaptive PSO algorithms are reported. The simulation results indicate that the proposed adaptive SA-PSO algorithm converges faster than both the traditional and adaptive PSO algorithms and can quickly and effectively solve the multimissile formation optimization problem while ensuring that the optimized formation satisfies the given performance constraints.

Sign in / Sign up

Export Citation Format

Share Document