Achieving Residential Connectivity and Density Goals with Computer-Generated Plans in a Greenfield Area

Yuchao Sun, Min Qiu and John Taplin

Environment and Planning B, 2014, vol. 41, issue 3, 430-449

Abstract: An algorithm has been developed to generate, without external intervention, a road and land-use plan for a regular or irregular site. It starts from an ‘embryo’ and grows a plan rather than trying to modify an initial solution. The basic modules are universal building blocks which change and adapt in a guided search with random selection of branching points followed by operations to add links or make connections. Deletion operators guide development by removing branches which do not improve the outcome. A hypothetical application, maximizing combined everyone-to-everyone connectivity and dwelling density, has evolved a highly interconnected street plan. However, no step is specific to the example; the operators will grow a road and land-use network under various specifications and constraints guided by an objective function. Making the process applicable to an actual development might require more constraints and certainly an enlarged objective function. Cost and other goals can be included so long as each goal is functionally related in some way to every change in the plan made by the search procedure.

Keywords: residential plan; optimize growth; module; operators; flexibility (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b38114 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:41:y:2014:i:3:p:430-449

DOI: 10.1068/b38114

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().