Optimal feeding profile in fed-batch bioreactors using a genetic algorithm

An optimal feeding profile for a fed-batch process was designed based on an evolutionary algorithm. Usually the presence of multiple objectives in a problem leads to a set of optimal solutions, commonly known as Pareto-optimal solutions. Evolutionary algorithms are well suited for deriving multi-objective optimisation since they evolve a set of non-dominated solutions distributed along the Pareto front. Several evolutionary multi-objective optimisation algorithms have been developed, among which the Non-dominated Sorting Genetic Algorithm NSGA-II is recognised to be very effective in overcoming a variety of problems. To demonstrate the applicability of this technique, an optimal control problem from the literature was solved using several methods considering the single-objective dynamic optimisation problem.     

Multi-objective design optimization of a new space radiator

In this work different multi-objective techniques are used to the conceptual design of a new kind of space radiator. Called VESPAR (Variable Emittance Space Radiator), the radiator has an effective variable emittance which makes it able to reduce or avoid the demand for heater power to warm up equipment during cold case operations in orbit. The multi-objective approach was aimed on obtaining a radiator that minimize its mass while at the same time minimize the need for heater power during cold case. Four multi-objective algorithms were used: Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II), Multi-Objective Genetic Algorithm (MOGA), Multi-Objective Simulating Annealing (MOSA) and Multi-Objective Generalized Extremal Optimization (M-GEO). The first three algorithms were used under the modeFrontier^® optimization software package, while M-GEO is a recently proposed multi-objective implementation of the Generalized Extremal Optimization (GEO) algorithm. The Pareto frontier showing the trade-off solutions between radiator mass and heater power consumption is obtained by the four algorithms and the results compared. An assessment of the performance of M-GEO on this problem, compared to the other well-known multi-objective algorithms is also made.     

A multi-objective model for multi-project scheduling and multi-skilled staff assignment for IT product development considering competency evolution

We address a multi-skill project scheduling problem for IT product development in this article. The goal is for product development managers to be able to generate an initial schedule at an early stage of development activities. Due to the complexity of the product structure and functionality, an IT product development effort is divided into multiple projects. Each project includes several tasks, and each task must be completed by an employee who has mastered a certain skill to complete it. A pool of multi-skilled employees is available, and the employees’ skill efficiencies are influenced by both learning and forgetting phenomena. Based on the real-world demands of product development managers, three objectives are simultaneously considered: skill efficiency gain, product development cycle time and costs. To solve this problem, we propose a multi-objective non-linear mixed integer programming model. The Non-dominated Sorting Genetic Algorithm II (NSGA-II)is designed to generate an approximation to the optimal Pareto front of this NP-hard multi-objective optimisation problem. The algorithm produces feasible schedules for all the development projects using the serial schedule generation scheme. We adopt penalty values and individual employee adjustments to address resource conflicts and constraint violations. A weighted ideal point method is used to select the final solution from the approximate Pareto solution set. An application case of a new electrical energy saving product implementation in a leading electrical device company in China is used to illustrate the proposed model and algorithm.     

Multi-objective sustainable process plan generation in a reconfigurable manufacturing environment: exact and adapted evolutionary approaches

Achieving competitiveness in nowadays manufacturing market goes through being cost and time-efficient as well as environmentally harmless. Reconfigurable manufacturing system (RMS) is a paradigm that is able to meet these challenges due to its scalability and integrability. In this paper, we aim to solve the multi-objective sustainable process plan generation problem in a reconfigurable environment. In addition to the total production cost and the completion time, we use the amount of greenhouse gases (GHG) emitted during the manufacturing process as a sustainability criterion. We propose an iterative multi-objective integer linear programming (I-MOILP) approach and its comparison with adapted versions of the two well-known evolutionary algorithms, respectively, the Archived Multi-Objective Simulated Annealing (AMOSA) and the Non-dominated Sorting Genetic Algorithm (NSGA-II). Moreover, we study the influence of the probabilities of genetic operators on the convergence of the adapted NSGA-II. To illustrate the applicability of the three approaches, an example is presented and obtained numerical results analysed.     

生产调度与维护集成的多目标Lorenz非劣遗传优化

研究了一种单机环境下集成生产和维护的双目标优化调度问题。机床的故障间隔时间和平均维修时间服从指数分布,同时结合加工序列相关准备时间。预防性维护活动不能与作业加工同时进行,但与准备时间不相冲突。调度目标是同时最小化作业总计完成时间和机床不可得性。在问题建模的基础上,构造了一种基于Lorenz非劣关系的分类遗传算法(表示为L-NSGA-Ⅱ),详细设计了算法的核心部分。最后,通过大量计算实验,将L-NSGA-II算法与NSGA-II算法进行了比较分析,说明了L-NSGA-II算法的有效性。     

A Pareto block-based estimation and distribution algorithm for multi-objective permutation flow shop scheduling problem

Multi-objective flow shop scheduling plays a key role in real-life scheduling problem which attract the researcher attention. The primary concern is to find the best sequence for flow shop scheduling problem. Estimation of Distribution Algorithms (EDAs) has gained sufficient attention from the researchers and it provides prominent results as an alternate of traditional evolutionary algorithms. In this paper, we propose the pareto optimal block-based EDA using bivariate model for multi-objective flow shop scheduling problem. We apply a bivariate probabilistic model to generate block which have the better diversity. We employ the non-dominated sorting technique to filter the solutions. To check the performance of proposed approach, we test it on the benchmark problems available in OR-library and then we compare it with non-dominated sorting genetic algorithm-II (NSGA-II). Computational results show that pareto optimal BBEDA provides better result and better convergence than NSGA-II.     

考虑温度因素的磁流变减振器的优化设计与实验

磁流变(Magneto-rheological简称MR)减振器在运行过程中,会出现阻尼力随温度升高而下降的现象,为了在不同温度下都能输出足够的阻尼力,在结构设计时考虑温度因素至关重要。为此,本文引入了评价系数,对较高温度下MR减振器是否有能力能够输出足够的阻尼力进行衡量,并与MR减振器的最大阻尼力和动态范围作为优化目标。利用有限元方法获得了工作区域的磁感应强度,并采用响应面法建立二阶预测模型描述了磁感应强度与结构参数之间的非线性关系;结合非支配遗传算法(Non-dominated sorting genetic algorithm II,NSGA II)对MR减振器的进行了多目标优化设计,根据优化结果制造了磁流变减振器,并进行了试验测试,验证了设计方案的有效性。     

A comparative study of genetic algorithms for the multi-objective optimization of composite stringers under compression loads

Optimization methods are close to become a common task in the design process of many mechanical engineering fields, specially those related with the use of composite materials which offer the flexibility in the design of both the shape and the material properties and so, are very suitable to any optimization process. While nowadays there exist a large number of solution methods for optimization problems there is not much information about which method may be most reliable for a specific problem. Genetic algorithms have been presented as a family of methods which can handle most of engineering problems. However, starting from a common basic set of rules many algorithms which differ slightly from each other have been implemented even in commercial software packages. This work presents a comparative study of three common Genetic Algorithms: Archive-based Micro Genetic Algorithm (AMGA), Neighborhood Cultivation Genetic Algorithm (NCGA) and Non-dominate Sorting Genetic Algorithm II (NSGA-II) considering three different strategies for the initial population. Their performance in terms of solution, computational time and number of generations was compared. The benchmark problem was the optimization of a T-shaped stringer commonly used in CFRP stiffened panels. The objectives of the optimization were to minimize the mass and to maximize the critical buckling load. The comparative study reveals that NSGA-II and AMGA seem the most suitable algorithms for this kind of problem.     

Comparison of evolutionary computation algorithms for solving bi-objective task scheduling problem on heterogeneous distributed computing systems

The task scheduling problem in heterogeneous distributed computing systems is a multiobjective optimization problem (MOP). In heterogeneous distributed computing systems (HDCS), there is a possibility of processor and network failures and this affects the applications running on the HDCS. To reduce the impact of failures on an application running on HDCS, scheduling algorithms must be devised which minimize not only the schedule length (makespan) but also the failure probability of the application (reliability). These objectives are conflicting and it is not possible to minimize both objectives at the same time. Thus, it is needed to develop scheduling algorithms which account both for schedule length and the failure probability. Multiobjective Evolutionary Computation algorithms (MOEAs) are well-suited for Multiobjective task scheduling on heterogeneous environment. The two Multi-Objective Evolutionary Algorithms such as Multiobjective Genetic Algorithm (MOGA) and Multiobjective Evolutionary Programming (MOEP) with non-dominated sorting are developed and compared for the various random task graphs and also for a real-time numerical application graph. The metrics for evaluating the convergence and diversity of the obtained non-dominated solutions by the two algorithms are reported. The simulation results confirm that the proposed algorithms can be used for solving the task scheduling at reduced computational times compared to the weighted-sum based biobjective algorithm in the literature.     

Task Scheduling Optimization in Cloud Computing by Rao Algorithm

Cloud computing is currently dominated within the space of high-performance distributed computing and it provides resource polling and on-demand services through the web. So, task scheduling problem becomes a very important analysis space within the field of a cloud computing environment as a result of user's services demand modification dynamically. The main purpose of task scheduling is to assign tasks to available processors to produce minimum schedule length without violating precedence restrictions. In heterogeneous multiprocessor systems, task assignments and schedules have a significant impact on system operation. Within the heuristic-based task scheduling algorithm, the different processes will lead to a different task execution time (makespan) on a heterogeneous computing system. Thus, a good scheduling algorithm should be able to set precedence efficiently for every subtask depending on the resources required to reduce (makespan). In this paper, we propose a new efficient task scheduling algorithm in cloud computing systems based on RAO algorithm to solve an important task and schedule a heterogeneous multiple processing problem. The basic idea of this process is to exploit the advantages of heuristic-based algorithms to reduce space search and time to get the best solution. We evaluate our algorithm's performance by applying it to three examples with a different number of tasks and processors. The experimental results show that the proposed approach significantly succeeded in finding the optimal solutions than others in terms of the time of task implementation.     

Multi-objective process planning and scheduling using controlled elitist non-dominated sorting genetic algorithm

The integration of process planning and scheduling is considered as a critical component in manufacturing systems. In this paper, a multi-objective approach is used to solve the planning and scheduling problem. Three different objectives considered in this work are minimisation of makespan, machining cost and idle time of machines. To solve this integration problem, we propose an improved controlled elitist non-dominated sorting genetic algorithm (NSGA) to take into account the computational intractability of the problem. An illustrative example and five test cases have been taken to demonstrate the capability of the proposed model. The results confirm that the proposed multi-objective optimisation model gives optimal and robust solutions. A comparative study between proposed algorithm, controlled elitist NSGA and NSGA-II show that proposed algorithm significantly reduces scheduling objectives like makespan, cost and idle time, and is computationally more efficient.     

Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm

The multi-objective reentrant hybrid flowshop scheduling problem (RHFSP) exhibits significance in many industrial applications, but appears under-studied in the literature. In this study, an iterated Pareto greedy (IPG) algorithm is proposed to solve a RHFSP with the bi-objective of minimising makespan and total tardiness. The performance of the proposed IPG algorithm is evaluated by comparing its solutions to existing meta-heuristic algorithms on the same benchmark problem set. Experimental results show that the proposed IPG algorithm significantly outperforms the best available algorithms in terms of the convergence to optimal solutions, the diversity of solutions and the dominance of solutions. The statistical analysis manifestly shows that the proposed IPG algorithm can serve as a new benchmark approach for future research on this extremely challenging scheduling problem.     

Evolutionary multi-objective concurrent maximisation of process tolerances

Concurrent tolerancing which simultaneously optimises process tolerance based on constraints of both dimensional and geometrical tolerances (DGTs), and process accuracy with multi-objective functions is tedious to solve by a conventional optimisation technique like a linear programming approach. Concurrent tolerancing becomes an optimisation problem to determine optimum allotment of the process tolerances under the design function constraints. Optimum solution for this advanced tolerance design problem is difficult to obtain using traditional optimisation techniques. The proposed algorithms (elitist non-dominated sorting genetic algorithm (NSGA-II) and multi-objective differential evolution (MODE)) significantly outperform the previous algorithms for obtaining the optimum solution. The average fitness factor method and the normalised weighting objective function method are used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of the Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find the computational effort of the NSGA-II and MODE algorithms. Comparison of the results establishes that the proposed algorithms are superior to the algorithms in the literature.     

Cross-trained workers scheduling for field service using improved NSGA-II

The proper balancing of geographically distributed task schedules and the associated workforce distributions are critical determinants of productivity in any people-centric production environment. The paper has investigated the cross-trained workers scheduling problem considering the qualified personal allocation and temporally cooperation of engineers simultaneously. A 0–1 programming model is developed and the non-dominated sorting genetic algorithm-II (NSGA-II) is adopted to deal with the NP-hard problem. In order to enforce the NSGA-II, significant improvements are made to function the approach in a more efficient way. It is observed that the improved NSGA-II outperforms the original NSGA-II in the experimental test. The promising outcomes of the formulation in the experiment make its implementation easily customisable and transferable for solving other intricate problems in the context of skilled workforce scheduling. Furthermore, the modified NSGA II can be used as an efficient and effective tool for other multiobjective optimisation problems.     

A calibration framework for discrete element model parameters using genetic algorithms

In this research, a universal framework for automated calibration of microscopic properties of modeled granular materials is proposed. The proposed framework aims at industrial scale applications, where optimization of the computational time step is important. It can be generally applied to all types of DEM simulation setups. It consists of three phases: data base generation, parameter optimization, and verification. In the first phase, DEM simulations are carried out on a multi-dimensional grid of sampled input parameter values to generate a database of macroscopic material responses. The database and experimental data are then used to interpolate the objective functions with respect to an arbitrary set of parameters. In the second phase, the Non-dominated Sorting Genetic Algorithm II (NSGA-II) is used to solve the calibration multi-objective optimization problem. In the third phase, the DEM simulations using the results of the calibrated input parameters are carried out to calculate the macroscopic responses that are then compared with experimental measurements for verification and validation.The proposed calibration framework has been successfully demonstrated by a case study with two-objective optimization for the model accuracy and the simulation time. Based on the concept of Pareto dominance, the trade-off between these two conflicting objectives becomes apparent. Through verification and validation steps, the approach has proven to be successful for accurate calibration of material parameters with the optimal simulation time.     

DEM calibration of cohesive material in the ring shear test by applying a genetic algorithm framework

This research demonstrates capturing different stress states and history dependency in a cohesive bulk material by DEM simulations. An automated calibration procedure, based on the Non-dominated Sorting Genetic Algorithm, is applied. It searches for the appropriate simulation parameters of an Elasto-Plastic Adhesive contact model such that its response is best fitted to the shear stress measured in experiments. Using this calibration procedure, the optimal set of DEM input parameters are successfully found to reproduce the measured shear stresses of the cohesive coal sample in two different pre-consolidation levels. The calibrated simulation resembles the stress history dependent values of shear stress, bulk density and wall friction. Through the case study of the ring shear tester, this research demonstrates the robustness and accuracy of the calibration framework using multi-objective optimization on multi-variable calibration problems irrespective of the chosen contact model.     

基于差异演化算法和多属性决策的机电系统可靠性多目标优化设计

针对机电系统可靠性设计问题,以可靠性和费用(或体积等)最优为目标建立可靠性设计的多目标优化模型．提出了自适应多目标差异演化算法,该算法提出了自适应缩放因子和混沌交叉率,采用改进的快速排序方法构造Pareto最优解,采用NSGA-II的拥挤操作对档案文件进行消减．采用自适应多目标差异演化算法获得多目标问题的Pareto最优解,利用TOPSIS方法对Pareto最优解进行多属性决策．实际工程结果表明：自适应多目标差异演化算法调节参数更少,且求得的Pareto最优解分布均匀;采用基于TOPSIS的多属性决策方法得到的结果合理可行．     

A study on evolutionary multi-objective optimization for flow geometry design

In this paper, we investigate three recently proposed multi-objective optimization algorithms with respect to their application to a design-optimization task in fluid dynamics. The usual approach to render optimization problems is to accumulate multiple objectives into one objective by a linear combination and optimize the resulting single-objective problem. This has severe drawbacks such that full information about design alternatives will not become visible. The multi-objective optimization algorithms NSGA-II, SPEA2 and Femo are successfully applied to a demanding shape optimizing problem in fluid dynamics. The algorithm performance will be compared on the basis of the results obtained.     

Non-dominated archiving multi-colony ant algorithm for multi-objective optimization: Application to multi-purpose reservoir operation

Multi-objective optimization using heuristic methods has been established as a subdiscipline that combines the fields of heuristic computation and classical multiple criteria decision making. This article presents the Non-dominated Archiving Ant Colony Optimization (NA-ACO), which benefits from the concept of a multi-colony ant algorithm and incorporates a new information-exchange policy. In the proposed information-exchange policy, after a given number of iterations, different colonies exchange information on the assigned objective, resulting in a set of non-dominated solutions. The non-dominated solutions are moved into an offline archive for further pheromone updating. Performance of the NA-ACO is tested employing two well-known mathematical multi-objective benchmark problems. The results are promising and compare well with those of well-known NSGA-II algorithms used in real-world multi-objective-optimization problems. In addition, the optimization of reservoir operating policy with multiple objectives (i.e. flood control, hydropower generation and irrigation water supply) is considered and the associated Pareto front generated.