Optimizing Grey Wolf Optimization: A Novel Agents’ Positions Updating Technique for Enhanced Efficiency and Performance

Grey Wolf Optimization (GWO) is a nature-inspired metaheuristic algorithm that has gained popularity for solving optimization problems. In GWO, the success of the algorithm heavily relies on the efficient updating of the agents’ positions relative to the leader wolves. In this paper, we provide a brief overview of the Grey Wolf Optimization technique and its significance in solving complex optimization problems. Building upon the foundation of GWO, we introduce a novel technique for updating agents’ positions, which aims to enhance the algorithm’s effectiveness and efficiency. To evaluate the performance of our proposed approach, we conduct comprehensive experiments and compare the results with the original Grey Wolf Optimization technique. Our comparative analysis demonstrates that the proposed technique achieves superior optimization outcomes. These findings underscore the potential of our approach in addressing optimization challenges effectively and efficiently, making it a valuable contribution to the field of optimization algorithms.

Determination of interference fit value on entire roller embedded shapemeter roll

For entire roller embedded shapemeter roll, the relationship between the value of interference fit and the sensor pre-pressure, and the pressure transfer performance of shapemeter roll were analyzed by elasticity theory during the cold reversible rolling process. Considering the influence of strip temperature on the interference fit, the distributions of contact pressure of the framework's top surface and the sensor pre-pressure on different values of interference fit were analyzed by the finite element technology. The results show that the contact pressure of the framework's top surface and the sensor pre-pressure increase with the increase of the value of interference fit. When the value of interference fit is between 0.05 mm and 0.09 mm, roll body's inner hole surface, the framework and pressure magnetic sensitive component don't separate from each other, and the sensor works in the linear segment of characteristic curve, so the normal operation of shapemeter roll is guaranteed.

Parker Test for Heteroskedasticity Based on Sample Fitted Values

To address the drawbacks of the traditional Parker test in multivariate linear models: the process is cumbersome and computationally intensive, we propose a new heteroscedasticity test. A new heteroskedasticity test is proposed using the fitted values of the samples as new explanatory variables, reconstructing the regression model, and giving a new heteroskedasticity test based on the significance test of the coefficients, it is also compared with the existing Parker test which is improved using the principal component idea. Numerical simulations and empirical analyses show that the improved Parker test with the fitted values of the samples proposed in this paper is superior.

Modified Bat Algorithm for Optimal VM’s in Cloud Computing

All task scheduling applications need to ensure that resources are optimally used,performance is enhanced,and costs are minimized.The purpose of this paper is to discuss how to Fitness Calculate Values(FCVs)to provide application software with a reliable solution during the initial stages of load balancing.The cloud computing environment is the subject of this study.It consists of both physical and logical components(most notably cloud infrastructure and cloud storage)(in particular cloud services and cloud platforms).This intricate structure is interconnected to provide services to users and improve the overall system’s performance.This case study is one of the most important segments of cloud computing,i.e.,Load Balancing.This paper aims to introduce a new approach to balance the load among Virtual Machines(VM’s)of the cloud computing environment.The proposed method led to the proposal and implementation of an algorithm inspired by the Bat Algorithm(BA).This proposed Modified Bat Algorithm(MBA)allows balancing the load among virtual machines.The proposed algorithm works in two variants:MBA with Overloaded Optimal Virtual Machine(MBAOOVM)and Modified Bat Algorithm with Balanced Virtual Machine(MBABVM).MBA generates cost-effective solutions and the strengths of MBA are finally validated by comparing it with Bat Algorithm.

Strategy of changing cracking furnace feedstock based on improved group search optimization

The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is proposed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the "excellent" infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Finally, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained.

An adaptive genetic algorithm for solving bilevel linear programming problem

Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this problem. Of all the algorithms, the ge- netic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes maybe infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.

Forecasting Gas Consumption Based on a Residual Auto-Regression Model and Kalman Filtering Algorithm

Consumption of clean energy has been increasing in China.Forecasting gas consumption is important to adjusting the energy consumption structure in the future.Based on historical data of gas consumption from 1980 to 2017,this paper presents a weight method of the inverse deviation of fitted value,and a combined forecast based on a residual auto-regression model and Kalman filtering algorithm is used to forecast gas consumption.Our results show that:(1)The combination forecast is of higher precision:the relative errors of the residual auto-regressive model,the Kalman filtering algorithm and the combination model are within the range(–0.08,0.09),(–0.09,0.32)and(–0.03,0.11),respectively.(2)The combination forecast is of greater stability:the variance of relative error of the residual auto-regressive model,the Kalman filtering algorithm and the combination model are 0.002,0.007 and 0.001,respectively.(3)Provided that other conditions are invariant,the predicted value of gas consumption in 2018 is 241.81×10~9 m^3.Compared to other time-series forecasting methods,this combined model is less restrictive,performs well and the result is more credible.