当前位置: X-MOL 学术Irrig. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Methodology for flushing pressurised irrigation networks for fertigation and operation maintenance purposes
Irrigation Science ( IF 3.1 ) Pub Date : 2021-03-08 , DOI: 10.1007/s00271-021-00724-4
M. A. Jiménez-Bello , J. C. Alonso Campos , J. Manzano-Juárez , F. Martínez Alzamora

Pressurised irrigation networks with a certain degree of automation allow centralized fertigation and maintenance operations such as cleaning subunits and preventing the proliferation of invasive species such as zebra mussels. Until now, there is no methodology that guarantees the total cleaning of the network of a substance in the shortest possible time. In the same way, it does not exist to guarantee reaching all consumption points with a certain concentration of a substance, injecting the minimum possible amount. For that purpose, a general novel methodology has been developed that makes use of the network’s hydraulic model and parallel multi-objective genetic algorithms to flush the network of a certain substance or to get it to all consumption points in the shortest possible time and supplying a minimum volume. This method assumes that the available pressure at the source is always over a minimum value. The arrival times to the consumption points are minimized and the injected volume is reduced to the minimum of replacement, that is, the volume of the network pipes. The methodology applied to the study case allowed the entire network to be flushed in a minimum time of 2.46 h. On a normal irrigation day, without making any changes to the irrigation schedule the time to completely flush the network is 11.76 h. Furthermore, the injected volume differs greatly from the total volume of the pipes.



中文翻译:

用于施肥和运行维护目的的冲洗加压灌溉网络的方法

具有一定程度自动化程度的加压灌溉网络允许集中进行灌溉施肥和维护操作,例如清洁亚基并防止斑马贻贝等入侵物种的繁殖。到目前为止,还没有一种方法可以保证在最短的时间内彻底清洁物质网络。同样,也不可能保证以一定浓度的某种物质达到所有消耗点,并注入尽可能少的量。为此,已开发出一种通用的新方法,该方法利用网络的水力模型和并行的多目标遗传算法来冲洗某种物质的网络或使其在最短的时间内到达所有消耗点,并提供最小音量。该方法假定源处的可用压力始终超过最小值。到消耗点的到达时间被最小化,注入的体积被减少到最小的替换量,即网络管道的体积。应用于研究案例的方法论允许整个网络在最少2.46小时的时间内被冲洗。在正常的灌溉日中,不对灌溉计划进行任何更改,完全冲洗网络的时间为11.76 h。此外,注入的体积与管道的总体积相差很大。应用于研究案例的方法论允许整个网络在最少2.46小时的时间内被冲洗。在正常的灌溉日中,不对灌溉计划进行任何更改,完全冲洗网络的时间为11.76 h。此外,注入的体积与管道的总体积相差很大。应用于研究案例的方法论允许整个网络在最少2.46小时的时间内被冲洗。在正常的灌溉日中,不对灌溉计划进行任何更改,完全冲洗网络的时间为11.76 h。此外,注入的体积与管道的总体积相差很大。

更新日期:2021-03-09
down
wechat
bug