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.

scholarly journals DIMENSIONAMENTO DE REDES DE DISTRIBUIÇÃO DE ÁGUA MALHADAS VIA OTIMIZAÇÃO POR ENXAME DE PARTÍCULAS

Irriga ◽  
2018 ◽  
Vol 23 (4) ◽  
pp. 798-817
Author(s):  
Saulo de Tarso Marques Bezerra ◽  
José Eloim Silva de Macêdo
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Distribution Systems ◽  
Water Distribution ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Computational Time ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Irrigation Network

DIMENSIONAMENTO DE REDES DE DISTRIBUIÇÃO DE ÁGUA MALHADAS VIA OTIMIZAÇÃO POR ENXAME DE PARTÍCULAS     SAULO DE TARSO MARQUES BEZERRA1 E JOSÉ ELOIM SILVA DE MACÊDO2   1 Universidade Federal de Pernambuco, Campus Agreste, Núcleo de Tecnologia, Avenida Campina Grande, S/N, Bairro Nova Caruaru, CEP 55014-900, Caruaru, Pernambuco, Brasil. [email protected]. 2 Centro Universitário Maurício de Nassau, Departamento de Engenharia Civil, BR 104, Km 68, S/N, Bairro Agamenon Magalhães, CEP 55000-000, Caruaru, Pernambuco, Brasil. [email protected].     1 RESUMO   Apresenta-se, neste trabalho, um modelo de otimização para o dimensionamento de sistemas pressurizados de distribuição de água para projetos de irrigação. A metodologia empregada é fundamentada no algoritmo Otimização por Enxame de Partículas (PSO), que é inspirada na dinâmica e comportamento social observados em muitas espécies de pássaros, insetos e cardumes de peixes. O PSO proposto foi aplicado em dois benchmark problems reportados na literatura, que correspondem à Hanoi network e a um sistema de irrigação localizado na Espanha. O dimensionamento resultou, para as mesmas condições de contorno, na solução de ótimo global para a Hanoi network, enquanto a aplicação do PSO na Balerma irrigation network demonstrou que o método proposto foi capaz de encontrar soluções quase ótimas para um sistema de grande porte com um tempo computacional razoável.   Palavras-chave: água, irrigação, análise econômica.     BEZERRA, S. T. M.; MACÊDO, J. E. S. LOOPED WATER DISTRIBUTION NETWORKS DESIGN VIA PARTICLE SWARM OPTIMIZATION ALGORITHM     2 ABSTRACT   This paper presents an optimization model for the design of pressurized water distribution systems for irrigation projects. The methodology is based on the Particle Swarm Optimization algorithm (PSO), which is inspired by the social foraging behavior of some animals such as flocking behavior of birds and the schooling behavior of fish. The proposed PSO has been tested on two benchmark problems reported in the literature, which correspond to the Hanoi network and an irrigation system located in Spain. The design resulted in the global optimum for the Hanoi network, while the application of PSO in Balerma irrigation network demonstrated that the proposed method was able to find almost optimal solutions for a large-scale network with reasonable computational time.   Keywords: water, irrigation, economic analysis. O desempenho do método foi comparado com trabalhos prévios, demonstrando convergência rápida e resultados satisfatórios na busca da solução ótima de um sistema com elevado exigência computacional.

scholarly journals Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem

2016 ◽  
Vol 11 (1) ◽  
pp. 58-67 ◽  
Author(s):  
S Sarathambekai ◽  
K Umamaheswari
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Initial Population ◽  
Discrete Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Discrete Particle

Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization is the most commonly used method in majority of the evolutionary algorithms to generate solutions in the initial population. The initial good quality solutions can facilitate the algorithm to locate the optimal solution or else it may prevent the algorithm from finding the optimal solution. Intelligence should be incorporated to generate the initial population in order to avoid the premature convergence. This article presents a discrete particle swarm optimization algorithm, which incorporates opposition-based technique to generate initial population and greedy algorithm to balance the load of the processors. Make span, flow time, and reliability cost are three different measures used to evaluate the efficiency of the proposed discrete particle swarm optimization algorithm for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the proposed algorithm.

scholarly journals Multi/Many-Objective Particle Swarm Optimization Algorithm Based on Competition Mechanism

2020 ◽  
Vol 2020 ◽  
pp. 1-26
Author(s):  
Wusi Yang ◽  
Li Chen ◽  
Yi Wang ◽  
Maosheng Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Competition Mechanism ◽  
Multiobjective Particle Swarm Optimization

The recently proposed multiobjective particle swarm optimization algorithm based on competition mechanism algorithm cannot effectively deal with many-objective optimization problems, which is characterized by relatively poor convergence and diversity, and long computing runtime. In this paper, a novel multi/many-objective particle swarm optimization algorithm based on competition mechanism is proposed, which maintains population diversity by the maximum and minimum angle between ordinary and extreme individuals. And the recently proposed θ-dominance is adopted to further enhance the performance of the algorithm. The proposed algorithm is evaluated on the standard benchmark problems DTLZ, WFG, and UF1-9 and compared with the four recently proposed multiobjective particle swarm optimization algorithms and four state-of-the-art many-objective evolutionary optimization algorithms. The experimental results indicate that the proposed algorithm has better convergence and diversity, and its performance is superior to other comparative algorithms on most test instances.

Optimization of Neural Tree Based on an Improved Quantum Particle Swarm Optimization

2013 ◽  
Vol 475-476 ◽  
pp. 956-959 ◽  
Author(s):  
Hao Teng ◽  
Shu Hui Liu ◽  
Yue Hui Chen
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Quantum Particle Swarm Optimization ◽  
Local Optimal Solution

In the model of flexible neural tree (FNT), parameters are usually optimized by particle swarm optimization algorithm (PSO). Because PSO has many shortcomings such as being easily trapped in local optimal solution and so on, an improved algorithm based on quantum-behaved particle swarm optimization (QPSO) is presented. It is combined with the factor of speed, gather and disturbance, so as to be used to optimize the parameters of FNT. This paper applies the improved quantum particle swarm optimization algorithm to the neural tree, and compares it with the standard particle swarm algorithm in the optimization of FNT. The result shows that the proposed algorithm is with a better expression, thus improves the performance of the FNT.

scholarly journals Progressive Particle Swarm Optimization Algorithm for Solving Reactive Power Problem

2015 ◽  
Vol 1 (3) ◽  
pp. 125
Author(s):  
Kanagasabai Lenin ◽  
Bhumanapally Ravindhranath Reddy ◽  
Munagala Surya Kalavathi
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Reactive Power ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Test System ◽  
Position Vector ◽  
Swarm Optimization ◽  
Power Problem

In this paper a Progressive particle swarm optimization algorithm (PPS) is used to solve optimal reactive power problem. A Particle Swarm Optimization algorithm maintains a swarm of particles, where each particle has position vector and velocity vector which represents the potential solutions of the particles. These vectors are modernized from the information of global best (Gbest) and personal best (Pbest) of the swarm. All particles move in the search space to obtain optimal solution. In this paper a new concept is introduced of calculating the velocity of the particles with the help of Euclidian Distance conception. This new-fangled perception helps in finding whether the particle is closer to Pbest or Gbest and updates the velocity equation consequently. By this we plan to perk up the performance in terms of the optimal solution within a rational number of generations. The projected PPS has been tested on standard IEEE 30 bus test system and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss with control variables are within the limits.

scholarly journals Research on Microgrid Optimization Based on Simulated Annealing Particle Swarm Optimization

2019 ◽  
Vol 118 ◽  
pp. 01038
Author(s):  
Shuyi Li ◽  
Xifeng Zhou ◽  
Qiangang Guo
Keyword(s):  
Power Generation ◽  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Optimization Algorithm ◽  
Simulated Annealing Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Storage Device ◽  
Swarm Optimization

Based on the pursuit of different goals in the operation of the microgrid, it is not possible to meet the lowest cost and the least pollution at the same time. From the perspective of economy and environmental protection, a microgrid model including photovoltaic power generation, wind power generation, micro gas turbine, fuel cell and energy storage device is proposed. This paper establishes a comprehensive benefit objective function that considers both microgrid fuel cost, maintenance management cost, depreciation cost, interaction cost with public grid and pollutant treatment cost. In order to avoid the defect that the traditional particle swarm optimization algorithm is easy to fall into the local optimal solution, this paper uses the combination of simulated annealing algorithm and particle swarm optimization algorithm to compare with the traditional particle swarm optimization algorithm to obtain a more suitable method for microgrid operation. Finally, a typical microgrid in China is taken as an example to verify the feasibility of the algorithm.

scholarly journals A Novel Particle Swarm Optimization with Genetic Operator and Its Application to TSP

2021 ◽  
Vol 15 (4) ◽  
pp. 0-0
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Genetic Operators ◽  
Swarm Optimization ◽  
Genetic Operator ◽  
Hybrid Particle Swarm Optimization ◽  
The Traveling Salesman Problem

To solve some problems of particle swarm optimization, such as the premature convergence and falling into a sub-optimal solution easily, we introduce the probability initialization strategy and genetic operator into the particle swarm optimization algorithm. Based on the hybrid strategies, we propose a improved hybrid particle swarm optimization, namely IHPSO, for solving the traveling salesman problem. In the IHPSO algorithm, the probability strategy is utilized into population initialization. It can save much more computing resources during the iteration procedure of the algorithm. Furthermore, genetic operators, including two kinds of crossover operator and a directional mutation operator, are used for improving the algorithm’s convergence accuracy and population diversity. At last, the proposed method is benchmarked on 9 benchmark problems in TSPLIB and the results are compared with 4 competitors. From the results, it is observed that the proposed approach significantly outperforms others on most the 9 datasets.

scholarly journals An Airborne Multi-Sensor Task Allocation Method Based on Improved Particle Swarm Optimization Algorithm

2018 ◽  
Vol 36 (4) ◽  
pp. 722-727
Author(s):  
Guoqing Shi ◽  
Fan Wu ◽  
Lin Zhang ◽  
Shuyang Zhang ◽  
Cao Guo
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Task Allocation ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Allocation Model ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Allocation Method

The characteristics of airborne multi-sensor task allocation problem are analyzed, and an airborne multi-sensor task allocation model is established. In order to solve the problems of local convergence and slow convergence of the traditional Particle Swarm Optimization (PSO) algorithm, the structure and parameters of the existing Particle Swarm Optimization algorithm are adjusted, and the direction coefficient and far away factor are introduced to control the velocity and direction of the particle far away from the worst solution, so that the particle moves away from the worst solution while moving to the optimal solution. Based on the improved Particle Swarm Optimization algorithm, an airborne multi-sensor task allocation method is proposed using maximum detection probability as objective function, and the algorithm is simulated. The simulation results show that this algorithm can effectively allocate tasks and improve allocation effects.

Study of Simulation Test Generation Method Based on Improved Binary Particle Swarm Optimization Algorithm

2013 ◽  
Vol 823 ◽  
pp. 661-664
Author(s):  
Guang Yao Lian ◽  
Peng Cheng Yan ◽  
Jiang Sheng Sun ◽  
Kao Li Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Test Generation ◽  
Particle Swarm Optimization Algorithm ◽  
Fitness Function ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Binary Particle Swarm Optimization ◽  
Simulation Test ◽  
Swarm Optimization

To solve the backdating problem of traditional test generation methods, it puts forward a new test generation method based on improved binary particle swarm optimization algorithm in the paper. It estates the fitness function of test vector and faults in the circuits, and the optimal solution is the maximal value of the function. The experimentations prove that the method can reduce the compute quantity of test generation.

Sign in / Sign up

Export Citation Format

Share Document