• Journal of the korean Society of Automotive Engineers
• /
• v.14 no.6
• /
• pp.113-126
• /
• 1992

Recently the multi-kind, small-amount manufacturing system has been replacing the mass manufacturing system, and domestic machining inustry also is eager to absorb the new technology because of its high productivity and cost reduction. The optimization of the cutting condition has been a vital problem in the machining industry, which would help increase the productivity and raise the international competitiveness. It is intended in this study to investigate the machining costs per unit time which is essential to the analysis of the optimal cutting condition, to computer the cutting speed that lead to the minimum machining costs and the maximum production to suggest the cutting speed range that enables efficient speed cutting, and to review the machining economy in relation to cutting depth and feed. Also considered are the optimal cutting speed and prodution rated in rrelation with feed. It is found that the minimum-cost cutting speed increases and the efficient cutting speed range is reduced as machining cost per unit time increases since the cutting speed for maximum production remains almost constant. The machining cost is also lowered and the production rate increases as the feed increases, and the feed should be selected to satisfy the required surface roughness. The machining cost and production rate are hardly affected by the cutting depth if the cutting speed stays below 100m/min, however, they are subject to change at larger cutting depth and the high-efficient speed range also is restricted. It can be established an adaptive optimal cutting conditions can be established in workshop by the auto-selection progam for optimal operation. It is expected that this method for choosing the optimal cutting conditions might contribute to the improvement of the productivity and reduced the cost. It is highly recommended to prepare the optimal cutting conditionthus obtained for future use in the programing of G-function of CNC machines. If proper programs that automatically select the optimal cutting conditions should be developed, it would be helpful to the works being done in the machine shops and would result in noticeable production raise and cost reduction.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2010

It is recently issued scalability, mobility and external internet connection on Wire-less sensor network. The low power wireless sensor networks based on IPv6 technology 6LoWPAN technology is being standardized in the IETF. This paper for the 6LoWPAN environment based on the routing protocol LOAD, route cost applied the packet re-transmission rate which follows in Link Qualities price which uses at course expense and packet transmission Minimum route Cost routing protocol where does on the course wherethe smallest packet re-transmission becomes accomplished proposed. The technique which proposes compared and LOAD and AODV that about 13%, about 16% energy consumption is few respectively averagely, Energy of the entire network equally, used and energy effectiveness and improvement of network life time experiment led and confirmed.

• Geomechanics and Engineering
• /
• v.7 no.5
• /
• pp.525-537
• /
• 2014

The typical design of ground improvement with prefabricated vertical drains (PVD) and surcharge preloading involves a series of deterministic analyses using averaged or mean soil properties for the various combination of the PVD spacing and surcharge preloading height that would meet the criteria for minimum consolidation time and required degree of consolidation. The optimum design combination is then selected in which the total cost of ground improvement is a minimum. Considering the variability and uncertainties of the soil consolidation parameters, as well as considering the effects of soil disturbance (smear zone) and drain resistance in the analysis, this study presents a stochastic cost optimization of ground improvement with PVD and surcharge preloading. Direct Monte Carlo (MC) simulation and importance sampling (IS) technique is used in the stochastic analysis by limiting the sampled random soil parameters within the range from a minimum to maximum value while considering their statistical distribution. The method has been verified in a case study of PVD improved ground with preloading, in which average results of the stochastic analysis showed a good agreement with field monitoring data.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1707-1718
• /
• 1996

Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

• Computers and Concrete
• /
• v.18 no.5
• /
• pp.983-998
• /
• 2016

Structural optimization is one of the most important topics in structural engineering and has a wide range of applicability. Therefore, the main objective of the present study is to apply the Lagrange Multiplier Method (LMM) for minimum cost design of singly and doubly reinforced rectangular concrete beams. Concrete and steel material costs are used as objective cost function to be minimized in this study, and ultimate flexural strength of the beam is considered to be as the main constraint. The ultimate limit state method with partial material strength factors and equivalent concrete stress block is used to derive general relations for flexural strength of RC beam and empirical coefficients are taken from topic 9 of the Iranian National Building Regulation (INBR9). Optimum designs are obtained by using the LMM and are presented in closed form solutions. Graphical representation of solutions are presented and it is shown that proposed design curves can be used for minimum cost design of the beams without prior knowledge of optimization and without the need for iterative trials. The applicability of the proposed relations and curves are demonstrated through two real life examples of SRB and DRB design situations and it is shown that the minimum cost design is actually reached using proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.139-148
• /
• 2011

This paper presents the minimum-cost network selection scheme which determines the transmission instance in the multi-band maritime communication system, so that the shipment-related real-time information can be transmitted within the maximum allowed period. The transmission instances and the corresponding network selection process are modeled by a Markov Decision Process (MDP), for the channel model in the 2-state Markov chain, which can be solved by stochastic dynamic programming. It derives the minimum-cost network selection rule, which can reduce the network cost significantly as compared with the straight-forward scheme with a periodic transmission.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.69-75
• /
• 2015

This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.177-182
• /
• 2021

Generally, the linear programming (LP) with O(n⁴) time complexity is applied to mixture optimization problem that can be produce the given ingredients grade product with minimum cost from mixture of various raw materials. This paper suggests heuristic algorithm with O(n log n) time complexity to obtain the solution of this problem. The proposed algorithm meets the content range of the components required by the alloy steel plate while obtaining the minimum raw material cost, decides the quantity of raw material that is satisfied with ingredients grade for ascending order of unit cost. Although the proposed algorithm applies simple decision technique with O(n log n) time complexity, it can be obtains same solution as or more than optimization technique of linear programing.

• Korean Management Science Review
• /
• v.29 no.1
• /
• pp.143-152
• /
• 2012

Location area planning (LAP) problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost in location management. The minimum cost has two components namely location update cost and searching cost. Location update cost is incurred when the user changes itself from one location area to another in the network. The searching cost incurred when a call arrives, the search is done only in the location area to find the user. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use particle swarm optimization (PSO) to obtain the best/optimal group of cells for 16, 36, 49, and 64 cells network. Experimental studies illustrate that PSO is more efficient and surpasses those of precious studies for these benchmarking problems.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.1
• /
• pp.55-65
• /
• 2003

In this study, we systemize the theoretical validity for applying unrelated question model to three-stage cluster sampling method and derive the estimate and it's variance of sensitive parameter. We derive the minimum variance form under the optimal values of the subsample sizes when the cost are fixed. Under the some given precision, we obtain the optimal values of the subsample sizes and derive the minimum cost form by using them.