scholarly journals Smart City Landscape Design Based on Improved Particle Swarm Optimization Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Wenting Yao ◽  
Yongjun Ding
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Particle Swarm Algorithm ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Particle Swarms ◽  
Standard Particle Swarm Optimization ◽  
Population Dispersion

Aiming at the shortcomings of standard particle swarm optimization (PSO) algorithms that easily fall into local optimum, this paper proposes an optimization algorithm (LTQPSO) that improves quantum behavioral particle swarms. Aiming at the problem of premature convergence of the particle swarm algorithm, the evolution speed of individual particles and the population dispersion are used to dynamically adjust the inertia weights to make them adaptive and controllable, thereby avoiding premature convergence. At the same time, the natural selection method is introduced into the traditional position update formula to maintain the diversity of the population, strengthen the global search ability of the LTQPSO algorithm, and accelerate the convergence speed of the algorithm. The improved LTQPSO algorithm is applied to landscape trail path planning, and the research results prove the effectiveness and feasibility of the algorithm.

A Novel Particle Swarm Optimization with Random Parameters

2013 ◽  
Vol 631-632 ◽  
pp. 1324-1329
Author(s):  
Shao Rong Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Iteration Process ◽  
Local Optimum ◽  
Random Parameters ◽  
Swarm Optimization ◽  
Standard Particle Swarm Optimization ◽  
Fast Convergence Rate

To improve the performance of standard particle swarm optimization algorithm that is easily trapped in local optimum, based on analyzing and comparing with all kinds of algorithm parameter settings strategy, this paper proposed a novel particle swarm optimization algorithm which the inertia weight (ω) and acceleration coefficients (c1 and c2) are generated as random numbers within a certain range in each iteration process. The experimental results show that the new method is valid with a high precision and a fast convergence rate.

scholarly journals A Parallel Adaptive Particle Swarm Optimization Algorithm for Economic/Environmental Power Dispatch

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Jinchao Li ◽  
Jinying Li ◽  
Dongxiao Niu ◽  
Yunna Wu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Evolutionary Process ◽  
Particle Swarm Algorithm ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Adaptive Particle Swarm Optimization ◽  
Power Dispatch

A parallel adaptive particle swarm optimization algorithm (PAPSO) is proposed for economic/environmental power dispatch, which can overcome the premature characteristic, the slow-speed convergence in the late evolutionary phase, and lacking good direction in particles’ evolutionary process. A search population is randomly divided into several subpopulations. Then for each subpopulation, the optimal solution is searched synchronously using the proposed method, and thus parallel computing is realized. To avoid converging to a local optimum, a crossover operator is introduced to exchange the information among the subpopulations and the diversity of population is sustained simultaneously. Simulation results show that the proposed algorithm can effectively solve the economic/environmental operation problem of hydropower generating units. Performance comparisons show that the solution from the proposed method is better than those from the conventional particle swarm algorithm and other optimization algorithms.

A Diversity Guided Particles Swarm Optimization

2012 ◽  
Vol 532-533 ◽  
pp. 1429-1433
Author(s):  
Na Li ◽  
Yuan Xiang Li
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Population Diversity ◽  
Premature Convergence ◽  
Local Optimum ◽  
Convergence Problem ◽  
Swarm Optimization ◽  
Search Capability

A new particle swarm optimization algorithm (a diversity guided particles swarm Optimization), which is guided by population diversity, is proposed. In order to overcome the premature convergence of the algorithm, a metric to measure the swarm diversity is designed, the update of velocity and position of particles is controlled by this criteria, and the four sub-processes are introduced in the process of updating in order to increase the swarm diversity, which enhance to the ability of particle swarm optimization algorithm (PSO) to break away from the local optimum. The experimental results exhibit that the new algorithm not only has great advantage of global search capability, but also can avoid the premature convergence problem effectively.

Compressed Sensing Image Reconstruction Based on Improved Particle Swarm Optimization Algorithm

2014 ◽  
Vol 599-601 ◽  
pp. 1453-1456
Author(s):  
Ju Wang ◽  
Yin Liu ◽  
Wei Juan Zhang ◽  
Kun Li
Keyword(s):  
Particle Swarm Optimization ◽  
Image Reconstruction ◽  
Compressed Sensing ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Matching Pursuit ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The reconstruction algorithm has a hot research in compressed sensing. Matching pursuit algorithm has a huge computational task, when particle swarm optimization has been put forth to find the best atom, but it due to the easy convergence to local minima, so the paper proposed a algorithm ,which based on improved particle swarm optimization. The algorithm referred above combines K-mean and particle swarm optimization algorithm. The algorithm not only effectively prevents the premature convergence, but also improves the K-mean’s local. These findings indicated that the algorithm overcomes premature convergence of particle swarm optimization, and improves the quality of image reconstruction.

Self-Adaptive Particle Swarm Optimization Algorithm with Mutation Operation Based on K-Means

2013 ◽  
Vol 760-762 ◽  
pp. 2194-2198 ◽  
Author(s):  
Xue Mei Wang ◽  
Yi Zhuo Guo ◽  
Gui Jun Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Adaptive Particle Swarm Optimization ◽  
Inertia Weight ◽  
Clustering Quality ◽  
Mutation Operation

Adaptive Particle Swarm Optimization algorithm with mutation operation based on K-means is proposed in this paper, this algorithm Combined the local searching optimization ability of K-means with the gobal searching optimization ability of Particle Swarm Optimization, the algorithm self-adaptively adjusted inertia weight according to fitness variance of population. Mutation operation was peocessed for the poor performative particle in population. The results showed that the algorithm had solved the poblems of slow convergence speed of traditional Particle Swarm Optimization algorithm and easy falling into the local optimum of K-Means, and more effectively improved clustering quality.

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 Power load forecasting algorithm based on nonlinear inertial factor change pattern particle swarm optimization algorithm

2018 ◽  
Vol 173 ◽  
pp. 02016
Author(s):  
Jin Liang ◽  
Wang Yongzhi ◽  
Bao Xiaodong
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Load Forecasting ◽  
Particle Swarm ◽  
Support Vector ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Power Load ◽  
Selection Of

The common method of power load forecasting is the least squares support vector machine, but this method is very dependent on the selection of parameters. Particle swarm optimization algorithm is an algorithm suitable for optimizing the selection of support vector parameters, but it is easy to fall into the local optimum. In this paper, we propose a new particle swarm optimization algorithm, it uses non-linear inertial factor change that is used to optimize the algorithm least squares support vector machine to avoid falling into the local optimum. It aims to make the prediction accuracy of the algorithm reach the highest. The experimental results show this method is correct and effective.

scholarly journals Application of Simulated Annealing Particle Swarm Optimization Based on Correlation in Parameter Identification of Induction Motor

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Lei Wang ◽  
Yongqiang Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Optimization Algorithm ◽  
Simulated Annealing Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Correlation Algorithm ◽  
Annealing Algorithm

The strengths and weaknesses of correlation algorithm, simulated annealing algorithm, and particle swarm optimization algorithm are studied in this paper. A hybrid optimization algorithm is proposed by drawing upon the three algorithms, and the specific application processes are given. To extract the current fundamental signal, the correlation algorithm is used. To identify the motor dynamic parameter, the filtered stator current signal is simulated using simulated annealing particle swarm algorithm. The simulated annealing particle swarm optimization algorithm effectively incorporates the global optimization ability of simulated annealing algorithm with the fast convergence of particle swarm optimization by comparing the identification results of asynchronous motor with constant torque load and step load.

Hybrid Particle Swarm Optimization Algorithm Merging Simulated Annealing and Mountain-Climb Searching

2014 ◽  
Vol 651-653 ◽  
pp. 2159-2163
Author(s):  
Jia Xing You ◽  
Ji Li Chen ◽  
Ming Gang Dong
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Local Search ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Swarm Optimization ◽  
Hybrid Particle ◽  
Hybrid Particle Swarm Optimization

To solve the problem of standard particle swarm optimization (PSO) easy turn to premature convergence and poor ability in local search, this paper present a hybrid particle swarm optimization algorithm merging simulated annealing (SA) and mountain-climb. During the running time, the algorithm use the pso to find the global optimal position quickly, take advantage of the Gaussian mutation and mountain-climb strategy to enhance local search ability, and combine with SA to strengthen the population diversity to enable particles to escape from local minima. Test results on several typical test functions show that this new algorithm has a significant improve in searching ability and effectively overcome the premature convergence problem.

Sign in / Sign up

Export Citation Format

Share Document