Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the chall...Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.展开更多
The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency...The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.展开更多
This paper presents a Markov random field （MRP） approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general he...This paper presents a Markov random field （MRP） approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general heading distribution estimation using Markov random fields （DEUM）. DEUM is a subclass of estimation of distribution algorithms （EDAs） where interaction between solution variables is represented as an undirected graph and the joint probability of a solution is factorized as a Gibbs distribution derived from the structure of the graph. The focus of this paper will be on describing the three main characteristics of DEUM framework, which distinguishes it from the traditional EDA. They are： 1） use of MRF models, 2） fitness modeling approach to estimating the parameter of the model and 3） Monte Carlo approach to sampling from the model.展开更多
This paper presents a new method to reduce the distribution system loss by feeder reconfiguration.This new method combines self-adaptive particle swarm optimization(SAPSO) with shuffled frog-leaping algorithm(SFLA) in...This paper presents a new method to reduce the distribution system loss by feeder reconfiguration.This new method combines self-adaptive particle swarm optimization(SAPSO) with shuffled frog-leaping algorithm(SFLA) in an attempt to find the global optimal solutions for the distribution feeder reconfiguration(DFR).In PSO algorithm,appropriate adjustment of the parameters is cumbersome and usually requires a lot of time and effort.Thus,a self-adaptive framework is proposed to improve the robustness of PSO.In SAPSO the learning factors of PSO coevolve with the particles.SFLA is combined with the SAPSO algorithm to improve its performance.The proposed algorithm is tested on two distribution test networks.The results of simulation show that the proposed algorithm is very powerful and guarantees to obtain the global optimization in minimum time.展开更多
This paper proposed a novel distributed memetic evolutionary model,where four modules distributed exploration,intensified exploitation,knowledge transfer,and evolutionary restart are coevolved to maximize their streng...This paper proposed a novel distributed memetic evolutionary model,where four modules distributed exploration,intensified exploitation,knowledge transfer,and evolutionary restart are coevolved to maximize their strengths and achieve superior global optimality.Distributed exploration evolves three independent populations by heterogenous operators.Intensified exploitation evolves an external elite archive in parallel with exploration to balance global and local searches.Knowledge transfer is based on a point-ring communication topology to share successful experiences among distinct search agents.Evolutionary restart adopts an adaptive perturbation strategy to control search diversity reasonably.Quantum computation is a newly emerging technique,which has powerful computing power and parallelized ability.Therefore,this paper further fuses quantum mechanisms into the proposed evolutionary model to build a new evolutionary algorithm,referred to as quantum-inspired distributed memetic algorithm(QDMA).In QDMA,individuals are represented by the quantum characteristics and evolved by the quantum-inspired evolutionary optimizers in the quantum hyperspace.The QDMA integrates the superiorities of distributed,memetic,and quantum evolution.Computational experiments are carried out to evaluate the superior performance of QDMA.The results demonstrate the effectiveness of special designs and show that QDMA has greater superiority compared to the compared state-of-the-art algorithms based on Wilcoxon’s rank-sum test.The superiority is attributed not only to good cooperative coevolution of distributed memetic evolutionary model,but also to superior designs of each special component.展开更多
基金jointly supported by the Jiangsu Postgraduate Research and Practice Innovation Project under Grant KYCX22_1030,SJCX22_0283 and SJCX23_0293the NUPTSF under Grant NY220201.
文摘Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.
基金Project(50775089)supported by the National Natural Science Foundation of ChinaProject(2007AA04Z190,2009AA043301)supported by the National High Technology Research and Development Program of ChinaProject(2005CB724100)supported by the National Basic Research Program of China
文摘The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.
文摘This paper presents a Markov random field （MRP） approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general heading distribution estimation using Markov random fields （DEUM）. DEUM is a subclass of estimation of distribution algorithms （EDAs） where interaction between solution variables is represented as an undirected graph and the joint probability of a solution is factorized as a Gibbs distribution derived from the structure of the graph. The focus of this paper will be on describing the three main characteristics of DEUM framework, which distinguishes it from the traditional EDA. They are： 1） use of MRF models, 2） fitness modeling approach to estimating the parameter of the model and 3） Monte Carlo approach to sampling from the model.
文摘This paper presents a new method to reduce the distribution system loss by feeder reconfiguration.This new method combines self-adaptive particle swarm optimization(SAPSO) with shuffled frog-leaping algorithm(SFLA) in an attempt to find the global optimal solutions for the distribution feeder reconfiguration(DFR).In PSO algorithm,appropriate adjustment of the parameters is cumbersome and usually requires a lot of time and effort.Thus,a self-adaptive framework is proposed to improve the robustness of PSO.In SAPSO the learning factors of PSO coevolve with the particles.SFLA is combined with the SAPSO algorithm to improve its performance.The proposed algorithm is tested on two distribution test networks.The results of simulation show that the proposed algorithm is very powerful and guarantees to obtain the global optimization in minimum time.
文摘面向用户生成内容(User generated content,UGC)的进化搜索在大数据及个性化服务领域已引起广泛关注,其关键在于基于多源异构用户生成内容构建用户认知偏好模型,进而设计高效的进化搜索机制.针对此,提出融合注意力机制(Attention mechanism,AM)的受限玻尔兹曼机(Restricted Boltzmann machine,RBM)偏好认知代理模型构建机制,并应用于交互式分布估计算法(Interactive estimation of distribution algorithm,IEDA),设计含用户生成内容的个性化进化搜索策略.基于用户群体提供的文本评论,以及搜索物品的类别文本,构建无监督受限玻尔兹曼机模型提取广义特征;设计注意力机制,融合广义特征,获取对用户认知偏好高度相关特征的集成;利用该特征再次训练受限玻尔兹曼机,实现对用户偏好认知代理模型的构建;根据用户偏好认知代理模型,给出交互式分布估计算法概率更新模型以及物品适应度评价函数,实现物品个性化进化搜索.算法在亚马逊个性化搜索实例的应用验证了用户认知偏好模型的可靠性,以及个性化进化搜索的有效性.
基金the National Natural Science Foundation of China(No.62273193)the Talent Introducing Project of Hebei Agricultural University(Nos.KY201903 and YJ201953).
文摘This paper proposed a novel distributed memetic evolutionary model,where four modules distributed exploration,intensified exploitation,knowledge transfer,and evolutionary restart are coevolved to maximize their strengths and achieve superior global optimality.Distributed exploration evolves three independent populations by heterogenous operators.Intensified exploitation evolves an external elite archive in parallel with exploration to balance global and local searches.Knowledge transfer is based on a point-ring communication topology to share successful experiences among distinct search agents.Evolutionary restart adopts an adaptive perturbation strategy to control search diversity reasonably.Quantum computation is a newly emerging technique,which has powerful computing power and parallelized ability.Therefore,this paper further fuses quantum mechanisms into the proposed evolutionary model to build a new evolutionary algorithm,referred to as quantum-inspired distributed memetic algorithm(QDMA).In QDMA,individuals are represented by the quantum characteristics and evolved by the quantum-inspired evolutionary optimizers in the quantum hyperspace.The QDMA integrates the superiorities of distributed,memetic,and quantum evolution.Computational experiments are carried out to evaluate the superior performance of QDMA.The results demonstrate the effectiveness of special designs and show that QDMA has greater superiority compared to the compared state-of-the-art algorithms based on Wilcoxon’s rank-sum test.The superiority is attributed not only to good cooperative coevolution of distributed memetic evolutionary model,but also to superior designs of each special component.
