云计算中基于NSGA Ⅱ的虚拟资源调度算法

云计算环境下将物理资源抽象为同一的虚拟资源,如何将虚拟资源调度到物理资源上是云计算中一个基本且复杂的问题.对虚拟资源的调度进行建模并证明其难解性,将该模型的求解转化以系统负载均衡为优化目标的多目标优化问题,提出采用改进的基于非支配排序的遗传算法(NSGA Ⅱ)来求解该问题.与针对具体环境的调度算法相比,抽象的模型更能代表典型的云计算环境中的虚拟资源调度问题.对提出模型进行了仿真,实验结果表明了该模型的有效性和NSGA Ⅱ算法求解该问题的可行性,同时对比随机算法、静态算法和排序匹配调度算法,NSGA Ⅱ算法优于其他算法.     

面向云计算环境的分布式软件部署算法

分布式软件在云计算环境中的优化部署是云计算应用中的一个关键问题。针对该问题提出了一个软件部署算法,它具有多项式时间复杂度。对云计算环境的优化部署问题进行了描述,提出了相应的算法,介绍了实验并对实验结果进行了分析和讨论。     

多域SFC部署中基于强化学习的多目标优化方法

随着网络虚拟化技术的发展,多域网络中的服务功能链部署为服务功能链优化部署问题带来了新的挑战.传统的部署方法通常对单一目标进行优化,不适用于多目标优化问题,且无法对优化目标间权重进行衡量及平衡.因此,为了对大规模服务功能链部署请求下的时延、网络负载均衡性及接受率进行同步优化,提出了一种数据归一化处理方案,并设计了基于强化学习的两步SFC部署算法.该算法以传输时延与负载均衡性为反馈参数,平衡了两者的权重关系,并对其进行了同步优化,同时利用强化学习框架优化了SFC接受率.实验结果表明,所提算法在大规模请求数下,相比时延感知方法时延降低了71.8％,相比多域部署方法接受率提高了4.6％,相比贪心算法平均负载均衡性提高了39.1％,保证了多目标优化效果.     

基于膜计算的蝙蝠算法在云计算资源调度的研究

如何进一步实现云计算环境下的资源利用最大化是目前研究的热点.建立云计算环境下的资源分配模型,云计算资源调度使用蝙蝠算法,同时引入膜计算概念,提出一种基于膜计算的蝙蝠算法,将膜系统内部分解为主膜和辅助膜,在辅助膜内进行蝙蝠的个体局部寻优,将优化后的个体传送到主膜间进行全局优化,从而达到了云计算资源优化分配要求.通过CloudSim平台与其他算法进行仿真对比表明算法提高了云计算环境下的系统处理时间和效率,使得云计算环境下的资源分配更加合理.     

云计算环境下动态数据聚集算法研究

云计算技术的普及带动了数据的增长,为了对云环境下动态数据进行管理,防止数据损坏甚至丢失,方便后续利用,需要对云计算环境下动态数据进行聚集。但目前大多数算法都是基于线性时间概率计数的数据聚集算法,通过数据聚集操作在中间节点预先对数据进行处理,去除数据冗余,减少数据传输,实现节能,对于云计算环境下数据聚集操作存在的重复计数问题,通过研究对副本不敏感的概要结构并优化某些特性,从而完成数据聚集,但这种方法存在占用的存储空间较大,且不能保证动态数据聚集的准确性的问题。为此,提出一种基于粒子群优化算法的云计算环境下动态数据聚集算法,该算法通过对云计算环境下动态数据聚集算法数学模型进行分析,在此基础上,提出基于粒子群优化算法的云计算环境下动态数据聚集算法。首先对云计算环境中的动态数据结构模型进行分析,完成对云计算环境下动态数据的离散样本频谱特征的计算,实现云计算环境下动态数据聚集样本的特征提取和信息模型构建。针对粒子群算法收敛速度慢的问题,本文通过混沌映射方法对其进行优化,通过生成混沌序列,解决粒子群算法存在的问题,利用粒子群优化算法进行特征聚集,从而完成云计算环境下动态数据聚集算法。实验结果表明,本文所提算法能够有效提高动态数据聚集的可靠性和稳定性,降低聚集时间,减少所占内存空间,具有较强的实践性,为该领域的发展创造了条件。     

云计算环境下基于用户和资源约束的免疫效用均衡任务调度算法

针对云计算中的任务调度问题, 提出了一种免疫均衡效用任务调度算法. 该算法将云计算环境下任务调度问题建模为一个多目标优化模型, 同时兼顾了用户任务的时间跨度和虚拟化资源的负载均衡. 仿真结果表明, 该任务调度算法提高了用户满意度的同时减少了任务的完成时间, 是云平台下一种有效的任务调度策略.     

多云工作流优化传输费用的数据布局策略

科学工作流应用是一种复杂且数据密集型的应用,常应用于结构生物学、高能物理学和神经学等涉及分布式数据源的学科。数据分散存储在基于互联网的云计算平台上,致使科学工作流在执行时伴随着大量的数据传输。云计算是一种按使用量付费的模式,数据传输产生传输费用,尤其在多个工作流相互协同的情况下,将产生更高的传输成本。该文从全局的角度建立基于多工作流数据依赖图的传输成本模型,研究基于二进制粒子群算法（BPSO）的数据布局优化策略,从而减少对云计算传输资源的租赁费用。     

多云工作流优化传输费用的数据布局策略

科学工作流应用是一种复杂且数据密集型的应用,常应用于结构生物学、高能物理学和神经学等涉及分布式数据源的学科。数据分散存储在基于互联网的云计算平台上,致使科学工作流在执行时伴随着大量的数据传输。云计算是一种按使用量付费的模式,数据传输产生传输费用,尤其在多个工作流相互协同的情况下,将产生更高的传输成本。该文从全局的角度建立基于多工作流数据依赖图的传输成本模型,研究基于二进制粒子群算法(BPSO)的数据布局优化策略,从而减少对云计算传输资源的租赁费用。     

基于QoS和效用的云计算资源调度模型

针对已有的云计算环境下资源调度模型往往仅考虑任务执行跨度而忽略了能提高用户满意度的效用因素,为此,提出了一种基于用户需求QoS和最大化效用为目标的云计算资源调度模型;首先给出了云计算资源调度的框架和数学模型,并将满足用户预算和最迟完完工时间约束的总效用函数作为优化目标;然后对所有任务构造决策矩阵和归一化处理,并采用拉格朗日松弛求取属性权重向量,从而构造出最终的基于多维属性的总效用函数;最后,定义了基于QoS和以最大化效用为目标的云计算资源调度算法;采用CloudSim工具进行仿真实验,结果表明:文中方法能获得最优的资源调度方案,且与其它方法相比,具有较少的平均执行时间和执行花费,具有较大的优越性。     

云环境下改进SOS的多目标任务调度算法

为有效获取云计算中多目标任务调度求解算法的全局最优解,提出一种云环境下基于改进期望服务质量(Qo S)的多目标任务调度算法。设计多目标任务调度框架,提出相应的目标函数与约束条件。利用准反射学习构建初始种群以改进共生生物搜索(SOS)算法,加入自适应变异率以提高全局搜索能力。通过设定坐标进行任务分配,利用改进后SOS算法实现多目标任务优化调度。云计算仿真结果表明,所提算法相比于其它算法,有效改善了能源利用率、能耗和时间成本,具有较好的Qo S传输性能。     

Blended biogeography-based optimization for constrained optimization

Biogeography-based optimization (BBO) is a new evolutionary optimization method that is based on the science of biogeography. We propose two extensions to BBO. First, we propose a blended migration operator. Benchmark results show that blended BBO outperforms standard BBO. Second, we employ blended BBO to solve constrained optimization problems. Constraints are handled by modifying the BBO immigration and emigration procedures. The approach that we use does not require any additional tuning parameters beyond those that are required for unconstrained problems. The constrained blended BBO algorithm is compared with solutions based on a stud genetic algorithm (SGA) and standard particle swarm optimization 2007 (SPSO 07). The numerical results demonstrate that constrained blended BBO outperforms SGA and performs similarly to SPSO 07 for constrained single-objective optimization problems.     

Biogeography-based optimization for constrained optimization problems

Biogeography-based optimization (BBO) has been recently proposed as a viable stochastic optimization algorithm and it has so far been successfully applied in a variety of fields, especially for unconstrained optimization problems. The present paper shows how BBO can be applied for constrained optimization problems, where the objective is to find a solution for a given objective function, subject to both inequality and equality constraints.     

The particle swarm optimization algorithm in size and shape optimization

Shape and size optimization problems instructural design are addressed using the particle swarm optimization algorithm (PSOA). In our implementation of the PSOA, the social behaviour of birds is mimicked. Individual birds exchange information about their position, velocity and fitness, and the behaviour of the flock is then influenced to increase the probability of migration to regions of high fitness. New operators in the PSOA, namely the elite velocity and the elite particle, are introduced. Standard size and shape design problems selected from literature are used to evaluate the performance of the PSOA. The performance of the PSOA is compared with that of three gradient based methods, as well as the genetic algorithm (GA). In attaining the approximate region of the optimum, our implementation suggests that the PSOA is superior to the GA, and comparable to gradient based algorithms. Received December 18, 2000     

Multiobjective optimization using population-based extremal optimization

In recent years, a general-purpose local-search heuristic method called Extremal Optimization (EO) has been successfully applied in some NP-hard combinatorial optimization problems. In this paper, we present a novel Pareto-based algorithm, which can be regarded as an extension of EO, to solve multiobjective optimization problems. The proposed method, called Multiobjective Population-based Extremal Optimization (MOPEO), is validated by using five benchmark functions and metrics taken from the standard literature on multiobjective evolutionary optimization. The experimental results demonstrate that MOPEO is competitive with the state-of-the-art multiobjective evolutionary algorithms. Thus MOPEO can be considered as a viable alternative to solve multiobjective optimization problems.     

改进的r支配高维多目标粒子群优化算法

高维多目标优化问题是广泛存在于实际应用中的复杂优化问题,目前的研究方法大都限于进化算法.本文利用粒子群优化算法求解高维多目标优化问题,提出了一种基于r支配的多目标粒子群优化算法.采用r支配关系进行粒子的比较与选择,并结合粒子群优化算法收敛速度快的优势,使得算法在目标个数增加时仍保持较强的搜索能力;为了弥补由此造成的群体多样性的丢失,优化非r支配阈值的取值策略;此外,引入决策空间的拥挤距离测度,并给出新的外部存储器更新方法,从而进一步防止算法陷入局部最优.对多个基准测试函数的仿真结果表明所得解集在收敛性、多样性以及围绕参考点的分布性上均优于其他两种算法.     

A hybrid multi-objective tour route optimization algorithm based on particle swarm optimization and artificial bee colony optimization

Computational intelligence techniques have widespread applications in the field of engineering process optimization, which typically comprises of multiple conflicting objectives. An efficient hybrid algorithm for solving multi-objective optimization, based on particle swarm optimization (PSO) and artificial bee colony optimization (ABCO) has been proposed in this paper. The novelty of this algorithm lies in allocating random initial solutions to the scout bees in the ABCO phase which are subsequently optimized in the PSO phase with respect to the velocity vector. The last phase involves loyalty decision-making for the uncommitted bees based on the waggle dance phase of ABCO. This procedure continues for multiple generations yielding optimum results. The algorithm is applied to a real life problem of intercity route optimization comprising of conflicting objectives like minimization of travel cost, maximization of the number of tourist spots visited and minimization of the deviation from desired tour duration. Solutions have been obtained using both pareto optimality and the classical weighted sum technique. The proposed algorithm, when compared analytically and graphically with the existing ABCO algorithm, has displayed consistently better performance for fitness values as well as for standard benchmark functions and performance metrics for convergence and coverage.     

Plantwide optimization via real-time optimization with persistent parameter adaptation

Determining the optimization scope is a major issue whenever implementing Real-time Optimization (RTO). Ideally, the optimization problem should encompass the whole plant and not a single unit, which represents only a local subset of the problem. However, if the standard RTO method, the two-step approach (TS), is applied to the entire plant, the whole system needs to be at steady-state (SS) in order to initiate the optimization cycle. This condition is rarely found in practice. One alternative is to apply Real-time Optimization with Persistent Parameter Adaptation (ROPA). ROPA is an RTO variant that integrates online estimators to the standard TS framework and avoids the need of waiting for steady-state to trigger the optimization cycle. However, the problem shifts to obtaining a dynamic model of the entire plant, which can be challenging and time consuming. This paper proposes a variant of ROPA, named asynchronous ROPA (asROPA), where the plant-wide model is partitioned into submodels and, depending on their characteristics, their parameters are updated using either online or steady-state estimators. Consequently, it is not necessary to obtain a dynamic model for the whole process. This asynchronous updating strategy allows the plant-wide model to be up-to-date to the process and the plant-wide optimization can be scheduled at any arbitrary time. The new strategy is applied to a case study consisting of a system whose model can be partitioned into a separation and a reaction submodel. The plant-wide results indicate that asROPA reacts much faster to the disturbances in comparison to the TS approach, improving the overall economic performance and is able to drive the system to the plant-wide optimum. Additionally, a strategy for partitioning the process and choosing the estimation strategy for each partition is proposed.     

一种新型的全局优化算法——细胞膜优化算法*

通过研究细胞膜的特性及其物质转运方式,从中进行提取优化模型,并结合全局优化算法的基本思想,提出了一种新型的全局优化算法——细胞膜优化算法（CMO）。通过数值实验,验证了细胞膜优化算法具有很好的全局寻优能力、快速的收敛能力和获取高精度解的能力,并与标准粒子群算法（PSO）和人口迁移算法（PMA）进行比较,结果表明,细胞膜优化算法在解决高维优化问题时具有更好的收敛性能。     

Multi-objective ordinal optimization for simulation optimization problems

Ordinal optimization (OO) has been successfully applied to accelerate the simulation optimization process with single objective by quickly narrowing down the search space. In this paper, we extend the OO techniques to address multi-objective simulation optimization problems by using the concept of Pareto optimality. We call this technique the multi-objective OO (MOO). To define the good enough set and the selected set, we introduce two performance indices based on the non-dominance relationship among the designs. Then we derive several lower bounds for the alignment probability under various scenarios by using a Bayesian approach. Numerical experiments show that the lower bounds of the alignment probability are valid when they are used to estimate the size of the selected set as well as the expected alignment level. Though the lower bounds are conservative, they have great practical value in terms of narrowing down the search space.     

多策略的郊狼优化算法

郊狼优化算法（coyote optimization algorithm,COA）是最近提出的一种群智能优化算法,具有独特的搜索结构和较好的优化性能。为了进一步提高COA的优化性能,提出了一种多策略的郊狼优化算法（multi-strategy COA,MSCOA）。首先,对于组内最优郊狼,采用一种全局最优郊狼引导的成长策略提高其社会适应能力,对于组内最差郊狼,采用一种最优郊狼引导强化策略强化最差郊狼的能力;其次,对于组内其他郊狼采用一种动态调整信息交流的组内成长策略提升组内郊狼之间的信息共享程度,并将这种组内成长策略与一种改进的迁移策略融合,更进一步提升搜索能力;最后采用动态分组策略减少参数手动设置,提高算法的可操作性。以上多种策略的使用更好地平衡了探索与开采,使算法的性能最大化。大量来自CEC2014测试集的复杂函数实验结果表明,与COA相比,MSCOA具有更强搜索能力、更快的运行速度和更高的搜索效率,与其他优秀优化算法相比,具有更明显的优势。