Simulating Annealing for Land-use Planning
Land-use plan is a very complex activity.Generally,it is a multi-objective and nonlinear programming problem with the high dimensionality,determinative mathematical programming tools have difficulty to solve it.Because of its difficulty,planners have to use some qualitative methods,the result is more or less subjective and the resulting land use scheme may be non-optimal.This paper develops a new method called simulated annealing algorithms (SA) for handling such conflict.The simulated annealing algorithm is a robust searching technique,which is quite useful and effective for dealing with many complicated mathematical model.Since it is uneasy to tackle some spatial constraints in the optimisation process,Our SA integrates some spatial constraints into the objective function,including the contiguity and compact form constraints,while the direction constraint is considered into the process of feasible solution searching.The objective of optimisation model is to minimize development costs,maximize the spatial harmony among spatial units and spatial compactness of some types of land use.A special strategy is used to compute the value of spatial harmony.The SA method is successfully applied to Muyun industrial district planning,Hunan province,China.The result shows the method may be a promising one.
WANG Xinsheng HE Jing E Yuesheng
School of Resource and Environmental Science,Hubei University,Wuhan 430062,China
国际会议
Woekshop on Agricultural Land Use and its Effect in APEC Member Economies(APEC地区农业土地利用及其影响国际研讨会)
北京
英文
287-300
2009-10-19（万方平台首次上网日期，不代表论文的发表时间）