Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method

2016 ◽  
Vol 119 ◽  
pp. 142-160 ◽  
Author(s):  
Julio B. Clempner ◽  
Alexander S. Poznyak
Keyword(s):  
Markov Chains ◽  
Euclidean Distance ◽  
Pareto Front ◽  
Optimization Method ◽  
Minimum Euclidean Distance ◽  
Gradient Based

Parameter study and optimization design of a hat oblique tunnel portal

2021 ◽  
pp. 095440972110140
Author(s):  
Zijian Guo ◽  
Tanghong Liu ◽  
Wenhui Li ◽  
Yutao Xia
Keyword(s):  
High Speed ◽  
Optimization Design ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Method ◽  
Design Parameters ◽  
Parameter Study ◽  
Buffer Structure ◽  
Tunnel Entrance ◽  
The Ideal

The present work focuses on the aerodynamic problems resulting from a high-speed train (HST) passing through a tunnel. Numerical simulations were employed to obtain the numerical results, and they were verified by a moving-model test. Two responses, [Formula: see text] (coefficient of the peak-to-peak pressure of a single fluctuation) and[Formula: see text] (pressure value of micro-pressure wave), were studied with regard to the three building parameters of the portal-hat buffer structure of the tunnel entrance and exit. The MOPSO (multi-objective particle swarm optimization) method was employed to solve the optimization problem in order to find the minimum [Formula: see text] and[Formula: see text]. Results showed that the effects of the three design parameters on [Formula: see text] were not monotonous, and the influences of[Formula: see text] (the oblique angle of the portal) and [Formula: see text] (the height of the hat structure) were more significant than that of[Formula: see text] (the angle between the vertical line of the portal and the hat). Monotonically decreasing responses were found in [Formula: see text] for [Formula: see text] and[Formula: see text]. The Pareto front of [Formula: see text] and[Formula: see text]was obtained. The ideal single-objective optimums for each response located at the ends of the Pareto front had values of 1.0560 for [Formula: see text] and 101.8 Pa for[Formula: see text].

An Improved Shape Annealing Method for Truss Topology Generation

1994 ◽  
Author(s):  
Giridhar Reddy ◽  
Jonathan Cagan
Keyword(s):  
Simulated Annealing ◽  
Optimization Method ◽  
Geometric Constraints ◽  
Truss Structures ◽  
Model Design ◽  
Topology Generation ◽  
Truss Topology ◽  
Gradient Based ◽  
Annealing Algorithm ◽  
Annealing Method

Abstract A method for the design of truss structures which encourages lateral exploration, pushes away from violated spaces, models design intentions, and produces solutions with a wide variety of characteristics is introduced. An improved shape annealing algorithm for truss topology generation and optimization, based on the techniques of shape grammars and simulated annealing, implements the method. The algorithm features a shape grammar to model design intentions, an ability to incorporate geometric constraints to avoid obstacles, and a shape optimization method using only simulated annealing with more consistent convergence characteristics; no traditional gradient-based techniques are employed. The improved algorithm is illustrated on various structural examples generating a variety of solutions based on a simple grammar.

Efficient Gradient-Based Algorithms for the Construction of Pareto Fronts

2011 ◽  
Author(s):  
Sriram Shankaran ◽  
Brian Barr
Keyword(s):  
Pareto Front ◽  
Computational Cost ◽  
High Fidelity ◽  
Simulation Tools ◽  
Pareto Points ◽  
Uniform Spacing ◽  
Design Variables ◽  
Gradient Based ◽  
Pareto Fronts ◽  
Sampling Approach

The objective of this study is to develop and assess a gradient-based algorithm that efficiently traverses the Pareto front for multi-objective problems. We use high-fidelity, computationally intensive simulation tools (for eg: Computational Fluid Dynamics (CFD) and Finite Element (FE) structural analysis) for function and gradient evaluations. The use of evolutionary algorithms with these high-fidelity simulation tools results in prohibitive computational costs. Hence, in this study we use an alternate gradient-based approach. We first outline an algorithm that can be proven to recover Pareto fronts. The performance of this algorithm is then tested on three academic problems: a convex front with uniform spacing of Pareto points, a convex front with non-uniform spacing and a concave front. The algorithm is shown to be able to retrieve the Pareto front in all three cases hence overcoming a common deficiency in gradient-based methods that use the idea of scalarization. Then the algorithm is applied to a practical problem in concurrent design for aerodynamic and structural performance of an axial turbine blade. For this problem, with 5 design variables, and for 10 points to approximate the front, the computational cost of the gradient-based method was roughly the same as that of a method that builds the front from a sampling approach. However, as the sampling approach involves building a surrogate model to identify the Pareto front, there is the possibility that validation of this predicted front with CFD and FE analysis results in a different location of the “Pareto” points. This can be avoided with the gradient-based method. Additionally, as the number of design variables increases and/or the number of required points on the Pareto front is reduced, the computational cost favors the gradient-based approach.

Efficient Structural Design Using a Numerical Optimization Technique

2019 ◽  
Author(s):  
Qian Wang ◽  
Lucas Schmotzer ◽  
Yongwook Kim
Keyword(s):  
Structural Design ◽  
Numerical Optimization ◽  
Optimization Technique ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Convergence Criteria ◽  
Efficient Design ◽  
Concrete Building ◽  
Gradient Based ◽  
Structural Responses

<p>Structural designs of complex buildings and infrastructures have long been based on engineering experience and a trial-and-error approach. The structural performance is checked each time when a design is determined. An alternative strategy based on numerical optimization techniques can provide engineers an effective and efficient design approach. To achieve an optimal design, a finite element (FE) program is employed to calculate structural responses including forces and deformations. A gradient-based or gradient-free optimization method can be integrated with the FE program to guide the design iterations, until certain convergence criteria are met. Due to the iterative nature of the numerical optimization, a user programming is required to repeatedly access and modify input data and to collect output data of the FE program. In this study, an approximation method was developed so that the structural responses could be expressed as approximate functions, and that the accuracy of the functions could be adaptively improved. In the method, the FE program was not required to be directly looped in the optimization iterations. As a practical illustrative example, a 3D reinforced concrete building structure was optimized. The proposed method worked very well and optimal designs were found to reduce the torsional responses of the building.</p>

Computed Tomography Brain Images Semantic Segmentation

2017 ◽  
pp. 77-104
Author(s):  
Poonam Fauzdar ◽  
Sarvesh Kumar
Keyword(s):  
Computed Tomography ◽  
Positive Predictive Value ◽  
Euclidean Distance ◽  
Global Analysis ◽  
Semantic Segmentation ◽  
Brain Images ◽  
Minimum Euclidean Distance ◽  
Computed Tomography Images ◽  
Multi Level ◽  
Reduced Time

In this paper we applianced an approach for segmenting brain tumour regions in a computed tomography images by proposing a multi-level fuzzy technique with quantization and minimum computed Euclidean distance applied to morphologically divided skull part. Since the edges identified with closed contours and further improved by adding minimum Euclidean distance, that is why the numerous results that are analyzed are very assuring and algorithm poses following advantages like less cost, global analysis of image, reduced time, more specificity and positive predictive value.

A New Deterministic Approach Using Sensitivity Region Measures for Multi-Objective Robust and Feasibility Robust Design Optimization

2005 ◽  
Vol 128 (4) ◽  
pp. 874-883 ◽  
Author(s):  
Mian Li ◽  
Shapour Azarm ◽  
Art Boyars
Keyword(s):  
Pareto Front ◽  
Optimization Problems ◽  
Continuous Functions ◽  
Robust Design Optimization ◽  
Worst Case ◽  
New Approach ◽  
Multi Objective ◽  
Tolerance Region ◽  
Parameter Variations ◽  
Gradient Based

We present a deterministic non-gradient based approach that uses robustness measures in multi-objective optimization problems where uncontrollable parameter variations cause variation in the objective and constraint values. The approach is applicable for cases that have discontinuous objective and constraint functions with respect to uncontrollable parameters, and can be used for objective or feasibility robust optimization, or both together. In our approach, the known parameter tolerance region maps into sensitivity regions in the objective and constraint spaces. The robustness measures are indices calculated, using an optimizer, from the sizes of the acceptable objective and constraint variation regions and from worst-case estimates of the sensitivity regions’ sizes, resulting in an outer-inner structure. Two examples provide comparisons of the new approach with a similar published approach that is applicable only with continuous functions. Both approaches work well with continuous functions. For discontinuous functions the new approach gives solutions near the nominal Pareto front; the earlier approach does not.

Non-Probabilistic Based Topology Optimization Under External Load Uncertainty With Eigenvalue-Superposition of Convex Models

2013 ◽  
Author(s):  
Xike Zhao ◽  
Hae Chang Gea ◽  
Wei Song
Keyword(s):  
Topology Optimization ◽  
External Load ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Optimization Method ◽  
Convex Model ◽  
Structure Response ◽  
Gradient Based ◽  
Bounded Convex ◽  
Topology Optimization Method

In this paper the Eigenvalue-Superposition of Convex Models (ESCM) based topology optimization method for solving topology optimization problems under external load uncertainties is presented. The load uncertainties are formulated using the non-probabilistic based unknown-but-bounded convex model. The sensitivities are derived and the problem is solved using gradient based algorithm. The proposed ESCM based method yields the material distribution which would optimize the worst structure response under the uncertain loads. Comparing to the deterministic based topology optimization formulation the ESCM based method provided more reasonable solutions when load uncertainties were involved. The simplicity, efficiency and versatility of the proposed ESCM based topology optimization method can be considered as a supplement to the sophisticated reliability based topology optimization methods.

Sign in / Sign up

Export Citation Format

Share Document