Using a genetic algorithm to generate alternative sketch maps for urban planning

This paper describes a tool that can assist the urban planners in generating alternative sketch maps. The tool known as the Sketch Layout Model (SLM) consists of a multiobjective programming and a genetic algorithm. The SLM produces a set of alternatives approximating to the Pareto optimum, on which the tasks of evaluation and detailed design are based. The paper is presented in the following sections: first, problem definitions and conceptual framework are stated; second, the model containing mathematical programming is established; third, a genetic algorithm used to generate a set of approximating nondominated solutions to the established model is described; fourth, the established model is examined by a numerical example; fifth, a case study is applied for demonstration purposes, and a comparison between the results from the developed model and those from traditional method is made; finally, the conclusions and recommendations are drawn.

[1]  Lars Lundqvist,et al.  Integrated location -- transportation analysis; a decomposition approach , 1973 .

[2]  D Bammi,et al.  Urban Planning to Minimize Environmental Impact , 1976 .

[3]  John F. Brotchie.  Note---A New Approach to Urban Modelling , 1978 .

[4]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[5]  Peter Gordon,et al.  OPTIMAL URBAN FORMS , 1974 .

[6]  John W. Dickey,et al.  TOPAZ: General planning technique and its applications at the regional, urban, and facility planning levels , 1980 .

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Gülen Çağdaş,et al.  Multiobjective Land-Use Planning Model , 1993 .

[9]  Jerry B. Schneider,et al.  TRANSPORTATION NETWORK DESIGN USING A CUMULATIVE GENETIC ALGORITHM AND NEURAL NETWORK , 1992 .

[10]  Â Guimarães Pereira.  Generating Alternative Routes by Multicriteria Evaluation and a Genetic Algorithm , 1996 .

[11]  R. D. MacKinnon,et al.  Optimal Transportation Networks: A Case Study of Highway Systems , 1970 .

[12]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[13]  Partha Chakroborty,et al.  Optimal Scheduling of Urban Transit Systems Using Genetic Algorithms , 1995 .

[14]  M. Los.  Simultaneous optimization of land use and transportation : A synthesis of the quadratic assignment problem and the optimal network problem , 1978 .

[15]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[16]  Charles C. Palmer,et al.  An approach to a problem in network design using genetic algorithms , 1994, Networks.

[17]  Thomas W. Giambelluca,et al.  Linking Water-Balance Simulation and Multiobjective Programming: Land-Use Plan Design in Hawaii , 1992 .

[18]  Deepak Bammi,et al.  Development of a Comprehensive Land Use Plan by Means of a Multiple Objective Mathematical Programming Model , 1979 .

[19]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[20]  Marc Los,et al.  A Discrete-Convex Programming Approach to the Simultaneous Optimization of Land Use and Transportation , 1979 .

[21]  G M Barber,et al.  Land-Use Plan Design via Interactive Multiple-Objective Programming , 1976 .

[22]  Bruce N. Janson,et al.  Heuristic ranking and selection procedures for network design problems , 1987 .