• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
• /
• pp.359-366
• /
• 2005

Most engineering optimization are based on numerical linear and nonlinear programming methods that require substantial gradient information and usually seek to improve the solution in the neighborhood of a starting point. These algorithm, however, reveal a limited approach to complicated real-world optimization problems. If there is more than one local optimum in the problem, the result may depend on the selection of an initial point, and the obtained optimal solution may not necessarily be the global optimum. This paper describes a new harmony search(HS) meta-heuristic algorithm-based approach for structural size optimization problems with continuous design variables. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. Two classical space truss optimization problems are presented to demonstrate the effectiveness and robustness of the HS algorithm. The results indicate that the proposed approach is a powerful search and optimization technique that may yield better solutions to structural engineering problems than those obtained using current algorithms.

• 대한기계학회논문집A
• /
• 제28권10호
• /
• pp.1558-1565
• /
• 2004

It is important to determine supporting locations for structural stability when a structure is loaded with non-uniform load or supporting locations as well as the number of the supporting structures are restricted by the problem of space. Moreover, the supporting location optimization of complex structure in real world is frequently faced with discontinuous design space. Therefore, the traditional optimization methods based on derivative are not suitable Whereas, Genetic Algorithm (CA) based on stochastic search technique is a very robust and general method. The KSTAR in-vessel control coil installed in vacuum vessel is loaded with non- uniform electro-magnetic load and supporting locations are restricted by the problem of space. This paper shows the supporting location optimization for structural stability of the in-vessel control coil. Optimization has been performed by means of a developed program. It consists of a Finite Element Analysis interfaced with a Genetic Algorithm. In addition, this paper presents an algorithm to find an optimum solution in discontinuous space using continuous design variables.

• 대한기계학회논문집A
• /
• 제24권3호
• /
• pp.661-666
• /
• 2000

Optimization of the elastic joint of train is performed according to the minimization of ten responses which represent driving safety and ride comfort of train and analyzed by using the each response se surface model from stochastic design of experiments. After the each response surface model is constructed, the main effect and sensitivity analyses are successfully performed by 2nd order approximated regression model as described in this paper. We can get the optimal solutions using by nonlinear programming method such as simplex or interval optimization algorithms. The response surface models and the optimization algorithms are used together to obtain the optimal design of the elastic joint of train. the ten 2nd order polynomial response surface models of the three translational stiffness of the elastic joint (design factors) are constructed by using CCD(Central Composite Design) and the multi-objective optimization is also performed by applying min-max and distance minimization techniques of relative target deviation.

• 대한기계학회논문집A
• /
• 제32권12호
• /
• pp.1132-1139
• /
• 2008

The aim of this study is to apply shape optimization technique for the repair of aging airframe components, which may extend fatigue life substantially. Free-form optimum shapes of a cracked part to be reworked or replaced are investigated with the objective to minimize the peak local stress concentration or fatigue-damage. Iterative non-gradient method, which is based on an analogy with biological growth, is employed by incorporating the robust optimization method to take account of the stochastic nature of the loading conditions. Numerical examples of optimal hole shape in a flat plate are presented to validate the proposed method. The method is then applied to determine the reworked or replacement shape for the repair of a cracked rib in the rear assembly wing body of aircraft.

• International Journal of Control, Automation, and Systems
• /
• 제3권2호
• /
• pp.236-243
• /
• 2005

This paper presents a new stochastic approach for solving combinatorial optimization problems by using a new selection method, i.e. SA-selection, in genetic algorithm (GA). This approach combines GA with simulated annealing (SA) to improve the performance of GA. GA and SA have complementary strengths and weaknesses. While GA explores the search space by means of population of search points, it suffers from poor convergence properties. SA, by contrast, has good convergence properties, but it cannot explore the search space by means of population. However, SA does employ a completely local selection strategy where the current candidate and the new modification are evaluated and compared. To verify the effectiveness of the proposed method, the optimization of a fuzzy controller for balancing an inverted pendulum on a cart is considered.

• Structural Engineering and Mechanics
• /
• 제32권1호
• /
• pp.127-145
• /
• 2009

A novel approach is proposed to effectively estimate the quantile functions of normalized performance indices of reliability constraints in a reliability-based optimization (RBO) problem. These quantile functions are not only estimated as functions of exceedance probabilities but also as functions of the design variables of the target RBO problem. Once these quantile functions are obtained, all reliability constraints in the target RBO problem can be transformed into non-probabilistic ordinary ones, and the RBO problem can be solved as if it is an ordinary optimization problem. Two numerical examples are investigated to verify the proposed novel approach. The results show that the approach may be capable of finding approximate solutions that are close to the actual solution of the target RBO problem.

• ETRI Journal
• /
• 제35권6호
• /
• pp.1168-1171
• /
• 2013

We propose an improvement of particle swarm optimization (PSO) based on the stabilization of particle movement (PM). PSO uses a stochastic variable to avoid an unfortunate state in which every particle quickly settles into a unanimous, unchanging direction, which leads to overshoot around the optimum position, resulting in a slow convergence. This study shows that randomly located particles may converge at a fast speed and lower overshoot by using the proportional-integral-derivative approach, which is a widely used feedback control mechanism. A benchmark consisting of representative training datasets in the domains of function approximations and pattern recognitions is used to evaluate the performance of the proposed PSO. The final outcome confirms the improved performance of the PSO through facilitating the stabilization of PM.

• 전자공학회논문지B
• /
• 제30B권8호
• /
• pp.54-63
• /
• 1993

This paper proposes a method for improving the performances of the neural network for optimization by an optimal estimation of initial states. The optimal initial state that leads to the global minimum is estimated by using the stochastic approximation. And then the update rule of Hopfield model, which is the high speed deterministic algorithm using the steepest descent rule, is applied to speed up the optimization. The proposed method has been applied to the tavelling salesman problems and an optimal task partition problems to evaluate the performances. The simulation results show that the convergence speed of the proposed method is higher than conventinal Hopfield model. Abe's method and Boltzmann machine with random initial neuron output setting, and the convergence rate to the global minimum is guaranteed with probability of 1. The proposed method gives better result as the problem size increases where it is more difficult for the randomized initial setting to give a good convergence.

• 한국경영과학회지
• /
• 제21권2호
• /
• pp.125-140
• /
• 1996

Simulated annealing (SA) is a very promising general purpose algorithm which can be conveniently utilized for various complicated combinatorial optimization problems. But its slowness has been pointed as a major drawback. In this paper, we propose an accelerated SA and test its performance experimentally by applying it for two standard combinatorial optimization problems (TSP(Travelling Salesman Problem) and GPP(Graph Partitioning Problem) of various sizes. It turns out that performance of the proposed method is consistently better both in convergenge speed and the quality of solution than the conventional SA or SE (Stochastic Evolution). In the second part of the paper we apply the accelerated SA to solve the virtual path management problem encountered in ATM netowrks. The problem is modeled as a combinatorial optimization problem to optimize the utilizy of links and an efficient SA implementation scheme is proposed. Two application examples are given to demonstrate the validity of the proposed algorithm.

• 한국시뮬레이션학회논문지
• /
• 제6권1호
• /
• pp.71-84
• /
• 1997

For many optimization problems where some of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computer simulation is one of the most effective means of studying such complex systems. Many, if not most, simulation optimization problems have multiple aspects. Historically, multiple aspects have been combined ad hoc to form a scalar objective function, usually through a linear combination (weighted sum) of the multiple attributes, or by turning objectives into constraints. The genetic algorithm (GA), however, is readily modified to deal with multiple aspects. In this paper we propose a MAGA (Multiple Aspects-based Genetic Algorithm) as an algorithm for finding the Pareto optimal set. We demonstrate its ability to find and maintain a diverse "Pareto optimal population" on two problems.