• Journal of the Microelectronics and Packaging Society
• /
• v.14 no.4
• /
• pp.1-7
• /
• 2007

Nanoimprint lithography (NIL) is an emerging technology enabling cost-effective and high-throughput nanofabrication. To successfully imprint a nano-sized pattern, the process conditions such as temperature, pressure, and time should be appropriately selected. This starts with a clear understanding of polymer material behavior during the NIL process. In this work, the squeezing of thin polymer films into nanocavities during the thermal NIL has been investigated based upon a two-dimensional viscoelastic finite element analysis in order to understand how the process conditions affect a pattern quality. The simulations have been performed within the viscoelastic plateau region and the stress relaxation effect has been taken into account.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.179-184
• /
• 2002

We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.

• Steel and Composite Structures
• /
• v.22 no.5
• /
• pp.1163-1192
• /
• 2016

This paper presents the cost optimization of a composite I beam floor system, designed to be made from a reinforced concrete slab and steel I sections. The optimization was performed by the mixed-integer non-linear programming (MINLP) approach. For this purpose, a number of different optimization models were developed that enable different design possibilities such as welded or standard steel I sections, plastic or elastic cross-section resistances, and different positions of the neutral axes. An accurate economic objective function of the self-manufacturing costs was developed and subjected to design, resistance and deflection (in)equality constraints. Dimensioning constraints were defined in accordance with Eurocode 4. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm was applied together with a two-phase MINLP strategy. A numerical example of the optimization of a composite I beam floor system, as presented at the end of this paper, demonstrates the applicability of the proposed approach. The optimal result includes the minimal produced costs of the structure, the optimal concrete and steel strengths, and dimensions.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.500-509
• /
• 1999

In this paper, we consider an optimal routing problem when point-to-point and point-to-multipoint connection traffics are offered in an ATM network. We propose a mathematical model for cost-minimizing configuration of a logical network for a given ATM-based BISDN. Our model is essentially identical to the previous one proposed by Kim(Kim, 1996) which finds a virtual-path configuration where the relevant gains obtainable from the ATM technology such as the statistical multiplexing gain and the switching/control cost-saving gain are optimally traded-off. Unlike the Kim's model, however, ours explicitly considers the VP's QoS(Quality of Service) for more efficient utilization of bandwidth. The problem is a large-scale, nonlinear, and mixed-integer problem. The proposed algorithm is based on the local linearization of equivalent-capacity functions and the relaxation of link capacity constraints. As a result, the problem can be decomposed into moderate-sized shortest path problems, Steiner arborescence problems, and LPs. This fact renders our algorithm a lot faster than the previous nonlinear programming algorithm while the solution quality is maintained, hence application to large-scale network problems.

• Journal of Mechanical Science and Technology
• /
• v.20 no.1
• /
• pp.42-50
• /
• 2006

To evaluate the fatigue lifetime of structures, it is necessary to identify the values of parameters through tests. From the viewpoint of time and cost it is difficult for engineers to get the necessary data through tests. In this study, we surveyed literature and proposed a procedure to identify the fatigue parameters expressed with the Brinell hardness and elastic modulus. After obtaining stress concentration factors by finite element analysis, we calculated fatigue notch factors using Peterson's formula. Taking into account the welding residual stress, which was also obtained by finite element analysis, we evaluated the fatigue lifetime of four kinds of welded joints using the proposed approach. The estimated results are in a good agreement with the experimental results.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.166-167
• /
• 2011

본 논문에서는 전력 소비자 입장에서 전력가격에 큰 비중을 차지하는 System Marginal Cost(SMP)를 줄이는 방법으로 ESS를 포함하여 Unit Commitment(UC)를 수행하는 방법과 그에 따른 효과를 분석하였다. 먼저 본 논문에서는 일반적인 UC를 Lagrangian Relaxation(LR) 기법으로 얻은 최적의 결과 값을 토대로 ESS를 추가하였다. 기존의 LR알고리즘으로부터 얻은 결과 값에 ESS를 추가하는 방법으로는 Dynamic Programming 방법의 한 종류인 Label Correcting Methods[]를 사용하였다. 기존의 UC 알고리즘 결과 값을 토대로 ESS를 추가하여 SMP 감소효과 분석을 위해 실 계통에서 사용되는 종류별 발전기 10대와 임의적으로 설정한 24시간의 부하 값을 토대로 MATLAB을 이용해서 구현하였고, 결과 값을 통해 실질적인 SMP 감소효과 유무를 확인할 수 있었다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.421-424
• /
• 2004

This paper focuses on the problem of determining the quantity and timing of disassembling used products while satisfying the demand of their parts or components over a planning horizon. The case of multiple product types with parts commonality is considered for the objective of minimizing the sum of setup, disassembly operation, and inventory holding costs. A heuristic is suggested, in which an initial solution is obtained using a linear programming relaxation method, and then improved by perturbing the given solution using a dynamic programming approach and a look-ahead check while considering the trade-offs among different cost factors.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.47-58
• /
• 1988

The dynamic uncapacitated facility location model is formulated by a mixed integer programming. It has the objective of minimizing total discounted costs for meeting demands specified in different time periods at various demand centers. Costs include those for operation of facilities to demand centers and a fixed cost associated with the capital investment. The problem is decomposed into two simple Lagrangian relaxed subproblems which are coordinated by Lagrangian multipliers. We explored the effect of using the subgradient optimization procedure and a viable solution approach is proposed. Computational results are presented and further research directions are discussed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.205-215
• /
• 2008

convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

• Journal of the Korean Magnetic Resonance Society
• /
• v.22 no.1
• /
• pp.18-25
• /
• 2018

Replication protein A (RPA) is an essential single-stranded DNA binding protein in DNA processing. It is known that N terminal domain of RPA70 (RPA70N) recruits various protein partners including damage-response proteins such as p53, ATRIP, Rad9, and MRE11. Although the common binding residues of RPA70N were revealed, dynamic properties of the protein are not studied yet. In this study, we measured $^{15}N$ relaxation parameters ($T_1,\;T_2$ and heteronuclear NOE) of human RPA70N and analyzed them using model-free analysis. Our data showed that the two loops near the binding site experience fast time scale motion while the binding site does not. It suggests that the protein binding surface of RPA70N is mostly rigid for minimizing entropy cost of binding and the loops can experience conformational changes.