پديد آورندگان :
زارﻋﯽ، ﻧﮕﯿﻦ داﻧﺸﮕﺎه رازي - داﻧﺸﮑﺪه ﮐﺸﺎورزي - ﮔﺮوه ﻣﻬﻨﺪﺳﯽ آب، ﮐﺮﻣﺎﻧﺸﺎه، اﯾﺮان , آذري، آرش داﻧﺸﮕﺎه رازي - داﻧﺸﮑﺪه ﮐﺸﺎورزي - ﮔﺮوه ﻣﻬﻨﺪﺳﯽ آب، ﮐﺮﻣﺎﻧﺸﺎه، اﯾﺮان , ﺣﯿﺪري، ﻣﺤﻤﺪ ﻣﻬﺪي داﻧﺸﮕﺎه رازي - داﻧﺸﮑﺪه ﮐﺸﺎورزي - ﮔﺮوه ﻣﻬﻨﺪﺳﯽ آب، ﮐﺮﻣﺎﻧﺸﺎه، اﯾﺮان
كليدواژه :
SPEA-II , ﺑﻬﯿﻨﻪﺳﺎزي ﭼﻨﺪ ﻫﺪﻓﻪ , ﺷﺒﮑﻪ ﺗﻮزﯾﻊ آب ﺷﻬﺮي , PESA-II
چكيده فارسي :
ﺑﺎ ﺗﻮﺟﻪ ﺑﻪ ﻣﺤﺪودﯾﺖ ﺷﺪﯾﺪ ﻣﻨﺎﺑﻊ آب، ﻫﺰﯾﻨﻪﺑﺮ ﺑﻮدن ﺳﺎﺧﺖ و ﺑﻬﺮهﺑﺮداري ﺳﺎﻣﺎﻧﻪﻫﺎي آﺑﺮﺳﺎﻧﯽ و اﻓﺰاﯾﺶ ﺳﺮﯾﻊ ﺟﻤﻌﯿﺖ، ﻃﺮاﺣﯽ ﺑﻬﯿﻨﻪ اﯾﻦ ﺷﺒﮑﻪﻫﺎ، از ﺿﺮورﯾﺎت ﻣﯽﺑﺎﺷﺪ. ﻣﺴﺌﻠﻪ ﮐﻤﯿﻨﻪ ﮐﺮدن ﻫﺰﯾﻨﻪ از ﻃﺮﯾﻖ ﮐﻤﯿﻨﻪﺳﺎزي ﻗﻄﺮ ﻟﻮﻟﻪﻫﺎي ﺷﺒﮑﻪ اﻧﺠﺎم ﻣﯽﺷﻮد ﮐﻪ ﻣﻮﺟﺐ ﮐﺎﻫﺶ ﻓﺸﺎر در ﺷﺒﮑﻪ ﻣﯽﺷﻮد. از آﻧﺠﺎﯾﯽ ﮐﻪ ﺗﺎﻣﯿﻦ ﻓﺸﺎر ﻣﻨﺎﺳﺐ در ﮔﺮهﻫﺎ از اﺻﻮل ﻣﻬﻢ ﻃﺮاﺣﯽ اﺳﺖ، ﺑﻨﺎﺑﺮاﯾﻦ در اﯾﻦ ﺗﺤﻘﯿﻖ، ﻣﺴﺌﻠﻪ ﺑﻬﯿﻨﻪﺳﺎزي در ﭼﻨﺪ ﺷﺒﮑﻪ ﻧﻤﻮﻧﻪ ﺑﺎ اﻫﺪاف ﮐﻤﯿﻨﻪﺳﺎزي ﻫﺰﯾﻨﻪ و ﮐﻤﺒﻮد ﻓﺸﺎر در ﮐﻞ ﺷﺒﮑﻪ ﺗﻌﺮﯾﻒ ﺷﺪ. از ﻧﺮماﻓﺰار EPANET ﺑﺮاي ﺗﺤﻠﯿﻞ ﻫﯿﺪروﻟﯿﮑﯽ ﺷﺒﮑﻪﻫﺎي ﻧﻤﻮﻧﻪ اﺳﺘﻔﺎده ﺷﺪ و ﻓﺮآﯾﻨﺪ ﺑﻬﯿﻨﻪﺳﺎزي ﭼﻨﺪﻫﺪﻓﻪ از ﻃﺮﯾﻖ ﮐﺪﻧﻮﯾﺴﯽ اﻟﮕﻮرﯾﺘﻢﻫﺎي ﻓﺮاﮐﺎوﺷﯽ PESA-II و SPEA-II در ﻧﺮماﻓﺰار ﻣﺘﻠﺐ و اﺗﺼﺎل آنﻫﺎ ﺑﻪ EPANET ﺻﻮرت ﮔﺮﻓﺖ. ﺗﺎﺑﻊ ﻫﺰﯾﻨﻪ اﺑﺘﺪا ﻓﻘﻂ ﺑﺎ در ﻧﻈﺮ ﮔﺮﻓﺘﻦ راﺑﻄﻪ ﺑﯿﻦ ﻫﺰﯾﻨﻪ، ﻗﻄﺮ و ﻃﻮل ﻟﻮﻟﻪﻫﺎ ﺗﻌﺮﯾﻒ ﺷﺪ. ﺳﭙﺲ در ﺗﻌﺮﯾﻒ ﺑﻌﺪي، ﻫﺰﯾﻨﻪ ﻧﺎﺷﯽ از ﺗﻌﺪي از ﻣﺤﺪوده ﻣﺠﺎز ﻓﺸﺎر ﮐﻪ ﺣﺪاﻗﻞ و ﺣﺪاﮐﺜﺮ ﻓﺸﺎر ﻣﺠﺎز ﺑﻪ ﺗﺮﺗﯿﺐ 30 و 60 ﻣﺘﺮ در ﻧﻈﺮ ﮔﺮﻓﺘﻪ ﺷﺪهاﻧﺪ، ﻧﯿﺰ ﺑﻪ اﯾﻦ ﺗﺎﺑﻊ اﻓﺰوده ﺷﺪ و ﺑﺮﻧﺎﻣﻪ ﻣﺠﺪدا ﺑﺎ ﺗﻌﺪاد ﺗﮑﺮارﻫﺎﯾﯽ ﮐﻪ ﺑﻪ ﺑﻬﺘﺮﯾﻦ ﺟﻮاب ﺧﺘﻢ ﺷﻮد، اﺟﺮا ﮔﺮدﯾﺪ. ﻧﺘﺎﯾﺞ ﻧﺸﺎن داد اﯾﻦ اﻟﮕﻮرﯾﺘﻢﻫﺎ ﺗﻮاﻧﺎﯾﯽ ﺑﺎﻻﯾﯽ در ﯾﺎﻓﺘﻦ ﺟﻮابﻫﺎي ﺑﻬﯿﻨﻪ دارﻧﺪ. در اﯾﻦ اﻟﮕﻮرﯾﺘﻢﻫﺎ، در ﻧﻈﺮ ﮔﺮﻓﺘﻦ ﻫﺰﯾﻨﻪ ﺗﻌﺪي از ﺣﺪود ﻣﺠﺎز ﻓﺸﺎر ﺳﺒﺐ ﻣﯽﺷﻮد، ﺑﻬﺘﺮﯾﻦ ﺟﻮاﺑﯽ ﮐﻪ ﺗﺎ ﺑﻪ ﺣﺎل ﺳﺎﯾﺮ ﻣﺤﻘﻘﯿﻦ ﺑﺮاي ﺷﺒﮑﻪﻫﺎي ﻧﻤﻮﻧﻪ ﺑﻪدﺳﺖ آوردهاﻧﺪ، ﮐﻪ ﺑﺮاي ﺷﺒﮑﻪ دو ﺣﻠﻘﻪاي و ﻻﻧﺴﯽ ﺑﻪ ﺗﺮﺗﯿﺐ، ﻫﺰﯾﻨﻪ 419000 و 1069393 دﻻر و ﮐﻤﺒﻮد ﻓﺸﺎر ﺻﻔﺮ ﺑﻮد، ﺣﺎﺻﻞ ﺷﻮد و ﺑﺎ ﺗﻌﺪاد ﺗﮑﺮار ﭘﺎﯾﯿﻦ، در ﺷﺒﮑﻪ دو ﺣﻠﻘﻪاي ﺑﺮاي ﻫﺮ دو اﻟﮕﻮرﯾﺘﻢ ﺑﺎ 20 ﺗﮑﺮار و در ﺷﺒﮑﻪ ﻻﻧﺴﯽ ﺑﺮاي اﻟﮕﻮرﯾﺘﻢﻫﺎي PESA-II و SPEA-II ﺑﻪ ﺗﺮﺗﯿﺐ ﺑﺎ 200 و 140 ﺗﮑﺮار، ﺑﻪ ﺗﻌﺪاد ﺟﻮاب ﺑﻬﯿﻨﻪ ﺑﯿﺸﺘﺮي دﺳﺖ ﭘﯿﺪا ﮐﻨﯿﻢ و زﻣﺎن رﺳﯿﺪن ﺑﻪ ﻫﻤﮕﺮاﯾﯽ ﺑﻪ ﻃﻮر ﻗﺎﺑﻞ ﺗﻮﺟﻬﯽ ﮐﺎﻫﺶ ﯾﺎﺑﺪ، ﺑﻪﻃﻮريﮐﻪ در ﺷﺒﮑﻪ دو ﺣﻠﻘﻪاي، زﻣﺎن اﺟﺮاي اﻟﮕﻮرﯾﺘﻢﻫﺎي PESA-II و SPEA-II ﺑﻪ ﺗﺮﺗﯿﺐ 0/55 و 0/59 دﻗﯿﻘﻪ و در ﺷﺒﮑﻪ ﻻﻧﺴﯽ ﺑﻪ ﺗﺮﺗﯿﺐ 8/1 و 7/4 دﻗﯿﻘﻪ ﺑﻮد.
چكيده لاتين :
As for the severe limitation of water resources, costly construction and operation of water supply systems and rapid population growth, the optimal design of these networks is essential. The problem of cost minimization is done by minimizing the diameter of the network pipes, which reduces the pressure in the network. Since providing adequate pressure in the nodes is one of the important design principles, so in this study, the problem of optimization in several sample networks was defined with the objectives of minimizing the cost and lack of pressure in the whole network. EPANET software was used for hydraulic analysis of sample networks and the multi-objective optimization process through coding of PESA-II and SPEA-II algorithms in MATLAB software and their connection to EPANET face Took. The cost function was initially defined only by considering the relationship between cost, diameter, and pipe length. Then, in the next definition, the cost of exceeding the allowable pressure range, where the minimum and maximum allowable pressures are 30 and 60 meters, respectively, was added to this function, and the program again with the number of repetitions that ended in the best answer Was implemented. The results showed that these algorithms have a high ability to find optimal solutions. In these algorithms, considering the cost of exceeding the allowable pressure limits results in the best answer that other researchers have ever obtained for sample networks, which for the two-loop and lansey network, The cost was 419000 and 1069393 $ respectively, and the pressure shortage was zero and with a low number of iterations, in the two-loop network for both algorithms with 20 iterations and in the lansey network for PESA-II and SPEA-II algorithms with 200 and 140 iterations respectively, to achieve a higher number of optimal answers and the time to achieve convergence is significantly reduced, so that in the two-loop network, the execution time of PESA-II and SPEA-II algorithms are 0.55 and 0.59 minutes respectively, and in the lansey network It was 1/8 and 7.4 minutes respectively.
