3,577 research outputs found

    A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

    Get PDF
    Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

    Optimizing Three-Tank Liquid Level Control: Insights from Prairie Dog Optimization

    Get PDF
    The management of chemical process liquid levels poses a significant challenge in industrial process control, affecting the efficiency and stability of various sectors such as food processing, nuclear power generation, and pharmaceutical industries. While Proportional-Integral-Derivative (PID) control is a widely-used technique for maintaining liquid levels in tanks, its efficacy in optimizing complex and nonlinear systems has limitations. To overcome this, researchers are exploring the potential of metaheuristic algorithms, which offer robust optimization capabilities. This study introduces a novel approach to liquid level control using the Prairie Dog Optimization (PDO) algorithm, a metaheuristic algorithm inspired by prairie dog behavior. The primary objective is to design and implement a PID-controlled three-tank liquid level system that leverages PDO to regulate liquid levels effectively, ensuring enhanced stability and performance. The performance of the proposed system is evaluated using the ZLG criterion, a time domain metric-based objective function that quantifies the system's efficiency in maintaining desired liquid levels. Several analysis techniques are employed to understand the behavior of the system. Convergence curve analysis assesses the PDO-controlled system's convergence characteristics, providing insights into its efficiency and stability. Statistical analysis determines the algorithm's reliability and robustness across multiple runs. Stability analysis from both time and frequency response perspectives further validates the system's performance. A comprehensive comparison study with state-of-the-art metaheuristic algorithms, including AOA-HHO, CMA-ES, PSO, and ALC-PSODE, is conducted to benchmark the performance of PDO. The results highlight PDO's superior convergence, stability, and optimization capabilities, establishing its efficacy in real-world industrial applications. The research findings underscore the potential of PDO in PID control applications for three-tank liquid level systems. By outperforming benchmark algorithms, PDO demonstrates its value in industrial control scenarios, contributing to the advancement of metaheuristic-based control techniques and process optimization. This study opens avenues for engineers and practitioners to harness advanced control solutions, thereby enhancing industrial processes and automation

    Global identification of electrical and mechanical parameters in PMSM drive based on dynamic self-learning PSO

    Get PDF
    A global parameter estimation method for a PMSM drive system is proposed, where the electrical parameters, mechanical parameters and voltage-source-inverter (VSI) nonlinearity are regarded as a whole and parameter estimation is formulated as a single parameter optimization model. A dynamic learning estimator is proposed for tracking the electrical parameters, mechanical parameters and VSI of PMSM drive by using dynamic self learning particle swarm optimization (DSLPSO). In DSLPSO, a novel movement modification equation with dynamic exemplar learning strategy is designed to ensure its diversity and achieve a reasonable tradeoff between the exploitation and exploration during the search process. Moreover, a nonlinear multi-scale based interactive learning operator is introduced for accelerating the convergence speed of the Pbest particles; meanwhile a dynamic opposition-based learning (OBL) strategy is designed to facilitate the gBest particle to explore a potentially better region. The proposed algorithm is applied to parameter estimation for a PMSM drive system. The results show that the proposed method has better performance in tracking the variation of electrical parameters, and estimating the immeasurable mechanical parameters and the VSI disturbance voltage simultaneously

    Projectile-target search algorithm: a stochastic metaheuristic optimization technique

    Get PDF
    This paper proposes a new stochastic metaheuristic optimization algorithm which is based on kinematics of projectile motion and called projectile-target search (PTS) algorithm. The PTS algorithm employs the envelope of projectile trajectory to find the target in the search space. It has 2 types of control parameters. The first type is set to give the possibility of the algorithm to accelerate convergence process, while the other type is set to enhance the possibility to generate new better projectiles for searching process. However, both are responsible to find better fitness values in the search space. In order to perform its capability to deal with global optimum problems, the PTS algorithm is evaluated on six well-known benchmarks and their shifted functions with 100 dimensions. Optimization results have demonstrated that the PTS algoritm offers very good performances and it is very competitive compared to other metaheuristic algorithm

    Particle Swarm Optimization

    Get PDF
    Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field

    Identifying Generalized Neural Representation Across Hamiltonian Manifolds via Meta-learning

    Full text link
    Recent advancements in deep learning for physics have focused on discovering shared representations of target systems by incorporating physics priors or inductive biases into neural networks. However, these approaches are system-specific and do not allow for easy adaptation to new physical systems governed by different laws. For example, a neural network trained on a mass-spring system cannot accurately predict the behavior of a two-body system or any other system with different governing physics. In this work, we model our system with a graph neural network and employ a meta-learning algorithm to enable the model to gain experience over a distribution of tasks and make it adapt to new physics. Our approach aims to learn a general representation across the various Hamiltonian manifolds, which is a common feature of the data distribution of Hamiltonian systems. We train our model using a dataset of different physical systems, each governed by its own inherent dynamics, and evaluate its performance on a new type of dynamical system with unknown physics. Our results show that the meta-trained model effectively adapts to the new system, which was unseen during the meta-training phase. Furthermore, we analyze the representation learned by the meta-trained neural network to identify a generalizable representation of Hamilton's equation that is shared across various physical systems. Our findings suggest that the meta-learned model can capture the generalizable representation across Hamiltonian manifolds inherent in dynamical systems.Comment: 15 pages, 7 figure

    Soft computing applied to optimization, computer vision and medicine

    Get PDF
    Artificial intelligence has permeated almost every area of life in modern society, and its significance continues to grow. As a result, in recent years, Soft Computing has emerged as a powerful set of methodologies that propose innovative and robust solutions to a variety of complex problems. Soft Computing methods, because of their broad range of application, have the potential to significantly improve human living conditions. The motivation for the present research emerged from this background and possibility. This research aims to accomplish two main objectives: On the one hand, it endeavors to bridge the gap between Soft Computing techniques and their application to intricate problems. On the other hand, it explores the hypothetical benefits of Soft Computing methodologies as novel effective tools for such problems. This thesis synthesizes the results of extensive research on Soft Computing methods and their applications to optimization, Computer Vision, and medicine. This work is composed of several individual projects, which employ classical and new optimization algorithms. The manuscript presented here intends to provide an overview of the different aspects of Soft Computing methods in order to enable the reader to reach a global understanding of the field. Therefore, this document is assembled as a monograph that summarizes the outcomes of these projects across 12 chapters. The chapters are structured so that they can be read independently. The key focus of this work is the application and design of Soft Computing approaches for solving problems in the following: Block Matching, Pattern Detection, Thresholding, Corner Detection, Template Matching, Circle Detection, Color Segmentation, Leukocyte Detection, and Breast Thermogram Analysis. One of the outcomes presented in this thesis involves the development of two evolutionary approaches for global optimization. These were tested over complex benchmark datasets and showed promising results, thus opening the debate for future applications. Moreover, the applications for Computer Vision and medicine presented in this work have highlighted the utility of different Soft Computing methodologies in the solution of problems in such subjects. A milestone in this area is the translation of the Computer Vision and medical issues into optimization problems. Additionally, this work also strives to provide tools for combating public health issues by expanding the concepts to automated detection and diagnosis aid for pathologies such as Leukemia and breast cancer. The application of Soft Computing techniques in this field has attracted great interest worldwide due to the exponential growth of these diseases. Lastly, the use of Fuzzy Logic, Artificial Neural Networks, and Expert Systems in many everyday domestic appliances, such as washing machines, cookers, and refrigerators is now a reality. Many other industrial and commercial applications of Soft Computing have also been integrated into everyday use, and this is expected to increase within the next decade. Therefore, the research conducted here contributes an important piece for expanding these developments. The applications presented in this work are intended to serve as technological tools that can then be used in the development of new devices

    Metaheuristic Optimization Techniques Used in Controlling of an Active Magnetic Bearing System for High-Speed Machining Application

    Get PDF
    Smart control tactics, wider stability region, rapid reaction time, and high-speed performance are essential requirements for any controller to provide a smooth, vibrationless, and efficient performance of an in-house fabricated active magnetic bearing (AMB) system. In this manuscript, three pre-eminent population-based metaheuristic optimization techniques: Genetic algorithm (GA), Particle swarm optimization (PSO), and Cuckoo search algorithm (CSA) are implemented one by one, to calculate optimized gain parameters of PID controller for the proposed closed-loop active magnetic bearing (AMB) system. Performance indices or, objective functions on which these optimization techniques are executed are integral absolute error (IAE), integral square error (ISE), integral time multiplied absolute error (ITAE), and integral time multiplied square error (ITSE). The significance of an optimization technique and objective function can obtain only by implementing it. As a result, several comparisons are made based on statistical performance, time domain, frequency response behavior, and algorithm execution time. Finally, the applicability of optimization strategies in addition to the performance indices is determined with the aid of the comparative analysis. That could assist in choosing a suitable optimization technique along with a performance index for a high-speed application of an active magnetic bearing system
    corecore