scholarly journals A Generalization Belief Propagation Decoding Algorithm for Polar Codes Based on Particle Swarm Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Yingxian Zhang ◽  
Aijun Liu ◽  
Xiaofei Pan ◽  
Shi He ◽  
Chao Gong
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Belief Propagation ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Polar Codes ◽  
Decoding Algorithm ◽  
Swarm Optimization ◽  
Decoding Algorithms ◽  
Modifying Factors

We propose a generalization belief propagation (BP) decoding algorithm based on particle swarm optimization (PSO) to improve the performance of the polar codes. Through the analysis of the existing BP decoding algorithm, we first introduce a probability modifying factor to each node of the BP decoder, so as to enhance the error correcting capacity of the decoding. Then, we generalize the BP decoding algorithm based on these modifying factors and drive the probability update equations for the proposed decoding. Based on the new probability update equations, we show the intrinsic relationship of the existing decoding algorithms. Finally, in order to achieve the best performance, we formulate an optimization problem to find the optimal probability modifying factors for the proposed decoding algorithm. Furthermore, a method based on the modified PSO algorithm is also introduced to solve that optimization problem. Numerical results show that the proposed generalization BP decoding algorithm achieves better performance than that of the existing BP decoding, which suggests the effectiveness of the proposed decoding algorithm.

Convergence Analysis of Particle Swarm Optimization via Illustration Styles

2021 ◽  
pp. 29-37
Author(s):  
Wei-Der Chang ◽  
Keyword(s):  
Particle Swarm Optimization ◽  
Convergence Analysis ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Function Optimization ◽  
Evolutionary Computations ◽  
Swarm Optimization ◽  
Simulation Results ◽  
Population Based Algorithm

Particle swarm optimization (PSO) is the most important and popular algorithm to solving the engineering optimization problem due to its simple updating formulas and excellent searching capacity. This algorithm is one of evolutionary computations and is also a population-based algorithm. Traditionally, to demonstrate the convergence analysis of the PSO algorithm or its related variations, simulation results in a numerical presentation are often given. This way may be unclear or unsuitable for some particular cases. Hence, this paper will adopt the illustration styles instead of numeric simulation results to more clearly clarify the convergence behavior of the algorithm. In addition, it is well known that three parameters used in the algorithm, i.e., the inertia weight w, position constants c1 and c2, sufficiently dominate the whole searching performance. The influence of these parameter settings on the algorithm convergence will be considered and examined via a simple two-dimensional function optimization problem. All simulation results are displayed using a series of illustrations with respect to various iteration numbers. Finally, some simple rules on how to suitably assign these parameters are also suggested

A Method of Parameters Selecting in Robust Control Based on PSO Algorithm

2011 ◽  
Vol 320 ◽  
pp. 574-579
Author(s):  
Hua Li ◽  
Zhi Cheng Xu ◽  
Shu Qing Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Robust Control ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Satisfactory Performance ◽  
Novel Method ◽  
Simulation Results

Aiming at a kind of uncertainties of models in complex industry processes, a novel method for selecting robust parameters is stated in the paper. Based on the analysis, parameters selecting for robust control is reduced to be an object optimization problem, and the particle swarm optimization (PSO) is used for solving the problem, and the corresponding robust parameters are obtained. Simulation results show that the robust parameters designed by this method have good robustness and satisfactory performance.

A Novel Reactive Power Compensation Approach Based on Particle Swarm Optimization

2015 ◽  
Vol 740 ◽  
pp. 401-404
Author(s):  
Yun Zhi Li ◽  
Quan Yuan ◽  
Yang Zhao ◽  
Qian Hui Gang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Reactive Power ◽  
Power Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Particle Swarm Algorithm ◽  
Reactive Power Optimization ◽  
Swarm Optimization ◽  
Swarm Algorithm

The particle swarm optimization (PSO) algorithm as a stochastic search algorithm for solving reactive power optimization problem. The PSO algorithm converges too fast, easy access to local convergence, leading to convergence accuracy is not high, to study the particle swarm algorithm improvements. The establishment of a comprehensive consideration of the practical constraints and reactive power regulation means no power optimization mathematical model, a method using improved particle swarm algorithm for reactive power optimization problem, the algorithm weighting coefficients and inactive particles are two aspects to improve. Meanwhile segmented approach to particle swarm algorithm improved effectively address the shortcomings evolution into local optimum and search accuracy is poor, in order to determine the optimal reactive power optimization program.

scholarly journals Combination of Intermittent Search Strategy and an Improve Particle Swarm Optimization algorithm (IPSO) for damage detection of steel frame

2021 ◽  
Vol 16 (59) ◽  
pp. 141-152
Author(s):  
Cuong Le Thanh ◽  
Thanh Sang-To ◽  
Hoang-Le Hoang-Le ◽  
Tran-Thanh Danh ◽  
Samir Khatir ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Optimization Problem ◽  
Search Strategy ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Search Speed ◽  
Eagle Strategy

Modality and intermittent search strategy in combination with an Improve Particle Swarm Optimization algorithm (IPSO) to detect damage structure via using vibration analysis basic principle of a decline stiffness matrix a structure is presented in the study as a new technique. Unlike an optimization problem using a simplistic algorithm application, the combination leads to promising results. Interestingly, the PSO algorithm solves the optimal problem around the location determined previously. In contrast, Eagle Strategy (ES) is the charging of locating the position in intermittent space for the PSO algorithm to search locally. ES is easy to deal with its problem via drastic support of Levy flight. As known, the PSO algorithm has a fast search speed, yet the accuracy of the PSO algorithm is not as good as expected in many problems. Meanwhile, the combination is powerful to solve two problems: 1) avoiding local optimization, and 2) obtaining more accurate results. The paper compares the results obtained from the PSO algorithm with the combination of IPSO and ES for some problems and between experiment and FEM to demonstrate its effectiveness. Natural frequencies are used in the objective function to solve this optimization problem. The results show that the combination of IPSO and ES is quite effective.

Numerical function optimization by conditionalized PSO algorithm

2020 ◽  
Vol 39 (3) ◽  
pp. 3275-3295
Author(s):  
Yin Tianhe ◽  
Mohammad Reza Mahmoudi ◽  
Sultan Noman Qasem ◽  
Bui Anh Tuan ◽  
Kim-Hung Pho
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Function Optimization ◽  
Numerical Function ◽  
Problem Space ◽  
Swarm Optimization ◽  
Speed Up ◽  
Suboptimal Solution

A lot of research has been directed to the new optimizers that can find a suboptimal solution for any optimization problem named as heuristic black-box optimizers. They can find the suboptimal solutions of an optimization problem much faster than the mathematical programming methods (if they find them at all). Particle swarm optimization (PSO) is an example of this type. In this paper, a new modified PSO has been proposed. The proposed PSO incorporates conditional learning behavior among birds into the PSO algorithm. Indeed, the particles, little by little, learn how they should behave in some similar conditions. The proposed method is named Conditionalized Particle Swarm Optimization (CoPSO). The problem space is first divided into a set of subspaces in CoPSO. In CoPSO, any particle inside a subspace will be inclined towards its best experienced location if the particles in its subspace have low diversity; otherwise, it will be inclined towards the global best location. The particles also learn to speed-up in the non-valuable subspaces and to speed-down in the valuable subspaces. The performance of CoPSO has been compared with the state-of-the-art methods on a set of standard benchmark functions.

Influence of Optimization Algorithm on Airfoil Shape Optimization of Aircraft Wings

2012 ◽  
Vol 232 ◽  
pp. 614-619
Author(s):  
R. Mukesh ◽  
K. Lingadurai ◽  
K. Elamvaluthi
Keyword(s):  
Particle Swarm Optimization ◽  
Shape Optimization ◽  
Optimization Algorithm ◽  
Optimization Problem ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Aerodynamic Shape Optimization ◽  
Swarm Optimization ◽  
Shape Optimization Problem ◽  
Aerodynamic Shape

Computational fluid dynamics (CFD) is one of the computer-based solution methods which are more widely employed in aerospace engineering. The computational power and time required to carry out the analysis increases as the fidelity of the analysis increases. Aerodynamic shape optimization has become a vital part of aircraft design in the recent years. The Method of search algorithms or optimization algorithms is one of the most important parameters which will strongly influence the fidelity of the solution during an aerodynamic shape optimization problem. Nowadays various optimization methods such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO) etc., are more widely employed to solve the aerodynamic shape optimization problems. In addition to the optimization method, the geometry parameterisation becomes an important factor to be considered during the aerodynamic shape optimization process. Generally if we want to optimize an airfoil we have to describe the airfoil and for that, we need to have at least hundred points of x and y co-ordinates. It is really difficult to optimize airfoils with this large number of co-ordinates. Nowadays many different schemes of parameter sets are used to describe general airfoil such as B-spline, Hicks- Henne Bump function, PARSEC etc. The main goal of these parameterization schemes is to reduce the number of needed parameters as few as possible while controlling the important aerodynamic features effectively. Here the work has been done on the PARSEC geometry representation method. The objective of this work is to introduce the knowledge of describing general airfoil using twelve parameters by representing its shape as a polynomial function. And also we have introduced the concept of Particle Swarm optimization Algorithm which is one kind of Non-Traditional Optimization technique to optimize the aerodynamic characteristics of a general airfoil for specific conditions. An aerodynamic shape optimization problem is formulated for NACA 2411 airfoil and solved using the method of Particle Swarm Optimization for 5.0 deg angle of attack. A MATLAB program has been developed to implement PARSEC, Panel Technique, and PSO Algorithm. This program has been tested for a standard NACA 2411 airfoil and optimized to improve its coefficient of lift. Pressure distribution and co-efficient of lift for airfoil geometries has been calculated using panel method. NACA 2411 airfoil has been generated using PARSEC and optimized for 5.0 deg angle of attack using PSO Algorithm. The results show that the particle swarm optimization scheme is more effective in finding the optimum solution among the various possible solutions.

scholarly journals Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Jiaxi Wang ◽  
Boliang Lin ◽  
Junchen Jin
Keyword(s):  
Particle Swarm Optimization ◽  
High Speed ◽  
Optimization Problem ◽  
Particle Swarm Optimization Algorithm ◽  
Programming Model ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Enhanced Particle Swarm Optimization ◽  
Multiple Units

The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO) algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality.

scholarly journals Production Scheduling of Open Pit Mines Using Particle Swarm Optimization Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Asif Khan ◽  
Christian Niemann-Delius
Keyword(s):  
Particle Swarm Optimization ◽  
Production Scheduling ◽  
Optimization Problem ◽  
Planning Process ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Open Pit ◽  
Swarm Optimization ◽  
Open Pit Mines ◽  
Hard And Soft Constraints

Determining an optimum long term production schedule is an important part of the planning process of any open pit mine; however, the associated optimization problem is demanding and hard to deal with, as it involves large datasets and multiple hard and soft constraints which makes it a large combinatorial optimization problem. In this paper a procedure has been proposed to apply a relatively new and computationally less expensive metaheuristic technique known as particle swarm optimization (PSO) algorithm to this computationally challenging problem of the open pit mines. The performance of different variants of the PSO algorithm has been studied and the results are presented.

scholarly journals A New Hybrid Nelder-Mead Particle Swarm Optimization for Coordination Optimization of Directional Overcurrent Relays

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
An Liu ◽  
Ming-Ta Yang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Operating Time ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Search Method ◽  
Swarm Optimization ◽  
Simplex Search ◽  
Simplex Search Method ◽  
Overcurrent Relays

Coordination optimization of directional overcurrent relays (DOCRs) is an important part of an efficient distribution system. This optimization problem involves obtaining the time dial setting (TDS) and pickup current (Ip) values of each DOCR. The optimal results should have the shortest primary relay operating time for all fault lines. Recently, the particle swarm optimization (PSO) algorithm has been considered an effective tool for linear/nonlinear optimization problems with application in the protection and coordination of power systems. With a limited runtime period, the conventional PSO considers the optimal solution as the final solution, and an early convergence of PSO results in decreased overall performance and an increase in the risk of mistaking local optima for global optima. Therefore, this study proposes a new hybrid Nelder-Mead simplex search method and particle swarm optimization (proposed NM-PSO) algorithm to solve the DOCR coordination optimization problem. PSO is the main optimizer, and the Nelder-Mead simplex search method is used to improve the efficiency of PSO due to its potential for rapid convergence. To validate the proposal, this study compared the performance of the proposed algorithm with that of PSO and original NM-PSO. The findings demonstrate the outstanding performance of the proposed NM-PSO in terms of computation speed, rate of convergence, and feasibility.

Sign in / Sign up

Export Citation Format

Share Document