Skip to main content
padlock icon - secure page this page is secure

Integration of genetic algorithms and GIS for optimal location search

Buy Article:

$61.00 + tax (Refund Policy)

Optimal location search is frequently required in many urban applications for siting one or more facilities. However, the search may become very complex when it involves multiple sites, various constraints and multiple-objectives. The exhaustive blind (brute-force) search with high-dimensional spatial data is infeasible in solving optimization problems because of a huge combinatorial solution space. Intelligent search algorithms can help to improve the performance of spatial search. This study will demonstrate that genetic algorithms can be used with Geographical Information systems (GIS) to effectively solve the spatial decision problems for optimally sitting n sites of a facility. Detailed population and transportation data from GIS are used to facilitate the calculation of fitness functions. Multiple planning objectives are also incorporated in the GA program. Experiments indicate that the proposed method has much better performance than simulated annealing and GIS neighborhood search methods. The GA method is very convenient in finding the solution with the highest utility value.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: GIS; Genetic algorithms; multiple objectives; optimal location; simulated annealing

Document Type: Research Article

Affiliations: Centre of Urban Planning and Environmental Management, The University of Hong Kong, Pokfulam Road, Hong Kong SAR, P.R. China, Email: [email protected]

Publication date: May 1, 2005

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more