Coordinated Optimization of Pipe Network Layout and Pipe Diameters in a Multi-source Irrigation System

doi:10.3969/j.issn.1007-7375.220255

Abstract

Abstract: Water-saving irrigation is the key to accelerating agricultural modernization and improving irrigation efficiency. A mixed integer programming model is established for a multi-source irrigation system with the objective of minimizing the cost of system flow distribution and pipe installation, to determine the pipe network topology and connecting pipe sizes, where the distribution of water flow is considered. A hybrid heuristic algorithm is designed to integrate local searching with an accurate algorithm. It coordinates the optimization of the layout and design for pipe networks in two stages. The connections between nodes and connecting pipe diameters are analyzed, while the flow to demand nodes is allocated. Test examples with different scales verifies the effectiveness of the proposed coordinated optimization algorithm in reducing construction cost of a multi-source irrigation system.

Key words: multi-source irrigation system, local searching, hybrid heuristic algorithm

CLC Number:

F402
S277

LI Yanfeng, CHEN Saiyue. Coordinated Optimization of Pipe Network Layout and Pipe Diameters in a Multi-source Irrigation System[J]. Industrial Engineering Journal, 2024, 27(4): 141-149.

References

[1] 周荣敏, 雷延峰. 基于改进单亲遗传算法的树状管网布置优化[J]. 水利学报, 2012, 43(43): 1243-1247
ZHOU Rongmin, LEI Yanfeng. Optimal layout of tree pipe networks based on improved single parent genetic algorithm[J]. Journal of Hydraulic Engineering, 2012, 43(43): 1243-1247
[2] SU L, NIE T, HO C, et al. Optimizing pipe network design and central plant positioning of district heating and cooling system: a graph-based multi-objective genetic algorithm approach[J]. Applied Energy, 2022, 325: 119844
[3] SAMANI H, NAEENI S T. Optimization of water distribution networks using integer linear programming[J]. Journal of Hydraulic Research, 2006, 34(5): 623-632
[4] WACK Y, BAELMANS M, SALENBIEN R, et al. Economic topology optimization of district heating networks using a pipe penalization approach[J]. Energy, 2023, 264: 126161
[5] JAC A, MAURO A S S. RAVAGNANI A B. Water distribution networks optimization considering unknown flow directions and pipe diameters[J]. Computers & Chemical Engineering, 2019, 127: 41-48
[6] MARTINHO W C S, MELO R A, SÖRENSEN K. An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization[J]. Computers & Operations Research, 2021, 135: 105429
[7] GONCALVES G M, GOUVEIA L, PATO M V. An improved decomposition-based heuristic to design a water distribution network for an irrigation system[J]. Annals of Operations Research, 2014, 219: 141-167
[8] AFSHAR M H, AKBARI M, MARINO M A. Simultaneous layout and size optimization of water distribution networks: engineering approach[J]. Journal of Infrastructure Systems, 2005, 11(4): 221-230
[9] 李海滨, 马孝义, 赵文举, 等. 树状管网布置与管径同步优化方法研究[J]. 系统仿真学报, 2009(11): 3180-3183
LI Haibin, MA Xiaoyi, ZHAO Wenju, et al. Layout and diameter simultaneous optimization method of tree pipe network[J]. Journal of System Simulation, 2009(11): 3180-3183
[10] LEE E J, FREYBERG D L, CRIDDLE C S. An integrated planning tool for design of recycled water distribution networks[J]. Environmental Modelling and Software, 2016, 84: 311-325
[11] CHEN W, JIA Y, ZHAO F, et al. A cooperative co-evolutionary approach to large-scale multisource water distribution network optimization[J]. IEEE Transactions on Evolutionary Computation, 2019, 23(5): 842-857
[12] LIU D, LIU W, FU Q, et al. Two-stage multi-water sources allocation model in regional water resources management under uncertainty[J]. Water Resour Manage, 2017, 31, 3607-3625.
[13] 严熙世, 范瑾初. 给水工程[M]. 北京: 中国建筑工业出版社, 1999.
[14] LI F, GOLDEN B, WASIL E. Very large-scale vehicle routing: new test problems, algorithms, and results[J]. Computers & Operations Research, 2005, 32(5): 1165-1179
[15] RUIZ E, ALBAREDA-SAMBOLA M, FERNÁNDEZ E, et al. A biased random-key genetic algorithm for the capacitated minimum spanning tree problem[J]. Computer Operation Research, 2015, 57: 95-108
[16] AHUJAR K, ORLIN J B, SHARMA D. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem[J]. Mathematical Programming, 2001, 91: 71-97