Optimum Design of Skeletal Structures Using PSO-Based Algorithms

The particle swarm optimization with an aging leader and challengers (ALC-PSO) algorithm is a recently developed optimization method which transplants the aging mechanism to PSO. The ALC-PSO prevents premature convergence and maintains the fast-converging feature of PSO. In this paper, a harmony search-based mechanism is used to handle the side constraints and it is combined with ALC-PSO, resulting in a new algorithm called HALC-PSO. These two algorithms are employed to optimize different types of skeletal structures with continuous and discrete variables. The results are compared to those of some other meta-heuristic algorithms. The proposed methods find superior optimal designs in all problems investigated, illustrating the capability of the present methods in solving constrained problems. The convergence speed comparisons also reveal the fast-converging feature of the presented algorithms

Particle Swarm Optimization Algorithm with a Bio-Inspired Aging Model

A Particle Swarm Optimization with a Bio-inspired Aging Model (BAM-PSO) algorithm is proposed to alleviate the premature convergence problem of other PSO algorithms. Each particle within the swarm is subjected to aging based on the age-related changes observed in immune system cells. The proposed algorithm is tested with several popular and well-established benchmark functions and its performance is compared to other evolutionary algorithms in both low and high dimensional scenarios. Simulation results reveal that at the cost of computational time, the proposed algorithm has the potential to solve the premature convergence problem that affects PSO-based algorithms; showing good results for both low and high dimensional problems. This work suggests that aging mechanisms do have further implications in computational intelligence

Partial Discharge Spectral Characterization in HF, VHF and UHF Bands Using Particle Swarm Optimization

The measurement of partial discharge (PD) signals in the radio frequency (RF) range has gained popularity among utilities and specialized monitoring companies in recent years. Unfortunately, in most of the occasions the data are hidden by noise and coupled interferences that hinder their interpretation and renders them useless especially in acquisition systems in the ultra high frequency (UHF) band where the signals of interest are weak. This paper is focused on a method that uses a selective spectral signal characterization to feature each signal, type of partial discharge or interferences/noise, with the power contained in the most representative frequency bands. The technique can be considered as a dimensionality reduction problem where all the energy information contained in the frequency components is condensed in a reduced number of UHF or high frequency (HF) and very high frequency (VHF) bands. In general, dimensionality reduction methods make the interpretation of results a difficult task because the inherent physical nature of the signal is lost in the process. The proposed selective spectral characterization is a preprocessing tool that facilitates further main processing. The starting point is a clustering of signals that could form the core of a PD monitoring system. Therefore, the dimensionality reduction technique should discover the best frequency bands to enhance the affinity between signals in the same cluster and the differences between signals in different clusters. This is done maximizing the minimum Mahalanobis distance between clusters using particle swarm optimization (PSO). The tool is tested with three sets of experimental signals to demonstrate its capabilities in separating noise and PDs with low signal-to-noise ratio and separating different types of partial discharges measured in the UHF and HF/VHF bands.The work done in this paper has been funded by the Spanish Government (MINECO) and the European Regional Development Fund (ERDF) under contract DPI2015-66478-C2-1-R (MINECO/FEDER, UE)

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

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

Vibration suppression of the horizontal flexible plate using proportional– integral–derivative controller tuned by particle swarm optimization

This paper presents the development of an active vibration control for vibration suppression of the horizontal flexible plate structure using proportional–integral–derivative controller tuned by a conventional method via Ziegler–Nichols and an intelligent method known as particle swarm optimization algorithm. Initially, the experimental rig was designed and fabricated with all edges clamped at the horizontal position of the flexible plate. Data acquisition and instrumentation systems were designed and integrated into the experimental rig to collect input–output vibration data of the flexible plate. The vibration data obtained through experimental study was used to model the system using system identification technique based on auto-regressive with exogenous input structure. The plate system was modeled using particle swarm optimization algorithm and validated using mean squared error, one-step ahead prediction, and correlation tests. The stability of the model was assessed using pole zero diagram stability. The fitness function of particle swarm optimization algorithm is defined as the mean squared error between the measured and estimated output of the horizontal flexible plate system. Next, the developed model was used in the development of an active vibration control for vibration suppression on the horizontal flexible plate system using a proportional–integral–derivative controller. The proportional–integral–derivative gains are optimally determined using two different ways, the conventional method tuned by Ziegler–Nichols tuning rules and the intelligent method tuned by particle swarm optimization algorithm. The performances of developed controllers were assessed and validated. Proportional–integral–derivative-particle swarm optimization controller achieved the highest attenuation value for first mode of vibration by achieving 47.28 dB attenuation as compared to proportional–integral–derivative-Ziegler–Nichols controller which only achieved 34.21 dB attenuation

Optimal design of symmetric switching CMOS inverter using symbiotic organisms search algorithm

This paper investigates the optimal design of symmetric switching CMOS inverter using the Symbiotic Organisms Search (SOS) algorithm. SOS has been recently proposed as an effective evolutionary global optimization method that is inspired by the symbiotic interaction strategies between different organisms in an ecosystem. In SOS, the three common types of symbiotic relationships (mutualism, commensalism, and parasitism) are modeled using simple expressions, which are used to find the global minimum of the fitness function. Unlike other optimization methods, SOS has no parameters to be tuned, which makes it an attractive and easy-to-implement optimization method. Here, SOS is used to design a high speed symmetric switching CMOS inverter, which is considered the most fundamental logic gate. SOS results are compared to those obtained using several optimization methods, like particle swarm optimization (PSO), genetic algorithm (GA), differential evolution (DE), and other ones, available in the literature. It is shown that the SOS is a robust straight-forward evolutionary algorithm that can compete with other well-known advanced methods

Bi-velocity discrete particle swarm optimization and its application to multicast routing problem in communication networks

This paper proposes a novel bi-velocity discrete particle swarm optimization (BVDPSO) approach and extends its application to the NP-complete multicast routing problem (MRP). The main contribution is the extension of PSO from continuous domain to the binary or discrete domain. Firstly, a novel bi-velocity strategy is developed to represent possibilities of each dimension being 1 and 0. This strategy is suitable to describe the binary characteristic of the MRP where 1 stands for a node being selected to construct the multicast tree while 0 stands for being otherwise. Secondly, BVDPSO updates the velocity and position according to the learning mechanism of the original PSO in continuous domain. This maintains the fast convergence speed and global search ability of the original PSO. Experiments are comprehensively conducted on all of the 58 instances with small, medium, and large scales in the OR-library (Operation Research Library). The results confirm that BVDPSO can obtain optimal or near-optimal solutions rapidly as it only needs to generate a few multicast trees. BVDPSO outperforms not only several state-of-the-art and recent heuristic algorithms for the MRP problems, but also algorithms based on GA, ACO, and PSO

An Evolutionary Strategy based on Partial Imitation for Solving Optimization Problems

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem whose search space grows exponentially, increasing the number of cities, up to becoming NP-hard. The solutions of the TSP can be codified by arrays of cities, and can be evaluated by fitness, computed according to a cost function (e.g. the length of a path). Our method is based on the evolution of an agent population by means of an imitative mechanism, we define `partial imitation'. In particular, agents receive a random solution and then, interacting among themselves, may imitate the solutions of agents with a higher fitness. Since the imitation mechanism is only partial, agents copy only one entry (randomly chosen) of another array (i.e. solution). In doing so, the population converges towards a shared solution, behaving like a spin system undergoing a cooling process, i.e. driven towards an ordered phase. We highlight that the adopted `partial imitation' mechanism allows the population to generate solutions over time, before reaching the final equilibrium. Results of numerical simulations show that our method is able to find, in a finite time, both optimal and suboptimal solutions, depending on the size of the considered search space.Comment: 18 pages, 6 figure