A simple distributed overland and channel routing method for the Time-Area approach to develop direct runoff hydrograph

2010 ◽  
Author(s):  
YOUNGGU HER ◽  
CONRAD D HEATWOLE
Keyword(s):  
Channel Routing ◽  
Direct Runoff ◽  
Runoff Hydrograph ◽  
Routing Method ◽  
Direct Runoff Hydrograph

Simulation of the direct runoff hydrograph at basin outlet

1998 ◽  
Vol 12 (5) ◽  
pp. 769-779 ◽  
Author(s):  
Florisa Melone ◽  
Corrado Corradini ◽  
Vijay P. Singh
Keyword(s):  
Direct Runoff ◽  
Runoff Hydrograph ◽  
Direct Runoff Hydrograph

Investigating Parameters of Geomorphic Direct Runoff Hydrograph Models

2019 ◽  
Vol 46 (1) ◽  
pp. 19-28 ◽  
Author(s):  
A. R. Ghumman ◽  
Y. Ghazaw ◽  
R. H. Abdel-Maguid ◽  
A. Zafar
Keyword(s):  
Direct Runoff ◽  
Runoff Hydrograph ◽  
Direct Runoff Hydrograph

scholarly journals A New Algorithm For The Grid Cell-Based Runoff Routing Model Based on Travel Time Concept

2020 ◽  
Vol 5 (2) ◽  
pp. 160
Author(s):  
Baina Afkril ◽  
M. Pramono Hadi ◽  
Slamet Suprayogi
Keyword(s):  
Travel Time ◽  
Routing Algorithm ◽  
Grid Cell ◽  
Direct Runoff ◽  
Runoff Hydrograph ◽  
Data Formats ◽  
Matlab Programming ◽  
Model Algorithm ◽  
Direct Runoff Hydrograph ◽  
Runoff Routing

The grid cell-based routing model has recently been used to simulate direct runoff hydrographs at catchment scales. This study develops a flexible event-based runoff routing algorithm to simulate a direct runoff hydrograph (DRH). The experiment was based on the spatiotemporal inputs of a hydrological data set. The flexibility is based on the time step and grid cell size applied in the original STORE-DHM. Rainfall distribution was obtained using radar data adjusted by the measured point ground, while the runoff yield was determined using the NRCS-CN method. The parameter distribution was captured in the GIS environment as raster data formats. Furthermore, it was converted into ASCII data formats for scripting the routing algorithm using Matlab programming codes. The model algorithm was tested for storm events within two small study river systems in Yogyakarta, Indonesia. One event in each catchment was selected and calibrated to the observed hydrograph, treating the Curve Number (CN) and Manning coefficient (n) values as parameter calibrations. In the end, two events were selected for validation. The proposed routing model algorithm simulates DRHs of all selected events in the study areas with excellent performance. The Nash-Sutcliffe coefficient was greater than 0.75 for all DRH during validation, and the volume bias and peak discharge error were less than 25%. Keywords: Algorithm; Cell-based runoff routing; Travel time; GIS; Direct runoff hydrograph.   Copyright (c) 2020 Geosfera Indonesia Journal and Department of Geography Education, University of Jember This work is licensed under a Creative Commons Attribution-Share A like 4.0 International License

scholarly journals On the restrictive channel thickness estimation

2007 ◽  
Vol 20 (3) ◽  
pp. 499-506
Author(s):  
Iskandar Karapetyan
Keyword(s):  
Positive Integer ◽  
Heuristic Algorithms ◽  
Clique Number ◽  
Directed Path ◽  
Channel Routing ◽  
Routing Problem ◽  
Thickness Estimation ◽  
Channel Thickness ◽  
Np Complete ◽  
Routing Method

Channel routing is an important phase of physical design of LSI and VLSI chips. The channel routing method was first proposed by Akihiro Hashimoto and James Stevens [1]. The method was extensively studied by many authors and applied to different technologies. At present there are known many effective heuristic algorithms for channel routing. A. LaPaugh [2] proved that the restrictive routing problem is NP-complete. In this paper we prove that for every positive integer k there is a restrictive channel C for which ?(C)>? (HG)+L(VG)+k, where ? (C) is the thickness of the channel, ?(HG) is clique number of the horizontal constraints graph HG and L(VG) is the length of the longest directed path in the vertical constraints graph VG.

scholarly journals A Comparison of Continuous and Event-Based Rainfall–Runoff (RR) Modelling Using EPA-SWMM

Water ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 611 ◽  
Author(s):  
Sharif Hossain ◽  
Guna Alankarage Hewa ◽  
Subhashini Wella-Hewage
Keyword(s):  
Goodness Of Fit ◽  
Model Performance ◽  
South Australia ◽  
Comparative Performance ◽  
Direct Runoff ◽  
Continuous Simulation ◽  
Runoff Hydrograph ◽  
Total Runoff ◽  
Event Based ◽  
Runoff Hydrographs

This study investigates the comparative performance of event-based and continuous simulation modelling of a stormwater management model (EPA-SWMM) in calculating total runoff hydrographs and direct runoff hydrographs. Myponga upstream and Scott Creek catchments in South Australia were selected as the case study catchments and model performance was assessed using a total of 36 streamflow events from the period of 2001 to 2004. Goodness-of-fit of the EPA-SWMM models developed using automatic calibration were assessed using eight goodness-of-fit measures including Nash–Sutcliff efficiency (NSE), NSE of daily high flows (ANSE), Kling–Gupta efficiency (KGE), etc. The results of this study suggest that event-based modelling of EPA-SWMM outperforms the continuous simulation approach in producing both total runoff hydrograph (TRH) and direct runoff hydrograph (DRH).

Sign in / Sign up

Export Citation Format

Share Document