A Zero-One Integer-Programming Formulation of the Problem of Land-Use Assignment and Transportation-Network Design

J MacGregor Smith and Judith S Liebman

Environment and Planning B, 1978, vol. 5, issue 1, 101-115

Abstract: A zero-one integer-programming formulation of the simultaneous optimization of the problems of land-use assignment and transportation-network design is presented. The problem is modeled through a set-partitioning approach and incorporates a multiple-criteria objective function, appropriate upper- and lower-bound constraints on area assignments, and construction costs. A simple example and a more complicated urban-design case study are included to demonstrate the viability of this approach in solving the simultaneous-optimization problem. As a secondary benefit, this set-partitioning model can be reformulated as an integer, generalized-network, flow problem for which new efficient computer codes, capable of solving networks with thousands of nodes and variables, are available.

Date: 1978
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b050101 (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:5:y:1978:i:1:p:101-115

DOI: 10.1068/b050101

Access Statistics for this article

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