Evaluation of bed load transport equations in gravel bed rivers: A case study of the lower Jinsha River (SW China)
Zhiyi Feng, Anjun Deng, Qin Lu and 3 more
Journal of Hydrology: Regional Studies · 2025
doi:10.1016/j.ejrh.2025.102566 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Study region: This research is centered on the Sanduizi Reach of the lower Jinsha River, situated within the upper Yangtze River Basin in southwestern China. This section exemplifies a typical mountainous gravel-bed river, characterized by intricate hydraulic conditions, heterogeneous bed material, and a well-developed armor layer. Study focus: Existing bed load transport equations, predominantly derived from flume experiments with uniform sediments or data gathered in small to medium-sized rivers, frequently yield unreliable predictions when applied to large gravel-bed systems such as the Jinsha River. Utilizing 738 field measurements, we assessed the performance of six classical equations and identified systematic overestimations and underestimations, primarily attributable to the neglect of armor layer effects and transport phase variability. To address these limitations, we propose a novel dimensionless equation that incorporates critical parameters: d84 (surface material mobility), θ84/θc84 (transport phase classification), (d84/ d50)J (hiding–exposure effect), d84/H (relative roughness), and U (dimensionless velocity). New hydrological insights for the region: This study conducts the first comparative assessment of bed load transport equations in the lower Jinsha River. The newly proposed equation exhibits markedly enhanced predictive accuracy, with 97 % of the calculated values residing within one order of magnitude of the observed data. By necessitating only five variables, it improves field applicability and highlights the critical importance of incorporating armor layer mobility and transport phase dynamics in the modeling of gravel-bed rivers.
Abstract licence: CC BY-NC-ND
References60
40 more references, whose wording the paper’s licence keeps private.
All 60 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.