An Improved Global Particle Swarm Optimization for Faster Optimization Process

2015 ◽  
Vol 72 (2) ◽  
Author(s):  
Mohamad Fadzli Haniff ◽  
Hazlina Selamat ◽  
Salinda Buyamin
Keyword(s):  
Particle Swarm Optimization ◽  
Standard Deviation ◽  
Particle Swarm ◽  
Optimization Process ◽  
High Dimensional ◽  
Mathematical Function ◽  
Optimal Point ◽  
Swarm Optimization ◽  
Two Dimension ◽  
Ordinary Particle

An efficient Global Particle Swarm Optimization (GPSO) is proposed in order to overcome the concern of trapping in the local optimal point especially in high dimensional while using ordinary Particle Swarm Optimization (PSO). GPSO is able to bring all the particles to be closely clumped together faster than PSO. In this paper, an improved GPSO is proposed in order to get a closely clumped particles group faster than using GPSO. The original GPSO is improved by taking into account the global best fitness error and particle fitness clumping size of every iteration. The improved GPSO is simulated by using several two dimension mathematical function and benchmarked with the original GPSO. The improved GPSO is shown to be able to obtain closely clumped particles much more faster than the original GPSO up to 62%. The performances are also evaluated by comparing the standard deviation, average, best particle and worst particles obtained through a 50 independent runs. In term of the four factors mentioned, the improved GPSO performance is shown to be as good of the original GPSO.

scholarly journals Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
J. J. Jamian ◽  
M. N. Abdullah ◽  
H. Mokhlis ◽  
M. W. Mustafa ◽  
A. H. A. Bakar
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Function Optimization ◽  
High Dimensional ◽  
Local Optimum ◽  
Mathematical Function ◽  
Numerical Function ◽  
Swarm Optimization ◽  
Particle Position

The Particle Swarm Optimization (PSO) Algorithm is a popular optimization method that is widely used in various applications, due to its simplicity and capability in obtaining optimal results. However, ordinary PSOs may be trapped in the local optimal point, especially in high dimensional problems. To overcome this problem, an efficient Global Particle Swarm Optimization (GPSO) algorithm is proposed in this paper, based on a new updated strategy of the particle position. This is done through sharing information of particle position between the dimensions (variables) at any iteration. The strategy can enhance the exploration capability of the GPSO algorithm to determine the optimum global solution and avoid traps at the local optimum. The proposed GPSO algorithm is validated on a 12-benchmark mathematical function and compared with three different types of PSO techniques. The performance of this algorithm is measured based on the solutions’ quality, convergence characteristics, and their robustness after 50 trials. The simulation results showed that the new updated strategy in GPSO assists in realizing a better optimum solution with the smallest standard deviation value compared to other techniques. It can be concluded that the proposed GPSO method is a superior technique for solving high dimensional numerical function optimization problems.

A hybrid feature selection algorithm combining ReliefF and Particle swarm optimization for high-dimensional medical data

2021 ◽  
pp. 1-15
Author(s):  
Zhaozhao Xu ◽  
Derong Shen ◽  
Yue Kou ◽  
Tiezheng Nie
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Random Forest ◽  
Classification Accuracy ◽  
Particle Swarm ◽  
Medical Data ◽  
High Dimensional ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Swarm Optimization

Due to high-dimensional feature and strong correlation of features, the classification accuracy of medical data is not as good enough as expected. feature selection is a common algorithm to solve this problem, and selects effective features by reducing the dimensionality of high-dimensional data. However, traditional feature selection algorithms have the blindness of threshold setting and the search algorithms are liable to fall into a local optimal solution. Based on it, this paper proposes a hybrid feature selection algorithm combining ReliefF and Particle swarm optimization. The algorithm is mainly divided into three parts: Firstly, the ReliefF is used to calculate the feature weight, and the features are ranked by the weight. Then ranking feature is grouped according to the density equalization, where the density of features in each group is the same. Finally, the Particle Swarm Optimization algorithm is used to search the ranking feature groups, and the feature selection is performed according to a new fitness function. Experimental results show that the random forest has the highest classification accuracy on the features selected. More importantly, it has the least number of features. In addition, experimental results on 2 medical datasets show that the average accuracy of random forest reaches 90.20%, which proves that the hybrid algorithm has a certain application value.

Particle Swarm Optimization Method for Optimal Prioritization of Pavement Sections for Maintenance and Rehabilitation Activities

2013 ◽  
Vol 343 ◽  
pp. 43-49 ◽  
Author(s):  
Jia Ruey Chang
Keyword(s):  
Particle Swarm Optimization ◽  
Standard Deviation ◽  
Particle Swarm ◽  
Cost Savings ◽  
Optimization Method ◽  
Alternative Solution ◽  
Swarm Optimization ◽  
Pavement Condition ◽  
Significant Time ◽  
Maintenance And Rehabilitation

Optimal prioritization of maintenance and rehabilitation (M&R) activities for pavement sections can enable significant time and cost-savings. In this study, we used the particle swarm optimization (PSO) method to achieve optimal prioritization of 135 pavement sections based on eight pavement condition parameters. The parameters included standard deviation (SD) for smoothness, rutting, deflections, cracking, pothole, bleeding, patching, and shoving. SD for smoothness, rutting, and deflections were inspected using instruments, while cracking, pothole, bleeding, patching, and shoving were surveyed visually. The PSO method was used to quickly calculate the synthetic pavement condition for each pavement section and then obtain the optimal prioritization of pavement sections. With this approach, pavement engineers are able to efficiently perform appropriate and timely M&R activities for pavement sections, according to their priority. This study provides an alternative solution to current approaches for prioritization of pavement sections.

Sign in / Sign up

Export Citation Format

Share Document