Location-Allocation Algorithms for Land Use Plan Design with Fixed and Substitutable Interactions
Lewis D. Hopkins, Marc Los · Cahiers de recherche · 1978
Many attempts have been made to formalize the problem of designing land use plans (Brotchie, Sharpe, and Toakley [2], Gordon and MacReynolds [3], Karlqvist and Lundqvist [6], Mills [lo], Schlager [ 111, Southeastern Wisconsin Regional Planning Commission [El). Few of these have successfully handled the complexity of the real problem; none has handled this complexity for a problem of large size. This paper first formalizes as a mathematical program a complex version of the land use plan design problem. The formalized problem is of interest not only as a land use plan design model, but also as a general model for complex location-allocation problems that involve more than one type of spatial interaction. A realistic data set for a large land use problem is used to test alternative solution methods. Decomposition is required to handle large problems. The three solution methods presented are combinations of a particular decomposition approach and three different heuristic algorithms. 1. FORMALIZING THE LAND USE PLAN DESIGN PROBLEM