A unified conceptual framework for geographical optimization using evolutionary algorithms

Annals of the Association of American Geographers

Volumn 98, Issue 4, 2008, Pages 795-817

  Xiao, Ningchuan ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Evolutionary algorithms; Geographical optimization problems; Location allocation analysis; Political redistricting; Spatial representation

Indexed keywords

ALGORITHM; CONCEPTUAL FRAMEWORK; DECISION MAKING; EVOLUTIONARY THEORY; GEOGRAPHICAL THEORY; OPTIMIZATION; SPATIAL ANALYSIS;

EID: 65449161328     PISSN: 00045608     EISSN: 14678306     Source Type: Journal    
DOI: 10.1080/00045600802232458     Document Type: Article

References (105)

1. Alp, O., Erkut, E. and Drezner, Z. An efficient genetic algorithm for the p-median problem. Annals of Operations Research, 122, pp. 21-42.
2. Altman, M. (1998) Districting principles and democratic representation., California Institute of Technology, Pasadena, CA
3. Altman, M. (1998) Modeling the effect of mandatory district compactness on partisan gerrymanders. Political Geography, 17:8, pp. 989-1012.
4. Altman, M., MacDonald, K. and McDonald, M. (2005) From crayons to computers: The evolution of computer use in redistricting. Social Science Computer Review, 23:3, pp. 334-346.
5. Anderson, E. J. (1996) Mechanisms for local search. European Journal of Operational Research, 88, pp. 139-151.
6. Armstrong, M. P. (1993) On automated geography!. The Professional Geographer, 45:4, pp. 440-441.
7. Armstrong, M. P. (2000) Geography and computational science. Annals of the Association of American Geographers, 90:1, pp. 146-156.
8. Armstrong, M. P., Rushton, G., Honey, R., Dalziel, B. T., Lolonis, P., De, S. and Densham, P. J. (1991) Decision support for regionalization: A spatial decision support system for regionalizing service delivery systems. Computers, Environment and Urban Systems, 15, pp. 37-53.
9. Armstrong, M. P., Xiao, N. and Bennett, D. A. (2003) Using genetic algorithms to create multicriteria class intervals for choropleth maps. Annals of the Association of American Geographers, 93:3, pp. 595-623.
10. Bacao, F., Lobo, V. and Painho, M. (2005) Applying genetic algorithms to zone design. Soft Computing, 9, pp. 341-348.
11. Bacao, F., Lobo, V. and Painho, M. (1997) Handbook of evolutionary computation, Oxford University Press/IOP, New York
12. Bennett, D. A., Xiao, N. and Armstrong, M. P. (2004) Exploring the geographic ramifications of environmental policy using evolutionary algorithms. Annals of the Association of American Geographers, 94:4, pp. 827-847.
13. Bergey, P. K., Ragsdale, C. T. and Hoskote, M. (2003) A simulated annealing genetic algorithm for the electrical power districting problem. Annals of Operations Research, 121, pp. 33-55.
14. Bianchi, G. and Church, R. (1993) A non-binary encoded GA for a facility location problem., Department of Geography, University of California, Santa Barbara
15. Brandeau, M. L. and Chiu, S. S. (1989) Overview of representative problems in location research. Management Science, 35:6, pp. 645-674.
16. Brill Jr., E. D. (1979) The use of optimization models in public-sector planning. Management Science, 25:5, pp. 413-422.
17. Brookes, C. J. (2001) A genetic algorithm for designing optimal patch configurations in GIS. International Journal of Geographical Information Science, 15:6, pp. 539-559.
18. Cantu-Paz, E. (2000) Efficient and accurate parallel genetic algorithms., Kluwer Academic, Boston
19. Church, R. L., Stoms, D. M. and Davis, F. W. (1996) Reserve selection as a maximal covering location problem. Biological Conservation, 76, pp. 105-112.
20. Cooper, L. (1964) Heuristic methods for location-allocation problems. SIAM Review, 6, pp. 37-54.
21. Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C. (2001) Introduction to algorithms., MIT Press, Cambridge, MA
22. Cova, T. J. and Church, R. L. (2000) Contiguity constraints for single-region site search problems. Geographical Analysis, 32:4, pp. 306-329.
23. Deb, K. (2001) Multi-objective optimization using evolutionary algorithms., Wiley, Chichester, U.K.
24. De Jong, K. A. (2006) Evolutionary computation: A unified approach, MIT Press, Cambridge, MA
25. Densham, P. J. and Rushton, G. Designing and implementing strategies for solving large location-allocation problems with heuristic methods., National Center of Geographic Information and Analysis, Santa Barbara, CA
26. Densham, P. J. and Rushton, G. (1992) A more efficient heuristic for solving large p-median problems. Papers in Regional Science: The Journal of RSAI, 41:3, pp. 307-329.
27. Densham, P. J. and Rushton, G. (1996) Providing spatial decision support for rural public service facilities that require a minimum workload. Environment and Planning B: Planning and Design, 23, pp. 553-574.
28. Dibble, C. and Densham, P. J. (1993) Generating interesting alternatives in GIS and SDSS using genetic algorithms. GIS/LIS '93, pp. 180-189. ACSM, ASPRS, AM/FM International, AAG, URISA, Minneapolis, MN
29. Diestel, R. (2000) Graph theory., Springer-Verlag, New York
30. Dobson, J. E. (1983) Automated geography. The Professional Geographer, 35:2, pp. 135-143.
31. Dorigo, M., Maniezzo, V. and Colorni, A. (1991) Positive feedback as a search strategy., Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy
32. Dowsland, K. A. (1996) Genetic algorithms-A tool for OR?. Journal of the Operational Research Society, 47, pp. 550-561.
33. Eagles, M., Katz, R. S. and Mark, D. (2000) Controversies in political redistricting: GIS, geography, and society. Political Geography, 19, pp. 135-139.
34. Estivill-Castro, V. and Torres-Velazquez, R. (1999) Hybrid genetic algorithm for solving the p-median problem. Second Asia-Pacific conference on simulated evolution and learning, SEAL '98, pp. 18-25. Springer-Verlag, Berlin
35. Evans, J. and Minieka, E. (1992) Optimization algorithms for network and graphs., Marcel Dekker, New York
36. Even, S. (1973) Algorithmic combinatorics., Macmillan, New York
37. Falkenauer, E. (1994) A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2:2, pp. 123-144.
38. Feldman, E., Lehrer, F. A. and Ray, T. L. (1966) Warehouse location under continuous economies of scale. Management Science, 12, pp. 670-684.
39. Fogel, D. B. and Angeline, P. J. (1997) Guidelines for a suitable encoding. Handbook of evolutionary computation, pp. 1-2. Oxford University Press/IOP, New York
40. Fogel, L. J. (1962) Autonomous automata. Industrial Research, 4, pp. 14-19.
41. Forrest, S. (1993) Genetic algorithms: Principles of natural selection applied to computation. Science, 261, pp. 872-878.
42. Fotheringham, A. S. (1998) Trends in quantitative geography II: Stressing the computational. Progress in Human Geography, 22:2, pp. 283-292.
43. Fox, B. L. (1993) Integrating and accelerating tabu search, simulated annealing, and genetic algorithms. Annals of Operations Research, 41, pp. 47-67.
44. Garey, M. R. and Johnson, D. S. (1979) Computers and intractability: A guide to the theory of NP-completeness., Freeman, San Francisco
45. Gendreau, M. and Potvin, J. -Y. (2005) Metaheuristics in combinatorial optimization. Annals of Operations Research, 140:1, pp. 189-213.
46. Ghosh, A. and Harche, F. (1993) Location-allocation models in the private sector: Progress, problems, and prospects. Location Science, 1:1, pp. 81-106.
47. Glover, F. and Laguna, M. (1997) Tabu search., Kluwer Academic, Boston
48. Goldberg, D. E. (1989) Genetic algorithms in search, optimization and machine learning., Addison-Wesley, Reading, MA
49. Grefenstette, J. J., Gopal, R., Rosmaita, B. and van Gucht, D. (1985) Genetic algorithms for the traveling salesman problem. Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 160-166. Erlbaum, Hillsdale, NJ
50. Hakimi, S. L. (1965) Optimum distribution of switch centers in a communication network and some related graph theoretic problems. Operations Research, 13, pp. 462-475.
51. Hamacher, H. W. and Nickel, S. (1998) Classification of location models. Location Science, 6, pp. 229-242.
52. Han, J., Kamber, M. and Tung, A. K. H. (2001) Spatial clustering methods in data mining: A survey. Geographic data mining and knowledge discovery, pp. 188-217. Taylor & Francis, London
53. Hobbs, M. (1996) Spatial clustering with a genetic algorithm. Innovations in GIS 3, pp. 85-93. Taylor & Francis, London
54. Hof, J. and Bevers, M. (1998) Spatial optimization for managed ecosystems., Columbia University Press, New York
55. Holland, J. (1962) Outline for a logical theory of adaptive systems. Journal of the ACM, 3, pp. 297-314.
56. Holland, J. (1975) Adaptations in natural and artificial systems, University of Michigan Press, Ann Arbor
57. Holland, J. (1998) Emergence: From chaos to order, Perseus Books, Reading, MA
58. Hopkins, L. D. (1984) Evaluation of methods for exploring ill-defined problems. Environment and Planning B, 11, pp. 339-348.
59. Hosage, C. M. and Goodchild, M. F. (1986) Discrete space location-allocation solutions from genetic algorithms. Annals of Operations Research, 6, pp. 35-46.
60. Houck, C. R., Joines, J. A. and Kay, M. G. (1996) Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Computers & Operations Research, 23:6, pp. 587-596.
61. Huang, B., Cheu, R. L. and Liew, Y. S. (2004) GIS and genetic algorithms for HAZMAT route planning with security considerations. International Journal of Geographical Information Science, 18:8, pp. 769-787.
62. Jaramillo, J. H., Bhadury, J. and Batta, R. (2002) On the use of genetic algorithms to solve location problems. Computers & Operations Research, 29, pp. 761-779.
63. Kirkpatrick, S., Gelatt, C. D. and Vecchi Jr., M. P. (1983) Optimization by simulated annealing. Science, 220, pp. 671-680.
64. Koza, J. R. (1992) Genetic programming: On the programming of computers by means of natural selection., MIT Press, Cambridge, MA
65. Krarup, J. and Pruzan, P. M. (1990) Ingredients of locational analysis. Discrete location theory, pp. 1-54. Wiley, New York
66. Krzanowski, R. M. and Raper, J. (1999) Hybrid genetic algorithm for transmitter location in wireless networks. Computers, Environment and Urban Systems, 23, pp. 359-382.
67. Krzanowski, R. M. and Raper, J. (2001) Spatial evolutionary modeling, Oxford University Press, Oxford, U.K.
68. Kuehn, A. A. and Hamburger, M. J. (1963) A heuristic program for locating warehouses. Management Science, 9, pp. 643-666.
69. Leung, Y., Li, G. and Xu., Z.-B. (1998) A genetic algorithm for the multiple destination routing problems. IEEE Transactions on Evolutionary Computation, 2:4, pp. 150-161.
70. Li, X. and Yeh, A. G. -O. (2005) Integration of genetic algorithms and GIS for optimal location search. International Journal of Geographical Information Science, 19:5, pp. 581-601.
71. Lin, Y. -C., Hwang, K. -S. and Wang, F. -S. (2001) Co-evolutionary hybrid differential evolution for mixed-integer optimization problems. Engineering Optimization, 33, pp. 663-682.
72. Michalewicz, Z. (1996) Genetic algorithms + data structures = evolution programs., Springer-Verlag, Berlin
73. Mladenovic, N., Brimberg, J., Hansen, P. and Moreno-Perez, J. A. (2007) The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179:3, pp. 927-939.
74. Mooney, P. and Winstanley, A. (2006) An evolutionary algorithm for multicriteria path optimization problems. International Journal of Geographical Information Science, 20:4, pp. 401-423.
75. Morrill, R. L. (1976) Redistricting revisited. Annals of the Association of American Geographers, 66, pp. 548-556.
76. Morrill, R. L. (1981) Political redistricting and geographic theory, Association of American Geographers, Washington, DC
77. Murray, A. T. and Church, R. L. (1995) Measuring the efficacy of adjacency constraint structure in forest planning models. Canadian Journal of Forest Research, 25, pp. 1416-1424.
78. Nalle, D. J., Arthur, J. L. and Sessions, J. (2002) Designing compact and contiguous reserve networks with a hybrid heuristic algorithm. Forest Science, 48:1, pp. 59-68.
79. Openshaw, S. (1994) Computational human geography: Towards a research agenda. Environment and Planning A, 26, pp. 499-505.
80. Openshaw, S. and Perree, T. (1996) User-centred intelligent spatial analysis off point data. Innovations in GIS 3, pp. 119-134. Taylor & Francis, London
81. Osman, I. H. and Kelly, J. P. (1996) Meta-heuristics: Theory and application., Kluwer, Boston
82. Preux, P. and Talbi, E. -G. (1999) Towards hybrid evolutionary algorithms. International Transactions in Operational Research, 6:6, pp. 557-570.
83. Rechenberg, I. (1965) Cybernetic solution path of an experimental problem. Translation No. 1122., Royal Aircraft Establishment, Farnborough, Hants, U.K.
84. Rechenberg, I. (1993) Modern heuristic techniques for combinatorial problems, Blackwell, Oxford, U.K.
85. Rechenberg, I. (1997) Genetic algorithms for the operations researchers. INFORMS Journal on Computing, 9:3, pp. 231-251.
86. Ross, P. (1997) What are genetic algorithms good at?. INFORMS Journal on Computing, 9:3, pp. 260-262.
87. Ruiz-Andino, A., Araujo, L., Saenz, F. and Ruz, J. (2000) A hybrid evolutionary approach for solving constrained optimization problems over finite domains. IEEE Transactions on Evolutionary Computation, 4:4, pp. 353-372.
88. Rushton, G. (1988) Location theory, location-allocation models, and service development planning in the third world. Economic Geography, 64:2, pp. 97-120.
89. Schilling, D. A., Jayaraman, V. and Barkhi, R. (1993) A review of covering problems in facility location. Location Science, 1:1, pp. 25-55.
90. Scott, A. J. (1971) Combinatorial programming, spatial analysis, and planning., Methuen, London
91. Simoes, A. and Costa, E. (2000) Using genetic algorithms with sexual or asexual transposition: A comparative study. Proceedings of the 2000 Congress on Evolutionary Computation (CEC'2000), pp. 1196-1203. IEEE Computer Society, Washington, DC
92. Simon, H. A. (1960) The new science of management decision., Harper & Row, New York
93. Srikanth, R., George, R. and Warsi, N. (1995) A variable-length genetic algorithm for clustering and classification. Pattern Recognition Letters, 16, pp. 789-800.
94. Taylor, P. J. and Johnston, R. J. (1979) The geography of elections., Croom, Helm & Penguin, London
95. Teitz, M. B. and Bart, P. (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, pp. 955-961.
96. van Dijk, S., Thierens, D. and De Berg, M. (2002) Using genetic algorithms for solving hard problems in GIS. GeoInformatica, 6:4, pp. 381-413.
97. Vazirani, V. V. (2001) Approximation algorithms., Springer, Berlin
98. Williams, J. C. (2002) A zero-one programming model for contiguous land acquisition. Geographical Analysis, 34:4, pp. 330-349.
99. Williams, J. C. (1995) Political redistricting: A review. Papers in Regional Science, 74:1, pp. 13-40.
100. Wu, A. S. and Banzhaf, W. (1999) Introduction to the special issue: Variable-length representation and noncoding segments for evolutionary algorithms. Evolutionary Computation, 6:4, pp. iii-vi.
101. Xiao, N. (2006) An evolutionary algorithm for site search problems. Geographical Analysis, 38:3, pp. 227-247.
102. Xiao, N. and Armstrong, M. P. (2003) A specialized island model and its application in multiobjective optimization. Genetic and evolutionary computation-GECCO 2003, pp. 1530-1540. Springer-Verlag, Berlin
103. Xiao, N., Bennett, D. A. and Armstrong, M. P. (2002) Using evolutionary algorithms to generate alternatives for multiobjective site search problems. Environment and Planning A, 34:4, pp. 639-656.
104. Xiao, N., Bennett, D. A. and Armstrong, M. P. (2007) Interactive evolutionary approaches to multiobjective spatial decision making: A synthetic review. Computers, Environment and Urban Systems, 30, pp. 232-252.
105. Xu, Z. B., Leung, K. S., Liang, Y. and Leung, Y. (2003) Efficiency speed-up strategies for evolutionary computation: Fundamentals and fast-GAs. Applied Mathematics and Computation, 142, pp. 341-388.