Loading…
Developing a Bi-Level Optimization Model for the Coupled Street Network and Land Subdivision Design Problem with Various Lot Areas in Irregular Blocks
Street design and land subdivision are significant tasks in the development and redevelopment planning process. Optimizing street and land subdivision layouts within a unified framework to achieve solutions that meet a set of objectives and constraints (e.g., minimizing parcel area deviation from st...
Saved in:
Published in: | ISPRS international journal of geo-information 2024-07, Vol.13 (7), p.224 |
---|---|
Main Authors: | , |
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!
|
Summary: | Street design and land subdivision are significant tasks in the development and redevelopment planning process. Optimizing street and land subdivision layouts within a unified framework to achieve solutions that meet a set of objectives and constraints (e.g., minimizing parcel area deviation from standard values, minimizing land consumption for street construction, etc.) is a critical concern for planners, particularly in complex contexts such as blocks with irregular shapes and parcels of varying sizes and requirements. To address this challenge, a mathematical formulation is presented for the bi-level street network and land subdivision optimization problem. Subsequently, the solution procedure is outlined, which utilizes a genetic-based algorithm for street design and a memetic–genetic-based algorithm for land subdivision. Finally, two cases are presented, solved, and discussed to analyze and verify the proposed mathematical model and solution procedures. The results suggest that the formulated problem is suitable for addressing the coupled street network and land subdivision design problem, and it can be adapted and extended to other case studies. Additionally, the introduced ideas and algorithms satisfactorily solved the stated problem. |
---|---|
ISSN: | 2220-9964 2220-9964 |
DOI: | 10.3390/ijgi13070224 |