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.

scholarly journals Knowledge-guided multiobjective particle swarm optimization with fusion learning strategies

2021 ◽  
Author(s):  
Wei Li ◽  
Xiang Meng ◽  
Ying Huang ◽  
Soroosh Mahmoodi
Keyword(s):  
Particle Swarm Optimization ◽  
Learning Strategies ◽  
Learning Strategy ◽  
Particle Swarm ◽  
Population Diversity ◽  
Selection Strategy ◽  
Rapid Loss ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization

AbstractMultiobjective particle swarm optimization (MOPSO) algorithm faces the difficulty of prematurity and insufficient diversity due to the selection of inappropriate leaders and inefficient evolution strategies. Therefore, to circumvent the rapid loss of population diversity and premature convergence in MOPSO, this paper proposes a knowledge-guided multiobjective particle swarm optimization using fusion learning strategies (KGMOPSO), in which an improved leadership selection strategy based on knowledge utilization is presented to select the appropriate global leader for improving the convergence ability of the algorithm. Furthermore, the similarity between different individuals is dynamically measured to detect the diversity of the current population, and a diversity-enhanced learning strategy is proposed to prevent the rapid loss of population diversity. Additionally, a maximum and minimum crowding distance strategy is employed to obtain excellent nondominated solutions. The proposed KGMOPSO algorithm is evaluated by comparisons with the existing state-of-the-art multiobjective optimization algorithms on the ZDT and DTLZ test instances. Experimental results illustrate that KGMOPSO is superior to other multiobjective algorithms with regard to solution quality and diversity maintenance.

A novel three layer particle swarm optimization for feature selection

2021 ◽  
pp. 1-15
Author(s):  
Chenye Qiu ◽  
Ning Liu
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Classification Accuracy ◽  
Particle Swarm ◽  
Population Diversity ◽  
Convergence Speed ◽  
Selection Strategy ◽  
Small Subset ◽  
Feature Subset ◽  
Swarm Optimization

Feature selection (FS) is a vital data preprocessing task which aims at selecting a small subset of features while maintaining a high level of classification accuracy. FS is a challenging optimization problem due to the large search space and the existence of local optimal solutions. Particle swarm optimization (PSO) is a promising technique in selecting optimal feature subset due to its rapid convergence speed and global search ability. But PSO suffers from stagnation or premature convergence in complex FS problems. In this paper, a novel three layer PSO (TLPSO) is proposed for solving FS problem. In the TLPSO, the particles in the swarm are divided into three layers according to their evolution status and particles in different layers are treated differently to fully investigate their potential. Instead of learning from those historical best positions, the TLPSO uses a random learning exemplar selection strategy to enrich the searching behavior of the swarm and enhance the population diversity. Further, a local search operator based on the Gaussian distribution is performed on the elite particles to improve the exploitation ability. Therefore, TLPSO is able to keep a balance between population diversity and convergence speed. Extensive comparisons with seven state-of-the-art meta-heuristic based FS methods are conducted on 18 datasets. The experimental results demonstrate the competitive and reliable performance of TLPSO in terms of improving the classification accuracy and reducing the number of features.

scholarly journals Particle Swarm Optimization Combined with Inertia-Free Velocity and Direction Search

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 597
Author(s):  
Kun Miao ◽  
Qian Feng ◽  
Wei Kuang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Small Region ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Local Searches ◽  
Engineering Design Problems ◽  
Direction Search

The particle swarm optimization algorithm (PSO) is a widely used swarm-based natural inspired optimization algorithm. However, it suffers search stagnation from being trapped into a sub-optimal solution in an optimization problem. This paper proposes a novel hybrid algorithm (SDPSO) to improve its performance on local searches. The algorithm merges two strategies, the static exploitation (SE, a velocity updating strategy considering inertia-free velocity), and the direction search (DS) of Rosenbrock method, into the original PSO. With this hybrid, on the one hand, extensive exploration is still maintained by PSO; on the other hand, the SE is responsible for locating a small region, and then the DS further intensifies the search. The SDPSO algorithm was implemented and tested on unconstrained benchmark problems (CEC2014) and some constrained engineering design problems. The performance of SDPSO is compared with that of other optimization algorithms, and the results show that SDPSO has a competitive performance.

Improved Particle Swarm Optimization Algorithm and its Application Based on the Aggregation Degree

2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Diversity ◽  
Function Optimization ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.

scholarly journals Convergence Analysis of Particle Swarm Optimizer and Its Improved Algorithm Based on Velocity Differential Evolution

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Hongtao Ye ◽  
Wenguang Luo ◽  
Zhenqiang Li
Keyword(s):  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Particle Velocity ◽  
Particle Swarm ◽  
Search Space ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Relationship Of ◽  
The Relationship ◽  
Improved Algorithm

This paper presents an analysis of the relationship of particle velocity and convergence of the particle swarm optimization. Its premature convergence is due to the decrease of particle velocity in search space that leads to a total implosion and ultimately fitness stagnation of the swarm. An improved algorithm which introduces a velocity differential evolution (DE) strategy for the hierarchical particle swarm optimization (H-PSO) is proposed to improve its performance. The DE is employed to regulate the particle velocity rather than the traditional particle position in case that the optimal result has not improved after several iterations. The benchmark functions will be illustrated to demonstrate the effectiveness of the proposed method.

scholarly journals Perbandingan Metode Gaussian Particle Swarm Optimization (GPSO) dan Lagrange Multiplier pada Masalah Economic Dispatch

2012 ◽  
Vol 3 (1) ◽  
pp. 228
Author(s):  
Siti Komsiyah
Keyword(s):  
Particle Swarm Optimization ◽  
Electric Power ◽  
Lagrange Multiplier ◽  
Economic Dispatch ◽  
Particle Swarm ◽  
Economic Planning ◽  
Electric Power System ◽  
Planning Problem ◽  
Swarm Optimization ◽  
Economic Dispatch Problem

On electric power system operation, economic planning problem is one variable to take into account due to operational cost efficiency. Economic Dispatch problem of electric power generation is discussed in this study to manage the output division on several units based on the the required load demand, with minimum operating cost yet is able to satisfy equality and inequality constraint of all units and system. In this study the Economic Dispatch problem which has non linear cost function is solved using swarm intelligent method is Gaussian Particle Swarm Optimization (GPSO) and Lagrange Multiplier. GPSO is a population-based stochastic algorithms which their moving is inspired by swarm intelligent and probabilities theories. To analize its accuracy, the Economic Dispatch solution by GPSO method is compared with Lagrange Multiplier method. From the test result it is proved that GPSO method gives economic planning calculation better than Lagrange Multiplier does.

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.

Sign in / Sign up

Export Citation Format

Share Document