Using Enhanced Sparrow Search Algorithm-Deep Extreme Learning Machine Model to Forecast End-Point Phosphorus Content of BOF

：An effective technology for predicting the end-point phosphorous content of basic oxygen furnace (BOF) can provide theoretical instruction to improve the quality of steel via controlling the hardness and toughness. Given the slightly inadequate prediction accuracy in the existing prediction model, a novel hybrid method was suggested to more accurately predict the end-point phosphorus content by integrating an enhanced sparrow search algorithm (ESSA) and a multi-strategy with a deep extreme learning machine (DELM) as ESSA-DELM in this study. To begin with, the input weights and hidden biases of DELM were randomly selected, resulting in that DELM inevitably had a set of non-optimal or unnecessary weights and biases. Therefore, the ESSA was used to optimize the DELM in this work. For the ESSA, the Trigonometric substitution mechanism and Cauchy mutation were introduced to avoid trapping in local optima and improve the global exploration capacity in SSA. Finally, to evaluate the prediction efficiency of ESSSA-DELM, the proposed model was tested on process data of the converter from the Baogang steel plant. The efficacy of ESSA-DELM was more superior to that of other DELM-based hybrid prediction models and conventional models. The result demonstrated that the hit rate of end-point phosphorus content within ±0.003%, ±0.002%, and ±0.001% was 91.67%, 83.33%, and 63.55%, respectively. The proposed ESSA-DELM model could possess better prediction accuracy compared with other models, which could guide field operations.

Antlion Algorithm Based on Immune Cloning and Its Truss Optimization

Antlion optimization algorithm has good search and development capabilities, but the influence weight of elite ant lions is reduced in the later stage of optimization, which leads to slower algorithm convergence and easy to fall into local optimization. For this purpose, an antlion optimization algorithm based on immune cloning was proposed. In the early stage, the reverse learning strategy was used to initialize the ant population. The Cauchy mutation operator was added to the elite antlion update to improve the later development ability of the algorithm; finally, the antlion was cloned and mutated with the immune clone selection algorithm to change the position and fitness value of the antlion, and further improve the algorithm's global optimization ability and convergence accuracy. 10 test functions and a 0~1 backpack were used to evaluate the optimization ability of the algorithm and applied to the size and layout optimization problems of the truss structure. The optimization effect was found to be good through the force effect diagram. It is verified that ICALO is applied to combinatorial optimization problems with faster convergence speed and higher accuracy. It provides a new method for structural optimization.This article is submitted as original content. The authors declare that they have no competing interests.

Strengthened Teaching–Learning-Based Optimization Algorithm for Numerical Optimization Tasks

The teaching–learning-based optimization algorithm (TLBO) is an efficient optimizer. However, it has several shortcomings such as premature convergence and stagnation at local optima. In this paper, the strengthened teaching–learning-based optimization algorithm (STLBO) is proposed to enhance the basic TLBO’s exploration and exploitation properties by introducing three strengthening mechanisms: the linear increasing teaching factor, the elite system composed of new teacher and class leader, and the Cauchy mutation. Subsequently, seven variants of STLBO are designed based on the combined deployment of the three improved mechanisms. Performance of the novel STLBOs is evaluated by implementing them on thirteen numerical optimization tasks. The results show that STLBO7 is at the top of the list, significantly better than the original TLBO. Moreover, the remaining six variants of STLBO also outperform TLBO. Finally, a set of comparisons are implemented between STLBO7 and other advanced optimization techniques. The numerical results and convergence curves prove that STLBO7 clearly outperforms other competitors, has stronger local optimal avoidance, faster convergence speed and higher solution accuracy. All the above manifests that STLBOs has improved the search performance of TLBO. Data Availability Statements: All data generated or analyzed during this study are included in this published article.

A Novel Crow Search Algorithm Based on Improved Flower Pollination

Crow search algorithm (CSA) is a new type of swarm intelligence optimization algorithm proposed by simulating the crows’ intelligent behavior of hiding and retrieving food. The algorithm has the characteristics of simple structure, few control parameters, and easy implementation. Like most optimization algorithms, the crow search algorithm also has the disadvantage of slow convergence and easy fall into local optimum. Therefore, a crow search algorithm based on improved flower pollination algorithm (IFCSA) is proposed to solve these problems. First, the search ability of the algorithm is balanced by the reasonable change of awareness probability, and then the convergence speed of the algorithm is improved. Second, when the leader finds himself followed, the cross-pollination strategy with Cauchy mutation is introduced to avoid the blindness of individual location update, thus improving the accuracy of the algorithm. Experiments on twenty benchmark problems and speed reducer design were conducted to compare the performance of IFCSA with that of other algorithms. The results show that IFCSA has better performance in function optimization and speed reducer design problem.

Task scheduling and resource allocation of seasonal requests of users in cloud using NMKA and CM-GA techniques

Purpose The purpose of this paper is to provide energy-efficient task scheduling and resource allocation (RA) in cloud data centers (CDC). Design/methodology/approach Task scheduling and RA is proposed in this paper for cloud environment, which schedules the user’s seasonal requests and allocates resources in an optimized manner. The proposed study does the following operations: data collection, feature extraction, feature reduction and RA. Initially, the online streaming data of seasonal requests of multiple users were gathered. After that, the features are extracted based on user requests along with the cloud server, and the extracted features are lessened using modified principal component analysis. For RA, the split data of the user request is identified and that data is pre-processed by computing closed frequent itemset along with entropy values. After that, the user requests are scheduled using the normalized K-means algorithm (NKMA) centered on the entropy values. Finally, the apt resources are allotted to that scheduled task using the Cauchy mutation-genetic algorithm (CM-GA). The investigational outcomes exhibit that the proposed study outruns other existing algorithms in respect to response time, execution time, clustering accuracy, precision and recall. Findings The proposed NKMA and CM-GA technique’s performance is analyzed by comparing them with the existing techniques. The NKMA performance is analyzed with KMA and Fuzzy C-means regarding Prc (Precision), Rca (Recall), F ms (f measure), Acr (Accuracy)and Ct (Clustering Time). The performance is compared to about 500 numbers of tasks. For all tasks, the NKMA provides the highest values for Prc, Rca, Fms and Acr, takes the lowest time (Ct) for clustering the data. Then, the CM-GA optimization for optimally allocating the resource in the cloud is contrasted with the GA and particle swarm optimization with respect to Rt (Response Time), Pt (Process Time), Awt (Average Waiting Time), Atat (Average Turnaround Time), Lcy (Latency) and Tp (Throughput). For all number of tasks, the proposed CM-GA gives the lowest values for Rt, Pt, Awt, Atat and Lcy and also provides the highest values for Tp. So, from the results, it is known that the proposed technique for seasonal requests RA works well and the method optimally allocates the resources in the cloud. Originality/value The proposed approach provides energy-efficient task scheduling and RA and it paves the way for the development of effective CDC.

Research on Economic Optimization of Microgrid Cluster Based on Chaos Sparrow Search Algorithm

With the deepening of the power market reform on the retail side, it is of great significance to study the economic optimization of the microgrid cluster system. Aiming at the economics of the microgrid cluster, comprehensively considering the degradation cost of energy storage battery, the compensation cost of demand-side controllable loads dispatch, the electricity transaction cost between the microgrids, and the electricity transaction cost between the microgrid and the power distribution network of the microgrid cluster, we establish an optimal dispatch model for the microgrid cluster including wind turbines, photovoltaics, and energy storage batteries. At the same time, in view of the problem that the population diversity of the basic sparrow search algorithm decreases and it is easy to fall into local extremes in the later iterations of the basic sparrow search algorithm, a chaos sparrow search algorithm based on Bernoulli chaotic mapping, dynamic adaptive weighting, Cauchy mutation, and reverse learning is proposed, and different types of test functions are used to analyze the convergence effect of the algorithm, and the calculation effects of the sparrow algorithm, the particle swarm algorithm, the chaotic particle swarm, and the genetic algorithm are compared. The algorithm has higher convergence speed, higher accuracy, and better global optimization ability. Finally, through the calculation example, it is concluded that the benefit of the microgrid cluster is increased by nearly 20%, which verifies the effectiveness of the improvement.

Eagle Strategy with Cauchy Mutation Particle Swarm Optimization for Energy Management in Cloud Computing

Energy management of the cloud datacentre is a challenging task, especially when the cloud server receives a number of the user’s request simultaneously. This requires an efficient method to optimally allocate the resources to the users. Resource allocation in cloud data centers need to be done in optimized manner for conserving energy keeping in view of Service Level Agreement (SLA). We propose, Eagle Strategy (ES) based Modified Particle Swarm Optimization (ES-MPSO) to minimize the energy consumption and SLA violation. The Eagle Strategy method is applied due to its efficient local optimization technique. The Cauchy Mutation method which schedules the task effectively and minimize energy consumption, is applied to the proposed ES-MPSO method for improving the convergence performance. The simulation result shows that the energy consumption of ES-MPSO is 42J and Particle Swarm Optimization (PSO) is 51J. The proposed method ES-MPSO achieves higher efficiency compared to the PSO method in terms of energy management and SLA.

A Binary Superior Tracking Artificial Bee Colony with Dynamic Cauchy Mutation for Feature Selection

This paper aims to propose an improved learning algorithm for feature selection, termed as binary superior tracking artificial bee colony with dynamic Cauchy mutation (BSTABC-DCM). To enhance exploitation capacity, a binary learning strategy is proposed to enable each bee to learn from the superior individuals in each dimension. A dynamic Cauchy mutation is introduced to diversify the population distribution. Ten datasets from UCI repository are adopted as test problems, and the average results of cross-validation of BSTABC-DCM are compared with other seven popular swarm intelligence metaheuristics. Experimental results demonstrate that BSTABC-DCM could obtain the optimal classification accuracy and select the best representative features for the UCI problems.