Algorithms Including Particle Swarm Optimization Research Articles

Scheduling optimization of electric energy meter distribution vehicles for intelligent batch rotation

As industrial technology continues to advance through integration, society's demand for electricity is rapidly increasing. To meet the requirements of refined grid management and address the elevated challenges arising from the increased electrical load, this paper delves into the investigation of distribution vehicle scheduling for the practical scenario of batch rotation of smart meters. Initially, based on the practical distribution task requirements of a provincial metrology verification center, a multi-level optimization model is constructed for the batch rotation and distribution vehicle scheduling of smart meters. The primary objective is to maximize the enhancement of smart meter distribution efficiency while minimizing the overall distribution cost. Moreover, this paper introduces a refined Grey Wolf Optimization algorithm (OLC-GWO) based on Opposition-based Learning, Levy flight strategy, and Cauchy mutation to solve the model. By generating an opposite population to improve the quality of initial feasible solutions and further harnessing the global search capabilities of Levy flight and Cauchy mutation operators, the algorithm's effectiveness is enhanced. The algorithm is subjected to testing using multiple benchmark functions and its performance is compared with variants of GWO, as well as several cutting-edge intelligent optimization algorithms including Particle Swarm Optimization (PSO), Harris Hawks Optimization (HHO), and Honey Bee Algorithm (HBA). The results indicate that OLC-GWO exhibits excellent performance in terms of convergence speed and optimization capability. Finally, the improved algorithm is subjected to simulation experiments by incorporating order data from the practical distribution operations of a provincial metrology verification center. The outcomes verify the efficiency of the proposed algorithm, reinforcing the practical significance of the established model in addressing the real-world challenge of batch rotation and distribution vehicle scheduling for smart meters.

Cloud Computing: Optimization using Particle Swarm Optimization to Improve Performance of Cloud

INTRODUCTION: In the contemporary world cloud computing is acknowledged as advanced technology to manage and store huge amount of data over the network. To handle the network traffic and effective task scheduling some efficient load balancing algorithm should be implemented. This can reduce the network traffic and overcome the problem of limited bandwidth. The various research articles represents ample amount of optimization techniques to overcome the transfer of data with limited bandwidth. Among all, few solutions has been chosen for current research article such as – optimization of load distribution of various resources provided by cloud.
 OBJECTIVES: In this paper, Comparative analysis of various task scheduling algorithms such as (FCFS, SJF, Round Robin & PSO) have been proposed in current research article to accumulate the outcome and evaluate the overall performance of cloud at different number of processing elements (pesNumber) .
 METHODS: Overall performance of task scheduling is significantly enhanced by PSO Algorithm implemented on cloud in comparison of FCFS, SJF and Round Robin. Outcomes of optimization technique has been implemented and tested over the CloudSim simulator.
 RESULTS: The comparative analysis conducted based on scalability for increasing the number of processing elements over the cloud. The major insight of proposed algorithm has shows that results are still better when number of VMs is increased and it successfully minimizes waiting time and turnaround time and completion time by 43% which is significantly high than outcomes of existing research articles.
 CONCLUSION: To optimize the task scheduling in cloud computing, comparative analysis of various task scheduling algorithms has been proposed, including Particle Swarm Optimization algorithm.

Five Phases Algorithm: A Novel Meta-heuristic Algorithm and Its Application on Economic Load Dispatch Problem

<p>A new meta-heuristic algorithm named the five phases algorithm (FPA) is presented in this paper. The proposed method is inspired by the five phases theory in traditional Chinese thought. FPA updates agents based on the generating and overcoming strategy as well as learning strategy from the agent with the same label. FPA has a simple structure but excellent performance. It also does not have any predefined control parameters, only two general parameters including population size and terminal condition are required. This provides flexibility to users to solve different optimization problems. For global optimization, 10 test functions from the CEC2019 test suite are used to evaluate the performance of FPA. The experimental results confirm that FPA is better than the 6 state-of-the-art algorithms including particle swarm optimization (PSO), grey wolf optimizer (GWO), multi-verse optimizer (MVO), differential evolution (DE), backtracking search algorithm (BSA), and slime mould algorithm (SMA). Furthermore, FPA is applied to solve the Economic Load Dispatch (ELD) from the real power system problem. The experiments give that the minimum cost of power system operation obtained by the proposed FPA is more competitive than the 14 counterparts. The source codes of this algorithm can be found in https://ww2.mathworks.cn/matlabcentral/fileexchange/118215-five-phases-algorithm-fpa.</p> <p> </p>

Load Frequency Control of Marine Microgrid System Integrated with Renewable Energy Sources

In seaports, low-carbon energy systems and energy efficiency have become increasingly important as a result of the evolution of environmental and climate change challenges. In order to ensure the continued success of seaports, technological advancements must be introduced to a number of systems, such as seaport vehicles, harbor cranes, and the power sources of berthed ships. Harbor areas might need a microgrid to handle these aspects. Typically, microgrids that substitute conventional generator units with renewable energy sources (RES) suffer from system inertia problems, which adversely affect microgrid frequency stability. A load frequency controller (LFC) based on a novel modified proportional integral derivative with filter (MPIDF) is presented in this paper for enhancing the performance of marine microgrid system (MMS). The serval optimization algorithm (SOA), a recent bio-inspired optimization algorithm, is used to optimize the MPIDF controller coefficients. This controller is tested on a marine microgrid containing a number of RES such as wind turbine generators, sea wave energy, and solar generation. The efficacy of the proposed MPIDF controller is verified with respect to other controllers such as PIDF and PI. Similarly, the proposed meta-heuristic algorithm is validated as compared to other algorithms including particle swarm optimization (PSO), ant colony optimization (ACO), and jellyfish swarm optimization (JSO). This study also evaluates the robustness of the proposed controller to different perturbations in step load, changes in system parameters, and other parameter variations.

Detecting land use changes using hybrid machine learning methods in the Australian tropical regions

The present study evaluates the application of the hybrid machine learning methods to detect changes of land use with a focus on agricultural lands through remote sensing data processing. Two spectral images by Landsat 8 were applied to train and test the machine learning model. Feed forward neural network classifier was utilized as the machine learning model in which two evolutionary algorithms including particle swarm optimization and invasive weed optimization were applied for the training process. Moreover, three conventional training methods including Levenberg–Marquardt back propagation (LM), Scaled conjugate gradient backpropagation (SCG) and BFGS quasi-Newton backpropagation (BFG) were used for comparing the robustness and reliability of the evolutionary algorithms. Based on the results in the case study, evolutionary algorithms are not a reliable method for detecting changes through the remote sensing analysis in terms of accuracy and computational complexities. Either BFG or LM is the best method to detect the agricultural lands in the present study. BFG is slightly more robust than the LM method. However, LM might be preferred for applying in the projects due to low computational complexities.

Computational prediction of the drilling rate of penetration (ROP): A comparison of various machine learning approaches and traditional models

Rate of penetration (ROP) prediction, can assist precise planning of drilling operations and can reduce drilling costs. However, easy estimation of this key factor by traditional or experimental models is very difficult. This requires comparing available models for achieving the best prediction approach. In this study, four machine learning (ML) methods and two traditional ROP models were utilized to predict ROP. ML techniques include multilayer perceptron neural network (MLPNN), radial basis function neural network (RBFNN), adaptive neuro-fuzzy inference system (ANFIS), and support vector regression (SVR). MLPNN, ANFIS, and RBFNN methods were trained with four meta-heuristic algorithms including particle swarm optimization (PSO), ant colony optimization (ACO), differential evolution (DE), and genetic algorithm (GA). The backpropagation (BP) algorithm was also incorporated to train the ANFIS and MLPNN methods as a conventional method. For comparison purposes, the traditional ROP models of Bourgoyne and Young (BYM) and Bingham were also implemented in combination with four meta-heuristic algorithms. The required data were collected from the mud logging unit (MLU) and the final report of a drilled well located in southwestern of Iran. In the MLU, the information of different sensors is firstly collected through the data communications protocols and sent to a master unit to be processed into relevant dimensions (i.e. create operational variables). In order to accurately record information, the sensors are calibrated at regular intervals. After removing the outliers, the overall noise of data was reduced by Savitzky-Golay (SG) smoothing filter. Then, in order to simulate a drilling process in a realistic manner and also to evaluate the performance of the models in approximating the penetration rate at greater depth of hole, the available data were divided into 6 sections based on depth. After that, sections 2 Data collection and preprocessing , 3 Methodology , 4 Model development and ROP estimation , 5 Discussion and results , 6 Conclusion were separately used as a test dataset and all previous sections were considered as a training dataset. Results indicated that PSO-MLPNN achieved the highest performance in comparing with other developed models. The concluding remark is that ML models are more efficient and reliable than traditional models. In addition, combining ML models with meta-heuristic algorithms can achieve better results than conventional algorithms such as BP. The results of this study can be used as a practical guide for the management and planning of future well drilling. • Applying Savitzky-Golay (SG) filter to remove noise from data. • Data were divided into 6 sections. Section 2 to 6 were separately noted as test and the previous one(s) as training dataset. • Comparison of four machine learning (ML) methods and two traditional ROP models. • Coupling models with meta-heuristic algorithms and conventional algorithms. • PSO-MLPNNmodel showed the highest accuracy compared to others.

Emerging Applications of Bio-Inspired Algorithms in Image Segmentation

Image processing is one example of digital media. It consists of a set of operations to handle an image. Image segmentation is among its main important operations. It involves dividing the image into several parts or regions to extract vital information or identify relevant objects. Many techniques of artificial intelligence, including bio-inspired algorithms, have been used in this regard. This article collected the state-of-the-art studies presenting image-segmentation techniques combined with four bio-inspired algorithms including particle swarm optimization (PSO), genetic algorithms (GA), ant colony optimization (ACO), and artificial bee colonies (ABC). This research work aimed at showing the importance of image segmentation and its combination with these algorithms. This article provides insights on how these algorithms are adapted to image-segmentation combinatorial problems, which assist researchers to start the first hands-on application. It also discusses their setting parameters and the highly used algorithms such as PSO, GA, ACO, and ABC. The article presents new research directions in image segmentation based on bio-inspired algorithms.

Optimal design of 3D special steel buckling‐restrained braced structures

SummaryIn the current study, the optimal design of 3D frames equipped with buckling restrained braces is presented. The objective function in the optimization problem is considered as weight minimization subjected to serviceability and strength requirements. Three different metaheuristic algorithms including Particle Swarm Optimization (PSO) algorithm, Teaching Learning Based Optimization (TLBO) algorithm, and Discrete Firefly Algorithm (DFA) are utalized to solve the optimization problem. Response spectrum analysis is considered to examine the performance of the structures during the optimization process under applied loads. Two real‐size steel structures with buckling restrained braces are selected to perform optimal design. The results demonstrate that the TLBO algorithm has better performance in discrete structural optimization.

Collaborative Target Search Algorithm for UAV Based on Chaotic Disturbance Pigeon-Inspired Optimization

Unmanned aerial vehicles (UAVs) have shown their superiority in military and civilian missions. In the face of complex tasks, many UAVs are usually needed to cooperate with each other. Therefore, multi-UAV cooperative target search has attracted more and more scholars’ attention. At present, there are many bionic algorithms for solving the cooperative search problem of multi-UAVs, including particle swarm optimization algorithm (PSO) and differential evolution (DE). Pigeon-inspired optimization (PIO) is a new swarm intelligence optimization algorithm proposed in recent years. It has great advantages over other algorithms in convergence, robustness, and accuracy, and has few parameters to be adjusted. Aiming at the shortcomings of the standard pigeon colony algorithm, such as poor population diversity, slow convergence speed, and the ease of falling into local optimum, we have proposed chaotic disturbance pigeon-inspired optimization (CDPIO) algorithm. The improved tent chaotic map was used to initialize the population and increase the diversity of the population. The disturbance factor is introduced in the iterative update stage of the algorithm to generate new individuals, replace the individuals with poor performance, and carry out disturbance to increase the optimization accuracy. Benchmark functions and UAV target search model were used to test the algorithm performance. The results show that the CDPIO had faster convergence speed, better optimization precision, better robustness, and better performance than PIO.

A comparison of swarm-based optimization algorithms in linear antenna array synthesis

Today, the design of antenna arrays is very important in providing effective and efficient wireless communication. The purpose of antenna array synthesis is to obtain a radiation pattern with a low side lobe level (SLL) at a desired half power beam width in far-field. The amplitude and position values of the array elements can be optimized to obtain a radiation pattern with suppressed SLLs. In this paper, swarm-based metaheuristic algorithms including particle swarm optimization (PSO), artificial bee colony (ABC), mayfly algorithm (MA) and jellyfish search (JS) are compared to determine the optimal design of linear antenna arrays. Extensive experiments are conducted on designing 10-, 16-, 24- and 32-element linear arrays by determining the amplitude and positions. Experiments are repeated 30 times due to the random nature of swarm-based optimizers, and statistical results show that the performance of the novel algorithms, MA and JS, is better than that of the well-known PSO and ABC methods.

Brainstorm optimization for multi-document summarization

Document summarization is one of the solutions to mine the appropriate information from a huge number of documents. In this study, brainstorm optimization (BSO) based multi-document summarizer (MDSBSO) is proposed to solve the problem of multi-document summarization. The proposed MDSBSO is compared with two other multi-document summarization algorithms including particle swarm optimization (PSO) and bacterial foraging optimization (BFO). To evaluate the performance of proposed multi-document summarizer, two well-known benchmark document understanding conference (DUC) datasets are used. Performances of the compared algorithms are evaluated using ROUGE evaluation metrics. The experimental analysis clearly exposes that the proposed MDSBSO summarization algorithm produces significant enhancement when compared with the other summarization algorithms.

ISHO: improved spotted hyena optimization algorithm for phishing website detection

One of the major challenges in cyber space and Internet of things (IoT) environments is the existence of fake or phishing websites that steal users’ information. A website as a multimedia system provides access to different types of data such as text, image, video, audio. Each type of these data are prune to be used by fishers to perform a phishing attack. In phishing attacks, people are directed to fake pages and their important information is stolen by a thief or phisher. Machine learning and data mining algorithms are the widely used algorithms for classifying websites and detecting phishing attacks. Classification accuracy is highly dependent on the feature selection method employed to choose appropriate features for classification. In this research, an improved spotted hyena optimization algorithm (ISHO algorithm) is proposed to select proper features for classifying phishing websites through support vector machine. The proposed ISHO algorithm outperformed the standard spotted hyena optimization algorithm with better accuracy. In addition, the results indicate the superiority of ISHO algorithm to three other meta-heuristic algorithms including particle swarm optimization, firefly algorithm, and bat algorithm. The proposed algorithm is also compared with a number of classification algorithms proposed before on the same dataset.

Improving the Performance of Whale Optimization Algorithm through OpenCL-Based FPGA Accelerator

Whale optimization algorithm (WOA), known as a novel nature-inspired swarm optimization algorithm, demonstrates superiority in handling global continuous optimization problems. However, its performance deteriorates when applied to large-scale complex problems due to rapidly increasing execution time required for huge computational tasks. Based on interactions within the population, WOA is naturally amenable to parallelism, prompting an effective approach to mitigate the drawbacks of sequential WOA. In this paper, field programmable gate array (FPGA) is used as an accelerator, of which the high-level synthesis utilizes open computing language (OpenCL) as a general programming paradigm for heterogeneous System-on-Chip. With above platform, a novel parallel framework of WOA named PWOA is presented. The proposed framework comprises two feasible parallel models called partial parallel and all-FPGA parallel, respectively. Experiments are conducted by performing WOA on CPU and PWOA on OpenCL-based FPGA heterogeneous platform, to solve ten well-known benchmark functions. Meanwhile, other two classic algorithms including particle swarm optimization (PSO) and competitive swarm optimizer (CSO) are adopted for comparison. Numerical results show that the proposed approach achieves a promising computational performance coupled with efficient optimization on relatively large-scale complex problems.

Dynamic Salp swarm algorithm for feature selection

Recently, many optimization algorithms have been applied for Feature selection (FS) problems and show a clear outperformance in comparison with traditional FS methods. Therefore, this has motivated our study to apply the new Salp swarm algorithm (SSA) on the FS problem. However, SSA, like other optimizations algorithms, suffer from the problem of population diversity and fall into local optima. To solve these problems, this study presents an enhanced version of SSA which is known as the Dynamic Salp swarm algorithm (DSSA). Two main improvements were included in SSA to solve its problems. The first improvement includes the development of a new equation for salps’ position update. The use of this new equation is controlled by using Singer's chaotic map. The purpose of the first improvement is to enhance SSA solutions' diversity. The second improvement includes the development of a new local search algorithm (LSA) to improve SSA exploitation. The proposed DSSA was combined with the K-nearest neighbor (KNN) classifier in a wrapper mode. 20 benchmark datasets were selected from the UCI repository and 3 Hadith datasets to test and evaluate the effectiveness of the proposed DSSA algorithm. The DSSA results were compared with the original SSA and four well-known optimization algorithms including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Lion Optimizer (ALO), and Grasshopper Optimization Algorithm (GOA). From the obtained results, DSSA outperformed the original SSA and the other well-known optimization algorithms over the 23 datasets in terms of classification accuracy, fitness function values, the number of selected features, and convergence speed. Also, DSSA accuracy results were compared with the most recent variants of the SSA algorithm. DSSA showed a significant improvement over the competing algorithms in statistical analysis. These results confirm the capability of the proposed DSSA to simultaneously improve the classification accuracy while selecting the minimal number of the most informative features.

An efficient two-stage approach for structural damage detection using meta-heuristic algorithms and group method of data handling surrogate model

In this study, the performance of an efficient two-stage methodology which is applied in a damage detection system using a surrogate model of the structure has been investigated. In the first stage, in order to locate the damage accurately, the performance of the modal strain energy based index for using different numbers of natural mode shapes has been evaluated using the confusion matrix. In the second stage, to estimate the damage extent, the sensitivity of most used modal properties due to damage, such as natural frequency and flexibility matrix is compared with the mean normalized modal strain energy (MNMSE) of suspected damaged elements. Moreover, a modal property change vector is evaluated using the group method of data handling (GMDH) network as a surrogate model during damage extent estimation by optimization algorithm; in this part of methodology, the performance of the three popular optimization algorithms including particle swarm optimization (PSO), bat algorithm (BA), and colliding bodies optimization (CBO) is examined and in this regard, root mean square deviation (RMSD) based on the modal property change vector has been proposed as an objective function. Furthermore, the effect of noise in the measurement of structural responses by the sensors has also been studied. Finally, in order to achieve the most generalized neural network as a surrogate model, GMDH performance is compared with a properly trained cascade feed-forward neural network (CFNN) with log-sigmoid hidden layer transfer function. The results indicate that the accuracy of damage extent estimation is acceptable in the case of integration of PSO and MNMSE. Moreover, the GMDH model is also more efficient and mimics the behavior of the structure slightly better than CFNN model.

Improved Whale Optimization Algorithm applied to design PID plus second-order derivative controller for automatic voltage regulator system

ABSTRACT The paper proposes an Improved Whale Optimization Algorithm (IWOA). Its performance is validated by solving 23 benchmark functions. Comparing the results of IWOA with well-known meta-heuristic algorithms shows its efficiency. Three non-parametric statistical tests, namely, Friedman, Friedman aligned and Quade tests are used to confirm the proposed algorithm’s superiority. IWOA is employed to design the parameters of a controller, namely, PID plus second-order derivative (PIDD2) for an automatic voltage regulator system (AVR). In fact, the proposed technique benefits from an evolutionary operator crossover to promote the diversity of solutions while maintaining a reasonable local search behavior. The results are compared with the results of similar algorithms including Particle Swarm Optimization, Genetic Algorithm, Teaching Learning-Based Optimization, Differential Evolution, Cuckoo Search algorithm and Artificial Bee Colony, demonstrating the advantages and the efficiency of the IWOA-PIDD2 controller. Robustness analysis of the optimal design obtained is conducted by varying the time constants of the AVR system component. The results proved that the proposed technique reliably outperforms most of the current techniques.

Di-DE: Depth Information-Based Differential Evolution With Adaptive Parameter Control for Numerical Optimization

Differential Evolution (DE) is a simple and effective stochastic algorithm for optimization problems, and it became much more popular in recent year because of its easy-implementation and excellent performance. Nevertheless, the performance of DE algorithm is greatly affected by the trial vector generation strategy including mutation strategy and parameter control, both of which still exist some weaknesses, e.g. the premature convergence to some local optima of a mutation strategy and the misleading interaction among control parameters. Therefore in this paper, a novel Di-DE algorithm is proposed to tackle these weaknesses. A depth information based external archive was advanced in our novel mutation strategy, which can get a better perception of the landscape of objective in an optimization. Moreover, a novel grouping strategy was also employed in Di-DE and parameters were updated separately so as to avoid the misleading among parameters. Moreover, a cooperative strategy for information interchange was also advanced aiming at improving the efficiency of the exploration behavior. By absorbing these advancements, the novel Di-DE algorithm can secure better performance in comparison with other famous optimization algorithms. The algorithm validation was conducted on CEC2013 and CEC2017 test suites, and the results revealed the competitiveness of our Di-DE algorithm in comparison with those famous optimization algorithms including Particle Swarm Optimization (PSO) variants, QUasi-Affine TRansformation Evolution (QUATRE) variants and Differential Evolution (DE) variants.

Greenfly Aphid Swarm Optimization Algorithm

A new metaheuristic swarm intelligence optimization technique, called general greenfly aphid swarm optimization algorithm, which is proposed by enhancing the performance of swarm optimization through cockroach swarm optimization algorithm. The performance of 23 benchmark functions is tested and compared with widely used algorithms, including particle swarm optimization algorithm, cockroach swarm optimization and grasshopper optimization algorithm. Numerical experiments show that the greenfly aphid swarm optimization algorithm outperforms its counterparts. Besides, to demonstrate the practical impact of the proposed algorithm, two classic engineering design problems, namely, pressure vessel design problem and himmelblau’s optimization problem, are also considered and the proposed greenfly aphid swarm optimization algorithm is shown to be competitive in those applications.

Optimization and prediction of surface quality and cutting forces in the milling of aluminum alloys using ANFIS and interval type 2 neuro fuzzy network coupled with population-based meta-heuristic learning methods

Milling is among the most commonly used, flexible, and complex machining methods; and adequate selection of process parameters, modeling, and optimization of milling is challenging. Due to complex morphology of cutting process, edge and surface defects and elevated cutting forces and temperature are the main observations if non-adequate cutting parameters are selected. Therefore, modeling surface roughness and cutting forces in the milling process are of prime importance. Due to the ability of neuro-fuzzy networks to maintain appropriate modeling with investigation of uncertainties and the capacity of meta-heuristic approaches to set the coefficients of these networks precisely, in the present study, the coupled models of adaptive neuro-fuzzy inference system (ANFIS-type fuzzy neural networks) and interval type 2 fuzzy neural networks with evolutionary learning algorithms including particle swarm optimization (PSO) and genetic algorithm (GA) were used to predict the mean values of directional cutting forces as well as average surface roughness (Ra) in milling aluminum alloys (AA6061, AA2024, AA7075) under various cutting conditions and insert coatings. The main innovation of the present study refers to implementation of IT2FNN- PSO method in the machining operations. No similar research in this regards was found in the literature. According to the results, it was found that the proposed methods led to excellent and precise modeling results with high correlation rates with experimental outputs. The use of IT2FNN-PSO led to better performance as compared to observations made in other two ANFIS-based models aforementioned.

Meta-heuristic design optimization of steel moment resisting frames subjected to natural frequency constraints

Natural frequencies of a structure play a key role for finding underlying structural properties. Therefore, structural design considering natural frequencies is a very important issue for engineers. While there are many studies on optimization of truss structures under multiple frequency constraints, just a few studies have been published on steel frames for which only gradient based methods were applied. In this paper, meta-heuristic algorithms are applied for the first time ever to optimal design of steel frame structures with frequency constraints. Several benchmark design examples are solved with five algorithms including particle swarm optimization (PSO), charged system search (CSS), teaching-learning based optimization (TLBO), grey wolf optimizer (GWO) and a recently developed improved grey wolf optimizer (IGWO). Optimization results of these algorithms are compared in terms of statistical indices, convergence and optimum solutions. Various types of planar and space steel frames ranging from small to large scale cases are considered for illustrating merits and applicability of meta-heuristic algorithms to these sizing optimization problems wherein the large scale cases are studied in both continuous and discrete forms.