Loading…

Optimal pipe-sizing design of water distribution networks using modified Rao-II algorithm

Several evolutionary algorithms (EAs) have been suggested in the last three decades for the least-cost design of water distribution networks (WDNs). EAs generally worked well to identify the global/near-global optimal solutions for small- to moderate-size networks in a reasonable time and computatio...

Full description

Saved in:
Bibliographic Details
Published in:Journal of water and climate change 2024-08, Vol.15 (8), p.3775-3791
Main Authors: Gangwani, Laxmi, Palod, Nikita, Dongre, Shilpa, Gupta, Rajesh
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c150t-c2ebf8d7eef45630173bad7ecececb73d20f56979a07ba808c8a6294262f38c43
container_end_page 3791
container_issue 8
container_start_page 3775
container_title Journal of water and climate change
container_volume 15
creator Gangwani, Laxmi
Palod, Nikita
Dongre, Shilpa
Gupta, Rajesh
description Several evolutionary algorithms (EAs) have been suggested in the last three decades for the least-cost design of water distribution networks (WDNs). EAs generally worked well to identify the global/near-global optimal solutions for small- to moderate-size networks in a reasonable time and computational effort. However, their applications to large-size networks are still challenging due to large computational effort. Recent developments in EAs are towards parameter-less techniques that avoid fine-tuning of case-specific parameters to reduce the computational effort. Further, several self-adaptive penalties and search-space reduction methodologies have been suggested to reduce the computational effort. A fast, efficient, and parameter-less Rao-II algorithm has been used earlier with penalty-based approaches for the optimal design of WDNs. In this study, the application of a Rao-II algorithm is further explored with three self-adaptive penalty approaches to compare the convergence characteristics. The Rao-II algorithm is observed to converge at an infeasible solution in cases that the applied penalty to an infeasible solution is not so substantial to make it inferior to the feasible solutions. Modifications are suggested to improve the Rao-II algorithm, named the modified Rao-II algorithm. The modified Rao-II algorithm with the self-adaptive penalty methods resulted in better solutions than those obtained earlier.
doi_str_mv 10.2166/wcc.2024.055
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3102929648</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3102929648</sourcerecordid><originalsourceid>FETCH-LOGICAL-c150t-c2ebf8d7eef45630173bad7ecececb73d20f56979a07ba808c8a6294262f38c43</originalsourceid><addsrcrecordid>eNotkEtLAzEQgIMoWLQ3f0DAq1tn89jNHqX4KBQKogdPIZtNamq7WZMsRX-9WerMYWbgY4b5ELopYUHKqro_ar0gQNgCOD9DM8JAFA3l7Dz3wKAghLFLNI9xBzk4byiIGfrYDMkd1B4PbjBFdL-u3-LORLftsbf4qJIJuHMxBdeOyfke9yYdffiKeIwTe_Cds850-FX5YrXCar_1waXPwzW6sGofzfy_XqH3p8e35Uux3jyvlg_rQpccUqGJaa3oamMs4xWFsqatyqOesq1pR8DyqqkbBXWrBAgtVEUaRipiqdCMXqHb094h-O_RxCR3fgx9PilpCaQhTcVEpu5OlA4-xmCsHEL-O_zIEuTkT2Z_cvInsxv6B_uyZBs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3102929648</pqid></control><display><type>article</type><title>Optimal pipe-sizing design of water distribution networks using modified Rao-II algorithm</title><source>Alma/SFX Local Collection</source><creator>Gangwani, Laxmi ; Palod, Nikita ; Dongre, Shilpa ; Gupta, Rajesh</creator><creatorcontrib>Gangwani, Laxmi ; Palod, Nikita ; Dongre, Shilpa ; Gupta, Rajesh</creatorcontrib><description>Several evolutionary algorithms (EAs) have been suggested in the last three decades for the least-cost design of water distribution networks (WDNs). EAs generally worked well to identify the global/near-global optimal solutions for small- to moderate-size networks in a reasonable time and computational effort. However, their applications to large-size networks are still challenging due to large computational effort. Recent developments in EAs are towards parameter-less techniques that avoid fine-tuning of case-specific parameters to reduce the computational effort. Further, several self-adaptive penalties and search-space reduction methodologies have been suggested to reduce the computational effort. A fast, efficient, and parameter-less Rao-II algorithm has been used earlier with penalty-based approaches for the optimal design of WDNs. In this study, the application of a Rao-II algorithm is further explored with three self-adaptive penalty approaches to compare the convergence characteristics. The Rao-II algorithm is observed to converge at an infeasible solution in cases that the applied penalty to an infeasible solution is not so substantial to make it inferior to the feasible solutions. Modifications are suggested to improve the Rao-II algorithm, named the modified Rao-II algorithm. The modified Rao-II algorithm with the self-adaptive penalty methods resulted in better solutions than those obtained earlier.</description><identifier>ISSN: 2040-2244</identifier><identifier>EISSN: 2408-9354</identifier><identifier>DOI: 10.2166/wcc.2024.055</identifier><language>eng</language><publisher>London: IWA Publishing</publisher><subject>Adaptive algorithms ; Algorithms ; Computer applications ; Critical path ; Design ; Design optimization ; Evolutionary algorithms ; Genetic algorithms ; Linear programming ; Mathematical programming ; Networks ; Parameter identification ; Parameter modification ; Water distribution ; Water engineering</subject><ispartof>Journal of water and climate change, 2024-08, Vol.15 (8), p.3775-3791</ispartof><rights>Copyright IWA Publishing 2024</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c150t-c2ebf8d7eef45630173bad7ecececb73d20f56979a07ba808c8a6294262f38c43</cites><orcidid>0000-0002-4129-1671 ; 0000-0002-8955-2375 ; 0000-0002-6098-0595 ; 0009-0000-2979-6872</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Gangwani, Laxmi</creatorcontrib><creatorcontrib>Palod, Nikita</creatorcontrib><creatorcontrib>Dongre, Shilpa</creatorcontrib><creatorcontrib>Gupta, Rajesh</creatorcontrib><title>Optimal pipe-sizing design of water distribution networks using modified Rao-II algorithm</title><title>Journal of water and climate change</title><description>Several evolutionary algorithms (EAs) have been suggested in the last three decades for the least-cost design of water distribution networks (WDNs). EAs generally worked well to identify the global/near-global optimal solutions for small- to moderate-size networks in a reasonable time and computational effort. However, their applications to large-size networks are still challenging due to large computational effort. Recent developments in EAs are towards parameter-less techniques that avoid fine-tuning of case-specific parameters to reduce the computational effort. Further, several self-adaptive penalties and search-space reduction methodologies have been suggested to reduce the computational effort. A fast, efficient, and parameter-less Rao-II algorithm has been used earlier with penalty-based approaches for the optimal design of WDNs. In this study, the application of a Rao-II algorithm is further explored with three self-adaptive penalty approaches to compare the convergence characteristics. The Rao-II algorithm is observed to converge at an infeasible solution in cases that the applied penalty to an infeasible solution is not so substantial to make it inferior to the feasible solutions. Modifications are suggested to improve the Rao-II algorithm, named the modified Rao-II algorithm. The modified Rao-II algorithm with the self-adaptive penalty methods resulted in better solutions than those obtained earlier.</description><subject>Adaptive algorithms</subject><subject>Algorithms</subject><subject>Computer applications</subject><subject>Critical path</subject><subject>Design</subject><subject>Design optimization</subject><subject>Evolutionary algorithms</subject><subject>Genetic algorithms</subject><subject>Linear programming</subject><subject>Mathematical programming</subject><subject>Networks</subject><subject>Parameter identification</subject><subject>Parameter modification</subject><subject>Water distribution</subject><subject>Water engineering</subject><issn>2040-2244</issn><issn>2408-9354</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNotkEtLAzEQgIMoWLQ3f0DAq1tn89jNHqX4KBQKogdPIZtNamq7WZMsRX-9WerMYWbgY4b5ELopYUHKqro_ar0gQNgCOD9DM8JAFA3l7Dz3wKAghLFLNI9xBzk4byiIGfrYDMkd1B4PbjBFdL-u3-LORLftsbf4qJIJuHMxBdeOyfke9yYdffiKeIwTe_Cds850-FX5YrXCar_1waXPwzW6sGofzfy_XqH3p8e35Uux3jyvlg_rQpccUqGJaa3oamMs4xWFsqatyqOesq1pR8DyqqkbBXWrBAgtVEUaRipiqdCMXqHb094h-O_RxCR3fgx9PilpCaQhTcVEpu5OlA4-xmCsHEL-O_zIEuTkT2Z_cvInsxv6B_uyZBs</recordid><startdate>20240801</startdate><enddate>20240801</enddate><creator>Gangwani, Laxmi</creator><creator>Palod, Nikita</creator><creator>Dongre, Shilpa</creator><creator>Gupta, Rajesh</creator><general>IWA Publishing</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7QH</scope><scope>7TG</scope><scope>7UA</scope><scope>C1K</scope><scope>F1W</scope><scope>H97</scope><scope>KL.</scope><scope>L.G</scope><orcidid>https://orcid.org/0000-0002-4129-1671</orcidid><orcidid>https://orcid.org/0000-0002-8955-2375</orcidid><orcidid>https://orcid.org/0000-0002-6098-0595</orcidid><orcidid>https://orcid.org/0009-0000-2979-6872</orcidid></search><sort><creationdate>20240801</creationdate><title>Optimal pipe-sizing design of water distribution networks using modified Rao-II algorithm</title><author>Gangwani, Laxmi ; Palod, Nikita ; Dongre, Shilpa ; Gupta, Rajesh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c150t-c2ebf8d7eef45630173bad7ecececb73d20f56979a07ba808c8a6294262f38c43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Adaptive algorithms</topic><topic>Algorithms</topic><topic>Computer applications</topic><topic>Critical path</topic><topic>Design</topic><topic>Design optimization</topic><topic>Evolutionary algorithms</topic><topic>Genetic algorithms</topic><topic>Linear programming</topic><topic>Mathematical programming</topic><topic>Networks</topic><topic>Parameter identification</topic><topic>Parameter modification</topic><topic>Water distribution</topic><topic>Water engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gangwani, Laxmi</creatorcontrib><creatorcontrib>Palod, Nikita</creatorcontrib><creatorcontrib>Dongre, Shilpa</creatorcontrib><creatorcontrib>Gupta, Rajesh</creatorcontrib><collection>CrossRef</collection><collection>Aqualine</collection><collection>Meteorological &amp; Geoastrophysical Abstracts</collection><collection>Water Resources Abstracts</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ASFA: Aquatic Sciences and Fisheries Abstracts</collection><collection>Aquatic Science &amp; Fisheries Abstracts (ASFA) 3: Aquatic Pollution &amp; Environmental Quality</collection><collection>Meteorological &amp; Geoastrophysical Abstracts - Academic</collection><collection>Aquatic Science &amp; Fisheries Abstracts (ASFA) Professional</collection><jtitle>Journal of water and climate change</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gangwani, Laxmi</au><au>Palod, Nikita</au><au>Dongre, Shilpa</au><au>Gupta, Rajesh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal pipe-sizing design of water distribution networks using modified Rao-II algorithm</atitle><jtitle>Journal of water and climate change</jtitle><date>2024-08-01</date><risdate>2024</risdate><volume>15</volume><issue>8</issue><spage>3775</spage><epage>3791</epage><pages>3775-3791</pages><issn>2040-2244</issn><eissn>2408-9354</eissn><abstract>Several evolutionary algorithms (EAs) have been suggested in the last three decades for the least-cost design of water distribution networks (WDNs). EAs generally worked well to identify the global/near-global optimal solutions for small- to moderate-size networks in a reasonable time and computational effort. However, their applications to large-size networks are still challenging due to large computational effort. Recent developments in EAs are towards parameter-less techniques that avoid fine-tuning of case-specific parameters to reduce the computational effort. Further, several self-adaptive penalties and search-space reduction methodologies have been suggested to reduce the computational effort. A fast, efficient, and parameter-less Rao-II algorithm has been used earlier with penalty-based approaches for the optimal design of WDNs. In this study, the application of a Rao-II algorithm is further explored with three self-adaptive penalty approaches to compare the convergence characteristics. The Rao-II algorithm is observed to converge at an infeasible solution in cases that the applied penalty to an infeasible solution is not so substantial to make it inferior to the feasible solutions. Modifications are suggested to improve the Rao-II algorithm, named the modified Rao-II algorithm. The modified Rao-II algorithm with the self-adaptive penalty methods resulted in better solutions than those obtained earlier.</abstract><cop>London</cop><pub>IWA Publishing</pub><doi>10.2166/wcc.2024.055</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0002-4129-1671</orcidid><orcidid>https://orcid.org/0000-0002-8955-2375</orcidid><orcidid>https://orcid.org/0000-0002-6098-0595</orcidid><orcidid>https://orcid.org/0009-0000-2979-6872</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 2040-2244
ispartof Journal of water and climate change, 2024-08, Vol.15 (8), p.3775-3791
issn 2040-2244
2408-9354
language eng
recordid cdi_proquest_journals_3102929648
source Alma/SFX Local Collection
subjects Adaptive algorithms
Algorithms
Computer applications
Critical path
Design
Design optimization
Evolutionary algorithms
Genetic algorithms
Linear programming
Mathematical programming
Networks
Parameter identification
Parameter modification
Water distribution
Water engineering
title Optimal pipe-sizing design of water distribution networks using modified Rao-II algorithm
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T20%3A47%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20pipe-sizing%20design%20of%20water%20distribution%20networks%20using%20modified%20Rao-II%20algorithm&rft.jtitle=Journal%20of%20water%20and%20climate%20change&rft.au=Gangwani,%20Laxmi&rft.date=2024-08-01&rft.volume=15&rft.issue=8&rft.spage=3775&rft.epage=3791&rft.pages=3775-3791&rft.issn=2040-2244&rft.eissn=2408-9354&rft_id=info:doi/10.2166/wcc.2024.055&rft_dat=%3Cproquest_cross%3E3102929648%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c150t-c2ebf8d7eef45630173bad7ecececb73d20f56979a07ba808c8a6294262f38c43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3102929648&rft_id=info:pmid/&rfr_iscdi=true