IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0258125.html
   My bibliography  Save this article

Sediment transport modeling in non-deposition with clean bed condition using different tree-based algorithms

Author

Listed:
  • Enes Gul
  • Mir Jafar Sadegh Safari
  • Ali Torabi Haghighi
  • Ali Danandeh Mehr

Abstract

To reduce the problem of sedimentation in open channels, calculating flow velocity is critical. Undesirable operating costs arise due to sedimentation problems. To overcome these problems, the development of machine learning based models may provide reliable results. Recently, numerous studies have been conducted to model sediment transport in non-deposition condition however, the main deficiency of the existing studies is utilization of a limited range of data in model development. To tackle this drawback, six data sets with wide ranges of pipe size, volumetric sediment concentration, channel bed slope, sediment size and flow depth are used for the model development in this study. Moreover, two tree-based algorithms, namely M5 rule tree (M5RT) and M5 regression tree (M5RGT) are implemented, and results are compared to the traditional regression equations available in the literature. The results show that machine learning approaches outperform traditional regression models. The tree-based algorithms, M5RT and M5RGT, provided satisfactory results in contrast to their regression-based alternatives with RMSE = 1.184 and RMSE = 1.071, respectively. In order to recommend a practical solution, the tree structure algorithms are supplied to compute sediment transport in an open channel flow.

Suggested Citation

  • Enes Gul & Mir Jafar Sadegh Safari & Ali Torabi Haghighi & Ali Danandeh Mehr, 2021. "Sediment transport modeling in non-deposition with clean bed condition using different tree-based algorithms," PLOS ONE, Public Library of Science, vol. 16(10), pages 1-12, October.
  • Handle: RePEc:plo:pone00:0258125
    DOI: 10.1371/journal.pone.0258125
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0258125
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0258125&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0258125?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0258125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.