• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.62-62
• /
• 1996

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.381-381
• /
• 1995

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.282-285
• /
• 1998

The purpose of this study is to present a method for determining the k most vital arcs in the maximum flow problem using a heuristic method. Generally, the problem which determine the k most vital arcs in maximum flow problem has known as NP-hard. Therefore, in this study we propose a method for determining all the k most vital arcs in maximum flow problem using a genetic algorithm. The proposed algorithm found all alternatives within shorter time than other heuristic methods. The method presented in this study can determine all the alternatives when there exists other alternative solutions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3706-3714
• /
• 2011

This study deals with the algorithm to finding the maximum capacity and their schedule of extra freight while honoring planned timetable of trains on railway network. Time-expanded network, a kind of space-time graph, can be shown both planned train timetable and dynamic features of given problem. Pre-processing procedure is a series of infeasible arcs removal from time-expanded network honoring planned timetable. In the result, this preprocessing transforms dynamic features of given problem into static maximal flow problem which can be easily solved.

• TTA Journal
• /
• s.142
• /
• pp.26-27
• /
• 2012

UN 식량농업기구(FAO)는 기후변화의 최대 원인 중 하나로 '축산업'을 지목하고 있다. 그 요소 중의 하나가 바로 먹다 남아 버려지는 우유다. 우유 한 통을 사면 먹다 남길 때가 잦다. 유통기한까지 지나면 마시기에는 찜찜하다. 많이 따라놓고 먹지 않거나 오랫동안 먹지 않아 남은 우유는 보통 빨리 상해서 하수구로 버려지는 게 다반사다. 하수구를 통해 강이나 바다로 유입되는 우유를 정화하려면 버려지는 우유 양의 약 1만 5천 배의 물이 필요하다. 즉, 우유 1 리터(${\ell}$)를 통째로 버리면 15톤(t)의 물이 있어야 정화된다. 환경 문제가 만만치 않다는 얘기다.

• Journal of Information Management
• /
• v.37 no.1
• /
• pp.17-37
• /
• 2006

This study analyzes a copyright possession of scholarly journal papers which is published from academic society. There are three ways where the author transfers the copyright to a society, the author has the copyright, and the author and society own jointly the copyright. These ways are analyzed with their strong and weak points and then presented the desirable plans.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.44
• /
• pp.81-92
• /
• 1997

The purpose of this paper is to develop a method of paramatric analysis that can be applied to an optimal solution of a maximum flow problem. We first define the transformed network corresponding to a given network. In such a network, we conduct paramatric analysis by determining changes in the optimal solution precipitated by changes in the capacity as the arc capacity varies from 0 to infinite. By this method we can easily calculate not only the characteristic region where the given optimal solution remains unchanged, but also the characteristic region where the value of the maximal flow gradually increases or decreases. The proposed method is demonstrated by numerical example.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.825-833
• /
• 1997

The purpose of this paper is to develop a method of postoptimality analysis that can be applied to an optimal solution of a maximum flow problem. We first use the transformed network corresponding to a given network. In such a network we conduct postoptimality analysis by determining changes in the optimal solution precipitated by changes in the capacity as the arc capacity varies from 0 to infinite. By this method we can easily calculate not only the characteristic region where the given optimal solution remains unchanged, but also the characteristic region where the value of the maximal flow gradually increases or decreases. The proposed method is demonstrated by numerical example.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.263-269
• /
• 1996

The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc(MVA) in the maximum flow problem. We first define the transformed network corresponding In a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for a MVA consists of the arcs whose flow is at least as greate as the flow over every arc in a minimal cut As a result, we present a method in which the MVA is determined more easily by computing the minimal capacity in the transformed network. The proposed method is demonstrated by numerical example.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.106-116
• /
• 1999

The purpose of this study is to present a method for determining the k most vital arcs in the maximum flow problem using genetic algorithms. Generally, the problem which determine the k most vital arcs in maximum flow problem has known as NP-hard. Therefore, in this study we propose a method for determining all the k most vital arcs in maximum flow problem using genetic algorithms. First, we propose a genetic algorithm to find the k most vital arcs removed at the same time and then present the expression and determination method of individuals compatible with the characteristics of the problem, and specify the genetic parameter values of constitution, population size, crossover rate, mutation rate and etc. of the initial population which makes detecting efficiency better. Finally, using the proposed algorithms, we analyzed the performance of searching optimal solution through computer experiment. The proposed algorithms found all alternatives within shorter time than other heuristic methods. The method presented in this study can determine all the alternatives when there exists other alternative solutions.