• 전기학회논문지
• /
• 제58권10호
• /
• pp.1936-1941
• /
• 2009

This paper deals with a new methodology for topology optimization in which the topology of the design domain may change during the shape optimization process. To achieve this, the concept of the topological gradient is introduced to compute the sensitivity of an objective function when a small hole is drilled in the domain. Based on shape and topological sensitivity values, the shape and topology of the design domain may be simultaneously changed during design iterations if necessary. To verify the advantages and also to facilitate understanding of the method itself, two electrostatic design problems have been tested by using 2D finite element analysis: the first is the inverse problem of a simple dielectric model and the second is the rotor design of a MEMS actuator.

• 한국컴퓨터정보학회논문지
• /
• 제24권11호
• /
• pp.119-126
• /
• 2019

부분역최적화는 역최적화의 흥미로운 변형으로, 주어진 최적화문제와 그 문제의 부분해가 주어지면 이 부분해가 최적해에 포함되도록 문제를 최소한으로 수정하는 문제이다. 이 논문은 라인위에서 정의되는 순환외판원문제(TSP)를 다루는데, 이는 배달시스템, 창고 선반에서 물건을 수집하는 것, 등의 많은 응용을 가진다. 라인 위에서 위치하는 n개의 일이 주어지고 이 중 연속적으로 처리해야하는 일 k개가 부분적으로 주어진다. 각각의 일은 라인 위의 특정 장소에 위치하고 라인을 움직이는 서버에 의해 처리되어야 한다. 우리의 임무는 k개의 일이 최적해에서 연속적으로 처리되도록 n개의 일의 위치를 라인 위에서 최소한으로 조정하는 것이다. 이 논문에서 이 문제와 이 문제의 다양한 변종을 다항시간 내에 푸는 알고리즘을 개발한다. 구체적으로, 서버가 특정한 Forward Trip이라는 특정한 내부 알고리즘을 사용하는 경우와 일반적인 최적 알고리즘을 사용하는 경우에 대한 부분역최적화를 다룬다.

• Structural Engineering and Mechanics
• /
• 제6권8호
• /
• pp.857-870
• /
• 1998

This paper deals with a special class of inverse problems in discrete structural plasticity involving the identification of elastic limits and hardening moduli on the basis of information on displacements. The governing equations lead naturally to a special and challenging optimization problem known as a Mathematical Program with Equilibrium Constraints (MPEC), a key feature of which is the orthogonality of two sign-constrained vectors or so-called "complementarity" condition. We investigate numerically the application of two simple algorithms, both based on the use of the general purpose nonlinear programming code CONOPT accessed via the GAMS modeling language, for solving the suitably reformulated problem. Application is illustrated by means of two numerical examples.

• 소성∙가공
• /
• 제15권9호
• /
• pp.679-685
• /
• 2006

New method for evaluation of heat transfer coefficient is proposed. In general, many researchers have been studied about inverse problem in order to calculate the heat transfer coefficient on three-dimensional heat conduction problem. But they can get the time-dependent heat transfer coefficient only through inverse problem. In order to acquire temperature-dependent heat transfer coefficient, it requires much time for numerous repetitive calculation and inconvenient manual modification. In order to solve these problems, we are using the SQP(Sequential Quadratic Programming) as an optimization algorithm. When the temperature history is given by experiment, the optimization algorithm can evaluate the temperature-dependent heat transfer coefficient with automatic repetitive calculation until difference between calculated temperature history and experimental ones is minimized. Finally, temperature-dependent heat transfer coefficient evaluated by developed program can used on various heat transfer problem.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.724-727
• /
• 1999

The previous LQ-servo PI design methods have some serious design problems happened from the frequency matching of the maximum and minimum singular values of loop transfer function at both low and high frequency regions on the Bode plot. To solve these problems, this paper proposes a new design technique based on the inverse-optimal control and convex optimization.

• 대한기계학회논문집B
• /
• 제37권6호
• /
• pp.539-544
• /
• 2013

본 연구는 공개 해석프로그램과 상용 최적화 프로그램을 연계하여 역열전도 문제를 해결하는 방법론을 제시하고 구현하였다. 이 해석 방법은 구동이 간단하며, 내부 코딩 없이도 구동이 가능하기 때문에 다른 연구자들도 쉽게 역열전도 문제를 재현할 수 있다.

• Management Science and Financial Engineering
• /
• 제18권2호
• /
• pp.19-22
• /
• 2012

In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be returned by a pre-selected specific approximation algorithm.

• Journal of Magnetics
• /
• 제19권3호
• /
• pp.266-272
• /
• 2014

In this paper, we suggest reliability as a metric to evaluate the robustness of a design for the optimal design of electromagnetic devices, with respect to constraints under the uncertainties in design variables. For fast numerical efficiency, we applied the sensitivity-assisted Monte Carlo simulation (S-MCS) method to perform reliability calculation. Furthermore, we incorporated the S-MCS with single-objective and multi-objective particle swarm optimization algorithms to achieve reliability-based optimal designs, undertaking probabilistic constraint and multi-objective optimization approaches, respectively. We validated the performance of the developed optimization algorithms through application to the optimal design of a superconducting magnetic energy storage system.

• 대한수학회논문집
• /
• 제11권4호
• /
• pp.1147-1157
• /
• 1996

Nonlinear ill-posed problems arise in many application including parameter estimation and inverse scattering. We introduce a least squares regularization method to solve nonlinear ill-posed problems with constraints robustly and efficiently. The regularization method uses Trust-Region approach to handle the constraints on variables. The Generalized Cross Validation is used to choose the regularization parameter in computational tests. Numerical results are given to exhibit faster convergence of the method over other methods.

• Structural Engineering and Mechanics
• /
• 제88권5호
• /
• pp.493-500
• /
• 2023

The multiparameter eigenvalue method can be used to solve the damped finite element model updating problems. This method transforms the original problems into multiparameter eigenvalue problems. Comparing with the numerical methods based on various optimization methods, a big advantage of this method is that it can provide all possible choices of physical parameters. However, when solving the transformed singular multiparameter eigenvalue problem, the proposed method based on the generalised inverse of a singular matrix has some computational challenges and may fail. In this paper, more details on the transformation from the dynamic model updating problem to the multiparameter eigenvalue problem are presented and the structure of the transformed problem is also exposed. Based on this structure, the rigorous mathematical deduction gives the upper bound of the number of possible choices of the physical parameters, which confirms the singularity of the transformed multiparameter eigenvalue problem. More importantly, we present a row and column compression method to overcome the defect of the proposed numerical method based on the generalised inverse of a singular matrix. Also, two numerical experiments are presented to validate the feasibility and effectiveness of our method.