An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
type: Item
instance of: scholarly article
title: An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
zbMATH Open document ID: 1394.90522
DOI: 10.1155/2015/932029
author: Guang Yang
author: Tao Xu
author: Xiang Li
author: Haohua Xiu
author: Tianshuang Xu
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6927604
Wikidata QID: Q59120328
describes a project that uses: Matlab
describes a project that uses: MOPSO
describes a project that uses: SPEA2
describes a project that uses: NBI
describes a project that uses: Genetic Algorithm and Direct Search Toolbox
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/932029
OpenAlex ID: W1563666991
cites work: Aggregate objective functions and Pareto frontiers: required relationships and practical implications
cites work: Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method
cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
cites work: Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
cites work: A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
cites work: Scalarizations for adaptively solving multi-objective optimization problems
cites work: Newton's Method for Multiobjective Optimization
cites work: A combined scalarizing method for multiobjective programming problems
cites work: Q5701618
cites work: Solving the optimal process target problem using response surface designs in heteroscedastic conditions
cites work: Optimal shape parameter for the solution of elastostatic problems with the RBF method
cites work: On the Newton interior-point method for nonlinear programming problems
cites work: Q3832072
description: scientific article; zbMATH DE number 6927604