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 ...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.展开更多
<p> <span style="font-family:Verdana;">To address the drawbacks of the traditional Parker test in multivariate linear</span><span style="font-family:;" "=""> ...<p> <span style="font-family:Verdana;">To address the drawbacks of the traditional Parker test in multivariate linear</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">models:</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">the process is cumbersome and computationally intensive,</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">we propose a new heteroscedasticity test.</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">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.</span> </p>展开更多
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...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.展开更多
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 pr...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.展开更多
文摘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.
文摘<p> <span style="font-family:Verdana;">To address the drawbacks of the traditional Parker test in multivariate linear</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">models:</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">the process is cumbersome and computationally intensive,</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">we propose a new heteroscedasticity test.</span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">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.</span> </p>
基金We deeply acknowledge Taif University for supporting this study through Taif University Researchers Supporting Project Number(TURSP-2020/313),Taif University,Taif,Saudi Arabia.
文摘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.
基金the National Natural Science Foundation of China(Nos.60574071 and70771080)
文摘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.