• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.1-16
• /
• 2010

When Deterministic Design Optimization (DDO) methods are used, deterministic optimum designs are frequently pushed to the design constraint boundary, leaving little or no room for tolerances (or uncertainties) in design, manufacture, and operating processes. In the Reliability-Based Design Optimization (RBDO) model for robust system design, the mean values of uncertain system variables are usually used as design variables, and the cost is optimized subject to prescribed probabilistic constraints as defined by a nonlinear mathematical programming problem. Therefore, a RBDO solution that reduces the structural weight in uncritical regions does not only provide an improved design but also a higher level of confidence in the design. In this work, we seek to improve the quality of RBDO processes using efficient optimization techniques with object of improving the resulting objective function and satisfying the required constraints. Our recent RBDO developments show its efficiency and applicability in this context. So we present some recent structural engineering applications demonstrate the efficiency of these developed RBDO methods.

• Journal of the Korea Society for Simulation
• /
• v.21 no.3
• /
• pp.79-88
• /
• 2012

Recently, the study in efficient operation, maintenance, and equipment-design have been growing rapidly in military industry to meet the required missions. Through out these studies, the importance of Concurrent Spare Parts(CSP) are emphasized. The CSP, which is critical to the operation and maintenance to enhance the availability, is offered together when a equipment is delivered. Despite its significance, th responsibility for determining the range and depth of CSP are done from administrative decision rather than engineering analysis. The purpose of the paper is to optimize the number of CSP per item using simulation and multiple regression. First, the result, as the change of operational availability, was gained from changing the number of change in simulation model. Second, mathematical regression was computed from the input and output data, and the number of CSP was optimized by multiple regression and linear programming; the constraint condition is the cost for optimization. The advantage of this study is to respond with the transition of constraint condition quickly. The cost per item is consistently altered in the development state of equipment. The speed of analysis, that simulation method is continuously performed whenever constraint condition is repeatedly altered, would be down. Therefore, this study is suitable for real development environment. In the future, the study based on the above concept improves the accuracy of optimization by the technical progress of multiple regression.

• Journal of Korea Water Resources Association
• /
• v.48 no.12
• /
• pp.1051-1064
• /
• 2015

Currently, the H purification plant determines the hourly water intake amount based on operator experience and skill. Therefore, inevitably, there are deviations among operators. While meeting time-varying demand and maintaining the proper water level in the clean water reservoir, the methodology for minimizing electricity cost, when dealing with different electricity rate time zones, is a very complicated problem, which is beyond an operator's capability. To solve this problem, a linear programming (LP) model is proposed, which can determine the optimal hourly water intake amount for minimizing the daily electricity cost. It is shown that an inaccurate estimate for the hourly water usage in the demand areas causes the water level constraint to be violated, which is the weak point of the proposed LP method. However, several examples with real-field data show that we can practically and safely solve this problem with safety margins. It is also shown that the safety margin method still works effectively whether the estimate is accurate or not. The operators need not attend the site at all times under the proposed LP method, and we can additionally expect reductions in labor costs.

• 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 Korean Society of Propulsion Engineers
• /
• v.3 no.2
• /
• pp.1-9
• /
• 1999

Applicability of the pressure gradient method which is formulated based on pressure gradient is verified against turbulent flow analysis. In the pressure gradient method, pressure gradient instead of pressure itself is obtained using continuity constraint. Since correct pressure gradient is found only when mass conservation is satisfied, pressure gradient method can reflect physics of flow field properly The pressure gradient method is formulated with semi-staggered grid system which locates each primitive variables on the same grid point but evaluates pressure gradient in-between. This grid system ensures easy programming and reflection of correct physics in analysis. For verifying applicability of this method, the pressure gradient method is applied to turbulent flow analysis with low Reynolds number $\kappa$-$\varepsilon$ model. Turbulent flows include fully developed channel flow, backward-facing step flow, and conical diffuser flow. Prediction results show that the pressure gradient method can be applied to turbulent flow analysis. However, the pressure gradient method requires somewhat long computation time. Proper way to find optimum under-relaxation factor, $\gamma$, is also need to be developed.

• 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.

• 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.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.2
• /
• pp.173-182
• /
• 1993

This paper presents an algorithm to derive the representative unit hydrograph for the real environment of a watershed. For a given watershed, the conventional methods give several different unit hydrographs by storm events. In this study the LP model is somewhat modified based on the previous study by Mays et also as follows: the objective function is designed to minimize the sum of weighted residuals. An additional constraint of moving average is added to prevent the unit hydrograph from the occurence of oscillation which was not active in Mays's paper. Configuration of rainfall matrix was improved to reduce its dimension in accordance with Diskin's review point. In spite of the superiority of LP approach in terms of representativeness, all the methods were very sensitive to the validity of baseflow separation and rainfall-loss. Several methods of the separations for rainfall excesses and direct runoffs were applied and no preferred methods were identified. This is the matter of judgement considering catchment and rainfall characteristics. This algorithm was applied to a real watershed of the Wi stream in the Nak-dong river. Compared with the IHP results by conventional methods, this optimized representative unit hydrograph demonstrated relatively smaller and shorter values in terms of the peak discharge and the basin lag respectively, and the oscillation of its falling limb successfully eliminated owing to the additional constraints of moving averages.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.