• Smart Media Journal
• /
• v.12 no.9
• /
• pp.72-80
• /
• 2023

This paper presents a design and analyzes the performance of a hospital assignment and reassignment scheme for emergency rescue services based on minimum cost maximum flow algorithm. It consists of flow graph building, link capacity updating, and allocation discovering steps. The efficiency of the algorithm makes it possible to reallocate hospitals even in case of dynamic changes in the number of patients or hospitals. The performance measurement result obtained from a prototype implementation shows that the proposed scheme can reduce the transport time requirement miss by up to 24%.

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

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.33 no.1
• /
• pp.9-16
• /
• 1984

This paper describes the minimum cost expansion planning which is based on the economical aspect under the various conditions on the power system expansion planning. It presents not only linear cost characteristics analysis but also stepwise cost characteristics analysis which satisfies practical condition in the power system. The latter analysis must be handled by integer programming (IP), because the relation between the cost and the capacity has stepwise characteristics. In order to proceed the latter analysis, the solving procedure is illustrated in detais by using branch and bound method which includes the network flow theory and maximum flow-minimum cut theorem.

• KIEE International Transactions on Power Engineering
• /
• v.2A no.3
• /
• pp.121-128
• /
• 2002

This study proposes a new method for transmission system expansion planning using fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual system. A branch and bound method which includes the network flow method and the maximum flow - minimum cut set theorem has been used in order to carry out the stepwise cost characteristics analysis. Uncertainties of the permissibility of the construction cost and the lenient reserve rate and load forecasting of expansion planning have been included and also processed using the fuzzy set theory in this study. In order to carry out the latter analysis, the solving procedure is illustrated in detail by the branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on the 21- bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in the future.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.350-353
• /
• 2001

This study proposes a new method for the transmission system expansion planning using the fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual systems. A branch and bound method which includes the network flow method and the maximum flow-minimum cut set theorem has been used in order to proceed the stepwise cost characteristics analysis. Uncertainties of the permission of the construction cost and not strict reserve rate and load forecasting of expansion planning have been included and also processed using fuzzy set theory in this study. In order to proceed the latter analysis, the solving procedure is illustrated in detail by branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on 21-bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in future.

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

In recent years, several researchers have presented the extensive research reports on network optimization problems. In our real life applications, many important network problems are typically formulated as a Maximum flow model (MXF) or a Minimum Cost flow model (MCF). In this paper, we propose a Genetic Algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including MXF and MCF models(MXF/MCF).

• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.356-358
• /
• 2005

This paper evaluates minimum and maximum power exchange considering economic and technical characteristics between Russia and ROK. First, we evaluate minimum power exchange to assure the economic feasibility by comparison with the total cost and benefit of the interconnected line. For evaluating maximum exchange power, system constraints are considered, which are examined through load flow and dynamic analysis by using the PSS/E program. As a result of these evaluations, we suggest the reasonable range of power exchange between ROK and Russia considering economic and technical constraints with the interconnection scenario that power system interconnection between ROK and Russia will be realized in the year 2010.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.3
• /
• pp.221-227
• /
• 2005

This paper evaluates minimum and maximum power exchange considering economic and technical characteristics between Russia and ROK. First, we evaluate minimum power exchange to assure the economic feasibility by comparison with the total cost and benefit of the interconnected line. For evaluating maximum exchange power, system constraints are considered, which are examined through load flow and dynamic analysis by using the PSS/E program. As a result of these evaluations, we suggest the reasonable range of power exchange between ROK and Russia considering economic and technical constraints with the interconnection scenario that power system interconnection between ROK and Russia will be realized in the year 2010.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.37 no.3
• /
• pp.267-273
• /
• 2013

In order to provide effective operating conditions for the fan in a wet cooling tower with film fill, a new program to search for the minimum fan power was developed using a model of the optimal total annual cost of the tower based on Merkel's model. In addition, a type of design map for a cooling tower was also developed. The inlet water temperature and heat load were considered as key parameters. The present program was first validated using several typical examples. The results showed that for a given heat load, a three-dimensional graph of the fan power (z-axis), mass flux of air (x-axis, minimum fan power), and inlet water temperature (y-axis, maximum of minimum fan power) showed a saddle configuration. The minimum fan power increased as the heat load increased. The conventionally known fact that the most effective cooling tower operation coincides with a high inlet water temperature and low air flow rate can be replaced by the statement that there exists an optimum mass flux of air corresponding to a minimum fan power for a given inlet water temperature, regardless of the heat load.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.3
• /
• pp.63-80
• /
• 2007

This study is a generalization of 'stable dynamics' recently suggested by Nesterov and de Palma[29]. Stable dynamics is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model that is common in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. An equilibrium in stable dynamics needs only maximum flow in each arc and Wardrop[33] Principle. In this study, we generalize the stable dynamics into the model with multiple traffic classes. We classify the traffic into the types of vehicle such as cars, buses and trucks. Driving behaviors classified by age, sex and income-level can also be classes. We develop an equilibrium with multiple traffic classes. We can find the equilibrium by solving the well-known network problem, multicommodity minimum cost network flow problem.