• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.3
• /
• pp.320-326
• /
• 2017

Multistage deep-drawing technology is used widely in the production of mobile phone battery cases to improve productivity and economy. To ensure adequate capacity and rigidity, such cases are fabricated as a rectangular cup with a high slender ratio. The multistage deep-drawing of a rectangular cup entails a high slender ratio, and the heights of the product sides may be non-uniform because of the complicated deformation mechanisms. This causes problems in product assembly that affects the surface quality of the case. This study examined a blank shape that minimizes the height variations of the product to resolve the aforementioned problems. Optimization design and analysis were performed to identify the shape that yields the least variation. The long and short sides of an oval blank were set as the design variables. The objective function was set to yield the lowest height difference, and the thickness reduction rate of the product was set to the target range. In addition, the height of the final shape was set as a constraint. The height difference was minimized successfully using the optimized design. The design process of the initial blank for all rectangular shapes can be automated in the future.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.3
• /
• pp.39-55
• /
• 1992

In this research, a Three Level Decomposition technique has been developed for configuration design optimization of truss structures. In the first level, as design variables, behavior variables are used and the strain energy has been treated as the cost function to be maximized so that the truss structure can absorb maximum energy. For design constraint of the optimal design problem, allowable stress, buckling stress, and displacement under multi-loading conditions are considered. In the second level, design problem is formulated using the cross-sectional area as the design variable and the weight of the truss structure as the cost function. As for the design constraint, the equilibrium equation with the optimal displacement obtained in the first level is used. In the third level, the nodal point coordinates of the truss structure are used as coordinating variable and the weight has been taken as the cost function. An advantage of the Three Level Decomposition technique is that the first and second level design problems are simple because they are linear programming problems. Moreover, the method is efficient because it is not necessary to carry out time consuming structural analysis and techniques for sensitivity analysis during the design optimization process. By treating the nodal point coordinates as design variables, the third level becomes unconstrained optimal design problems which is easier to solve. Moreover, by using different convergence criteria at each level of design problem, improved convergence can be obtained. The proposed technique has been tested using four different truss structures to yield almost identical optimum designs in the literature with efficient convergence rate regardless of constraint types and configuration of truss structures.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.4
• /
• pp.137-146
• /
• 2016

In recent years, business environment is faced with multi uncertainty that have not been suffered in the past. As supply chain is getting expanded and longer, the flow of information, material and production is also being complicated. It is well known that development service industry using application software has various uncertainty in random events such as supply and demand fluctuation of developer's capcity, project effective date after winning a contract, manpower cost (or revenue), subcontract cost (or purchase), and overrun due to developer's skill-level. This study intends to social contribution through attempts to optimize enterprise's goal by supply chain management platform to balance demand and supply and stochastic programming which is basically applied in order to solve uncertainty considering economical and operational risk at solution supplier. In Particular, this study emphasizes to determine allocation of internal and external manpower of developers using S&OP (Sales & Operations Planning) as monthly resource input has constraint on resource's capability that shared in industry or task. This study is to verify how Stochastic Programming such as Markowitz's MV (Mean Variance) model or 2-Stage Recourse Model is flexible and efficient than Deterministic Programming in software enterprise field by experiment with process and data from service industry which is manufacturing software and performing projects. In addition, this study is also to analysis how profit and labor input plan according to scope of uncertainty is changed based on Pareto Optimal, then lastly it is to enumerate limitation of the study extracted drawback which can be happened in real business environment and to contribute direction in future research considering another applicable methodology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.865-875
• /
• 2012

In this paper, we optimize antenna locations for a distributed antenna system (DAS) with distributed antenna (DA) ports equipped with multiple antennas under per-DA port power constraint. Maximum ratio transmission and scaled zero-forcing beamforming are employed for single-user and multi-user DAS, respectively. Instead of maximizing the cell average ergodic sum rate, we focus on a lower bound of the expected signal-to-noise ratio (SNR) for the single-cell scenario and the expected signal-to-leakage ratio (SLR) for the two-cell scenario to determine antenna locations. For the single-cell case, optimization of the SNR criterion generates a closed form solution in comparison to conventional iterative algorithms. Also, a gradient ascent algorithm is proposed to solve the SLR criterion for the two-cell scenario. Simulation results show that DAS with antenna locations obtained from the proposed algorithms achieve capacity gains over traditional centralized antenna systems.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.4 no.1
• /
• pp.11-26
• /
• 1984

The aim of this study is to establish a synthetical optimal method that simultaneously analyze and design reinforced concrete flat slab-column structures involving multi-constraints and multi-design variables. The variables adopted in this mathematical models consist of design variables including sectional sizes and steel areas of frames, and analysis variable of the ratio of bending moment redistribution. The cost function is taken as the objective function in the formulation of optimal problems. A number of constraint equations, involving the ultimate limit state and the serviceability limit state, is derived in accordance with BSI CP110 requirements on the basis of limit state design theory. Both objective function and constraint equations derived from design variables and an analysis variable generally become high degree nonlinear problems. Using SLP as an analytical method of nonlinear optimal problems, an optimal algorithm is developed so as to analyze and design the structures considered in this study. The developed algorithm is directly applied to a few reinforced concrete flat slab-column structures to assure the validity of it and the possibility of optimization From the research it is found that the algorithm developed in this study is applicable to the optimization of reinforced concrete flat slab column structures and it converges to a optimal solution with 4 to 6 iterations regardless of initial variables. The result shows that an economical design can be possible when compared with conventional designs. It is also found that considering the ratio of bending moment redistribution as a variable is reasonable. It has a great effect on the composition of optimal sections and the economy of structures.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.96-106
• /
• 2014

Previous academic research on FPGA tools has relied on simple imaginary models for the targeting architecture. As the first step to overcome such restriction, the issues on analytic placement and legalization which are applied to commercial FPGAs have been brought up, and several techniques to remedy them are presented, and evaluated. First of all, the center of gravity of the placed cells may be far displaced from the center of the chip during analytic placement. A function is proposed to be added to the objective function for minimizing this displacement. And then, the density map is expanded into multiple layers to accurately calculate the density distribution for each of the cell types. Early fixation is also proposed for the memory blocks which can be placed at limited sites in small numbers. Since two flip-flops share control pins in a slice, a compatibility constraint is introduced during legalization. Pre-packing compatible flip-flops is proposed as a proactive step. The proposed techniques are implemented on the K-FPGA fabric evaluation framework in which commercial architectures can be precisely modeled, and modified for enhancement, and validated on twelve industrial strength examples. The placement results show that the proposed techniques have reduced the wire length by 22%, and the slice usage by 5% on average. This research is expected to be a development basis of the optimization CAD tools for new as well as the state-of-the-art FPGA architectures.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.33-43
• /
• 2011

Routing technologies considering QoS-based hypermedia services have been seen as a crucial network property in next generation optical Internet (NGOI) networks based on IP/dense-wavelength division multiplexing (DWDM). The huge potential capacity of one single fiber. which is in Tb/s range, can be exploited by applying DWDM technology which transfers multiple data streams (classified and aggregated IP traffics) on multiple wavelengths (classified with QoS-based) simultaneously. So, DWDM-based optical networks have been a favorable approach for the next generation optical backbone networks. Finding a qualified path meeting the multiple constraints is a multi-constraint optimization problem, which has been proven to be NP-complete and cannot be solved by a simple algorithm. The majority of previous works in DWDM networks has viewed heuristic QoS routing algorithms (as an extension of the current Internet routing paradigm) which are very complex and cause the operational and implementation overheads. This aspect will be more pronounced when the network is unstable or when the size of network is large. In this paper, we propose a flooding-based unicast and multicast QoS routing methodologies(YS-QUR and YS-QMR) which incur much lower message overhead yet yields a good connection establishment success rate. The simulation results demonstrate that the YS-QUR and YS-QMR algorithms are superior to the previous routing algorithms.