云虚拟环境下资源分配的研究与实现

云计算中的基础设施层IaaS(Infrastructureas a Service)是通过虚拟化技术管理底层物理资源,向用户提供可用的计算机集群。对于如何有效的分配资源,使其利用率最大化,即使得物理机器中的各种资源的碎片最小也成了云计算中需要考虑的问题。针对这一问题,可以结合遗传算法来解决这种多目标多约束的组合优化问题,实现云虚拟环境下的资源分配问题。通过仿真实验表明,该算法可用有效的减少物理机器中的碎片,提高资源的利用率。     

Complex componential approach for redundancy allocation problem solved by simulation-optimization framework

This article addresses the problem of redundancy and reliability allocation in the operational dimensioning of an automated production system. The aim of this research is to improve the global reliability of the system by allocating alternative components (redundancies) that are associated in parallel with each original component. By considering a complex componential approach that simultaneously evaluates the interrelations among sub-systems, conflicting goals, and variables of different natures, a solution for the problem is proposed through a multi-objective formulation that joins a multi-objective elitist genetic algorithm with a high-level simulation environment also known as simulation optimization framework.     

改进GSA算法在协同制造任务分配中的应用

针对网络化协同制造中的任务分配问题,建立了以制造任务完成时间、完成成本、产品工艺质量为目标的多目标优化模型,提出了模型求解的改进遗传模拟退火（Genetic Simulated Annealing,GSA）算法。建立了协同制造任务分配的层次结构模型,应用模糊层次分析法分析了时间、成本和工艺质量等因素在协同制造任务分配过程中的相对重要性。设计了优化模型求解的改进遗传模拟退火算法,并结合具体实例验证了算法的有效性和优越性。     

Multi-objective optimization of fiber reinforced composite laminates for strength,stiffness and minimal mass

We present a methodology for the multi-objective optimization of laminated composite materials that is based on an integer-coded genetic algorithm. The fiber orientations and fiber volume fractions of the laminae are chosen as the primary optimization variables. Simplified micromechanics equations are used to estimate the stiffnesses and strength of each lamina using the fiber volume fraction and material properties of the matrix and fibers. The lamina stresses for thin composite coupons subjected to force and/or moment resultants are determined using the classical lamination theory and the first-ply failure strength is computed using the Tsai–Wu failure criterion. A multi-objective genetic algorithm is used to obtain Pareto-optimal designs for two model problems having multiple, conflicting, objectives. The objectives of the first model problem are to maximize the load carrying capacity and minimize the mass of a graphite/epoxy laminate that is subjected to biaxial moments. In the second model problem, the objectives are to maximize the axial and hoop rigidities and minimize the mass of a graphite/epoxy cylindrical pressure vessel subject to the constraint that the failure pressure be greater than a prescribed value.     

不确定可靠性优化问题的多目标粒子群优化算法

针对元件可靠性为区间值的系统可靠性优化问题, 提出一种区间多目标粒子群优化方法. 首先, 建立问题的区间多目标优化模型; 然后, 利用粒子群算法优化该模型, 定义一种不精确Pareto 支配关系, 并给出编码、约束处理、外部存储器更新、领导粒子选择等关键问题的解决方法; 最后, 将该方法应用于可靠性优化问题实例, 验证了方法的有效性.

     

Genetic algorithm based multi-objective reliability optimization in interval environment

In most of the real world design or decision making problems involving reliability optimization, there are simultaneous optimization of multiple objectives such as the maximization of system reliability and the minimization of system cost, weight and volume. In this paper, our goal is to solve the constrained multi-objective reliability optimization problem of a system with interval valued reliability of each component by maximizing the system reliability and minimizing the system cost under several constraints. For this purpose, four different multi-objective optimization problems have been formulated with the help of interval mathematics and our newly proposed order relations of interval valued numbers. Then these optimization problems have been solved by advanced genetic algorithm and the concept of Pareto optimality. Finally, to illustrate and also to compare the results, a numerical example has been solved.     

Multi-objective genetic algorithm and its applications to flowshop scheduling

In this paper, we propose a multi-objective genetic algorithm and apply it to flowshop scheduling. The characteristic features of our algorithm are its selection procedure and elite preserve strategy. The selection procedure in our multi-objective genetic algorithm selects individuals for a crossover operation based on a weighted sum of multiple objective functions with variable weights. The elite preserve strategy in our algorithm uses multiple elite solutions instead of a single elite solution. That is, a certain number of individuals are selected from a tentative set of Pareto optimal solutions and inherited to the next generation as elite individuals. In order to show that our approach can handle multi-objective optimization problems with concave Pareto fronts, we apply the proposed genetic algorithm to a two-objective function optimization problem with a concave Pareto front. Last, the performance of our multi-objective genetic algorithm is examined by applying it to the flowshop scheduling problem with two objectives: to minimize the makespan and to minimize the total tardiness. We also apply our algorithm to the flowshop scheduling problem with three objectives: to minimize the makespan, to minimize the total tardiness, and to minimize the total flowtime.     

Entropy based region reducing genetic algorithm for reliability redundancy allocation in interval environment

This research paper presents a multi-objective reliability redundancy allocation problem for optimum system reliability and system cost with limitation on entropy of the system which is very essential for effective sustainability. Both crisp and interval-valued system parameters are considered for better realization of the model in more realistic sense. We propose that the system cost of the redundancy allocation problem depends on reliability of the components. A subpopulation and entropy based region reducing genetic algorithm (GA) with Laplace crossover and power mutation is proposed to determine the optimum number of redundant components at each stage of the system. The approach is demonstrated through the case study of a break lining manufacturing plant. A comprehensive study is conducted for comparing the performance of the proposed GA with the single-population based standard GA by evaluating the optimum system reliability and system cost with the optimum number of redundant components. Set of numerical examples are provided to illustrate the effectiveness of the redundancy allocation model based on the proposed optimization technique. We present a brief discussion on change of the system using graphical phenomenon due to the changes of parameters of the system. Comparative performance studies of the proposed GA with the standard GA demonstrate that the proposed GA is promising to solve the reliability redundancy optimization problem providing better optimum system reliability.     

A new multi-objective algorithm for a project selection problem

Project selection problem is an incessant problem, which every organization face. It, in fact, plays a key role in prosperity of the company. Meta-heuristic methods are the well-reputed methods which have been employed to solve a variety of multi-objective problems forming the real world problems. In this paper, a new multi-objective algorithm for project selection problem is studied. Two objective functions have been considered to maximize total expected benefit of selected projects and minimize the summation of the absolute variation of allotted resource between each successive time periods. A meta-heuristic multi-objective is proposed to obtain diverse locally non-dominated solutions. The proposed algorithm is compared, based on some prominent metrics, with a well-known genetic algorithm, i.e. NSGA-II. The computational results show the superiority of the proposed algorithm in comparison with NSGA-II.     

基于改进的NSGA-II多目标优化方法研究*

针对传统多目标优化算法在其领域存在的多个子目标不能同时取优的问题,提出了一种基于改进的非支配排序遗传算法（Non-dominated Sorting Genetic Algorithm-II, NSGA-II）多目标优化方法,以多目标优化遗传算法为基础,多输入多输出的反向传播（Back-Propagation, BP）神经网络为适应度函数评价体系,保证算法快速收敛并搜索到全局最优解集,该算法在建模前对实验数据进行主成分分析,降低了运算时间和算法难度,通过在遗传进化过程中引进正态分布交叉算子（Normal Distribution Crossover, NDX）和改进的自适应调整变异算子,实现了多个目标同时取优,保证Pareto最优解集快速、准确地获取。仿真实验使用UCI数据集,通过与其他常用的多目标优化算法对比,验证了改进的NSGA-II算法精确度更高、收敛速度更快、稳定性更强。     

Bi-objective vibration damping optimization for congested location–pricing problem

This paper presents a bi-objective mathematical programming model for the restricted facility location problem, under a congestion and pricing policy. Motivated by various applications such as locating server on internet mirror sites and communication networks, this research investigates congested systems with immobile servers and stochastic demand as M/M/m/k queues. For this problem, we consider two simultaneous perspectives; (1) customers who desire to limit waiting time for service and (2) service providers who intend to increase profits. We formulate a bi-objective facility location problem with two objective functions: (i) maximizing total profit of the whole system and (ii) minimizing the sum of waiting time in queues; the model type is mixed-integer nonlinear. Then, a multi-objective optimization algorithm based on vibration theory (so-called multi-objective vibration damping optimization (MOVDO)), is developed to solve the model. Moreover, the Taguchi method is also implemented, using a response metric to tune the parameters. The results are analyzed and compared with a non-dominated sorting genetic algorithm (NSGA-II) as a well-developed multi-objective evolutionary optimization algorithm. Computational results demonstrate the efficiency of the proposed MOVDO to solve large-scale problems.     

Solving a fuzzy multi objective model of a production–distribution system using meta-heuristic based approaches

This paper studies a multi-objective production–distribution system. The objectives are to minimize total costs and maximize the reliability of transportations system. Each transportation system is assumed to be of unique reliability. In the real world, some parameters may be of vagueness; therefore, some tools such as fuzzy logic is applied to tackle with. The problem is formulated using a mixed integer programming model. Commercial software can optimally solve small sized instances. We propose two novel HEURISTICS called ranking genetic algorithm (RGA) and concessive variable neighborhood search (CVNS) in order to solve the large sized instances. RGA utilizes various crossover operators and compares their performances so that better crossover operators are used during the solution process. CVNS applies several neighborhood search structures with a novel learning procedure. The heuristics can recognize which neighborhood structure performs well and applies those more than the others. The results indicated that RGA is of higher performance.     

串并联系统中支持实时替换的混合冗余策略优化

在需要长时间可靠运行的软件系统中,由于持续运行时间和任务响应速度的要求增加,工作组件在被探测到失效后将被冗余组件实时替换.但现有可靠性优化研究通常假设冷备份冗余在所有积极冗余组件失效后才使用.针对支持实时替换的混合冗余策略,对其冗余度优化分配进行研究.该策略不仅能够保障系统可靠性,而且能够保障系统性能,故选用实时可用性和任务完成效率两类约束条件,建立冗余配置代价最小化模型.基于马尔可夫链理论对可靠性及性能两类系统指标进行定量分析;采用数值计算方法对非线性的状态分析模型进行计算;改进二元组编码遗传算法对上述优化问题进行求解.采用实例对串并联系统中实时可用性及任务完成效率的分析进行了说明,并对优化冗余分配模型进行了验证.实验结果表明,在相同冗余度下,支持实时替换的混合冗余策略在任务完成效率方面优于传统的混合冗余策略.所以,在相同约束条件下不同混合冗余策略需要采用不同的冗余优化配置方案.     

区际救援物资中转调度的多目标优化问题研究

针对大规模、远距离和多品种的区际救援物资联动调运问题,以区际救援物资送达受灾城市总时间最短和总成本最小为目标,建立了一个区际救援物资中转调度的多目标优化模型,并设计了一种多目标协进化遗传算法。算例分析验证了该算法能够较好地获取问题的Pareto最优解。     

A charging-scheme decision model for electric vehicle battery swapping station using varied population evolutionary algorithms

This paper proposes a new battery swapping station (BSS) model to determine the optimized charging scheme for each incoming Electric Vehicle (EV) battery. The objective is to maximize the BSS’s battery stock level and minimize the average charging damage with the use of different types of chargers. An integrated objective function is defined for the multi-objective optimization problem. The genetic algorithm (GA), differential evolution (DE) algorithm and three versions of particle swarm optimization (PSO) algorithms have been implemented to solve the problem, and the results show that GA and DE perform better than the PSO algorithms, but the computational time of GA and DE are longer than using PSO. Hence, the varied population genetic algorithm (VPGA) and varied population differential evolution (VPDE) algorithm are proposed to determine the optimal solution and reduce the computational time of typical evolutionary algorithms. The simulation results show that the performances of the proposed algorithms are comparable with the typical GA and DE, but the computational times of the VPGA and VPDE are significantly shorter. A 24-h simulation study is carried out to examine the feasibility of the model.     

一种服务质量驱动的企业应用软件构件组装方法

针对现有面向全局构件组装方案选择技术的不足,提出了一种基于服务质量优化的构件组装方案选择方法.该方法主要是面向大型复杂企业应用软件系统的配置管理,其主要思想是将构件组装方案的选择问题转化为带约束的多目标优化问题.针对该问题,给出了一种基于向量编码的构件组装方案选择遗传算法,该编码方式可以非常方便地表示构件组装模型中构件接口之间的连接关系,从而克服了现有编码在描述构件组装模型中的局限性.最后通过实验分析了算法的可行性.     

Hybrid multi-objective shape design optimization using Taguchi’s method and genetic algorithm

This research is based on a new hybrid approach, which deals with the improvement of shape optimization process. The objective is to contribute to the development of more efficient shape optimization approaches in an integrated optimal topology and shape optimization area with the help of genetic algorithms and robustness issues. An improved genetic algorithm is introduced to solve multi-objective shape design optimization problems. The specific issue of this research is to overcome the limitations caused by larger population of solutions in the pure multi-objective genetic algorithm. The combination of genetic algorithm with robust parameter design through a smaller population of individuals results in a solution that leads to better parameter values for design optimization problems. The effectiveness of the proposed hybrid approach is illustrated and evaluated with test problems taken from literature. It is also shown that the proposed approach can be used as first stage in other multi-objective genetic algorithms to enhance the performance of genetic algorithms. Finally, the shape optimization of a vehicle component is presented to illustrate how the present approach can be applied for solving multi-objective shape design optimization problems.     

Multi-skilled project scheduling with level-dependent rework risk; three multi-objective mechanisms based on cuckoo search

In many projects, multi-skilled workforces are able to perform different tasks with different quality levels. In this paper, a real-life version of the multi-skilled resource constrained project scheduling problem is investigated, in which the reworking risk of each activity depends on the assigned level of multi-skilled workforces. The problem is formulated mathematically as a bi-objective optimization model to minimize total costs of processing the activities and to minimize reworking risks of the activities, concurrently. In order to solve the resulting problem, three cuckoo-search-based multi-objective mechanisms are developed based on non-dominance sorting genetic algorithm, multi-objective particle swarm and multi-objective invasive weeds optimization algorithm. The parameters of the algorithms are tuned using the Taguchi method to improve the efficiency of the solution procedures. Furthermore, a competitive multi-objective invasive weeds optimization algorithm is used to evaluate the performance of the proposed methodologies. Finally, a priority based method is employed to compare the proposed algorithms in terms of different metrics.     

An improved fruit fly optimization algorithm to solve the homogeneous fuzzy series–parallel redundancy allocation problem under discount strategies

In this paper, a mathematical formulation is first derived for a homogenous fuzzy series–parallel redundancy allocation problem, where both the system and its subsystems can only take two states of complete perfect and complete failure. Identical redundant components are included in order to achieve desirable system reliability. The components of each subsystem characterized by their cost, weight, and reliability, are purchased from the market under all-unit discount and incremental quantity discount strategies. The goal is to find the optimum combination of the number of components for each subsystem that maximizes the system reliability under total fuzzy cost and weight constraints. An improved fruit fly optimization algorithm (IFOA) is proposed to solve the problem, where a particle swarm optimization, a genetic algorithm, and a Tabu search algorithm are utilized to validate the results obtained. These algorithms are the most common ones in the literature to solve series–parallel redundancy allocation problems. Moreover, design of experiments using the Taguchi approach is employed to calibrate the parameters of the algorithms. At the end, some numerical examples are solved to demonstrate the applicability of the proposed methodology. The results are generally in favor IFOA.     

Multi-objective supply planning for two-level assembly systems with stochastic lead times

This paper considers two-level assembly systems whose lead times of components are stochastic with known discrete random distributions. In such a system, supply planning requires determination of release dates of components at level 2 in order to minimize expected holding cost and to maximize customer service. Hnaien et al. [Hnaien F, Delorme X, Dolgui A. Multi-objective optimization for inventory control in two-level assembly systems under uncertainty of lead times. Computers and Operations Research 2010; 37:1835-43] have recently examined this problem, trying to solve it through multi-objective genetic algorithms. However, some reconsideration in their paper is unavoidable. The main problem with Hnaien et al. proposal is their wrong mathematical model. In addition, the proposed algorithms do not work properly in large-scale instances. In the current paper, this model is corrected and solved via a new approach based on NSGA-II that is called Guided NSGA-II. This approach tries to guide search toward preferable regions in the solution space. According to the statistical analyses, the guided NSGA-II has the higher performance in comparison with the basic NSGA-II used by Hnaien et al. Moreover, the wrongly reported characteristics of the Pareto front shape provided by Hnaien et al. are modified.