• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.3
• /
• pp.487-500
• /
• 1997

In this paper, we introduce the shortest flow-generating path problem in the generalized network. As the simplest generalized network model, this problem captures many of the most salient core ingredients of the generalized network flows and so it provides both a benchmark and a point of departure for studying more complex generalized network models. We show that the generalized label-correcting algorithm for the shortest flow-generating path problem has O(mn) time complexity if it starts with a good point and also propose an O($n^3m^2$) algorithm for finding a good starting point. Hence, the shortest flow-generating path problem is solved in O($n^3m^2$) time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.10
• /
• pp.415-420
• /
• 2020

Crowd flows occur in metropolitan railway transit stations, terminals, multiple buildings, and stadiums and are important in ensuring the safety as well as smooth flow of pedestrians in these facilities. In this study, the author developed a new computational analysis method for crowd flow dynamics and applied it to models of transit connecting paths. Using the analysis method, the potential value of the exit was assigned the smallest value, and the potential value of the surrounding grids gradually increased to form the overall potential map. A pathline map was then constructed by determining the direction vector from the grid with large potential value to the grid and small potential. These pathlines indicate basic routes of passenger flow. In all models of the analysis object, the pedestrians did not move to the first predicted shortest path but instead moved using alternative paths that changed depending on the situation. Even in bottlenecks in which pedestrians in both directions encountered each other, walking became much smoother if the entry time difference was dispersed. The results of the analysis show that a method for reducing congestion could be developed through software analysis such as passenger flow analysis without requiring hardware improvement work at the railway station.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.497-497
• /
• 2023

정수장에서 소독 및 여과 처리가 완료된 깨끗한 물은 배급수시설로 전달되나, 실제로 관의 노후화, 갑작스러운 유향 변동, 특정 구역의 관 내 정체 시간에 따른 Water Age 상승 등 여러 요인으로 인해 실제 수용가에는 안전하지 않은 용수가 공급될 가능성이 있으며, 이에 따라 적절한 위치에서 지속적인 감시를 통한 조기 발견 및 조치가 필요하다. 상수도 시설기준(2010)에 배수시설의 주요 지점 혹은 관 말단 등 필요에 따라 적절한 위치에 수질 계측기를 설치할 수 있도록 제시되어 있으나, 계측기 설치 위치나 개수에 대한 기준이 모호한 실정이다. 모든 구역에 수질계측기를 설치하여 감시하는 것이 이상적이지만, 현실적으로는 지자체 환경 및 경제적인 한계가 있어 주요 위치에 설치하는 것이 바람직하다. 본 연구에서는 대표적인 수리해석 모형인 EPANET을 사용하여 대상 관망의 노후도, 유속, 유향변동 등의 영향인자를 바탕으로 수질사고가 발생할 확률이 높은 관을 위험관으로 선정하고, 선정된 위험관을 대상으로 최단 경로와 Cost를 산출할 수 있는 Floyd Warshall Algorithm을 이용하여 각 Node(수용가)간 물이 이동할 때의 최소 도달시간과 경로를 파악하였다. 또한, 시간 서비스 수준(Level of T hour Serivice)의 개념을 도입하여 위험관으로부터 특정시간 이내에 흐름이 도달하는 Node를 파악한 뒤, 그 중 가장 많은 피해를 발생시킬 수 있는 위험관을 수질계측위치 지점으로 선정하였다. 제시된 수질사고 발생위험이 높은 위험관을 대상으로 수질계측 위치를 선정하는 방법이 전체 관망 네트워크를 대상으로 수질계측 위치를 판단하는 방법보다 결과 신뢰도 측면에서 더욱 효과적이고 효율적인 방법으로 사료된다.

• Journal of the Korea Society for Simulation
• /
• v.17 no.2
• /
• pp.91-103
• /
• 2008

In order to simulate the behavior of automated manufacturing systems, the performance of material handling systems should be measured dynamically. Multi-Agent technology could be well adapted for the development of simulator for distributed and intelligent manufacture systems. A multi-agent system is composed of one coordination agent and multiple application agents. Issues in AGVS simulator can be classified by the set-up and operating problems. Decisions on the number of vehicles, bi- or uni-directional guide-path, etc. are fallen into the set-up problem category, while deadlock tree algorithm and conflict resolution are in operating problem. In this paper, a multi-agent based deadlock-free simulator for automated guided vehicle system(AGVS) are proposed through the use of multi-agent technologies and the development of deadlock-free algorithm. In this AGVS simulator proposed, well-known Floyd algorithm is used to create AGVS Guide path, through which AGVS move. Also, AGVs avoid vehicle conflict and deadlock using check path algorithm. And Moving vehicle agents are operated in real-time control by coordination agent. AGV position is dynamically calculated based on the concept of rolling time horizon. Simulator receives and presents operating information of vehicle in AGVS Gaunt chart. The performance of the proposed algorithm and developed simulator based on multi-agent are validated through set of experiments.

• Journal of the Korean Society for Railway
• /
• v.19 no.3
• /
• pp.388-396
• /
• 2016

The metropolitan subway network of Seoul has gone through many evolutionary processes in past decades to disperse the floating population and improve the traffic flow. In this study, we analyzed how the structural characteristics and the efficiency of the subway network have changed according to the dynamic evolutionary processes of the metropolitan subway network of Seoul. We have also proposed new measures that can be used to characterize the structural properties of the subway network more practically. It is shown that the global efficiency is about 74%, which is higher than those of subway networks of foreign countries. It should also be considered that passenger flow between stations is even higher, at about 85%. Since the private lines, including line 9, the New Bundang line, the Uijeongbu line, and the Ever line do not release their traffic data since September, 2013, only 5 years of data from September, 2008 to September, 2013 is available. So, in this study we limit the analysis period to these 5 years.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.1B
• /
• pp.35-45
• /
• 2009

In this study, a laboratory experiment has been performed on a S-curved channel with two curved sections. In the experiments, effects of 3-D velocity structures on mixing characteristics of tracer material were investigated. As a result, it was clearly noticed that the primary flow travels taking the shortest course of the meandering channel and has a very ununiform distribution at the bends. The secondary cell which was developing at the first bend disappears at the crossover, and then, at the next bend, secondary cell is re-developing in the opposite direction. The experimental results show that mixing of tracer is significantly affected by the combined action of ununiform primary flow and secondary cell. The ununiform primary flow separates the tracer cloud in the longitudinal direction, and the secondary cell further separates the retarding tracer cloud mainly in the transverse direction. As a result, these complex flow structures cause separation and spreading of tracer cloud both in the longitudinal and in the transverse directions. The measured dimensionless transverse dispersion coefficients calculated using 2-D routing procedure ranges 0.012-0.875, and is generally proportional to width to depth ratio (W/h). The predicted values calculated by the theoretical equation overestimate slightly the measured transverse dispersion coefficients.