• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 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.

• Nuclear Engineering and Technology
• /
• 제49권2호
• /
• pp.434-441
• /
• 2017

Containment venting is one of several essential measures to protect the integrity of the final barrier of a nuclear reactor during severe accidents, by which the uncontrollable release of fission products can be avoided. The authors seek to develop an optimization approach to venting operations, from a simulation-based perspective, using an integrated severe accident code, THALES2/KICHE. The effectiveness of the containment-venting strategies needs to be verified via numerical simulations based on various settings of the venting conditions. The number of iterations, however, needs to be controlled to avoid cumbersome computational burden of integrated codes. Bayesian optimization is an efficient global optimization approach. By using a Gaussian process regression, a surrogate model of the "black-box" code is constructed. It can be updated simultaneously whenever new simulation results are acquired. With predictions via the surrogate model, upcoming locations of the most probable optimum can be revealed. The sampling procedure is adaptive. Compared with the case of pure random searches, the number of code queries is largely reduced for the optimum finding. One typical severe accident scenario of a boiling water reactor is chosen as an example. The research demonstrates the applicability of the Bayesian optimization approach to the design and establishment of containment-venting strategies during severe accidents.

• 한국콘텐츠학회논문지
• /
• 제15권7호
• /
• pp.21-29
• /
• 2015

본 논문은 목적이 네 개 이상인 고도 다목적 문제(many-objective problem)에서의 의사 결정을 위한 새로운 이중(two-tier) 최적화 접근법을 제안한다. 목적의 개수가 증가할수록, 특히 네 개 이상부터는, 전체해(solution) 중에서 파레도 최적해(Parero-optimal solution)가 차지하는 비율이 기하급수적으로 증가한다. 그래서 일반 다목적 문제와는 달리, 의사 결정을 하는데 단순히 파레토 최적 해만을 찾는 것으로는 충분하지 않고, 찾은 파레토 최적 해들 중에서도 상대적으로 좀 더 선호하는 해들을 가려내는 것이 필요하다. 제안하는 접근법에서는 추가적인 최적화 단계를 추가함으로써 사용자의 선호도를 균형있게 반영하는 방향으로 파레토 최적해들을 찾는다. 이러한 2차 최적화는 관련된 2차 목적들을 수반하게 되는데, 2차 목적으로는 광역평가값과 혼잡 거리를 사용하였다. 광역평가값과 혼잡 거리는 각각 사용자의 선호도와 다양성을 대변하는 척도이다. 제안한 접근법의 우수성을 보이기 위해서는 잘 알려진 검증 함수들을 활용하는데, 같은 함수에 대해 제안한 접근법을 적용한 경우와 적용하지 않은 경우의 결과를 비교한다. 제안한 접근법을 적용함으로써 기존보다 사용자의 선호도를 잘 반영하면서 동시에 우수하고 다양한 의사 선택이 가능하다.

• 경영과학
• /
• 제21권3호
• /
• pp.23-38
• /
• 2004

Recently the usage of mobile devices which enable the accessibility to Internet has been dramatically increased. Most of the mobile services, however, so far tend to be simple such as infotainment service. In order to fully taking advantage of wireless network and corresponding technology, personalized web service based on user's context could be needed. Meanwhile, optimization techniques have been vitally incorporated for optimizing the development and administration of electronic commerce. However, applying context-aware optimization mechanism to personalized mobile services is still very few. Hence, the purpose of this paper is to propose a methodology to incorporate optimization techniques into personalization services. Multi agent-based web service approach is considered to realize the methodology. To show the feasibility of the methodology proposed in this paper, a prototype system, CAMA-myOPt(Context-Aware Multi-Agent system for my Optimization), was implemented and adopted in mobile comparative shopping.

• Structural Engineering and Mechanics
• /
• 제43권6호
• /
• pp.795-821
• /
• 2012

The size and topology of geometrically nonlinear dome structures are optimized thereby minimizing both its entire weight & joint (node) displacements and maximizing load-carrying capacity. Design constraints are implemented from provisions of American Petroleum Institute specification (API RP2A-LRFD). In accordance with the proposed design constraints, the member responses computed by use of arc-length technique as a nonlinear structural analysis method are checked at each load increment. Thus, a penalization process utilized for inclusion of unfeasible designations to genetic search is correspondingly neglected. In order to solve this complex design optimization problem with multiple objective functions, Non-dominated Sorting Genetic Algorithm II (NSGA II) approach is employed as a multi-objective optimization tool. Furthermore, the flexibility of proposed optimization is enhanced thereby integrating an automatic dome generating tool. Thus, it is possible to generate three distinct sphere-shaped dome configurations with varying topologies. It is demonstrated that the inclusion of brace (diagonal) members into the geometrical configuration of dome structure provides a weight-saving dome designation with higher load-carrying capacity. The proposed optimization approach is recommended for the design optimization of geometrically nonlinear dome structures.

• Journal of Computing Science and Engineering
• /
• 제6권4호
• /
• pp.294-309
• /
• 2012

In the age of multi-core and specialized accelerators in high performance computing (HPC) systems, it is critical to understand application characteristics and apply suitable optimizations in order to fully utilize advanced computing system. Often time, the process involves multiple stages of application performance diagnosis and a trial-and-error type of approach for optimization. In this study, a general guideline of performance optimization has been demonstrated with two class-representing applications. The main focuses are on node-level optimization and inter-node scalability improvement. While the number of optimization case studies is somewhat limited in this paper, the result provides insights into the systematic approach in HPC applications performance engineering.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2004년도 춘계학술대회 논문집
• /
• pp.19-22
• /
• 2004

A scheme of shape optimization by new approximation approach is applied to design of a flow guide in three-dimensional extrusion processes. The optimization scheme is presented to reduce computation time fur the optimization process and applied to an H-section extrusion problem for verifying the efficiency and the usefulness. The object of optimization is to minimize the deviation of exit velocity and control points of a Bezier curve describing the shape of the flow guide are regarded as design variables. The effectiveness of the proposed scheme is then demonstrated through the applied example.

• 한국생산제조학회지
• /
• 제19권2호
• /
• pp.224-229
• /
• 2010

This paper presents a reliability-based topology optimization (RBTO) using bi-directional evolutionary structural optimization (BESO). An actual design involves uncertain conditions such as material property, operational load and dimensional variation. Deterministic topology optimization (DTO) is obtained without considering of uncertainties related to the uncertainty parameters. However, the RBTO can consider the uncertainty variables because it has the probabilistic constraints. In this paper, the reliability index approach (RIA) is adopted to evaluate the probabilistic constraint. RBTO based on BESO starting from various design domains produces a similar optimal topology each other. Numerical examples are presented to compare the DTO with the RBTO.

• 한국생산제조학회지
• /
• 제19권6호
• /
• pp.826-833
• /
• 2010

Electric-thermal-structural actuated compliant mechanisms are mechanisms onto which electric voltage drop is applied as input instead of force. This mechanism is based on thermal expansion of material while being heated. Compliant mechanisms are designed subjected to electric charge input using BESO(bi-directional evolutionary structural optimization) method. Reliability-based topology optimization (RBTO) is applied to the topology design of actuators. performance measure approach (PMA), which has probabilistic constraints that are formulated in terms of the reliability index, is adopted to evaluate the probabilistic constraints. In this study, BESO method is used to obtain optimal topology of compliant mechanisms from initial design domain. PMA approach is used to evaluate reliability index. The procedure has been tested in numerical applications and compared with the results obtained by other methods to validate these approaches.

• Advances in Computational Design
• /
• 제1권2호
• /
• pp.175-194
• /
• 2016

Nature has provided inspiration for most of the man-made technologies. Scientists believe that dolphins are the second to humans in smartness and intelligence. Echolocation is the biological sonar used by dolphins for navigation and hunting in various environments. This ability of dolphins is mimicked in this paper to develop a new optimization method. Dolphin Echolocation Optimization (DEO) is an optimization method based on dolphin's approach for hunting food and exploration of environment. DEO has already been developed for discrete optimization search space and here it is extended to continuous search space. DEO has simple rules and is adjustable for predetermined computational cost. DEO provides the optimum results and leads to alternative optimality curves suitable for the problem. This algorithm has a few parameters and it is applicable to a wide range of problems like other metaheuristic algorithms. In the present work, the efficiency of this approach is demonstrated using standard benchmark problems.