scholarly journals A Dynamic Multi-Swarm Particle Swarm Optimization with Global Detection Mechanism

2021 ◽  
Vol 15 (4) ◽  
pp. 0-0
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Superior Performance ◽  
Detection Mechanism ◽  
Swarm Optimization ◽  
Information Interaction ◽  
Standard Particle Swarm Optimization ◽  
Comparison Results ◽  
Different Types ◽  
Average Fitness

To overcome the shortcomings of the standard particle swarm optimization algorithm (PSO), such as premature convergence and low precision, a dynamic multi-swarm PSO with global detection mechanism (DMS-PSO-GD) is proposed. In DMS-PSO-GD, the whole population is divided into two kinds of sub-swarms: several same-sized dynamic sub-swarms and a global sub-swarm. The dynamic sub-swarms achieve information interaction and sharing among themselves through the randomly regrouping strategy. The global sub-swarm evolves independently and learns from the optimal individuals of the dynamic sub-swarm with dominant characteristics. During the evolution process of the population, the variances and average fitness values of dynamic sub-swarms are used for measuring the distribution of the particles, by which the dominant one and the optimal individual can be detected easily. The comparison results among DMS-PSO-GD and other 5 well-known algorithms suggest that it demonstrates superior performance for solving different types of functions.

scholarly journals An Advanced Chemical Reaction Optimization Algorithm Based on Balanced Local and Global Search

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Min Zhang ◽  
Liang Chen ◽  
Xin Chen
Keyword(s):  
Particle Swarm Optimization ◽  
Chemical Reaction ◽  
Optimization Algorithm ◽  
Particle Swarm ◽  
Global Search ◽  
Superior Performance ◽  
Chemical Reaction Optimization ◽  
Swarm Optimization ◽  
Reaction Optimization ◽  
Comparison Results

An advanced chemical reaction optimization algorithm based on balanced local search and global search is proposed, which combines the advantages of adaptive chemical reaction optimization (ACRO) and particle swarm optimization (PSO), to solve continuous optimization problems. This new optimization is mainly based on the framework of ACRO, with PSO’s global search operator applied as part of ACRO’s neighborhood search operator. Moreover, a “finish” operator is added to the ACRO’s structure and the search operator is evolved by an adaptive scheme. The simulation results tested on a set of twenty-three benchmark functions, and a comparison was made with the results of a newly proposed hybrid algorithm based on chemical reaction optimization (CRO) and particle swarm optimization (denoted as HP-CRO). The finial comparison results show the superior performance improvement over HP-CRO in most experiments.

scholarly journals Multi-Objective Power Distribution Network Reconfiguration using Chaotic Fractional Particle Swarm Optimization

2021 ◽  
Vol 19 (1) ◽  
pp. 43-50
Author(s):  
Yashar Mousavi ◽  
Mohammad Hosein Atazadegan ◽  
Arash Mousavi
Keyword(s):  
Particle Swarm Optimization ◽  
Power Distribution ◽  
Distribution Network ◽  
Particle Swarm ◽  
Superior Performance ◽  
Network Reconfiguration ◽  
Power Distribution Network ◽  
Swarm Optimization ◽  
Distribution Network Reconfiguration ◽  
Multi Objective

Optimization of power distribution system reconfiguration is addressed as a multi-objective problem, which considers the system losses along with other objectives, and provides a viable solution for improvement of technical and economic aspects of distribution systems. A multi-objective chaotic fractional particle swarm optimization customized for power distribution network reconfiguration has been applied to reduce active power loss, improve the voltage profile, and increase the load balance in the system through deterministic and stochastic structures. In order to consider the prediction error of active and reactive loads in the network, it is assumed that the load behaviour follows the normal distribution function. An attempt is made to consider the load forecasting error on the network to reach the optimal point for the network in accordance with the reality. The efficiency and feasibility of the proposed method is studied through standard IEEE 33-bus and 69-bus systems. In comparison with other methods, the proposed method demonstrated superior performance by reducing the voltage deviation and power losses. It also achieved better load balancing.

scholarly journals Internet of Things Energy Efficient Cluster-Based Routing Using Hybrid Particle Swarm Optimization for Wireless Sensor Network

2021 ◽  
Author(s):  
Senthil G A ◽  
Arun Raaza ◽  
N Kumar
Keyword(s):  
Particle Swarm Optimization ◽  
Internet Of Things ◽  
Optimal Path ◽  
Particle Swarm ◽  
Base Station ◽  
Superior Performance ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Swarm Optimization ◽  
Hybrid Particle Swarm Optimization

Abstract Specialized transducers in Wireless Sensor Networks (WSNs) that offer sensing services to the Internet of Things (IoT) devices have limited storage and energy resources. One of the most vital issues in WSN design is power usage, as it is nearly impossible to recharge or replace sensor nodes’ batteries. A prominent role in conserving power for energy-constrained networks is served by the clustering algorithm. It is possible to reduce network energy usage and network lifespan prolongation by proper balancing of the network load with Cluster Head (CH) election. The single-hop inter-cluster routing technique, in which there is a direct transfer from CHs to the Base Station (BS), is done by the Low Energy Adaptive Clustering Hierarchy (LEACH). However, for networks with large-regions, this technique is not viable. An optimized Orphan-LEACH (O-LEACH) has been proposed in this work to facilitate the formation of a novel process of clustering, which can result in minimized usage of energy as well as enhanced network longevity. Sufficient energy is possessed by the orphan node, which will attempt to be cover the network. The proposed work’s primary novel contribution is the O-LEACH protocol that supplies the entire network’s coverage with the least number of orphaned nodes and has extremely high connectivity rates. A hybrid optimization utilizing Simulated Annealing (SA) with Lightning Search Algorithm (LSA) (SA-LSA), and Particle Swarm Optimization (PSO) with LSA (PSO-LSA) Algorithm is proposed. These proposed techniques effectivelymanage the CH election achieving optimal path routing and minimization in energy usage, resulting in the enhanced lifespan of the WSN. The proposed technique’s superior performance, when compared with other techniques, is confirmed from the outcomes of the experimentations.

scholarly journals Employing particle swarm optimization algorithm for shrinkage parameter estimation in generalized Liu estimator

2020 ◽  
Vol 8 (1) ◽  
pp. 10
Author(s):  
Qamar Abdulkareem Abdulazeez ◽  
Zakariya Yahya Algamal
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Optimization Method ◽  
Least Square ◽  
Superior Performance ◽  
Ridge Estimator ◽  
Swarm Optimization ◽  
Liu Estimator ◽  
Ordinary Least Square ◽  
Parameter Matrix

It is well-known that in the presence of multicollinearity, the Liu estimator is an alternative to the ordinary least square (OLS) estimator and the ridge estimator. Generalized Liu estimator (GLE) is a generalization of the Liu estimator. However, the efficiency of GLE depends on appropriately choosing the shrinkage parameter matrix which is involved in the GLE. In this paper, a particle swarm optimization method, which is a metaheuristic continuous algorithm, is proposed to estimate the shrinkage parameter matrix. The simulation study and real application results show the superior performance of the proposed method in terms of prediction error.   

scholarly journals Greedy Mechanism Based Particle Swarm Optimization for Path Planning Problem of an Unmanned Surface Vehicle

Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4620 ◽  
Author(s):  
Junfeng Xin ◽  
Jiabao Zhong ◽  
Shixin Li ◽  
Jinlu Sheng ◽  
Ying Cui
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Population Diversity ◽  
Superior Performance ◽  
Selection Strategy ◽  
Planning Problem ◽  
Swarm Optimization ◽  
Change Environment ◽  
Local Searches ◽  
Improved Algorithm

Recently, issues of climate change, environment abnormality, individual requirements, and national defense have caused extensive attention to the commercial, scientific, and military development of unmanned surface vehicles (USVs). In order to design high-quality routes for a multi-sensor integrated USV, this work improves the conventional particle swarm optimization algorithm by introducing the greedy mechanism and the 2-opt operation, based on a combination strategy. First, a greedy black box is established for particle initialization, overcoming the randomness of the conventional method and excluding a great number of infeasible solutions. Then the greedy selection strategy and 2-opt operation are adopted together for local searches, to maintain population diversity and eliminate path crossovers. In addition, Monte-Carlo simulations of eight instances are conducted to compare the improved algorithm with other existing algorithms. The computation results indicate that the improved algorithm has the superior performance, with the shortest route and satisfactory robustness, although a fraction of computing efficiency becomes sacrificed. Moreover, the effectiveness and reliability of the improved method is also verified by its multi-sensor-based application to a USV model in real marine environments.

Particle Swarm Optimization with Team Spirit Inertia Weight

2011 ◽  
Vol 383-390 ◽  
pp. 5744-5750
Author(s):  
Xi Zhen Wang ◽  
Yan Li ◽  
Gang Hu Cheng
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Convergence Problem ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Standard Particle Swarm Optimization ◽  
Decline Curves ◽  
Team Spirit ◽  
Global And Local

A PSO Algorithm with Team Spirit Inertia weight (TSWPSO) is presented based on the study of the effect of inertia weight on Standard Particle Swarm Optimization (SPSO). Due to the theory of group in organization psychology, swarm is divided into multiple sub-swarms and search is run in a number of different sub-swarms which are parallel performed. Try to find or modify a curve which is compatible with optimized object within many inertia weight decline curves, in order to balance the global and local explorations ability in particle swarm optimization and to avoid the premature convergence problem effectively. The testes by five classical functions show that, TSWPSO has a better performance in both the convergence rate and the precision.

Application of Quantum-Behaved Particle Swarm Optimization in Engineering Constrained Optimization Problems

2011 ◽  
Vol 383-390 ◽  
pp. 7208-7213
Author(s):  
De Kun Tan
Keyword(s):  
Particle Swarm Optimization ◽  
Constrained Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Local Optima ◽  
Standard Particle Swarm Optimization ◽  
Fixed Path

To overcome the shortage of standard Particle Swarm Optimization(SPSO) on premature convergence, Quantum-behaved Particle Swarm Optimization (QPSO) is presented to solve engineering constrained optimization problem. QPSO algorithm is a novel PSO algorithm model in terms of quantum mechanics. The model is based on Delta potential, and we think the particle has the behavior of quanta. Because the particle doesn’t have a certain trajectory, it has more randomicity than the particle which has fixed path in PSO, thus the QPSO more easily escapes from local optima, and has more capability to seek the global optimal solution. In the period of iterative optimization, outside point method is used to deal with those particles that violate the constraints. Furthermore, compared with other intelligent algorithms, the QPSO is verified by two instances of engineering constrained optimization, experimental results indicate that the algorithm performs better in terms of accuracy and robustness.

Sign in / Sign up

Export Citation Format

Share Document