Application of two ant colony optimisation algorithms to water distribution system optimisation

Water distribution systems (WDSs) are costly infrastructure in terms of materials, construction, maintenance, and energy requirements. Much attention has been given to the application of optimisation methods to minimise the costs associated with such infrastructure. Historically, traditional optimis...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical and computer modelling 2006-09, Vol.44 (5), p.451-468
Hauptverfasser: Zecchin, Aaron C., Simpson, Angus R., Maier, Holger R., Leonard, Michael, Roberts, Andrew J., Berrisford, Matthew J.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 468
container_issue 5
container_start_page 451
container_title Mathematical and computer modelling
container_volume 44
creator Zecchin, Aaron C.
Simpson, Angus R.
Maier, Holger R.
Leonard, Michael
Roberts, Andrew J.
Berrisford, Matthew J.
description Water distribution systems (WDSs) are costly infrastructure in terms of materials, construction, maintenance, and energy requirements. Much attention has been given to the application of optimisation methods to minimise the costs associated with such infrastructure. Historically, traditional optimisation techniques have been used, such as linear and non-linear programming, but within the past decade the focus has shifted to the use of heuristics derived from nature (HDNs), for example Genetic Algorithms, Simulated Annealing and more recently Ant Colony Optimisation (ACO). ACO, as an optimisation process, is based on the analogy of the foraging behaviour of a colony of searching ants, and their ability to determine the shortest route between their nest and a food source. Many different formulations of ACO algorithms exist that are aimed at providing advancements on the original and most basic formulation, Ant System (AS). These advancements differ in their utilisation of information learned about a search-space to manage two conflicting aspects of an algorithm’s searching behaviour. These aspects are termed ‘exploration’ and ‘exploitation’. Exploration is an algorithm’s ability to search broadly through the problem’s search space and exploitation is an algorithm’s ability to search locally around good solutions that have been found previously. One such advanced ACO algorithm, which is implemented within this paper, is the Max-Min Ant System (MMAS). This algorithm encourages local searching around the best solution found in each iteration, while implementing methods that slow convergence and facilitate exploration. In this paper, the performance of MMAS is compared to that of AS for two commonly used WDS case studies, the New York Tunnels Problem and the Hanoi Problem. The sophistication of MMAS is shown to be effective as it outperforms AS and performs better than any other HDN in the literature for both case studies considered.
doi_str_mv 10.1016/j.mcm.2006.01.005
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29497278</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0895717706000069</els_id><sourcerecordid>29497278</sourcerecordid><originalsourceid>FETCH-LOGICAL-c371t-e03f2faee2929a7451ac7f8b116bc599e64cf138cc441aa98004fc4426f230353</originalsourceid><addsrcrecordid>eNp9kD1PwzAQhi0EEqXwA9g8sSWcnQ_HYqoqvqRKLDBbrnsGV0kcbJeq_56UsLAw3Un3Pqe7h5BrBjkDVt9u8850OQeoc2A5QHVCZqwRPJOlkKdkBo2sMsGEOCcXMW5hTEhoZkQthqF1Rifne-otTXtPdZ-o8a3vD9QPyXUuTmPdvvvg0kcXafJ0rxMGunExBbfe_QTiISbs_kCX5MzqNuLVb52Tt4f71-VTtnp5fF4uVpkpBEsZQmG51YhccqlFWTFthG3WjNVrU0mJdWksKxpjypJpLRuA0o49ry0voKiKObmZ9g7Bf-4wJjVeYLBtdY9-FxWXpRRcNGOQTUETfIwBrRqC63Q4KAbqqFJt1ahSHVUqYGoUNTJ3E4PjB18Og4rGYW9w4wKapDbe_UN_Ax_Hfo0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29497278</pqid></control><display><type>article</type><title>Application of two ant colony optimisation algorithms to water distribution system optimisation</title><source>Elsevier ScienceDirect Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Zecchin, Aaron C. ; Simpson, Angus R. ; Maier, Holger R. ; Leonard, Michael ; Roberts, Andrew J. ; Berrisford, Matthew J.</creator><creatorcontrib>Zecchin, Aaron C. ; Simpson, Angus R. ; Maier, Holger R. ; Leonard, Michael ; Roberts, Andrew J. ; Berrisford, Matthew J.</creatorcontrib><description>Water distribution systems (WDSs) are costly infrastructure in terms of materials, construction, maintenance, and energy requirements. Much attention has been given to the application of optimisation methods to minimise the costs associated with such infrastructure. Historically, traditional optimisation techniques have been used, such as linear and non-linear programming, but within the past decade the focus has shifted to the use of heuristics derived from nature (HDNs), for example Genetic Algorithms, Simulated Annealing and more recently Ant Colony Optimisation (ACO). ACO, as an optimisation process, is based on the analogy of the foraging behaviour of a colony of searching ants, and their ability to determine the shortest route between their nest and a food source. Many different formulations of ACO algorithms exist that are aimed at providing advancements on the original and most basic formulation, Ant System (AS). These advancements differ in their utilisation of information learned about a search-space to manage two conflicting aspects of an algorithm’s searching behaviour. These aspects are termed ‘exploration’ and ‘exploitation’. Exploration is an algorithm’s ability to search broadly through the problem’s search space and exploitation is an algorithm’s ability to search locally around good solutions that have been found previously. One such advanced ACO algorithm, which is implemented within this paper, is the Max-Min Ant System (MMAS). This algorithm encourages local searching around the best solution found in each iteration, while implementing methods that slow convergence and facilitate exploration. In this paper, the performance of MMAS is compared to that of AS for two commonly used WDS case studies, the New York Tunnels Problem and the Hanoi Problem. The sophistication of MMAS is shown to be effective as it outperforms AS and performs better than any other HDN in the literature for both case studies considered.</description><identifier>ISSN: 0895-7177</identifier><identifier>EISSN: 1872-9479</identifier><identifier>DOI: 10.1016/j.mcm.2006.01.005</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Ant colony optimisation ; Heuristics derived from nature ; Optimisation ; Water distribution systems</subject><ispartof>Mathematical and computer modelling, 2006-09, Vol.44 (5), p.451-468</ispartof><rights>2005 Elsevier Ltd</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c371t-e03f2faee2929a7451ac7f8b116bc599e64cf138cc441aa98004fc4426f230353</citedby><cites>FETCH-LOGICAL-c371t-e03f2faee2929a7451ac7f8b116bc599e64cf138cc441aa98004fc4426f230353</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0895717706000069$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65534</link.rule.ids></links><search><creatorcontrib>Zecchin, Aaron C.</creatorcontrib><creatorcontrib>Simpson, Angus R.</creatorcontrib><creatorcontrib>Maier, Holger R.</creatorcontrib><creatorcontrib>Leonard, Michael</creatorcontrib><creatorcontrib>Roberts, Andrew J.</creatorcontrib><creatorcontrib>Berrisford, Matthew J.</creatorcontrib><title>Application of two ant colony optimisation algorithms to water distribution system optimisation</title><title>Mathematical and computer modelling</title><description>Water distribution systems (WDSs) are costly infrastructure in terms of materials, construction, maintenance, and energy requirements. Much attention has been given to the application of optimisation methods to minimise the costs associated with such infrastructure. Historically, traditional optimisation techniques have been used, such as linear and non-linear programming, but within the past decade the focus has shifted to the use of heuristics derived from nature (HDNs), for example Genetic Algorithms, Simulated Annealing and more recently Ant Colony Optimisation (ACO). ACO, as an optimisation process, is based on the analogy of the foraging behaviour of a colony of searching ants, and their ability to determine the shortest route between their nest and a food source. Many different formulations of ACO algorithms exist that are aimed at providing advancements on the original and most basic formulation, Ant System (AS). These advancements differ in their utilisation of information learned about a search-space to manage two conflicting aspects of an algorithm’s searching behaviour. These aspects are termed ‘exploration’ and ‘exploitation’. Exploration is an algorithm’s ability to search broadly through the problem’s search space and exploitation is an algorithm’s ability to search locally around good solutions that have been found previously. One such advanced ACO algorithm, which is implemented within this paper, is the Max-Min Ant System (MMAS). This algorithm encourages local searching around the best solution found in each iteration, while implementing methods that slow convergence and facilitate exploration. In this paper, the performance of MMAS is compared to that of AS for two commonly used WDS case studies, the New York Tunnels Problem and the Hanoi Problem. The sophistication of MMAS is shown to be effective as it outperforms AS and performs better than any other HDN in the literature for both case studies considered.</description><subject>Ant colony optimisation</subject><subject>Heuristics derived from nature</subject><subject>Optimisation</subject><subject>Water distribution systems</subject><issn>0895-7177</issn><issn>1872-9479</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNp9kD1PwzAQhi0EEqXwA9g8sSWcnQ_HYqoqvqRKLDBbrnsGV0kcbJeq_56UsLAw3Un3Pqe7h5BrBjkDVt9u8850OQeoc2A5QHVCZqwRPJOlkKdkBo2sMsGEOCcXMW5hTEhoZkQthqF1Rifne-otTXtPdZ-o8a3vD9QPyXUuTmPdvvvg0kcXafJ0rxMGunExBbfe_QTiISbs_kCX5MzqNuLVb52Tt4f71-VTtnp5fF4uVpkpBEsZQmG51YhccqlFWTFthG3WjNVrU0mJdWksKxpjypJpLRuA0o49ry0voKiKObmZ9g7Bf-4wJjVeYLBtdY9-FxWXpRRcNGOQTUETfIwBrRqC63Q4KAbqqFJt1ahSHVUqYGoUNTJ3E4PjB18Og4rGYW9w4wKapDbe_UN_Ax_Hfo0</recordid><startdate>20060901</startdate><enddate>20060901</enddate><creator>Zecchin, Aaron C.</creator><creator>Simpson, Angus R.</creator><creator>Maier, Holger R.</creator><creator>Leonard, Michael</creator><creator>Roberts, Andrew J.</creator><creator>Berrisford, Matthew J.</creator><general>Elsevier Ltd</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20060901</creationdate><title>Application of two ant colony optimisation algorithms to water distribution system optimisation</title><author>Zecchin, Aaron C. ; Simpson, Angus R. ; Maier, Holger R. ; Leonard, Michael ; Roberts, Andrew J. ; Berrisford, Matthew J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c371t-e03f2faee2929a7451ac7f8b116bc599e64cf138cc441aa98004fc4426f230353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Ant colony optimisation</topic><topic>Heuristics derived from nature</topic><topic>Optimisation</topic><topic>Water distribution systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zecchin, Aaron C.</creatorcontrib><creatorcontrib>Simpson, Angus R.</creatorcontrib><creatorcontrib>Maier, Holger R.</creatorcontrib><creatorcontrib>Leonard, Michael</creatorcontrib><creatorcontrib>Roberts, Andrew J.</creatorcontrib><creatorcontrib>Berrisford, Matthew J.</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Mathematical and computer modelling</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zecchin, Aaron C.</au><au>Simpson, Angus R.</au><au>Maier, Holger R.</au><au>Leonard, Michael</au><au>Roberts, Andrew J.</au><au>Berrisford, Matthew J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Application of two ant colony optimisation algorithms to water distribution system optimisation</atitle><jtitle>Mathematical and computer modelling</jtitle><date>2006-09-01</date><risdate>2006</risdate><volume>44</volume><issue>5</issue><spage>451</spage><epage>468</epage><pages>451-468</pages><issn>0895-7177</issn><eissn>1872-9479</eissn><abstract>Water distribution systems (WDSs) are costly infrastructure in terms of materials, construction, maintenance, and energy requirements. Much attention has been given to the application of optimisation methods to minimise the costs associated with such infrastructure. Historically, traditional optimisation techniques have been used, such as linear and non-linear programming, but within the past decade the focus has shifted to the use of heuristics derived from nature (HDNs), for example Genetic Algorithms, Simulated Annealing and more recently Ant Colony Optimisation (ACO). ACO, as an optimisation process, is based on the analogy of the foraging behaviour of a colony of searching ants, and their ability to determine the shortest route between their nest and a food source. Many different formulations of ACO algorithms exist that are aimed at providing advancements on the original and most basic formulation, Ant System (AS). These advancements differ in their utilisation of information learned about a search-space to manage two conflicting aspects of an algorithm’s searching behaviour. These aspects are termed ‘exploration’ and ‘exploitation’. Exploration is an algorithm’s ability to search broadly through the problem’s search space and exploitation is an algorithm’s ability to search locally around good solutions that have been found previously. One such advanced ACO algorithm, which is implemented within this paper, is the Max-Min Ant System (MMAS). This algorithm encourages local searching around the best solution found in each iteration, while implementing methods that slow convergence and facilitate exploration. In this paper, the performance of MMAS is compared to that of AS for two commonly used WDS case studies, the New York Tunnels Problem and the Hanoi Problem. The sophistication of MMAS is shown to be effective as it outperforms AS and performs better than any other HDN in the literature for both case studies considered.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.mcm.2006.01.005</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0895-7177
ispartof Mathematical and computer modelling, 2006-09, Vol.44 (5), p.451-468
issn 0895-7177
1872-9479
language eng
recordid cdi_proquest_miscellaneous_29497278
source Elsevier ScienceDirect Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Ant colony optimisation
Heuristics derived from nature
Optimisation
Water distribution systems
title Application of two ant colony optimisation algorithms to water distribution system optimisation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T23%3A55%3A28IST&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=Application%20of%20two%20ant%20colony%20optimisation%20algorithms%20to%20water%20distribution%20system%20optimisation&rft.jtitle=Mathematical%20and%20computer%20modelling&rft.au=Zecchin,%20Aaron%20C.&rft.date=2006-09-01&rft.volume=44&rft.issue=5&rft.spage=451&rft.epage=468&rft.pages=451-468&rft.issn=0895-7177&rft.eissn=1872-9479&rft_id=info:doi/10.1016/j.mcm.2006.01.005&rft_dat=%3Cproquest_cross%3E29497278%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=29497278&rft_id=info:pmid/&rft_els_id=S0895717706000069&rfr_iscdi=true