数学优化
多目标优化
集合(抽象数据类型)
帕累托原理
工程优化
最优化问题
计算机科学
上下界
混合算法(约束满足)
数学
算法
约束规划
数学分析
随机规划
约束逻辑程序设计
程序设计语言
作者
Guang Yang,Tao Xu,Xiang Li,Haohua Xiu,Tianshuang Xu
摘要
Generally, the inconvenience of establishing the mathematical optimization models directly and the conflicts of preventing simultaneous optimization among several objectives lead to the difficulty of obtaining the optimal solution of a practical engineering problem with several objectives. So in this paper, a generate-first-choose-later method is proposed to solve the multiobjective engineering optimization problems, which can set the number of Pareto solutions and optimize repeatedly until the satisfactory results are obtained. Based on Frisch’s method, Newton method, and weighed sum method, an efficient hybrid algorithm for multiobjective optimization models with upper and lower bounds and inequality constraints has been proposed, which is especially suitable for the practical engineering problems based on surrogate models. The generate-first-choose-later method with this hybrid algorithm can calculate the Pareto optimal set, show the Pareto front, and provide multiple designs for multiobjective engineering problems fast and accurately. Numerical examples demonstrate the effectiveness and high efficiency of the hybrid algorithm. In order to prove that the generate-first-choose-later method is rapid and suitable for solving practical engineering problems, an optimization problem for crash box of vehicle has been handled well.
科研通智能强力驱动
Strongly Powered by AbleSci AI