Component-oriented decomposition for multidisciplinary design optimization in building design

The potential of Multidisciplinary Design Optimization (MDO) is not sufficiently exploited in current building design practice. I argue that this field of engineering requires a special setup of the optimization model that considers the uniqueness of buildings, and allows the designer to interact with the optimization in order to assess qualities of aesthetics, expression, and building function. For this reason, the approach applies a performance optimization based on resource consumption extended by preference criteria. Furthermore, building design-specific components serve for the decomposition and an interactive way of working. The component scheme follows the Industry Foundation Classes (IFC) as a common Building Information Model (BIM) standard in order to allow a seamless integration into an interactive CAD working process in the future. A representative case study dealing with a frame-based hall design serves to illustrate these considerations. An N-Square diagram or Design Structure Matrix (DSM) represents the system of components with the disciplinary dependencies and workflow of the analysis. The application of a Multiobjective Genetic Algorithm (MOGA) leads to demonstrable results.     

Maximum variation analysis based analytical target cascading for multidisciplinary robust design optimization under interval uncertainty

Analytical target cascading (ATC) is a generally used hierarchical method for deterministic multidisciplinary design optimization (MDO). However, uncertainty is almost inevitable in the lifecycle of a complex system. In engineering practical design, the interval information of uncertainty can be more easily obtained compared to probability information. In this paper, a maximum variation analysis based ATC (MVA-ATC) approach is developed. In this approach, all subsystems are autonomously optimized under the interval uncertainty. MVA is used to establish an outer-inner framework which is employed to find the optimal scheme of system and subsystems. All subsystems are coordinated at the system level to search the system robust optimal solution. The accuracy and validation of the presented approach are tested using a classical mathematical example, a heart dipole optimization problem, and a battery thermal management system (BTMS) design problem.     

多学科设计优化中的智能算法比较*

对多学科设计优化领域中涉及的几种智能优化算法的特点进行了总结.在此基础上提出了时间、精度、解决问题的个数等几个比较指标,首次将精度作为比较指标,并且创新性地提出一个针对工程问题的有效比较指标,即短时寻优能力.通过对所选取的系列案例运行得到一系列对工程问题有指导意义的结论,手机实例验证了所得到的结论的正确性.     

求解多目标优化问题的一种多子群体进化算法

提出一种新的多目标粒子群优化（MOPSO）算法,根据多目标优化问题（MOP）的特点,将一个进化群体分成若干个子群体,利用非劣支配的概念构造全局最优区域,用以指导整个粒子群的进化．通过子群体间的信息交换．使整个群体分布更均匀,并且避免了局部最优,保证了解的多样性,通过很少的迭代次数便可得到分布均匀的Pareto有效解集．数值实验表明了该算法的有效性.     

Attributed multi-objective comprehensive learning particle swarm optimization for optimal security of networks

In particle swarm optimization (PSO) each particle uses its personal and global or local best positions by linear summation. However, it is very time consuming to find the global or local best positions in case of complex problems. To overcome this problem, we propose a new multi-objective variant of PSO called attributed multi-objective comprehensive learning particle swarm optimizer (A-MOCLPSO). In this technique, we do not use global or local best positions to modify the velocity of a particle; instead, we use the best position of a randomly selected particle from the whole population to update the velocity of each dimension. This method not only increases the speed of the algorithm but also searches in more promising areas of the search space. We perform an extensive experimentation on well-known benchmark problems such as Schaffer (SCH), Kursawa (KUR), and Zitzler–Deb–Thiele (ZDT) functions. The experiments show very convincing results when the proposed technique is compared with existing versions of PSO known as multi-objective comprehensive learning particle swarm optimizer (MOCLPSO) and multi-objective particle swarm optimization (MOPSO), as well as non-dominated sorting genetic algorithm II (NSGA-II). As a case study, we apply our proposed A-MOCLPSO algorithm on an attack tree model for the security hardening problem of a networked system in order to optimize the total security cost and the residual damage, and provide diverse solutions for the problem. The results of our experiments show that the proposed algorithm outperforms the previous solutions obtained for the security hardening problem using NSGA-II, as well as MOCLPSO for the same problem. Hence, the proposed algorithm can be considered as a strong alternative to solve multi-objective optimization problems.     

An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the mono-objective FJSP. However, they are very difficult to solve multi-objective FJSP very well. In this paper, a particle swarm optimization (PSO) algorithm and a tabu search (TS) algorithm are combined to solve the multi-objective FJSP with several conflicting and incommensurable objectives. PSO which integrates local search and global search scheme possesses high search efficiency. And, TS is a meta-heuristic which is designed for finding a near optimal solution of combinatorial optimization problems. Through reasonably hybridizing the two optimization algorithms, an effective hybrid approach for the multi-objective FJSP has been proposed. The computational results have proved that the proposed hybrid algorithm is an efficient and effective approach to solve the multi-objective FJSP, especially for the problems on a large scale.     

Metamodel-based collaborative optimization framework

This paper focuses on the metamodel-based collaborative optimization (CO). The objective is to improve the computational efficiency of CO in order to handle multidisciplinary design optimization problems utilising high fidelity models. To address these issues, two levels of metamodel building techniques are proposed: metamodels in the disciplinary optimization are based on multi-fidelity modelling (the interaction of low and high fidelity models) and for the system level optimization a combination of a global metamodel based on the moving least squares method and trust region strategy is introduced. The proposed method is demonstrated on a continuous fiber-reinforced composite beam test problem. Results show that methods introduced in this paper provide an effective way of improving computational efficiency of CO based on high fidelity simulation models.     

Automated generation of multiphysics simulation models to support multidisciplinary design optimization

To ensure a consistent design representation for serving multidisciplinary analysis, this research study proposes an intelligent modeling system to automatically generate multiphysics simulation models to support multidisciplinary design optimization processes by using a knowledge based engineering approach. A key element of this system is a multiphysics information model (MIM), which integrates the design and simulation knowledge from multiple engineering domains. The intelligent modeling system defines classes with attributes to represent various aspects of physical entities. Moreover, it uses functions to capture the non-physical information, such as control architecture, simulation test maneuvers and simulation procedures. The challenge of system coupling and the interactions among the disciplines are taken into account during the process of knowledge acquisition. Depending on the domain requirements, the intelligent modeling system extracts the required knowledge from the MIM and uses this first to instantiate submodels and second to construct the multiphysics simulation model by combining all submodels. The objective of this research is to reduce the time and effort for modeling complex systems and to provide a consistent and concurrent design environment to support multidisciplinary design optimization. The development of an unstable and unmanned aerial vehicle, a multirotor UAV, is selected as test case. The intelligent modeling system is demonstrated by modeling thirty-thousand multirotor UAV designs with different topologies and by ensuring the automatic development of a consistent control system dedicated for each individual design. Moreover, the resulting multiphysics simulation model of the multirotor UAV is validated by comparing with the flight data of an actual quadrotor UAV. The results show that the multiphysics simulation model matches test data well and indicate that high fidelity models can be generated with the automatic model generation process.     

QPSO算法求解无约束多目标优化问题

在分析了用基于目标加权的PSO算法(WAPSO)的基础上,研究了利用基于量子行为的微粒群优化算法(QPSO)来解决多目标优化问题.提出了基于目标加权的QPSO算法(WAQPSO),利用WAQPSO算法解决无约束的多目标优化问题,通过典型的多目标测试函数实验,验证了该算法解决无约束多目标问题的有效性.     

一种多目标粒子群改进算法的研究

针对多目标粒子群优化过程中的粒子飞行偏向性和多样性损失问题,提出一种基于最大最小适应函数的改进算法．该算法在最大最小适应函数的计算中引入了函数相对值算法和ε-支配的概念,并提出了变ε-支配的策略,改进了最大最小适应函数的计算方法,解决了粒子飞行过程中的偏向性和多样性损失问题,加快了算法的收敛速度．将该改进算法应用于直流变频压缩机启动时峰值电流和启动转速的优化问题,应用结果表明该算法收敛速度快且效果良好．     

Particle swarm optimization with query-based learning for multi-objective power contract problem

Particle swarm optimization (PSO) is one of the most important research topics on swarm intelligence. Existing PSO techniques, however, still contain some significant disadvantages. In this paper, we present a new QBL-PSO algorithm that uses QBL (query-based learning) to improve both the exploratory and exploitable capabilities of PSO. Here, we apply a QBL method proposed in our previous research to PSO, and then test this new algorithm on a real case study on problems of power conservation. Our algorithm not only broadens the search diversity of PSO, but also improves its precision. Conventional PSO often snag on local solutions when performing queries, instead of finding better global solutions. To resolve this limitation, when particles converge in nature, we direct some of them into an “ambiguous solution space” defined by our algorithm. This paper introduces two ways to invoke this QBL algorithm. Our experimental results confirm that the proposed method attains better convergence to the global best solution. Finally, we present a new PSO model for solving multi-objective power conservation problems. Overall, this model successfully reduces power consumption, and to our knowledge, this paper represents the first attempt within the literature to apply the QBL concept to PSO.     

Particle swarm optimization with preference order ranking for multi-objective optimization

A new optimality criterion based on preference order (PO) scheme is used to identify the best compromise in multi-objective particle swarm optimization (MOPSO). This scheme is more efficient than Pareto ranking scheme, especially when the number of objectives is very large. Meanwhile, a novel updating formula for the particle’s velocity is introduced to improve the search ability of the algorithm. The proposed algorithm has been compared with NSGA-II and other two MOPSO algorithms. The experimental results indicate that the proposed approach is effective on the highly complex multi-objective optimization problems.     

基于拥挤度与变异的动态微粒群多目标优化算法

提出一种动态微粒群多目标优化算法(DCMOPSO),算法中的惯性权重和加速因子动态变化以增强算法的全局搜索能力,并采用拥挤度的方法对外部档案进行维护以增加非劣解的多样性.在维护过程中,从外部档案中按拥挤度为每个微粒选择全局最好位置,同时使用变异操作避免算法早熟.通过几个典型的多目标测试函数对DCMOPSO算法的性能进行了测试,并与多目标优化算法MOPSO和NSGA-Ⅱ进行对比.结果表明,DCMOPSO算法具有良好的搜索性能.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

Integrating linear physical programming within collaborative optimization for multiobjective multidisciplinary design optimization

Multidisciplinary design optimization (MDO) is a concurrent engineering design tool for large-scale, complex systems design that can be affected through the optimal design of several smaller functional units or subsystems. Due to the multiobjective nature of most MDO problems, recent work has focused on formulating the MDO problem to resolve tradeoffs between multiple, conflicting objectives. In this paper, we describe the novel integration of linear physical programming within the collaborative optimization framework, which enables designers to formulate multiple system-level objectives in terms of physically meaningful parameters. The proposed formulation extends our previous multiobjective formulation of collaborative optimization, which uses goal programming at the system and subsystem levels to enable multiple objectives to be considered at both levels during optimization. The proposed framework is demonstrated using a racecar design example that consists of two subsystem level analyses — force and aerodynamics — and incorporates two system-level objectives: (1) minimize lap time and (2) maximize normalized weight distribution. The aerodynamics subsystem also seeks to minimize rearwheel downforce as a secondary objective. The racecar design example is presented in detail to provide a benchmark problem for other researchers. It is solved using the proposed formulation and compared against a traditional formulation without collaborative optimization or linear physical programming. The proposed framework capitalizes on the disciplinary organization encountered during large-scale systems design.     

A multi-objective mixed-model assembly line sequencing problem in order to minimize total costs in a Make-To-Order environment,considering order priority

Nowadays, mixed-model assembly line is used increasingly as a result of customers’ demand diversification. An important problem in this field is determining the sequence of products for entering the line. Before determining the best sequence of products, a new procedure is introduced to choose important orders for entering the shop floor. Thus the orders are sorted using an analytical hierarchy process (AHP) approach based on three criteria: critical ratio of each order (CR_o), Significance degree of customer and innovation in a product, while the last one is presented for the first time. In this research, six objective functions are presented: minimizing total utility work cost, total setup cost and total production rate variation cost are the objectives which were presented previously, another objective is minimizing total idle cost, meanwhile two other new objectives regarding minimizing total operator error cost and total tardiness cost are presented for the first time. The total tardiness cost tries to choose a sequence of products that minimizes the tardiness cost for customers with high priority. First, to check the feasibility of the model, GAMS software is used. In this case, GAMS software could not search all of the solution space, so it is tried in two stages and because this problem is NP-hard, particle swarm optimization (PSO) and simulated annealing (SA) algorithms are used. For small sized problems, to compare exact method with proposed algorithms, the problem must be solved using meta-heuristic algorithms in two stages as GAMS software, whereas for large sized problems, the problem can be solved in two ways (one stage and two stages) by using proposed algorithms; the computational results and pairwise comparisons (based on sign test) show GAMS is a proper software to solve small sized problems, whereas for a large sized problem the objective function is better when solved in one stage than two stages; therefore it is proposed to solve the problem in one stage for large sized problems. Also PSO algorithm is better than SA algorithm based on objective function and pairwise comparisons.     

多学科目标兼容优化算法及在MEMS中应用

针对复杂系统的优化设计问题,提出了面向非层级复杂系统的多学科目标兼容优化设计方法,对其基本思路、原理进行阐述。通过在系统级中建立兼容约束和在子系统中构造兼容目标,使各子系统在独立优化设计的同时满足各系统之间的耦合关系,并使系统得到总体的最优解。并将此算法应用于梳齿式微加速度计的设计中,验证了此方法的可行性。     

多目标优化问题的粒子群算法仿真研究*

研究了一种用于求解多目标优化问题的粒子群算法(CMMOPSO)。该算法采用外部存档存储每一代产生的非劣解, 并且采用拥挤距离来维持外部存档规模, 同时提出一种新的全局最优粒子的选取策略(基于拥挤距离和收敛性距离)来提升粒子向Pareto前沿飞行的概率;为提升种群跳出局部最优解的能力, 以一定的概率对外部存档中粒子进行变异操作。通过典型的多目标测试函数对提出的算法进行检测, 结果表明,CMMOPSO算法在求解多目标问题上有一定的优势。因此, CMMOPSO可以作为求解多目标优化问题的有效算法。     

An efficient strategy for reliability-based multidisciplinary design optimization using BLISS

This paper presents an efficient reliability-based multidisciplinary design optimization (RBMDO) strategy. The conventional RBMDO has tri-level loops: the first level is an optimization in the deterministic space, the second one is a reliability analysis in the probabilistic space, and the third one is the multidisciplinary analysis. Since it is computationally inefficient when high-fidelity simulation methods are involved, an efficient strategy is proposed. The strategy [named probabilistic bi-level integrated system synthesis (ProBLISS)] utilizes a single-level reliability-based design optimization (RBDO) approach, in which the reliability analysis and optimization are conducted in a sequential manner by approximating limit state functions. The single-level RBDO is associated with the BLISS formulation to solve RBMDO problems. Since both the single-level RBDO and BLISS are mainly driven by approximate models, the accuracy of models can be a critical issue for convergence. The convergence of the strategy is guaranteed by employing the trust region–sequential quadratic programming framework, which validates approximation models in the trust region radius. Two multidisciplinary problems are tested to verify the strategy. ProBLISS significantly reduces the computational cost and shows stable convergence while maintaining accuracy.     

改进PSO算法及在无人机路径规划中的应用

在无人机路径规划问题中,传统算法存在计算复杂与收敛慢等缺点,粒子群优化算法(PSO)得益于其算法原理简单、通用性强、搜索全面等特性,现多用于无人机航路规划.然而,常规PSO算法容易陷入局部最优,本文在优化调整自适应参数的基础上综合引入全局极值变异与加速度项,以平衡全局和局部搜索效率,避免种群陷入“早熟”.对基准测试函数进行测试的结果表明,本文所提改进PSO算法收敛速度更快,精度更高.在实例验证部分,首先提取飞行场景特征,结合无人机性能约束,进行环境建模;然后将多项运行约束和期望的最小化飞行时间均转化为罚函数,以最小化罚函数作为目标,构建无人机飞行任务场景下的航路规划模型,并利用本文所提改进粒子群算法进行求解,最后通过对比仿真验证了改进粒子群算法的高效性和实用性.