Optimization of water network using big bang-big crunch algorithm
Clicks: 4
ID: 284955
2012
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
0.9
/100
4 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #334 of 3,757 articles by views in Malay Journal
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 3,757 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Recycling water in industrial plants has become necessary to minimize treatment cost and freshwater purchase expenses. Mathematical programming was used to solve water network optimization problems to find minimum water consumption or minimum wastewater generation. The purpose of this study was to develop a procedure to design water treatment and reuse networks using Erol and Eksins Big Bang-Big Crunch (BB-BC) algorithm. Another aim was to investigate the convergence characteristic and efficiency of the algorithm. Five case studies were used to test the performance of the BB-BC. The parameters that were varied were step size function, factor and penalty weights, resulting in fifteen configurations. Lowering the parameter value of the step size function was found to create near optimal and consistent solutions in all case studies. However, increasing the penalty function weight reduced convergence time while decreasing the factor has obtained low standard deviation. The configuration which has a step size value of 0.01, factor of 0.99 and a penalty weight of 100 was found to generate near optimal and consistent solutions in all case studies. This configuration has achieved the lowest convergence point at less than 200 iterations, lowest standard deviation and obtained the nearest flow rate value with the correction solution The BB-BC algorithm at configuration of step size = 0.01, = 0.99 and penalty weight = 100 also outperformed Pikaia, a public-domain genetic algorithm code, in all case studies.
| Reference Key |
persistent_1760654191_68f1736f70f35
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Bautista, Rena Angela Sanchez |
| Journal | Malay Journal |
| Year | 2012 |
| DOI |
DOI not found
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.