An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
Summary: 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.
- A novel hybrid algorithm for solving multiobjective optimization problems with engineering applications
- A hybrid optimization technique for solving nonlinear multi-objective optimization problem
- Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA
- An interactive dynamic approach based on hybrid swarm optimization for solving multiobjective programming problem with fuzzy parameters
- Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
- A combined scalarizing method for multiobjective programming problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- Aggregate objective functions and Pareto frontiers: required relationships and practical implications
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method
- scientific article; zbMATH DE number 4108183 (Why is no real title available?)
- scientific article; zbMATH DE number 2222820 (Why is no real title available?)
- Newton's method for multiobjective optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On the Newton interior-point method for nonlinear programming problems
- Optimal shape parameter for the solution of elastostatic problems with the RBF method
- Scalarizations for adaptively solving multi-objective optimization problems
- Solving the optimal process target problem using response surface designs in heteroscedastic conditions
Uses Software
This page was built for publication: An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666979)
