Abstract
This study aims to create a cost function for residential subdivisions based on three key variables: population density, area, and slope. The cost function was developed by minimizing the capital cost of representative residential water distribution networks through a genetic algorithm and a heuristic search method known as the greedy algorithm. To test the proposed cost function and determine if a more efficient design would reduce cost, two subdivisions in Tucson, Arizona, were compared to an equivalent theoretical oblong network. The greedy algorithm required a fraction of the time demanded by the genetic algorithm and arrived at subdivision network costs that were consistently equal to or lower than the best solutions found by the genetic algorithm. Both optimization methods obtained results indicating that area has the greatest effect on cost and that the effect of population density is negligible when dealing with small areas.
Original language | English (US) |
---|---|
Pages (from-to) | 145-153 |
Number of pages | 9 |
Journal | Urban Water Journal |
Volume | 12 |
Issue number | 2 |
DOIs | |
State | Published - Feb 17 2015 |
Keywords
- genetic algorithm
- greedy algorithm
- heuristics
- optimization
- residential subdivisions
ASJC Scopus subject areas
- Geography, Planning and Development
- Water Science and Technology