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

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.