• 대한기계학회논문집A
• /
• 제30권2호
• /
• pp.128-134
• /
• 2006

Topology optimization is an effective scheme to obtain the initial design concept: however, it is hard to apply in case of non-linear or multi-objective problems. In this study, a modified topology optimization method is proposed to generate a structure of a swing arm type actuator satisfying maximum compliance as well. as maximum stiffness using the multi-objective optimization. approach. The multi-objective function is defined to maximize the compliance in the direction of focusing of the actuator and the second eigen-frequency of the structure. The design of experiments are performed and the response surface functions are formulated to construct the multi-objective function. The weighting factors between conflicting functions are determined by the back-error propagation neural network and the solution of multi-objective function is acquired using the genetic algorithm.

• Journal of Computational Design and Engineering
• /
• 제2권3호
• /
• pp.165-175
• /
• 2015

One of the current challenges in the domain of the multicriteria shape optimization is to reduce the calculation time required by conventional methods. The high computational cost is due to the high number of simulation or function calls required by these methods. Recently, several studies have been led to overcome this problem by integrating a metamodel in the overall optimization loop. In this paper, we perform a coupling between the Normal Boundary Intersection - NBI - algorithm with Radial Basis Function - RBF - metamodel in order to have a simple tool with a reasonable calculation time to solve multicriteria optimization problems. First, we apply our approach to academic test cases. Then, we validate our method against an industrial case, namely, shape optimization of the bottom of an aerosol can undergoing nonlinear elasto-plastic deformation. Then, in order to select solutions among the Pareto efficient ones, we use the same surrogate approach to implement a method to compute Nash and Kalai-Smorodinsky equilibria.

• 오토저널
• /
• 제15권1호
• /
• pp.81-88
• /
• 1993

A direct treatment of the min-max type objective function of the dynamic response optimization problem is proposed. Previously, the min-max type objective function was transformed to an artificial design variable and an additional point-wise state variable constraint function was imposed, which increased the complexity of the optimization problem. Especially, the design sensitivity analysis for the augmented Lagrangian functional with the suggested treatment is established by using the adjoint variable method and a computer program to implement the proposed algorithm is developed. The optimization result of the proposed treatment are obtained for three typical problems and compared with those of the previous treatment. It is concluded that the suggested treatment in much more efficient in the computational effort than the previous treatment with giving the similar optimal solutions.

• 항공우주시스템공학회지
• /
• 제15권2호
• /
• pp.1-9
• /
• 2021

In this paper, a thickness compensation function is introduced to consider the shear deformation and warping effect resulting from increased thickness in the composite multi-cell wing box. The thickness compensation function is used to perform the structure optimization of the multi-cell. It is determined by minimizing the error of an analytical formula using solid mechanics and the Ritz method. It is used to define a structural performance prediction expression due to the increase in thickness. The parameter is defined by the number of spars and analyzed by the critical buckling load and the limited failure index as a response. Constraints in structural optimization are composed of displacements, torsional angles, the critical buckling load, and the failure index. The objective function is the mass, and its optimization is performed using a genetic algorithm.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제1권2호
• /
• pp.165-173
• /
• 2001

The desirability function approach by Derringer and Suich (1980) and the generalized distance approach by Khuri and Conlon (1981) are two major approaches to multiresponse optimization for improvement of quality of a product or process. So far, the desirability function method has been the only tool for multiresponse optimization in the situations where there are the goal regions for the respective responses. For such situations, we propose a multiresponse optimization method based on the generalized distance approach.

• 충청수학회지
• /
• 제27권3호
• /
• pp.433-438
• /
• 2014

A semi-infinite optimization problem involving a quasi-convex objective function and infinitely many convex constraint functions with data uncertainty is considered. A surrogate duality theorem for the semi-infinite optimization problem is given under a closed and convex cone constraint qualification.

• Journal of Information Processing Systems
• /
• 제14권5호
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• East Asian mathematical journal
• /
• 제29권3호
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• 품질경영학회지
• /
• 제27권2호
• /
• pp.237-250
• /
• 1999

Response surface analysis has been a popular tool conducted by engineers in many processes. In this paper, response surface function, named partial least squares response surface function is proposed. Partial least squares response surface function is a function of partial least squares components and the response surface modeling is used in either a first-order or a second-order model. Also, this approach will have the engineers be able to do the response surface modeling and the process optimization even when the number of experimental runs is less than the number of model parameters. This idea is applied to the nondesign data and an application of partial least squares response surface function to the process optimization is considered.

• 호남수학학술지
• /
• 제35권2호
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.