Circuit Design Based on Particle Swarm Optimization Algorithms

2011 ◽  
Vol 474-476 ◽  
pp. 1093-1098 ◽  
Author(s):  
Xue Song Yan ◽  
Qing Hua Wu ◽  
Cheng Yu Hu ◽  
Qing Zhong Liang
Keyword(s):  
Particle Swarm Optimization ◽  
Circuit Design ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Random Solution ◽  
Swarm Optimization ◽  
Fish Schools ◽  
Optimum Solution ◽  
Evolutionary Electronics ◽  
Modified Pso

This work investigates the application of Particle Swarm Optimization (PSO) algorithms in the field of evolutionary electronics. PSO was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. PSO achieves its optimum solution by starting from a group of random solution and then searching repeatedly. We propose the new means for designing electronic circuits and introduce the modified PSO algorithm. For the case studies this means has proved to be efficient, experiments show that we have better results.

A dynamic particle swarm optimization method applied to global optimizations of engineering inverse problem

2018 ◽  
Vol 37 (1) ◽  
pp. 98-117 ◽  
Author(s):  
Shafiullah Khan ◽  
Shiyou Yang ◽  
Obaid Ur Rehman
Keyword(s):  
Inverse Problem ◽  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Optimization Method ◽  
Swarm Optimization ◽  
Content Type ◽  
Novel Strategy ◽  
Modified Pso

Purpose The aim of this paper is to explore the potential of particle swarm optimization (PSO) algorithm to solve an electromagnetic inverse problem. Design/methodology/approach A modified PSO algorithm is designed. Findings The modified PSO algorithm is a more stable, robust and efficient global optimizer for solving the well-known benchmark optimization problems. The new mutation approach preserves the diversity of the population, whereas the proposed dynamic and adaptive parameters maintain a good balance between the exploration and exploitation searches. The numerically experimental results of two case studies demonstrate the merits of the proposed algorithm. Originality/value Some improvements, such as the design of a new global mutation mechanism and introducing a novel strategy for learning and control parameters, are proposed.

A Particle Swarm Optimization with Variety Factor

2012 ◽  
Vol 239-240 ◽  
pp. 1291-1297 ◽  
Author(s):  
Hai Sheng Qin ◽  
Deng Yue Wei ◽  
Jun Hui Li ◽  
Lei Zhang ◽  
Yan Qiang Feng
Keyword(s):  
Particle Swarm Optimization ◽  
Convergence Property ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Premature Convergence ◽  
Simulation Experiments ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Previous Algorithm ◽  
Modified Pso

A new particle swarm optimization (PSO) algorithm (a PSO with Variety Factor, VFPSO) based on the PSO was proposed. Compared with the previous algorithm, the proposed algorithm is to update the Variety Factor and to improve the inertia weight of the PSO. The target of the improvement is that the new algorithm could go on enhancing the robustness as before and should reduce the risk of premature convergence. The simulation experiments show that it has great advantages of convergence property over some other modified PSO algorithms, and also avoids algorithm being trapped in local minimum effectively. So it can avoid the phenomenon of premature convergence.

scholarly journals Particle Swarm Optimization: A survey of Historical and Recent Developments with Hybridization Perspectives

2018 ◽  
Author(s):  
Saptarshi Sengupta ◽  
Sanchita Basak ◽  
Richard Alan Peters
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Interested Reader ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Fish Schools ◽  
Deterministic Algorithms ◽  
Multidimensional Problems ◽  
Recent Developments

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the very recent state–of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

scholarly journals Particle Swarm Optimization: A Survey of Historical and Recent Developments with Hybridization Perspectives

2018 ◽  
Vol 1 (1) ◽  
pp. 157-191 ◽  
Author(s):  
Saptarshi Sengupta ◽  
Sanchita Basak ◽  
Richard Peters
Keyword(s):  
Particle Swarm Optimization ◽  
State Of The Art ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Fish Schools ◽  
Deterministic Algorithms ◽  
Multidimensional Problems ◽  
Recent Developments

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems that cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment, and improvements of its most basic as well as some of the very recent state-of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

scholarly journals Efficient Energy Load Distribution Model using Modified Particle Swarm Optimization Algorithm

2021 ◽  
Vol 2 (4) ◽  
pp. 226-231
Author(s):  
Vijayakumar T ◽  
Vinothkanna R
Keyword(s):  
Power Generation ◽  
Particle Swarm Optimization ◽  
Electric Power ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Economic Load Dispatch ◽  
Electric Power Generation ◽  
Swarm Optimization ◽  
Modified Particle Swarm Optimization ◽  
Modified Pso

Reduction of emission and energy conservation plays a major role in the current power system for realizing sustainable socio-economic development. The application prospects and practical significance of economic load dispatch issue in the electric power market is remarkable. The various generating sets must be assigned with load capacity in a reasonable manner for reducing the cost of electric power generation. This problem may be overcome by the proposed modified particle swarm optimization (PSO) algorithm. The practical issue is converted and modelled into its corresponding mathematical counterpart by establishing certain constraints. Further, a novel interdependence strategy along with a modified PSO algorithm is implemented for balancing the local search capability and global optimization. Multiple swarms are introduced in the modified PSO algorithm. Certain standard test functions are executed for specific analysis. Finally, the proposed modified PSO algorithm can optimize the economic load dispatch problem while saving the energy resources to a larger extent. The algorithm evaluation can be performed using real-time examples for verifying the efficiency. When compared to existing schemes like artificial bee colony (ABC), genetic algorithms (GAs), and conventional PSO algorithms, the proposed scheme offers lowest electric power generation cost and overcomes the load dispatch issue according to the simulation results.

Operation sequencing optimization for five-axis prismatic parts using a particle swarm optimization approach

2009 ◽  
Vol 223 (5) ◽  
pp. 485-497 ◽  
Author(s):  
Y W Guo ◽  
A R Mileham ◽  
G W Owen ◽  
P G Maropoulos ◽  
W D Li
Keyword(s):  
Particle Swarm Optimization ◽  
Process Planning ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Search Space ◽  
Operation Sequencing ◽  
Swarm Optimization ◽  
Process Plan ◽  
Five Axis ◽  
Modified Pso

Operation sequencing is one of the crucial tasks in process planning. However, it is an intractable process to identify an optimized operation sequence with minimal machining cost in a vast search space constrained by manufacturing conditions. Also, the information represented by current process plan models for three-axis machining is not sufficient for five-axis machining owing to the two extra degrees of freedom and the difficulty of set-up planning. In this paper, a representation of process plans for five-axis machining is proposed, and the complicated operation sequencing process is modelled as a combinatorial optimization problem. A modern evolutionary algorithm, i.e. the particle swarm optimization (PSO) algorithm, has been employed and modified to solve it effectively. Initial process plan solutions are formed and encoded into particles of the PSO algorithm. The particles ‘fly’ intelligently in the search space to achieve the best sequence according to the optimization strategies of the PSO algorithm. Meanwhile, to explore the search space comprehensively and to avoid being trapped into local optima, several new operators have been developed to improve the particle movements to form a modified PSO algorithm. A case study used to verify the performance of the modified PSO algorithm shows that the developed PSO can generate satisfactory results in optimizing the process planning problem.

Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review

2017 ◽  
Vol 25 (1) ◽  
pp. 1-54 ◽  
Author(s):  
Mohammad Reza Bonyadi ◽  
Zbigniew Michalewicz
Keyword(s):  
Particle Swarm Optimization ◽  
Future Study ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
High Impact ◽  
Swarm Optimization ◽  
Continuous Space ◽  
Modified Pso ◽  
Single Objective

This paper reviews recent studies on the Particle Swarm Optimization (PSO) algorithm. The review has been focused on high impact recent articles that have analyzed and/or modified PSO algorithms. This paper also presents some potential areas for future study.

scholarly journals Virtual Angle Boundary-Aware Particle Swarm Optimization to Maximize the Coverage of Directional Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2868
Author(s):  
Gong Cheng ◽  
Huangfu Wei
Keyword(s):  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
The Internet ◽  
Directional Sensor Networks ◽  
Swarm Optimization ◽  
Coverage Optimization ◽  
Boundary Constraint ◽  
Directional Sensor

With the transition of the mobile communication networks, the network goal of the Internet of everything further promotes the development of the Internet of Things (IoT) and Wireless Sensor Networks (WSNs). Since the directional sensor has the performance advantage of long-term regional monitoring, how to realize coverage optimization of Directional Sensor Networks (DSNs) becomes more important. The coverage optimization of DSNs is usually solved for one of the variables such as sensor azimuth, sensing radius, and time schedule. To reduce the computational complexity, we propose an optimization coverage scheme with a boundary constraint of eliminating redundancy for DSNs. Combined with Particle Swarm Optimization (PSO) algorithm, a Virtual Angle Boundary-aware Particle Swarm Optimization (VAB-PSO) is designed to reduce the computational burden of optimization problems effectively. The VAB-PSO algorithm generates the boundary constraint position between the sensors according to the relationship among the angles of different sensors, thus obtaining the boundary of particle search and restricting the search space of the algorithm. Meanwhile, different particles search in complementary space to improve the overall efficiency. Experimental results show that the proposed algorithm with a boundary constraint can effectively improve the coverage and convergence speed of the algorithm.

Adaptive particle swarm optimization algorithm based long short-term memory networks for sentiment analysis

2021 ◽  
pp. 1-17
Author(s):  
J. Shobana ◽  
M. Murali
Keyword(s):  
Particle Swarm Optimization ◽  
Sentiment Analysis ◽  
Language Processing ◽  
Short Term Memory ◽  
Contextual Information ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Adaptive Particle Swarm Optimization ◽  
Proposed Model

Text Sentiment analysis is the process of predicting whether a segment of text has opinionated or objective content and analyzing the polarity of the text’s sentiment. Understanding the needs and behavior of the target customer plays a vital role in the success of the business so the sentiment analysis process would help the marketer to improve the quality of the product as well as a shopper to buy the correct product. Due to its automatic learning capability, deep learning is the current research interest in Natural language processing. Skip-gram architecture is used in the proposed model for better extraction of the semantic relationships as well as contextual information of words. However, the main contribution of this work is Adaptive Particle Swarm Optimization (APSO) algorithm based LSTM for sentiment analysis. LSTM is used in the proposed model for understanding complex patterns in textual data. To improve the performance of the LSTM, weight parameters are enhanced by presenting the Adaptive PSO algorithm. Opposition based learning (OBL) method combined with PSO algorithm becomes the Adaptive Particle Swarm Optimization (APSO) classifier which assists LSTM in selecting optimal weight for the environment in less number of iterations. So APSO - LSTM ‘s ability in adjusting the attributes such as optimal weights and learning rates combined with the good hyper parameter choices leads to improved accuracy and reduces losses. Extensive experiments were conducted on four datasets proved that our proposed APSO-LSTM model secured higher accuracy over the classical methods such as traditional LSTM, ANN, and SVM. According to simulation results, the proposed model is outperforming other existing models.

Sign in / Sign up

Export Citation Format

Share Document