Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis

Abstract

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.

Global Search PSO to Analyze the Values of Cultural and Creative Industries

“…If the value is less than 0.5, the attribute does The operator is the encoding format of continuous attributes, and its range value is 0-1. If the range value is 0-0.4, the operator of this attribute is <; otherwise, it is ≥, and the generated attribute value will not exceed the range values of the various attributes [34,35].…”

“…Next, the validity of the rule set is guaranteed by applying the particle filtering algorithm. The rule set is input into the particle filtering algorithm to determine acceptable classification rules, and the particle fitness is recalculated and updated [30,34,35].…”

“…Hung and Maleki [4] applied group technology to the forging operations of the Tabriz Tractor Manufacturing Industry, and Holimchayachotiku et al [1] introduced the innovative idea of measuring value added along the supply chain using a collaborative method. Jamian et al [35] solved a series of complex problems using global PSO, and Jakubcová et al [36] found a better modification of the PSO algorithm using adaptive inertia weights. Perez-Cisneros et al [37] considered an estimation method for multi-objective programming, with many matching points and multiple solutions being simultaneously optimized.…”

Knee kinematic curve representation and application to knee pathology classification

“…Minimization of the simultaneous objective functions is done efficiently by particle swarm optimization, a method which, contrary to gradient descent, is generally robust to the presence of outlying data. [11] We have applied the resulting variational algorithm to knee osteoarthritis pathology classification in several experiments using distinct test data sets. The effectiveness of the algorithm was tested in terms of sensibility, specificity, and classification accuracy criteria.…”

A hybrid artificial bee colony algorithm for numerical function optimization

“…21 However, it is impossible to¯nd an optimization algorithm that can reach the global optimum for every optimization problem. 22 In order to address the disadvantages, several variants of ABC have been proposed to enhance the exploration and exploitation capability, convergence speed and avoid being trapped at the local optimum. [16][17][18]20,[23][24][25][26][27][28][29] The modi¯cations include changes on the ABC itself or hybridizing it with other optimization algorithms.…”