Received date: 2004-01-10
Revised date: 2004-06-03
Online published: 2004-09-25
Supported by
National Natural Science Foundation of China, No. 40071060
This study demonstrates that genetic algorithms are capable of producing satisfying results for optimal spatial search under complex situations. We successfully solve a spatial search problem using the proposed method to allocate the facility according to the population constraint from GIS. The search algorithm is very simple using the mechanics of natural selection in biology. The proposed method can be used as a planning tool that can help urban planners to improve development efficiency in site selection. The method is developed by a common computer language which can directly use the full functions of a commercial GA package through the DLL and can import the spatial data from GIS. This integration is useful for solving realistic problems by using large spatial data sets. The programming can be easily adapted to other applications by just modifying the fitness functions instead of changing the model itself. The proposed method has been tested in the city of Hong Kong, a densely populated region. The population data are obtained from the census department and the population density is prepared in GIS as the main inputs to the GA programming.
Key words： genetic algorithms; GIS; spatial optimization; simulated annealing
Xia LI, Anthony Gar-On YEH . Optimal Spatial Search Using Genetic Algorithms and GIS[J]. Acta Geographica Sinica, 2004 , 59(5) : 745 -753 . DOI: 10.11821/xb200405013
[1] Zhan H G, Lee Z P, Shi P et al. Retrieval of water optical properties for optically deep waters using genetic algorithms. IEEE Transactions on Geoscience and Remote Sensing, 2003, 41(5): 1123-1128.
[2] Jin Y Q, Wang Y. A genetic algorithm to simultaneously retrieve land surface roughness and soil wetness. International Journal of Remote Sensing, 2001, 22(16): 3093-3099.
[3] Holland J. Adaptation in Natural And Artificial Systems: An Introductory Analysis with Applications to Biology, Control, And Artificial Intelligence. Cambridge, Mass: MIT Press, 1992. 211.
[4] Goldberg D E. Genetic Algorithms in Search, Optimisation and Machine Learning, Reading, MA: Addison-Wesley, 1989. 412.
[5] Openshaw S, Steadman P. On the geography of a worst case nuclear attack on population of Britain. Political Geography Quarterly, 1982, 1: 263-278.
[6] Openshaw S, Openshaw C. Artificial Intelligence in Geography. Chichester: John Wiley & Sons, 1997. 329.
[7] Cooper L. Location-allocation problems. Operations Research, 1963, (11): 331-343.
[8] Cooper L. Solutions of generalized location equilibrium problems. Journal of Research Science, 1967, (7): 1-18.
[9] Church R L. Location modeling and GIS. In: P A Longley, M F Goodchild, D J Maguire et al. (eds.), Geographical Information Systems: Volume 1. New York: John Wiley & Sons, Inc., 1999. 293-303.
[10] Simha R, Cai W D, Spitkovsky V. Simulated N-body: new particle physics-based heuristics for a Euclidean location-allocation problem. Journal of Heuristics, 2001, 7(1): 23-36.
[11] Aerts C J H, Heuvelink G B M. Using simulated annealing for resource allocation. International Journal of Geographical Information Science, 2002, 16(6): 571-587.
[12] Brookes C J. A genetic algorithm for designing optimal patch configurations in GIS. International Journal of Geographical Information Science, 2001, 15(6): 539-559.
[13] Jaramillo J H, Bhadury J, Batta R. On the use of genetic algorithms to solve location problems. Computers & Operations Research, 2002, 29(6): 761-779.
[14] Laarhoven Van P J M. Theoretical and Computational Aspects of Simulated Annealing. PhD Thesis, Erasmus University Rotterdam, 1987.
/
| 〈 |
|
〉 |