• Journal of Korean Association for Spatial Structures
• /
• v.8 no.4
• /
• pp.47-55
• /
• 2008

This paper deals with basic theories and some numerical results on structural optimization for geodesic dome. First of all, the space efficiency of geodesic dome is investigated by using the ratio of icosahedron's surface area to the internal volume enclosed by it. The procedure how to create the geodesic dome is also provided in systematic way and implemented and utilized into the design optimization code ISADO-OPT. The mathematical programming technique is introduced to find out the optimum pattern of member size of geodesic dome against a point load. In this study, total weight of structure is considered as the objective function to be minimized and the displacement occurred at loading point and member stresses of geodesic dome are used as the constraint functions. The finite difference method is used to calculate the design sensitivity of objective function with respect to design variables. The SLP, SQP and MFDM available in the optimizer DoT is used to search optimum member size patterns of geodesic dome. It is found to be that the optimum member size pattern can be efficiently obtained by using the proposed design optimization technique and numerical results can be used as benchmark test as a basic reference solution for design optimization of dome structures.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1227-1234
• /
• 2008

In this paper is designed a 256-bit synchronous OTP(one-time programmable) memory required in application fields such as automobile appliance power ICs, display ICs, and CMOS image sensors. A 256-bit synchronous memory cell consists of NMOS capacitor as antifuse and access transistor without a high-voltage blocking transistor. A gate bias voltage circuit for the additional blocking transistor is removed since logic supply voltage VDD(=1.5V) and external program voltage VPPE(=5.5V) are used instead of conventional three supply voltages. And loading current of cell to be programmed increases according to RON(on resistance) of the antifuse and process variation in case of the voltage driving without current constraint in programming. Therefore, there is a problem that program voltage can be increased relatively due to resistive voltage drop on supply voltage VPP. And so loading current can be made to flow constantly by using the current driving method instead of the voltage driving counterpart in programming. Therefore, program voltage VPP can be lowered from 5.9V to 5.5V when measurement is done on the manufactured wafer. And the sens amplifier circuit is simplified by using the sens amplifier of clocked inverter type instead of the conventional current sent amplifier. The synchronous OTP of 256 bits is designed with Magnachip $0.13{\mu}m$ CMOS process. The layout area if $298.4{\times}314{\mu}m2$.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.109-116
• /
• 2015

This paper is concerned with the single vendor single buyer integrated production inventory problem. To make this problem more practical, space restriction and lead time proportional to lot size are considered. Since the space for the inventory is limited in most practical inventory system, the space restriction for the inventory of a vendor and a buyer is considered. As product's quantity to be manufactured by the vendor is increased, the lead time for the order is usually increased. Therefore, lead time for the product is proportional to the order quantity by the buyer. Demand is assumed to be stochastic and the continuous review inventory policy is used by the buyer. If the buyer places an order, then the vendor will start to manufacture products and the products will be transferred to the buyer with equal shipments many times. The mathematical formulation with space restriction for the inventory of a vendor and a buyer is suggested in this paper. This problem is constrained nonlinear integer programming problem. Order quantity, reorder points for the buyer, and the number of shipments are required to be determined. A Lagrangian relaxation approach, a popular solution method for constrained problem, is developed to find lower bound of this problem. Since a Lagrangian relaxation approach cannot guarantee the feasible solution, the solution method based on the Lagrangian relaxation approach is proposed to provide with a good feasible solution. Total costs by the proposed method are pretty close to those by the Lagrangian relaxation approach. Sensitivity analysis for space restriction for the vendor and the buyer is done to figure out the relationships between parameters.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.105-111
• /
• 2017

Vendor Managed Inventory is a well-known vendor-retailer coordination approach in supply chain management where the vendor manages inventory of the retailer and determines the order interval and order quantity for the retailer. To consider practical situation, the upper limit of inventory for the retailer is set. If the inventory level for the retailer exceeds the upper limit, then the penalty cost is charged to the retailer. Furthermore, maximum allowable inventory level is set for the vendor to prevent the vendor from keeping much inventory. Single-vendor multi-retailer supply chain model with upper limit of inventory for vendor and retailers is studied. All the retailers' are assumed to have the common cycle time, and a vendor manages retailers' inventory and replenishes products. The mathematical formulation is introduced to minimize the total cost including the penalty cost violating the upper limit of inventory for retailers with the constraint of maximum allowable inventory level. The solution procedure based on Karush-Kuhn-Tucker (KKT) conditions is derived. KKT conditions are often applied to find an optimal solution of nonlinear programming problem with constraints. An illustrative example is used to show the application of the proposed solution procedure. Furthermore, sensitivity analysis is done to find out the relationship between maximum allowable inventory level and other values such as order quantity, the number of shipment, vendor's cost, retailer's cost, and total cost. As maximum allowable inventory level decreases, the number of shipment decreases but total cost increases. Order quantity has the trend of decline and is affected by the number of shipment.

• Journal of Sensor Science and Technology
• /
• v.6 no.1
• /
• pp.6-15
• /
• 1997

This paper presents the multi-objective optimal design of thermopile sensor having beam or membrane structure. The thermopile sensor is composed of $Si_{3}N_{4}/SiO_{2}$ dielectric membrane, Al-polysilicon thermocouples and $RuO_{2}$ thin film for black body. The sensing method is based on the Seebeck effect which is originated from the temperature difference of the two positions, black body and silicon rim. The objective functions of the presented design are sensitivity, detectivity and thermal time constant. The modelling of the sensor is proposed including the package. The multi-objective optimization technique is applied to the design of the sensor not only inspecting the modelling equation but also simulating mathematical programming method. Especially, fuzzy optimization technique is adapted to get the optimal solution which enables the designer to reach the more practical solution. The design constraint of the voltage output originated from the change of the environmental temperature is included for practical use.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.11
• /
• pp.1691-1696
• /
• 2010

The efforts of reflecting the system's uncertainties in design step have been made and robust optimization or reliabilitybased design optimization are examples of the most famous methodologies. The statistical moments of a performance function and the constraints corresponding to probability conditions are involved in the formulation of these methodologies. Therefore, it is essential to effectively and accurately calculate them. The sensitivities of these methodologies have to be determined when nonlinear programming is utilized during the optimization process. The sensitivity of statistical moments and probability constraints is expressed in the integral form and limited to the normal random variable; we aim to expand the sensitivity formulation to nonnormal variables. Additional functional calculation will not be required when statistical moments and failure or satisfaction probabilities are already obtained at a design point. On the other hand, the accuracy of the sensitivity results could be worse than that of the moments because the target function is expressed as a product of the performance function and the explicit functions derived from probability density functions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2032-2041
• /
• 1998

In this work, we propose a novel bit allocation method that is to minimize overall distortions subject ot the bit rate constraint. We partition the original bitallocation problem into 'macroblock level bit allocation' problems that can be solved by conventional Lagrangian mutiplier methods and a 'frame level bit allocation' problem. To tackle the frame level problem, 'two-phase optimization' algorithm is used with iter-frame dependency model. While the existing approaches are almost impossible to find the macroblock-unit result for the moving picture coding system due to high computational complexity, the proposed algorithm can drastically reduce the computational loads by the problem partitioning and can obtain the result close to the optimal solution. Because the optimally allocated results can be used as a benchmark for bit allocation methods, the upper performance limit, or a basis for approximation method development, we expect that the proposed algorithm can be very useful for the bit allocation related works.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2018

In South Korea, Jeju Island has a role as a test bed for electric vehicles (EVs). All conventional cars on the island are supposed to be replaced with EVs by 2030. Accordingly, how to effectively set up EV charging stations (EVCSs) that can charge EVs is an urgent research issue. In this paper, we present a case study on planning the locations of EVCS for Jeju Island, South Korea. The objective is to determine where EVCSs to be installed so as to balance the load of EVCSs while satisfying demands. For a public service with EVCSs by some government or non-profit organization, load balancing between EVCS locations may be one of major measures to evaluate or publicize the associated service network. Nevertheless, this measure has not been receiving much attention in the related literature. Thus, we consider the measure as a constraint and an objective in a mixed integer programming model. The model also considers the maximum allowed distance that drivers would detour to recharge their EV instead of using the shortest path to their destination. To solve the problem effectively, we develop a heuristic algorithm. With the proposed heuristic algorithm, a variety of numerical analysis is conducted to identify effects of the maximum allowed detour distance and the tightness of budget for installing EVCSs. From the analysis, we discuss the effects and draw practical implications.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.19 no.1 s.71
• /
• pp.63-71
• /
• 2006

This study presents the effective stiffness-based optimal technique to control Quantitatively lateral drift for shear wall-frame structure system using sensitivity analysis. To this end, the element stiffness matrices are constituted to solve the compatibility problem of displacement degree of freedom between the frame and shear wall. Also, lateral drift constraint to introduce the approximation concept that can preserve the generality of the mathematical programming and can effectively solve the large scaled problems is established. And, the section property relationships for shear wall and frame members are considered in order to reduce the number of design variables and differentiate easily the stiffness matrices. Specifically, constant-shape assumption which is uniformly varying in size during optimal process is applied in frame structure. The thickness or length of shear wall can be changed depending on user's intent. Two types of 20 story shear wall-frame structure system are presented to illustrate the features of the stiffness-based optimal design technique.