• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.53-66
• /
• 1989

The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.

• Journal of Energy Engineering
• /
• v.1 no.1
• /
• pp.87-96
• /
• 1992

Two major difficulties with finding an optimal solution to the heat exchanger network synthesis problems are the large solutionspace and the uncertainty in the formulation of the annual cost function. In this work, to overcome the first difficulty a problem reduction technique was developed. The second difficulty was also removed by dividing the annual cost function into four cost items. The optimal network structure for minimum equipment cost is then obtained by repeatedly applying the problem reduction technique and the heuristics in turn. The efficiency and the superiority of the method is demonstrated by examining two selected example problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.728-734
• /
• 2007

In this paper, we propose a GOSST(Grade Of Services Steiner minimum Tree) heuristic mechanism for the design of a physical multiple security grade network with minimum construction cost. On the network, each node can communicate with other nodes by its desiring security grade. Added to the existing network security methods, the preventing method from illegal physical access is necessary for more safe communication. To construct such network with minimum cost, the GOSST problem is applied. As the GOSST problem is a NP-Hard problem, a heuristic with reasonable complexity is necessary for a practical solution. In this research, to design the physical multiple security grade network with the minimum construction cost, the reformed our previous Distance Direct GOSST heuristic mechanism is proposed. The mechanism brings average 29.5% reduction in network construction cost in comparison with the experimental control G-MST.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.370-372
• /
• 1986

In this paper we propose a Generalized Minimum Variance Self-tuning Control of the system with an autoregressive noise model. To establish a Generalized Minimum Variance Control, the control input is also included in a cost function and a novel identity is introduced. The effectiveness of this algorithm is demonstrated by the computer simulation.

• The Korean Journal of Ecology
• /
• v.21 no.5_1
• /
• pp.409-418
• /
• 1998

A molel study was conducted to determine the optimal sample size for the analysis of the aquatic insect community in a stream reach of the Pangtae Creek, Kangwon-do in October 1995 and may 1996. The results showed that the required minimum sample size varied and depended on the purposes of the community analysis. Acoording to the Species: Area Curve method, at least 16 Surber samplings ($30{\times}30cm$) were required in a stream reach in each spring and fall survey. The species diversity index did not vary significantly as the sample size increased. Based on the coefficient of variation analysis, the minimum sample sizes of 10 were required in order to compare seasonal differences of the community in the study area. Considering the static community structure of aquatic insects, including both species numbers and individual numbers of aquatic insects, 11 and 7 samplings were optimal sizes for the fall and spring survey, respectively. We concluded that 12 Surber samplings from 3 riffle-pool sequences (4 samplings at each riffle-pool sequence) would be required in a stream reach (length 1 km) to obtain reliable as well as cost efficient data. Our model showed that the optimal sample size should be determined by interactions between minimum sample size, the degree of data reliability, and cost efficiency.

• Journal of the Korean Society of Safety
• /
• v.23 no.5
• /
• pp.125-130
• /
• 2008

To optimize the selected reinforcing method for application to PSC Beam bridges, the reliability analysis was performed with consideration for the increase and decrease of the member section based on the standard design section, and the minimum life-cycle cost(LCC) was calculated from this analysis with consideration for the aleatory uncertainty. Moreover, the mean, 50%, 75%, and 90% distributions of the analysis results were re-evaluated quantitatively by considering the effect of the epistemic uncertainty. The reliability results gained from the application of the reinforcing method, as well as the optimal design method based on the minimum LCC, will provide more reasonable design criteria for the PSC Beam bridges.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.195-204
• /
• 2003

Network optimization is being increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Networks provide a useful way to modeling real world problems and are extensively used in practice. Many real world applications impose on more complex issues, such as, complex structure, complex constraints, and multiple objects to be handled simultaneously and make the problem intractable to the traditional approaches. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems. The invited talk introduces a thorough treatment of evolutionary approaches, i.e., hybrid genetic algorithms approach to network optimization problems, such as, fixed charge transportation problem, minimum cost and maximum flow problem, minimum spanning tree problem, multiple project scheduling problems, scheduling problem in FMS.

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