• Title/Summary/Keyword: flow routing

Search Result 243, Processing Time 0.032 seconds

RUNOFF ANALYSIS BY DEAD ZONE LONGITUDINAL DISPERSION ANALOGY (사대종확산 모형에 의한 유출해석)

  • 윤용남;차영기
    • Water for future
    • /
    • v.12 no.1
    • /
    • pp.56-59
    • /
    • 1979
  • A prompt subsurface runoff producing mechanism whih creaters a depletion curve of direct runoff hydrograph is simulated by a dead zone dispersion model technique. Runoff processes are carried out by routing of the outflow resulted from previous linear channel and effective rainfall from its corresponding subwatershed through a series of conceptual linear channels representing subwatersheds of a catchment. Working rules are explained for evaluation the model parameters such as translatory velocity, diffusive factor, and parameters concerning the infiltration and relative magnitude of the prompt subsurface flow region.

  • PDF

Performance Comparison of Discrete Particle Swarm Optimizations in Sequencing Problems (순서화 문제에서 01산적 Particle Swarm Optimization들의 성능 비교)

  • Yim, D.S.
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.4
    • /
    • pp.58-68
    • /
    • 2010
  • Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

A Study on a Congestion-free Design of AGV System (무혼잡 무인 운반 차량 시스템의 설계에 관한 연구)

  • Park, Yun-Sun;Park, Dae-Hee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.3
    • /
    • pp.559-580
    • /
    • 1997
  • It is essential to construct on efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System(AGVS) ploys a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs became complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for partitioning the AGV system by introducing the concept of Central Path. This method named Central Path design has advantages, since each partitioned workstation group is served by one AGV and the material handling between groups is performed by special AGV that is used for the Central Path. Therefore the congestion problems never occur. Furthermore Central Path Design has a high flexibility for alteration and extension of system. Finally, we demonstrate its efficiency using simulation.

  • PDF

QoS Routing Protocol for Mobile Ad-Hoc Networks (이동 애드혹 네트워크를 위한 QoS 라우팅 프로토콜)

  • Kim, Jong-Sun;Joe, In-Whee;Park, Yong-Jin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.538-540
    • /
    • 2005
  • 본 논문의 목표는 TDMA기반의 이동 애드혹 네트워크에서 AODV 라우팅 프로토콜을 이용해서 QoS를 제공하는 것이다. 우리가 제공하려는 QoS는 종단간에 있어서 각 Flow에 대해 연속적이고도 충분한 대역폭을 보장하는 것이다. TDMA에서 대역폭은 time slot으로 다루어지며 각 노드는 전체 N개의 time slot으로 이루어진 frame단위로 전송을 한다. 본 논문에서는 Hello message와 수정된 AODV 프로토콜을 이용해서 이러한 time slot을 관리함으로써 최대한의 QoS를 보장할 수 있는 기법을 제안한다.

  • PDF

The Extension of IPv6 Multicast Routing Daemon For Using the Flow Label (플로우 레이블을 지원하는 IPv6멀티캐스트 라우팅 데몬의 구현)

  • 이주철;안종석
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.06a
    • /
    • pp.265-269
    • /
    • 2001
  • 멀티캐스트 라우팅 데몬은, 패킷 포워딩이 가능한 호스트 상에서 작동하여 호스트를 멀티캐스트 라우팅이 가능한 라우터로 만들어주는 역할을 하는 응용 프로그램이다. 현재의 리눅스 IP$_{v}$ 6 멀티캐스트 환경을 살펴보면 로컬 네트워트 상에서의 멀티캐스트 통신만을 지원하도록 되어있다. 즉 서로 다른 서브넷 상에 존재하는 호스트들 사이에서는 멀티캐스트 통신을 할 수 없다. 따라서, 본 논문에서는 리눅스 IP$_{v}$ 6 환경에서 멀티캐스트 라우팅이 가능하도록 IP$_{v}$ 6용 멀티캐스트 라우팅 데몬을 구현하였다. 멀티캐스트 라우팅이 가능하기 위해서는 두가지 문제가 해결되어야 하는데 첫째는 멀티캐스트 라우팅 정보를 주고받는 데몬 프로그램이고, 둘째는 데몬이 주고받은 라우팅 정보를 이용하여 멀티캐스트 패킷을 포워딩하는 커널 포워딩 루틴이다. 이 두가지가 본 논문에서 중심으로 다룰 내용이다.

  • PDF

Development of Flood Map Using Geographic Information System (GIS기반 홍수예측지도의 개발)

  • Kim Sang-Ho;Kim Han-Joong;Lee Nam-Ho;Kim Seong-Joon
    • Proceedings of the KSRS Conference
    • /
    • 2006.03a
    • /
    • pp.36-40
    • /
    • 2006
  • The objective of the study is to develop a GIS-based flood map. Hydraulic model (HEC-RAS) is linked with hydrologic model (HEC-HMS) for flood map. Geospatial data processors, HEC-GeoHMS and HEC-GeoRAS, are used for operating HEC-HMS and HEC-RAS. HEC-HMS was calibrated and validated at the Hwa-Ong watershed. HEC-HMS was used for calculating runoff from the Hwa-Ong watershed which consisted of Nam-Yang, Ja-An, U-Eun river sub-watersheds, and HEC-RAS was applied and validated for river flow routing at the Hwa-Ong watershed. The simulated results from HEC-HMS and HEC-RAS were reasonably good compared with the observed data. HEC-RAS and HEC-HMS were applied to simulate flooding from probability rainfall at the Hwa-Ong watershed, and the simulated result was used to develop a flood map. Flood map developed in this study will be used for mitigating and predicting the flood damages.

  • PDF

Routing Service Implementation using a Dual Graph (듀얼 그래프를 이용한 라우팅 서비스 구현)

  • 김성수;허태욱;박종현;이종훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.171-174
    • /
    • 2003
  • Shortest path problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time location-based service (LBS) environments according to user's route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. We propose a new rest modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification.

  • PDF

A Comparative Analysis of Flow Routing Scheme in urban Area with sewers and open channels (관거 및 개수로 하도로 구성된 도시지역에서의 흐름이송 해석기법 비교분석)

  • Lee, Jae-Joon;Lee, Sung-Ho
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2011.05a
    • /
    • pp.272-276
    • /
    • 2011
  • 현재 우리나라에서 사용되고 있는 강우-유출모형은 하도추적 방식을 모형 내에 내장되어 있는 해석절차나 유역내 모든 관거 및 하도에 일괄하여 적용하는 방식으로 되어있어 도시유역과 같이 관거와 하도가 복합적으로 구성되어 있는 경우 적절한 해석방식의 채택이 힘든 실정이다. 따라서 본 연구에서는 관거 및 하도의 개별적인 해석이 가능한 2009년 하천설계기준의 도시유역 유출해석 모형으로 포함된 FFC2Q모형을 이용하여 관거와 하도가 복합적으로 구성되어 있는 홍제천 유역을 선정하여 흐름이송 해석방법을 다양하게 설정하여 강우-유출 특성을 분석하고 실측자료에 대한 모의 방식별 분석결과에 대한 적합도를 분석하였다. 적합도 분석결과 하도에 Muskingum-Cunge법, 관거에 Kinematic-Wave법을 적용하여 흐름이송해석을 하는 경우가 가장 적합한 것으로 나타났다.

  • PDF

Experimental Evaluation of Routing Algorithms for Optimal Load Balancing on SONET Rings with Demand Splitting (분할이 허용된 SONET 링의 루팅 해법들에 대한 비교 분석)

  • 명영수;김후곤
    • Korean Management Science Review
    • /
    • v.18 no.2
    • /
    • pp.107-116
    • /
    • 2001
  • In the ring leading problem with demand splitting, traffic demands are given for each pair of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum link load on the ring. Recently, four different optimal a1gorithms have been developed for solving the problem. In this paper, we compare those algorithms in a single framework and conduct a computational study to evaluate the practical performance of those algorithms.

  • PDF

Small Watershed Peak Flow Prediction

  • Jun, Byong-Ho;Oh, Kyoung-Doo;Park, Young-Ha
    • Korean Journal of Hydrosciences
    • /
    • v.2
    • /
    • pp.1-12
    • /
    • 1991
  • To estimate the peak discharge from the small rural watersheds, 53 storm events of seven small watersheds from 1972 to 1989 were selected and were analyzed by the multiple regression technique. The peak values by the new prediction method developed in this study were also compared to the real data of Banwol Basins and the estimated peaks of the several watersheds which were analyzed by the Korean engineering companies. These values were also compared to the results from the other method, i.e. the Rational Method, the Kajiyama Method, the Nakayasu Unit Hydrograph companies. Through Method, the Area Routing Method, etc., which are favored by the Korean engineering companies. Through these comparisons, it is proved that the proposed method may be used for day-to-day use without any problem. However, there should be some modifications and improvements as more data are available in the future.

  • PDF