Multi-Objective Parameter Identification in Structural Dynamics

2003 ◽  
Author(s):  
Y. Haralampidis ◽  
M. Pavlidou ◽  
C. Papadimitriou
Keyword(s):  
Pareto Front ◽  
Identification Problem ◽  
Relative Importance ◽  
Optimal Solutions ◽  
Multi Objective Optimization ◽  
Pareto Solutions ◽  
Multi Objective ◽  
Objective Parameter ◽  
Strength Pareto Evolutionary Algorithm ◽  
Objective Context

The structural identification problem is formulated in a multi-objective context that allows the simultaneous minimization of the various objectives related to the fit between measured and model predicted data. Thus, the need for using arbitrary weighting factors for weighting the relative importance of each objective is eliminated. The set of admissible solutions are known in multi-objective optimization terminology as Pareto optimal solutions and constitute acceptable compromise solutions that cannot be improved in any objective without causing degradation in one other objective. The strength Pareto evolutionary algorithm is used to obtain the set of Pareto solutions. The use of the proposed methodology is illustrated by identifying the Pareto front and the corresponding set of optimal solutions for a model of a scaled laboratory structure using experimentally obtained modal data.

scholarly journals Multiobjective approach in the treatment of cancer

2020 ◽  
Author(s):  
Soukaina Sabir ◽  
Nadia Raissi ◽  
Mustapha Serhani
Keyword(s):  
Optimal Control ◽  
Tumor Cells ◽  
Pareto Front ◽  
Multi Objective Optimization ◽  
Pareto Solutions ◽  
Effector Cells ◽  
Multi Objective ◽  
Chemotherapy Drugs ◽  
Multiobjective Approach ◽  
Growth Of Tumor

In this work we deal with a cancer problem involving the growth of tumor cells and their interaction with effector cells. The goal is to find an optimal control minimizing tumor cells density together with the amount of chemotherapy drugs and maximizing the density of effector cells. By invoking the multi-objective optimization we characterize optimal Pareto solutions and give simulation of Pareto front.

scholarly journals Search Acceleration of Evolutionary Multi-Objective Optimization Using an Estimated Convergence Point

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 129 ◽  
Author(s):  
Yan Pei ◽  
Jun Yu ◽  
Hideyuki Takagi
Keyword(s):  
Parameter Space ◽  
Statistical Tests ◽  
Distribution Characteristic ◽  
Multi Objective Optimization ◽  
Pareto Improvement ◽  
Pareto Solutions ◽  
Pareto Solution ◽  
Multi Objective ◽  
Objective Space ◽  
Convergence Point

We propose a method to accelerate evolutionary multi-objective optimization (EMO) search using an estimated convergence point. Pareto improvement from the last generation to the current generation supports information of promising Pareto solution areas in both an objective space and a parameter space. We use this information to construct a set of moving vectors and estimate a non-dominated Pareto point from these moving vectors. In this work, we attempt to use different methods for constructing moving vectors, and use the convergence point estimated by using the moving vectors to accelerate EMO search. From our evaluation results, we found that the landscape of Pareto improvement has a uni-modal distribution characteristic in an objective space, and has a multi-modal distribution characteristic in a parameter space. Our proposed method can enhance EMO search when the landscape of Pareto improvement has a uni-modal distribution characteristic in a parameter space, and by chance also does that when landscape of Pareto improvement has a multi-modal distribution characteristic in a parameter space. The proposed methods can not only obtain more Pareto solutions compared with the conventional non-dominant sorting genetic algorithm (NSGA)-II algorithm, but can also increase the diversity of Pareto solutions. This indicates that our proposed method can enhance the search capability of EMO in both Pareto dominance and solution diversity. We also found that the method of constructing moving vectors is a primary issue for the success of our proposed method. We analyze and discuss this method with several evaluation metrics and statistical tests. The proposed method has potential to enhance EMO embedding deterministic learning methods in stochastic optimization algorithms.

Applications of Multiple Objective Genetic Algorithms in the Optimization Design of Tracked Self-Moving Power’s Layout

2013 ◽  
Vol 307 ◽  
pp. 161-165
Author(s):  
Hai Jin ◽  
Jin Fa Xie
Keyword(s):  
Optimization Design ◽  
Pareto Front ◽  
Layout Optimization ◽  
Multiple Objective ◽  
Multi Objective Optimization ◽  
Layout Problem ◽  
Basic Principles ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Set Up

A multi-objective genetic algorithm is applied into the layout optimization of tracked self-moving power. The layout optimization mathematical model was set up. Then introduced the basic principles of NSGA-Ⅱ, which is a Pareto multi-objective optimization algorithm. Finally, NSGA-Ⅱwas presented to solve the layout problem. The algorithm was proved to be effective by some practical examples. The results showed that the algorithm can spread toward the whole Pareto front, and provide many reasonable solutions once for all.

scholarly journals On the use of filters to facilitate the post-optimal analysis of the Pareto solutions in multi-objective optimization

2015 ◽  
Vol 74 ◽  
pp. 48-58 ◽  
Author(s):  
E. Antipova ◽  
C. Pozo ◽  
G. Guillén-Gosálbez ◽  
D. Boer ◽  
L.F. Cabeza ◽  
...  
Keyword(s):  
Multi Objective Optimization ◽  
Pareto Solutions ◽  
Multi Objective ◽  
Optimal Analysis

Solving Multi-Objective Multicast Routing Problem Using a New Hybrid Approach

2018 ◽  
Vol 9 (4) ◽  
pp. 22-36
Author(s):  
Mohammed Mahseur ◽  
Abdelmadjid Boukra ◽  
Yassine Meraihi
Keyword(s):  
Multicast Routing ◽  
Hybrid Approach ◽  
Bat Algorithm ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Multi Objective ◽  
Strength Pareto Evolutionary Algorithm ◽  
Quality Of Service Parameters

Multicast routing is the problem of finding the spanning tree of a set of destinations whose roots are the source node and its leaves are the set of destination nodes by optimizing a set of quality of service parameters and satisfying a set of transmission constraints. This article proposes a new hybrid multicast algorithm called Hybrid Multi-objective Multicast Algorithm (HMMA) based on the Strength Pareto Evolutionary Algorithm (SPEA) to evaluate and classify the population in dominated solutions and non-dominated solutions. Dominated solutions are evolved by the Bat Algorithm, and non-dominated solutions are evolved by the Firefly Algorithm. Old and weak solutions are replaced by new random solutions by a process of mutation. The simulation results demonstrate that the proposed algorithm is able to find good Pareto optimal solutions compared to other algorithms.

scholarly journals Multi-Objective Optimization Design of an Electrohydrostatic Actuator Based on a Particle Swarm Optimization Algorithm and an Analytic Hierarchy Process

Energies ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 2426 ◽  
Author(s):  
Bo Yu ◽  
Shuai Wu ◽  
Zongxia Jiao ◽  
Yaoxing Shang
Keyword(s):  
Particle Swarm Optimization ◽  
Power Consumption ◽  
Analytic Hierarchy Process ◽  
Optimization Design ◽  
Pareto Front ◽  
Multi Objective Optimization ◽  
Analytic Hierarchy ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Hierarchy Process

During the last few years, the concept of more-electric aircraft has been pushed ahead by industry and academics. For a more-electric actuation system, the electrohydrostatic actuator (EHA) has shown its potential for better reliability, low maintenance cost and reducing aircraft weight. Designing an EHA for aviation applications is a hard task, which should balance several inconsistent objectives simultaneously, such as weight, stiffness and power consumption. This work presents a method to obtain the optimal EHA, which combines multi-objective optimization with a synthetic decision method, that is, a multi-objective optimization design method, that can combine designers’ preferences and experiences. The evaluation model of an EHA in terms of weight, stiffness and power consumption is studied in the first section. Then, a multi-objective particle swarm optimization (MOPSO) algorithm is introduced to obtain the Pareto front, and an analytic hierarchy process (AHP) is applied to help find the optimal design in the Pareto front. A demo of an EHA design illustrates the feasibility of the proposed method.

scholarly journals The dilemma between eliminating dominance-resistant solutions and preserving boundary solutions of extremely convex Pareto fronts

2021 ◽  
Author(s):  
Zhenkun Wang ◽  
Qingyan Li ◽  
Qite Yang ◽  
Hisao Ishibuchi
Keyword(s):  
Evolutionary Algorithms ◽  
Coping Strategies ◽  
Test Problem ◽  
Pareto Front ◽  
Optimization Problems ◽  
Feasible Region ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Fronts ◽  
Boundary Solutions

AbstractIt has been acknowledged that dominance-resistant solutions (DRSs) extensively exist in the feasible region of multi-objective optimization problems. Recent studies show that DRSs can cause serious performance degradation of many multi-objective evolutionary algorithms (MOEAs). Thereafter, various strategies (e.g., the $$\epsilon $$ ϵ -dominance and the modified objective calculation) to eliminate DRSs have been proposed. However, these strategies may in turn cause algorithm inefficiency in other aspects. We argue that these coping strategies prevent the algorithm from obtaining some boundary solutions of an extremely convex Pareto front (ECPF). That is, there is a dilemma between eliminating DRSs and preserving boundary solutions of the ECPF. To illustrate such a dilemma, we propose a new multi-objective optimization test problem with the ECPF as well as DRSs. Using this test problem, we investigate the performance of six representative MOEAs in terms of boundary solutions preservation and DRS elimination. The results reveal that it is quite challenging to distinguish between DRSs and boundary solutions of the ECPF.

scholarly journals Integration of Operability Framework and Pareto Optimal Front to Calculate Optimal Condition of Ethane Cracking Process

2020 ◽  
pp. 105-113
Author(s):  
M. Farsi
Keyword(s):  
Pareto Front ◽  
Optimal Solution ◽  
Optimization Procedure ◽  
Operating Conditions ◽  
Base Case ◽  
Pareto Optimal ◽  
Multi Objective Optimization ◽  
Pareto Optimal Front ◽  
Multi Objective ◽  
Cracking Process

The main aim of this research is to present an optimization procedure based on the integration of operability framework and multi-objective optimization concepts to find the single optimal solution of processes. In this regard, the Desired Pareto Index is defined as the ratio of desired Pareto front to the Pareto optimal front as a quantitative criterion to analyze the performance of chemical processes. The Desired Pareto Front is defined as a part of the Pareto front that all outputs are improved compared to the conventional operating condition. To prove the efficiency of proposed optimization method, the operating conditions of ethane cracking process is optimized as a base case. The ethylene and methane production rates are selected as the objectives in the formulated multi-objective optimization problem. Based on the simulation results, applying the obtained operating conditions by the proposed optimization procedure on the ethane cracking process improve ethylene production by about 3% compared to the conventional condition.  

scholarly journals Walking with EMO

2011 ◽  
pp. 300-332
Author(s):  
Jason Teo ◽  
Lynnie D. Neri ◽  
Minh H. Nguyen ◽  
Hussein A. Abbass
Keyword(s):  
Legged Locomotion ◽  
Operational Performance ◽  
Multi Objective Optimization ◽  
Pareto Solutions ◽  
Uncertain Environments ◽  
Multi Objective ◽  
Limb Dynamics

This chapter will demonstrate the various robotics applications that can be achieved using evolutionary multi-objective optimization (EMO) techniques. The main objective of this chapter is to demonstrate practical ways of generating simple legged locomotion for simulated robots with two, four and six legs using EMO. The operational performance as well as complexities of the resulting evolved Pareto solutions that act as controllers for these robots will then be analyzed. Additionally, the operational dynamics of these evolved Pareto controllers in noisy and uncertain environments, limb dynamics and effects of using a different underlying EMO algorithm will also be discussed.

Toward the Use of Pareto Performance Solutions and Pareto Robustness Solutions for Multi-Objective Robust Optimization Problems

2012 ◽  
Author(s):  
Weijun Wang ◽  
Stéphane Caro ◽  
Fouad Bennis ◽  
Oscar Brito Augusto
Keyword(s):  
Robust Optimization ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Multi Objective Optimization ◽  
Robust Solutions ◽  
Multi Objective ◽  
Robust Optimization Problem ◽  
Design Solutions ◽  
Further Development

For Multi-Objective Robust Optimization Problem (MOROP), it is important to obtain design solutions that are both optimal and robust. To find these solutions, usually, the designer need to set a threshold of the variation of Performance Functions (PFs) before optimization, or add the effects of uncertainties on the original PFs to generate a new Pareto robust front. In this paper, we divide a MOROP into two Multi-Objective Optimization Problems (MOOPs). One is the original MOOP, another one is that we take the Robustness Functions (RFs), robust counterparts of the original PFs, as optimization objectives. After solving these two MOOPs separately, two sets of solutions come out, namely the Pareto Performance Solutions (PP) and the Pareto Robustness Solutions (PR). Make a further development on these two sets, we can get two types of solutions, namely the Pareto Robustness Solutions among the Pareto Performance Solutions (PR(PP)), and the Pareto Performance Solutions among the Pareto Robustness Solutions (PP(PR)). Further more, the intersection of PR(PP) and PP(PR) can represent the intersection of PR and PP well. Then the designer can choose good solutions by comparing the results of PR(PP) and PP(PR). Thanks to this method, we can find out the optimal and robust solutions without setting the threshold of the variation of PFs nor losing the initial Pareto front. Finally, an illustrative example highlights the contributions of the paper.

Sign in / Sign up

Export Citation Format

Share Document