کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8959586 1646329 2018 37 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Multigene genetic programming for sediment transport modeling in sewers for conditions of non-deposition with a bed deposit
ترجمه فارسی عنوان
برنامه نویسی ژنتیک چند گانه برای مدل سازی حمل و نقل رسوب در فاضلاب برای شرایط غیر رسوب با بستر تخت
موضوعات مرتبط
مهندسی و علوم پایه علوم زمین و سیارات ژئوشیمی و پترولوژی
چکیده انگلیسی
It is known that construction of large sewers based on consideration of flow with non-deposition without a bed deposit is not economical. Sewer design based on consideration of flow with non-deposition with a bed deposit reduces channel bed slope and construction cost in which the presence of a small depth of sediment deposition on the bed increases the sediment transport capacity of the flow. This paper suggests a new Pareto-optimal model developed by the multigene genetic programming (MGGP) technique to estimate particle Froude number (Frp) in large sewers with conditions of sediment deposition on the bed. To this end, four data sets including wide ranges of sediment size and concentration, deposit thickness, and pipe size are used. On the basis of different statistical performance indices, the efficiency of the proposed Pareto-optimal MGGP model is compared to those of the best MGGP model developed in the current study as well as the conventional regression models available in the literature. The results indicate the higher efficiency of the MGGP-based models for Frp estimation in the case of no additional deposition onto a bed with a sediment deposit. Inasmuch as the Pareto-optimal MGGP model utilizes a lower number of input parameters to yield comparatively higher performance than the conventional regression models, it can be used as a parsimonious model for self-cleansing design of large sewers in practice.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Sediment Research - Volume 33, Issue 3, September 2018, Pages 262-270
نویسندگان
, ,