On the Performance of the PSP Method for Mixed-Variable Multi-Objective Design Optimization

2010 ◽  
Vol 132 (7) ◽  
Author(s):  
Zeeshan Omer Khokhar ◽  
Hengameh Vahabzadeh ◽  
Amirreza Ziai ◽  
G. Gary Wang ◽  
Carlo Menon
Keyword(s):  
Design Optimization ◽  
Optimization Problems ◽  
Black Box ◽  
Performance Comparison ◽  
Benchmark Problems ◽  
Continuous Variables ◽  
Multi Objective ◽  
Algorithm Efficiency ◽  
Design Variables ◽  
Mixed Variable

Practical design optimization problems require use of computationally expensive “black-box” functions. The Pareto set pursuing (PSP) method, for solving multi-objective optimization problems with expensive black-box functions, was originally developed for continuous variables. In this paper, modifications are made to allow solution of problems with mixed continuous-discrete variables. A performance comparison strategy for nongradient-based multi-objective algorithms is discussed based on algorithm efficiency, robustness, and closeness to the true Pareto front with a limited number of function evaluations. Results using several methods, along with the modified PSP, are given for a suite of benchmark problems and two engineering design ones. The modified PSP is found to be competitive when the total number of function evaluations is limited, but faces an increased computational challenge when the number of design variables increases.

Multi Objective Design Optimization of Two Bar Truss Using NSGA II and TOPSIS

2014 ◽  
Vol 984-985 ◽  
pp. 419-424
Author(s):  
P. Sabarinath ◽  
M.R. Thansekhar ◽  
R. Saravanan
Keyword(s):  
Design Optimization ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Optimal Solutions ◽  
Objective Functions ◽  
Nsga Ii ◽  
Multi Objective ◽  
Total Displacement ◽  
Design Variables ◽  
Conflicting Objectives

Arriving optimal solutions is one of the important tasks in engineering design. Many real-world design optimization problems involve multiple conflicting objectives. The design variables are of continuous or discrete in nature. In general, for solving Multi Objective Optimization methods weight method is preferred. In this method, all the objective functions are converted into a single objective function by assigning suitable weights to each objective functions. The main drawback lies in the selection of proper weights. Recently, evolutionary algorithms are used to find the nondominated optimal solutions called as Pareto optimal front in a single run. In recent years, Non-dominated Sorting Genetic Algorithm II (NSGA-II) finds increasing applications in solving multi objective problems comprising of conflicting objectives because of low computational requirements, elitism and parameter-less sharing approach. In this work, we propose a methodology which integrates NSGA-II and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for solving a two bar truss problem. NSGA-II searches for the Pareto set where two bar truss is evaluated in terms of minimizing the weight of the truss and minimizing the total displacement of the joint under the given load. Subsequently, TOPSIS selects the best compromise solution.

scholarly journals A Sequential Linearization Approach for Solving Mixed-Discrete Nonlinear Design Optimization Problems

1991 ◽  
Vol 113 (3) ◽  
pp. 325-334 ◽  
Author(s):  
Han Tong Loh ◽  
P. Y. Papalambros
Keyword(s):  
Design Optimization ◽  
Optimization Problems ◽  
Continuous Variables ◽  
New Approach ◽  
Design Variables ◽  
Nonlinear Design ◽  
Discrete Problems ◽  
Computationally Intensive ◽  
Discrete Values ◽  
Sequential Linearization

Design optimization models of often contain variables that must take only discrete values, such as standard sizes. Nonlinear optimization problems with a mixture of discrete and continuous variables are very difficult, and existing algorithms are either computationally intensive or applicable to models with special structure. A new approach for solving nonlinear mixed-discrete problems with no particular structure is presented here, motivated by its efficiency for models with extensive monotonicities of the problem’s objective and constraint functions with respect to the design variables. It involves solving a sequence of mixed-discrete linear approximations of the original nonlinear model. In this article, a review of previous approaches is followed by description of the resulting algorithm, its convergence properties and limitations. Several illustrative examples are given. A sequel article presents a detailed algorithmic implementation and extensive computational results.

scholarly journals A Sequential Linearization Approach for Solving Mixed-Discrete Nonlinear Design Optimization Problems

1990 ◽  
Author(s):  
Han Tong Loh ◽  
Panos Y. Papalambros
Keyword(s):  
Design Optimization ◽  
Optimization Problems ◽  
Continuous Variables ◽  
New Approach ◽  
Design Variables ◽  
Nonlinear Design ◽  
Discrete Problems ◽  
Computationally Intensive ◽  
Discrete Values ◽  
Sequential Linearization

Abstract Design optimization models often contain variables that must take only discrete values, such as standard sizes. Nonlinear optimization problems with a mixture of discrete and continuous variables are very difficult, and existing algorithms are either computationally intensive or applicable to models with special structure. A new approach for solving nonlinear mixed-discrete problems with no particular structure is presented here, motivated by its efficiency for models with extensive monotonicities of the problem’s objective and constraint functions with respect to the design variables. It involves solving a sequence of mixed-discrete linear approximations of the original nonlinear model. In this article, a review of previous approaches is followed by description of the resulting algorithm, its convergence properties and limitations. Several illustrative examples are given. A sequel article presents a detailed algorithmic implementation and extensive computational results.

Study on Mix-Variable Collaborative Design Optimization

2012 ◽  
Vol 215-216 ◽  
pp. 592-596
Author(s):  
Li Gao ◽  
Rong Rong Wang
Keyword(s):  
Design Optimization ◽  
Product Design ◽  
Optimization Algorithm ◽  
Collaborative Design ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Collaborative Optimization ◽  
Continuous Variables ◽  
Complex Product ◽  
Divide And Rule

In order to deal with complex product design optimization problems with both discrete and continuous variables, mix-variable collaborative design optimization algorithm is put forward based on collaborative optimization, which is an efficient way to solve mix-variable design optimization problems. On the rule of “divide and rule”, the algorithm decouples the problem into some relatively simple subsystems. Then by using collaborative mechanism, the optimal solution is obtained. Finally, the result of a case shows the feasibility and effectiveness of the new algorithm.

Improved Trust Region Based MPS Method for High-Dimensional Expensive Black-Box Problems

2013 ◽  
Author(s):  
George H. Cheng ◽  
Adel Younis ◽  
Kambiz Haji Hajikolaei ◽  
G. Gary Wang
Keyword(s):  
Optimization Problems ◽  
Trust Region ◽  
Black Box ◽  
High Dimensional ◽  
Test Problems ◽  
Design Variables ◽  
Low Dimensionality ◽  
Improve Algorithm ◽  
Improved Performance ◽  
Better Than

Mode Pursuing Sampling (MPS) was developed as a global optimization algorithm for optimization problems involving expensive black box functions. MPS has been found to be effective and efficient for problems of low dimensionality, i.e., the number of design variables is less than ten. A previous conference publication integrated the concept of trust regions into the MPS framework to create a new algorithm, TRMPS, which dramatically improved performance and efficiency for high dimensional problems. However, although TRMPS performed better than MPS, it was unproven against other established algorithms such as GA. This paper introduces an improved algorithm, TRMPS2, which incorporates guided sampling and low function value criterion to further improve algorithm performance for high dimensional problems. TRMPS2 is benchmarked against MPS and GA using a suite of test problems. The results show that TRMPS2 performs better than MPS and GA on average for high dimensional, expensive, and black box (HEB) problems.

Multi-objective collaborative multidisciplinary design optimization using particle swarm techniques and fuzzy decision making

2012 ◽  
Vol 226 (9) ◽  
pp. 2281-2295 ◽  
Author(s):  
Mohammad Reza Farmani ◽  
Jafar Roshanian ◽  
Meisam Babaie ◽  
Parviz M Zadeh
Keyword(s):  
Particle Swarm Optimization ◽  
Design Optimization ◽  
Multidisciplinary Design Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Collaborative Optimization ◽  
Multidisciplinary Design ◽  
Fuzzy Decision ◽  
Swarm Optimization ◽  
Multi Objective

This article focuses on the efficient multi-objective particle swarm optimization algorithm to solve multidisciplinary design optimization problems. The objective is to extend the formulation of collaborative optimization which has been widely used to solve single-objective optimization problems. To examine the proposed structure, racecar design problem is taken as an example of application for three objective functions. In addition, a fuzzy decision maker is applied to select the best solution along the pareto front based on the defined criteria. The results are compared to the traditional optimization, and collaborative optimization formulations that do not use multi-objective particle swarm optimization. It is shown that the integration of multi-objective particle swarm optimization into collaborative optimization provides an efficient framework for design and analysis of hierarchical multidisciplinary design optimization problems.

Design Optimization of Aircraft Engine-Mount Systems

1993 ◽  
Author(s):  
Hashem Ashrafiuon
Keyword(s):  
Design Optimization ◽  
Vibration Isolation ◽  
Optimization Problems ◽  
Three Dimensional ◽  
Low Frequency ◽  
Aircraft Engine ◽  
Variable Metric ◽  
Design Variables ◽  
Engine Mount ◽  
Optimization Search

Abstract Design optimization of aircraft engine-mount systems for vibration isolation is presented. The engine is modeled as a rigid body connected to a flexible base representing the nacelle. The base is modeled with mass and stiffness matrices and structural damping using finite element modeling. The mounts are modeled as three-dimensional springs with hysteresis damping. The objective is to select the stiffness coefficients and orientation angles of the individual mounts to minimize the transmitted forces from the engine to the base. Meanwhile, the mounts have to be stiff enough not allowing engine deflection to exceed its limits under static and low frequency loadings. It is shown that with an optimal system the transmitted forces may be reduced significantly particularly when mount orientation angles are also treated as design variables. The optimization problems are solved using a Constraint Variable Metric approach. The closed form derivatives of the engine vibrational amplitudes with respect to design variables are derived in order to achieve a more effective optimization search technique.

A multi-objective evolutionary algorithm based on niche selection in solving irregular Pareto fronts

2021 ◽  
pp. 1-21
Author(s):  
Xin Li ◽  
Xiaoli Li ◽  
Kang Wang
Keyword(s):  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Environmental Selection ◽  
Optimal Solution Set ◽  
Pareto Fronts

The key characteristic of multi-objective evolutionary algorithm is that it can find a good approximate multi-objective optimal solution set when solving multi-objective optimization problems(MOPs). However, most multi-objective evolutionary algorithms perform well on regular multi-objective optimization problems, but their performance on irregular fronts deteriorates. In order to remedy this issue, this paper studies the existing algorithms and proposes a multi-objective evolutionary based on niche selection to deal with irregular Pareto fronts. In this paper, the crowding degree is calculated by the niche method in the process of selecting parents when the non-dominated solutions converge to the first front, which improves the the quality of offspring solutions and which is beneficial to local search. In addition, niche selection is adopted into the process of environmental selection through considering the number and the location of the individuals in its niche radius, which improve the diversity of population. Finally, experimental results on 23 benchmark problems including MaF and IMOP show that the proposed algorithm exhibits better performance than the compared MOEAs.

A Strength Pareto Gravitational Search Algorithm for Multi-Objective Optimization Problems

2015 ◽  
Vol 29 (06) ◽  
pp. 1559010 ◽  
Author(s):  
Xiaohui Yuan ◽  
Zhihuan Chen ◽  
Yanbin Yuan ◽  
Yuehua Huang ◽  
Xiaopan Zhang
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Local Optima ◽  
Multi Objective ◽  
Fine Grained ◽  
Gravitational Search

A novel strength Pareto gravitational search algorithm (SPGSA) is proposed to solve multi-objective optimization problems. This SPGSA algorithm utilizes the strength Pareto concept to assign the fitness values for agents and uses a fine-grained elitism selection mechanism to keep the population diversity. Furthermore, the recombination operators are modeled in this approach to decrease the possibility of trapping in local optima. Experiments are conducted on a series of benchmark problems that are characterized by difficulties in local optimality, nonuniformity, and nonconvexity. The results show that the proposed SPGSA algorithm performs better in comparison with other related works. On the other hand, the effectiveness of two subtle means added to the GSA are verified, i.e. the fine-grained elitism selection and the use of SBX and PMO operators. Simulation results show that these measures not only improve the convergence ability of original GSA, but also preserve the population diversity adequately, which enables the SPGSA algorithm to have an excellent ability that keeps a desirable balance between the exploitation and exploration so as to accelerate the convergence speed to the true Pareto-optimal front.

scholarly journals A New Method for Dynamic Multi-Objective Optimization Based on Segment and Cloud Prediction

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 465 ◽  
Author(s):  
Peng Ni ◽  
Jiale Gao ◽  
Yafei Song ◽  
Wen Quan ◽  
Qinghua Xing
Keyword(s):  
Optimization Problems ◽  
Pareto Set ◽  
Benchmark Problems ◽  
Small Range ◽  
Optimal Solutions ◽  
Multi Objective Optimization ◽  
Good Convergence ◽  
Multi Objective ◽  
The Law ◽  
Cloud Theory

In the real world, multi-objective optimization problems always change over time in most projects. Once the environment changes, the distribution of the optimal solutions would also be changed in decision space. Sometimes, such change may obey the law of symmetry, i.e., the minimum of the objective function in such environment is its maximum in another environment. In such cases, the optimal solutions keep unchanged or vibrate in a small range. However, in most cases, they do not obey the law of symmetry. In order to continue the search that maintains previous search advantages in the changed environment, some prediction strategy would be used to predict the operation position of the Pareto set. Because of this, the segment and multi-directional prediction is proposed in this paper, which consists of three mechanisms. First, by segmenting the optimal solutions set, the prediction about the changes in the distribution of the Pareto front can be ensured. Second, by introducing the cloud theory, the distance error of direction prediction can be offset effectively. Third, by using extra angle search, the angle error of prediction caused by the Pareto set nonlinear variation can also be offset effectively. Finally, eight benchmark problems were used to verify the performance of the proposed algorithm and compared algorithms. The results indicate that the algorithm proposed in this paper has good convergence and distribution, as well as a quick response ability to the changed environment.

Sign in / Sign up

Export Citation Format

Share Document