Bare-bones Particle Swarm Optimization Algorithm Research Articles

A Bi-Objective Optimal Scheduling Method for the Charging and Discharging of EVs Considering the Uncertainty of Wind and Photovoltaic Output in the Context of Time-of-Use Electricity Price

With the increasing share of renewable energy generation and the integration of large-scale electric vehicles (EVs) into the grid, the reasonable charging and discharging scheduling of electric vehicles is essential for the stable operation of power grid. Therefore, this paper proposes a bi-objective optimal scheduling strategy for microgrids based on the participation of electric vehicles in vehicle-to-grid technology (V2G) mode. Firstly, the system structure for electric vehicles participating in the charging and discharging schedule was established. Secondly, a bi-objective optimization model was formulated, considering load mean square error and user charging cost. A heuristic method was employed to handle constraints related to system energy balance and equipment output. Then, the Monte Carlo method was employed to simulate electric vehicle loads and to facilitate the generation of and reduction in scenario scenes. Finally, the model was solved using an improved multi-objective barebones particle swarm optimization algorithm. The simulation results show that the proposed scheduling strategy has a lower charging cost (CNY 11,032.4) and lower load mean square error (12.84 × 105 kW2) than the strategy employed in the comparison experiment, which ensures the economic and stable operation of the microgrid.

A deep memory bare-bones particle swarm optimization algorithm for single-objective optimization problems.

A deep memory bare-bones particle swarm optimization algorithm (DMBBPSO) for single-objective optimization problems is proposed in this paper. The DMBBPSO is able to perform high-precision local search while maintaining a large global search, thus providing a reliable solution to high-dimensional complex optimization problems. Normally, maintaining high accuracy while conducting global searches is an important challenge for single-objective optimizers. Traditional particle swarms optimizers can rapidly lose the diversity during iterations and are unable to perform global searches efficiently, and thus are more likely to be trapped by local optima. To address this problem, the DMBBPSO combines multiple memory storage mechanism (MMSM) and a layer-by-layer activation strategy (LAS). The MMSM catalyzes a set of deep memories to increase the diversity of the particle swarm. For every single particle, both of the personal best position and deep memories will be used in the evaluation process. The LAS enables the particle swarm to avoid premature convergence while enhancing local search capabilities. The collaboration between MMSM and LAS enhances the diversity of the particle swarm, which in turn enhances the robustness of the DMBBPSO. To investigate the optimization ability of the DMBBPSO for single-objective optimization problems, The CEC2017 benchmark functions are used in experiments. Five state-of-the-art evolutionary algorithms are used in the control group. Finally, experimental results demonstrate that the DMBBPSO can provide high precision results for single-objective optimization problems.

Radiation shielding optimization design research based on bare-bones particle swarm optimization algorithm

In order to further meet the requirements of weight, volume, and dose minimization for new nuclear energy devices, the bare-bones multi-objective particle swarm optimization algorithm is used to automatically and iteratively optimize the design parameters of radiation shielding system material, thickness, and structure. The radiation shielding optimization program based on the bare-bones particle swarm optimization algorithm is developed and coupled into the reactor radiation shielding multi-objective intelligent optimization platform, and the code is verified by using the Savannah benchmark model. The material type and thickness of Savannah model were optimized by using the BBMOPSO algorithm to call the dose calculation code, the integrated optimized data showed that the weight decreased by 78.77%, the volume decreased by 23.10% and the dose rate decreased by 72.41% compared with the initial solution. The results show that the method can get the best radiation shielding solution that meets a lot of different goals. This shows that the method is both effective and feasible, and it makes up for the lack of manual optimization.

Multi-Objective Intelligent Decision and Linkage Control Algorithm for Mine Ventilation

A novel bare-bones particle swarm optimization (BBPSO) algorithm is proposed to realize intelligent mine ventilation decision-making and overcome the problems of low precision, low speed, and difficulty in converging on an optimal global solution. The proposed method determines the decision objective function based on the minimal power consumption and maximal air demand. Three penalty terms, namely, dynamic ventilation condition, the supplied air volume at the location where the air is required, and roadway wind speed, are established. The particle construction method of “wind resistance” instead of “wind resistance & air volume” is proposed to reduce the calculation dimension effectively. Three optimization strategies, namely the contraction factor, optimal initial value, and elastic mirror image, are proposed to avoid premature convergence of the algorithm. The application flow of intelligent decision-making in the field and the parallel computing architecture are also discussed. Five methods are used to solve the problems. The results reveal that the improved parallel BBPSO algorithm (BBPSO-Para-Improved) outperforms other algorithms in terms of convergence efficiency, convergence time, and global optimization performance and meets the requirements of large ventilation systems for achieving economic and safety targets.

Heterogeneous Cooperative Bare-Bones Particle Swarm Optimization with Jump for High-Dimensional Problems

This paper proposes a novel Bare-Bones Particle Swarm Optimization (BBPSO) algorithm for solving high-dimensional problems. BBPSO is a variant of Particle Swarm Optimization (PSO) and is based on a Gaussian distribution. The BBPSO algorithm does not consider the selection of controllable parameters for PSO and is a simple but powerful optimization method. This algorithm, however, is vulnerable to high-dimensional problems, i.e., it easily becomes stuck at local optima and is subject to the “two steps forward, one step backward” phenomenon. This study improves its performance for high-dimensional problems by combining heterogeneous cooperation based on the exchange of information between particles to overcome the “two steps forward, one step backward” phenomenon and a jumping strategy to avoid local optima. The CEC 2010 Special Session on Large-Scale Global Optimization (LSGO) identified 20 benchmark problems that provide convenience and flexibility for comparing various optimization algorithms specifically designed for LSGO. Simulations are performed using these benchmark problems to verify the performance of the proposed optimizer by comparing the results of other variants of the PSO algorithm.

Enhanced Support Vector Machine Based Leukaemia Cancer Classification

Leukaemia is a blood cancer that is characterized by the bone marrow’s unregulated and irregular generation of white blood cells (leukocytes) in the blood. By testing the microscopic blood cell images, diseases can be detected and its early diagnosis can be done. In the current work,at smart decision support systemutilizing microscopic images is proposedto make a diagnosisof acute lymphoblastic leukaemia. Identification through images is a quick and inexpensive technique since there is no equipment is specially needed for lab testing. The improved Bare-Bones Particle Swarm Optimization algorithm is usedto identify the important distinguishing featuresof blast cells and the healthy cells to help in carry out the acute lymphoblastic leukaemia classification with efficiency. To avoid the poor accuracy, the modified median filtering has been introduced in this novel, which helps in removing the noise from the images and maintains the edge which is used to improve the identification of leukocytes and lymphocytes during the segmentation process. Enhanced linear contrast stretching is introduced in image enhancement for enriching the image. In the next step, feature extraction is carried out through the second order statistical features. Bare-bones with Adaptive Bat Optimization (BBABO) is used for feature selection. At last, the classification is carried out by using the combined Fuzzy Neural Network (FNN) and here the Enhanced Support Vector Machine (ESVM) is a classifier called as FNESVM.

IBPSO-Based MUSIC Algorithm for Broken Rotor Bars Fault Detection of Induction Motors

In spectrum analysis of induction motor current, the characteristic components of broken rotor bars (BRB) fault are often submerged by the fundamental component. Although many detection methods have been proposed for this problem, the frequency resolution and accuracy are not high enough so that the reliability of BRB fault detection is affected. Thus, a new multiple signal classification (MUSIC) algorithm based on particle swarm intelligence search is developed. Since spectrum peak search in MUSIC is a multimodal optimization problem, an improved bare-bones particle swarm optimization algorithm (IBPSO) is proposed first. In the IBPSO, a modified strategy of subpopulation determination is introduced into BPSO for realizing multimodal search. And then, the new MUSIC algorithm, called IBPSO-based MUSIC, is proposed by replacing the fixed-step traversal search with IBPSO. Meanwhile, a simulation signal is used to test the effectiveness of the proposed algorithm. The simulation results show that its frequency precision reaches 10−5, and the computational cost is only comparable to that of traditional MUSIC with 0.1 search step. Finally, the IBPSO-based MUSIC is applied in BRB fault detection of an induction motor, and the effectiveness and superiority are proved again. The proposed research provides a modified MUSIC algorithm which has sufficient frequency precision to detect BRB fault in induction motors.

Intelligent leukaemia diagnosis with bare-bones PSO based feature optimization

In this research, we propose an intelligent decision support system for acute lymphoblastic leukaemia (ALL) diagnosis using microscopic images. Two Bare-bones Particle Swarm Optimization (BBPSO) algorithms are proposed to identify the most significant discriminative characteristics of healthy and blast cells to enable efficient ALL classification. The first BBPSO variant incorporates accelerated chaotic search mechanisms of food chasing and enemy avoidance to diversify the search and mitigate the premature convergence of the original BBPSO algorithm. The second BBPSO variant exhibits both of the abovementioned new search mechanisms in a subswarm-based search. Evaluated with the ALL-IDB2 database, both proposed algorithms achieve superior geometric mean performances of 94.94% and 96.25%, respectively, and outperform other metaheuristic search and related methods significantly for ALL classification.

Mitigating the volatility of renewable distributed generators with plug-in electric vehicles in optimal operation of active distribution networks

Active distribution networks (ADNs) are becoming popular worldwide, where renewable distributed generators (DGs) are responsible to support system operation and allowed to be integrated to networks under non-firm connection agreements. With the increasing penetration of renewable DGs, their power volatility cannot be neglected any more. In order to overcome the negative influences caused by the volatility of renewable DGs, a strategy for mitigating the volatility with plug-in electric vehicles (PEVs) is proposed for economic and safe operation of ADNs. First, a PEV aggregator is proposed to control a group of PEVs, which can act as demand response in ADNs by charging/discharging power. Then, a volatility index (VI) is defined to measure the volatile degree of power from renewable DGs in a certain time period. Based on VI, the formulation of union volatility index is derived, considering the power charged/discharged by PEV aggregators. Thereafter, an optimal operation model of ADN operation with volatility constraints is proposed. Its objective is to minimize the operation cost of ADNs. This optimal model is solved by a novel algorithm–disruption bare-bones particle swarm optimization algorithm, which integrates disruption strategies into the bare-bones particle swarm optimization algorithm. The proposed model is demonstrated on a 37-node radial distribution system with a PEV aggregator. Five scenarios are carefully designed to certify the necessity of mitigating the volatility of renewable DGs in network economic operation. It is concluded that mitigating the volatility of renewable DGs and adopting real-time pricing schemes on PEV aggregators are particularly effective for optimal operation of ADNs.

Using BBPSO Algorithm to Estimate the Weibull Parameters with Censored Data

This article proposes the maximum likelihood estimates based on bare bones particle swarm optimization (BBPSO) algorithm for estimating the parameters of Weibull distribution with censored data, which is widely used in lifetime data analysis. This approach can produce more accuracy of the parameter estimation for the Weibull distribution. Additionally, the confidence intervals for the estimators are obtained. The simulation results show that the BB PSO algorithm outperforms the Newton–Raphson method in most cases in terms of bias, root mean square of errors, and coverage rate. Two examples are used to demonstrate the performance of the proposed approach. The results show that the maximum likelihood estimates via BBPSO algorithm perform well for estimating the Weibull parameters with censored data.

Adaptive bare-bones particle swarm optimization algorithm and its convergence analysis

Bare-bones particle swarm optimization (BBPSO) was first proposed in 2003. Compared to the traditional particle swarm optimization, it is simpler and has only a few control parameters to be tuned by users. In this paper, an improved BBPSO algorithm with adaptive disturbance (ABPSO) is studied. By the proposed approaches, each particle has its own disturbance value, which is adaptively decided based on its convergence degree and the diversity of swarm. And an adaptive mutation operator is introduced to improve the global exploration of ABPSO. Moreover, the convergence of ABPSO is analyzed using stochastic process theory by regarding each particle's position as a stochastic vector. A series of experimental trials confirms that the proposed algorithm is highly competitive to other BBPSO-based algorithms, and its performance can be still further improved with the use of mutation.