卫星有效载荷的多目标多学科设计优化研究

在卫星有效载荷系统研究中,实施多目标多学科优化的可行性设计。首先,分析了开展卫星有效载荷多学科设计优化的关键技术。建立了包含天线、转发器、数据传输、可靠性、成本和质量的多学科分析模型。然后,应用多目标遗传算法对某卫星有效载荷的可靠性和成本进行多目标设计优化,获得最优解集。最后,运用多学科协同优化结合遗传算法进行可靠性单目标设计优化。研究结果表明:有效载荷的多目标多学科设计优化全面考虑了多个学科之间的关系,设计人员可按需选择其满意的优化结果,大幅提高设计效率;协同优化方法有助于实现学科自治、并行设计,提高设计的灵活性和缩短设计周期。     

Multi‐objective optimization using metaheuristics: non‐standard algorithms

In recent years, the application of metaheuristic techniques to solve multi‐objective optimization problems has become an active research area. Solving this kind of problems involves obtaining a set of Pareto‐optimal solutions in such a way that the corresponding Pareto front fulfils the requirements of convergence to the true Pareto front and uniform diversity. Most of the studies on metaheuristics for multi‐objective optimization are focused on Evolutionary Algorithms, and some of the state‐of‐the‐art techniques belong this class of algorithms. Our goal in this paper is to study open research lines related to metaheuristics but focusing on less explored areas to provide new perspectives to those researchers interested in multi‐objective optimization. In particular, we focus on non‐evolutionary metaheuristics, hybrid multi‐objective metaheuristics, parallel multi‐objective optimization and multi‐objective optimization under uncertainty. We analyze these issues and discuss open research lines.     

Multi‐objective design optimization of antennas for reflection,size, and gain variability using kriging surrogates and generalized domain segmentation

Cost‐efficient multi‐objective design optimization of antennas is presented. The framework exploits auxiliary data‐driven surrogates, a multi‐objective evolutionary algorithm for initial Pareto front identification, response correction techniques for design refinement, as well as generalized domain segmentation. The purpose of this last mechanism is to reduce the volume of the design space region that needs to be sampled in order to construct the surrogate model, and, consequently, limit the number of training data points required. The recently introduced segmentation concept is generalized here to allow for handling an arbitrary number of design objectives. Its operation is illustrated using an ultra‐wideband monopole optimized for best in‐band reflection, minimum gain variability, and minimum size. When compared with conventional surrogate‐based approach, segmentation leads to reduction of the initial Pareto identification cost by over 20%. Numerical results are supported by experimental validation of the selected Pareto‐optimal antenna designs.     

Engineering an efficient two‐phase local search algorithm for the co‐rotating twin‐screw extruder configuration problem

The twin‐screw configuration problem arises during polymer extrusion and compounding. It consists in defining the location of a set of pre‐defined screw elements along the screw axis in order to optimize different, typically conflicting objectives. In this paper, we present a simple yet effective stochastic local search (SLS) algorithm for this problem. Our algorithm is based on efficient single‐objective iterative improvement algorithms, which have been developed by studying different neighborhood structures, neighborhood search strategies, and neighborhood restrictions. These algorithms are embedded into a variation of the two‐phase local search framework to tackle various bi‐objective versions of this problem. An experimental comparison with a previously proposed multi‐objective evolutionary algorithm shows that a main advantage of our SLS algorithm is that it converges faster to a high‐quality approximation to the Pareto front.     

Adaptive optimal dynamic surface control of strict‐feedback nonlinear systems with output constraints

In this paper, an adaptive optimal control strategy is proposed for a class of strict‐feedback nonlinear systems with output constraints by using dynamic surface control. The controller design procedure is divided into two parts. One is the design of feedforward controller and the other is the design of optimal controller. To guarantee the satisfaction of output constraints in feedforward controller, nonlinear mapping is utilized to transform the constrained system into an unconstrained system. Neural‐network based adaptive dynamic programming algorithm is employed to approximate the optimal cost function and the optimal control law. By theoretical analysis, all the signals in the closed‐loop system are proved to be semi‐globally uniformly ultimately bounded and the output constraints are not violated. A numerical example illustrates the effectiveness of the proposed scheme.     

An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem

The design of sustainable logistics solutions poses new challenges for the study of vehicle‐routing problems. The design of efficient systems for transporting products via a heterogeneous fleet of vehicles must consider the minimization of cost, emissions of greenhouse gases, and the ability to serve every customer within an available time slot. This phenomenon gives rise to a multi‐objective problem that considers the emission of greenhouse gases, the total traveling time, and the number of customers served. The proposed model is approached with an ε‐constraint technique that allows small instances to be solved and an evolutionary algorithm is proposed to deal with complex instances. Results for small instances show that all the points that approach the Pareto frontier found by the evolutionary algorithm are nondominated by any solution found by the multi‐objective model. For complex instances, nondominated solutions that serve most of the requests are found with low computational requirements.     

Uncertainty quantifications of Pareto optima in multiobjective problems

Design is a multi-objective decision-making process considering manufacturing, cost, aesthetics, usability among many other product attributes. The set of optimal solutions, the Pareto set, indicates the trade-offs between objectives. Decision-makers generally select their own optima from the Pareto set based on personal preferences or other judgements. However, uncertainties from manufacturing processes and from operating conditions will change the performances of the Pareto optima. Evaluating the impacts of uncertainties on Pareto optima requires a large amount of data and resources. Comparing multiple Pareto solutions under uncertainty are also very costly. In this work, local Pareto set approximation is integrated with uncertainty propagation technique to quantify design variations in the objective space. An optimality influence range is proposed using linear combinations of objective functions that creates a more accurate polygon objective variation subspace. A set of ‘virtual samples’ is then generated to form two quantifications of the objective variation subspace, namely an influence noise to indicate how a design remains optimal, and an influence range that quantifies the overall variations of a design. In most engineering practices, a Pareto optimum with a smaller influence noise and a smaller influence range is preferred. We also extend the influence noise/range concept to nonlinear Pareto set with the second-order approximation. The quadratic local Pareto approximation method in the literature is also extended in this work to solve multi-objective engineering problems with black-box functions. The usefulness of the proposed quantification method is demonstrated using a numerical example as well as using an engineering problem in structural design.     

Pareto-optimal solutions for multicriteria optimization of a chemical engineering process using a diploid genetic algorithm

In many, if not most, optimization problems, industrialists are often confronted with multi‐objective decision problems. For example, in manufacturing processes, it may be necessary to optimize several criteria to take into account all the market constraints. Hence, the purpose is to choose the best trade‐offs among all the defined and conflicting objectives. This paper presents a multi‐objective optimization procedure based on a diploid genetic algorithm, which yields an optimal zone containing the solution under the concept of Pareto dominance. Pair‐wise points are compared, and non‐dominated points are collected in the Pareto region. Then a ranking is established, and the decision maker selects the first‐best solution. Finally, the procedure is applied to the chemical engineering process of cattle feed manufacture.     

混合多目标粒子群优化算法在热精轧负荷分配优化中的应用

通过对热精轧负荷分配过程的分析,选取负荷均衡、板形良好和轧制功率最低为目标,建立了热精轧负荷分配多目标优化模型.为了提高多目标优化算法解集的分布性和收敛性,提出了一种混合多目标粒子群优化算法(HMOPSO),该算法根据Pareto支配关系得到Pareto前沿进而保证种群收敛;采用分解策略维护外部存档,该策略首先根据Pareto前沿求出上界点对目标空间进行归一化处理,然后对种群进行分区处理进而保证种群的分布性能.仿真结果表明,HMOPSO的收敛性和分布性都好于MOPSO和d MOPSO;采用模糊多属性决策的方法从Pareto最优解集中选择一个Pareto最优解,通过与经验负荷分配方法相比,表明该Pareto最优解可以使轧制方案更加合理.     

The normalized normal constraint method for generating the Pareto frontier

The authors recently proposed the normal constraint (NC) method for generating a set of evenly spaced solutions on a Pareto frontier – for multiobjective optimization problems. Since few methods offer this desirable characteristic, the new method can be of significant practical use in the choice of an optimal solution in a multiobjective setting. This papers specific contribution is two-fold. First, it presents a new formulation of the NC method that incorporates a critical linear mapping of the design objectives. This mapping has the desirable property that the resulting performance of the method is entirely independent of the design objectives scales. We address here the fact that scaling issues can pose formidable difficulties. Secondly, the notion of a Pareto filter is presented and an algorithm thereof is developed. As its name suggests, a Pareto filter is an algorithm that retains only the global Pareto points, given a set of points in objective space. As is explained in the paper, the Pareto filter is useful in the application of the NC and other methods. Numerical examples are provided.     

Parallel Optimal Control for Weakly Coupled Nonlinear Systems Using Successive Galerkin Approximation

This technical note presents a new algorithm for the closed-loop parallel optimal control of weakly coupled nonlinear systems with respect to performance criteria using the successive Galerkin approximation (SGA). By using the weak coupling theory, the optimal control law can be obtained from two reduced-order optimal control problems in parallel, but the resulting problem is difficult to solve for nonlinear systems. In order to overcome the difficulties inherent in the nonlinear optimal control problem, the parallel optimal control laws are constructed in terms of the approximated solutions to two independent Hamilton-Jacobi-Bellman equations using the SGA method. One of the purposes of this note is to design the closed-loop parallel optimal control law for the weakly coupled nonlinear systems using the SGA method. The second is to reduce the computational complexity when the SGA method is applied to the high-order weakly coupled systems.      

Adaptive finite‐time fault‐tolerant tracking control for a class of MIMO nonlinear systems with output constraints

In this work, we present a novel adaptive finite‐time fault‐tolerant control algorithm for a class of multi‐input multi‐output nonlinear systems with constraint requirement on the system output tracking error. Both parametric and nonparametric system uncertainties can be effectively dealt with by the proposed control scheme. The gain functions of the nonlinear systems under discussion, especially the control input gain function, can be not fully known and state‐dependent. Backstepping design with a tan‐type barrier Lyapunov function and a new structure of stabilizing function is presented. We show that under the proposed control scheme, finite‐time convergence of the output tracking error into a small set around zero is guaranteed, while the constraint requirement on the system output tracking error will not be violated during operation. An illustrative example on a robot manipulator model is presented in the end to further demonstrate the effectiveness of the proposed control scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

基于蚁群优化的多目标社区检测算法

蚁群优化算法作为单目标优化问题,由于只有一个目标函数,通常会将解限制到特定的范围内。当优化的目标不恰当时,算法可能失效,比如分辨率限制问题。我们将多目标优化的思想与传统的用于社区检测的蚁群优化算法相结合,增加了目标函数个数,即增加了解的评价指标数目。该算法引入多目标策略,提出多目标ACO算法,该算法在一次运行过程中会产生一组Pareto最优解。并在三个真实世界网络证明该算法的有效性和准确性。     

基于动态调整的多目标粒子群优化算法

为了改善多目标粒子群优化算法生成的最终Pareto前端的多样性和收敛性,提出了一种针对多目标粒子群算法进化状态的检测机制.通过对外部Pareto解集的更新情况进行检测,进而评估算法的进化状态,获取反馈信息来动态调整进化策略,使得算法在进化过程中兼顾近似Pareto前端的多样性和收敛性.最后,在ZDT系列测试函数中,将本文算法与其他4种对等算法比较,证明了本文算法生成的最终Pareto前端在多样性和收敛性上均有显著的优势.     

A hybrid project scheduling and material ordering problem: Modeling and solution algorithms

A novel combination of a multimode project scheduling problem with material ordering, in which material procurements are exposed to the total quantity discount policy is investigated in this paper. The study aims at finding an optimal Pareto frontier for a triple objective model derived for the problem. While the first objective minimizes the makespan of the project, the second objective maximizes the robustness of the project schedule and finally the third objective minimizes the total costs pertaining to renewable and nonrenewable resources involved in a project. Four well-known multi-objective evolutionary algorithms including non-dominated sorting genetic algorithm II (NSGAII), strength Pareto evolutionary algorithm II (SPEAII), multi objective particle swarm optimization (MOPSO), and multi objective evolutionary algorithm based on decomposition (MOEAD) solve the developed triple-objective problem. The parameters of algorithms are tuned by the response surface methodology. The algorithms are carried out on a set of benchmarks and are compared based on five performance metrics evaluating their efficiencies in terms of closeness to the optimal frontier, diversity, and variance of results. Finally, a statistical assessment is conducted to analyze the results obtained by the algorithms. Results show that the NSGAII considerably outperforms others in 4 out of 5 metrics and the MOPSO performs better in terms of the remaining metric.     

Multi‐objective memetic algorithm: comparing artificial neural networks and pattern search filter method approaches

In this work, two methodologies to reduce the computation time of expensive multi‐objective optimization problems are compared. These methodologies consist of the hybridization of a multi‐objective evolutionary algorithm (MOEA) with local search procedures. First, an inverse artificial neural network proposed previously, consisting of mapping the decision variables into the multiple objectives to be optimized in order to generate improved solutions on certain generations of the MOEA, is presented. Second, a new approach based on a pattern search filter method is proposed in order to perform a local search around certain solutions selected previously from the Pareto frontier. The results obtained, by the application of both methodologies to difficult test problems, indicate a good performance of the approaches proposed.     

Tuning of PID controller based on a multiobjective genetic algorithm applied to a robotic manipulator

Most controllers optimization and design problems are multiobjective in nature, since they normally have several (possibly conflicting) objectives that must be satisfied at the same time. Instead of aiming at finding a single solution, the multiobjective optimization methods try to produce a set of good trade-off solutions from which the decision maker may select one. Several methods have been devised for solving multiobjective optimization problems in control systems field. Traditionally, classical optimization algorithms based on nonlinear programming or optimal control theories are applied to obtain the solution of such problems. The presence of multiple objectives in a problem usually gives rise to a set of optimal solutions, largely known as Pareto-optimal solutions. Recently, Multiobjective Evolutionary Algorithms (MOEAs) have been applied to control systems problems. Compared with mathematical programming, MOEAs are very suitable to solve multiobjective optimization problems, because they deal simultaneously with a set of solutions and find a number of Pareto optimal solutions in a single run of algorithm. Starting from a set of initial solutions, MOEAs use iteratively improving optimization techniques to find the optimal solutions. In every iterative progress, MOEAs favor population-based Pareto dominance as a measure of fitness. In the MOEAs context, the Non-dominated Sorting Genetic Algorithm (NSGA-II) has been successfully applied to solving many multiobjective problems. This paper presents the design and the tuning of two PID (Proportional–Integral–Derivative) controllers through the NSGA-II approach. Simulation numerical results of multivariable PID control and convergence of the NSGA-II is presented and discussed with application in a robotic manipulator of two-degree-of-freedom. The proposed optimization method based on NSGA-II offers an effective way to implement simple but robust solutions providing a good reference tracking performance in closed loop.     

Multi-objective genetic algorithms for cost-effective distributions of actuators and sensors in large structures

This paper proposes a multi-objective genetic algorithm (MOGA) for optimal placements of control devices and sensors in seismically excited civil structures through the integration of an implicit redundant representation genetic algorithm with a strength Pareto evolutionary algorithm 2. Not only are the total number and locations of control devices and sensors optimized, but dynamic responses of structures are also minimized as objective functions in the multi-objective formulation, i.e., both cost and seismic response control performance are simultaneously considered in structural control system design. The linear quadratic Gaussian control algorithm, hydraulic actuators and accelerometers are used for synthesis of active structural control systems on large civil structures. Three and twenty-story benchmark building structures are considered to demonstrate the performance of the proposed MOGA. It is shown that the proposed algorithm is effective in developing optimal Pareto front curves for optimal placement of actuators and sensors in seismically excited large buildings such that the performance on dynamic responses is also satisfied.     

A distributed evolutionary approach for multisite mapping on grids

In this paper attention is concentrated on the mapping of computationally intensive multi‐task applications onto shared computational grids. This problem, already known to be as NP‐complete in parallel systems, becomes even more arduous in such environments. To find a near‐optimal mapping solution a parallel version of a Differential Evolution algorithm is presented and evaluated on different applications and operating conditions of the grid nodes. The purpose is to select for a given application the mapping solutions that minimize the greatest among the time intervals which each node dedicates to the execution of the tasks assigned to it. The experiments, effected with applications represented as task interaction graphs, demonstrate the ability of the evolutionary tool to perform multisite grid mapping, and show that the parallel approach is more effective than the sequential version both in enhancing the quality of the solution and in the time needed to get it. Copyright © 2011 John Wiley & Sons, Ltd.     

Multi‐objective robust fuzzy fractional order proportional–integral–derivative controller design for nonlinear hydraulic turbine governing system using evolutionary computation techniques

The present paper proposes a novel multi‐objective robust fuzzy fractional order proportional–integral–derivative (PID) controller design for nonlinear hydraulic turbine governing system (HTGS) by using evolutionary computation techniques. The fuzzy fractional order PID (FOPID) controller takes closed loop error and its fractional derivative as inputs and performs fuzzy logic operations. Then, it produces the output through the fractional order integrator. The predominant advantages of the proposed controller are its capability to handle complex nonlinear processes like HTGS in heuristic manner, due to fuzzy incorporation and extending an additional flexibility in tuning the order of fractional derivative/integral terms to enhance the closed loop performance. The present work formulates the optimal tuning problem of fuzzy FOPID controller for HTGS as a multi‐objective one instead of a traditional single‐objective one towards satisfying the conflicting criteria such as less settling time and minimum damped oscillations simultaneously to ensure the improved dynamic performance of HTGS. The multi‐objective evolutionary computation techniques such as non‐dominated sorting genetic algorithm‐II (NSGA‐II) and modified NSGA‐II have been utilized to find the optimal input/output scaling factors of the proposed controller along with the order of fractional derivative/integral terms for HTGS system under no load and load turbulence conditions. The performance of the proposed fuzzy FOPID controller is compared with PID and FOPID controllers. The simulations have been conducted to test the tracking capability and robust performance of HTGS during dynamic set point changes for a wide range of operating conditions and model parameter variations, respectively. The proposed robust fuzzy FOPID controller has ensured better fitness value and better time domain specifications than the PID and FOPID controllers, during optimization towards satisfying the conflicting objectives such as less settling time and minimum damped oscillations simultaneously, due to its special inheritance of fuzzy and FOPID properties.