Feasible Office-Location Patterns which Ensure the Existence of the Combined Transportation Network and Residential Location Equilibrium

Abstract

This paper considers the problem of finding the feasible office-location patterns subject to the capacity constraints of transport networks. We first construct the combined transportation-location equilibrium model to represent the transportation demands on networks induced by office-locations in CBDs. We then define the mathematical problem of finding the feasible office-location patterns which ensure the existence of the combined equilibrium. By utilizing the network transformation technique, we show that the problem reduces to finding the maximum OD demands under the Wardrop equilibrium constraints. Finally, we develops an efficient algorithm for obtaining a unique solution, which can be applied to large-scale networks.