Abstract
Spatial separation in located services and activities is often essential. Examples include homeland security, military asset defense, impacts on the environment, franchise outlet location, and promoting public wellbeing. When planning and management is supported by mathematical modeling, a difficulty has been efficient representation of spatial separation conditions. This paper reviews an optimization model, the anti-covering location problem, used to support planning and management problems where spatial separation must be ensured between sited services/activities. An approach is presented for the efficient and effective identification and use of spatial separation conditions called cliques in this model based upon the use of a geographic information system (GIS). Results highlight the significance of the developed methodology in terms of computational requirements, tractability and effectiveness. This research enhances capabilities for addressing important practical planning problems.
This is a preview of subscription content, log in via an institution to check access.
References
Barahona, F., Weintraub, A., Epstein, R.: Habitat dispersion in forest planning and stable set problem. Oper. Res. 40, S14–S21 (1992)
Chaudhry, S.S.: A genetic algorithm approach to solving the anti-covering location problem. Expert Syst. 23, 251–257 (2006)
Church, R.L., Murray, A.T.: Business Site Selection, Location Analysis and GIS. Wiley, New York (2008)
Cravo, G.L., Ribeiro, G.M., Nogueira Lorena, L.A.: A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput. Geosci. 34, 373–386 (2008)
Downs, J.A., Gates, R.J., Murray, A.T.: Estimating carrying capacity for sandhill cranes using habitat suitability and spatial optimization models. Ecol. Model. 214, 284–292 (2008)
Erkut, E., ReVelle, C., Ulkiisal, Y.: Integer-friendly formulations for the r-separation problem. Eur. J. Oper. Res. 92, 342–351 (1996)
Goycoolea, M., Murray, A.T., Barahona, F., Epstein, R., Weintraub, A.: Harvest scheduling subject to maximum area restrictions: exploring exact approaches. Oper. Res. 53, 490–500 (2005)
Grubesic, T.H., Murray, A.T.: Sex offender residency and spatial equity. Appl. Spatial Anal. Policy (2008, in press)
Jones, J.G., Meneghin, B.J., Kirby, M.W.: Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning. For. Sci. 37, 1283–1297 (1991)
Moon, A.D., Chaudhry, S.: An analysis of network location problems with distance constraints. Manag. Sci. 30, 290–307 (1984)
Murray, A.T.: Spatial restrictions in harvest scheduling. For. Sci. 45, 45–52 (1999)
Murray, A.T., Church, R.L.: Measuring the efficacy of adjacency constraint structure in forest planning. Can. J. For. Res. 25, 1416–1424 (1995)
Murray, A.T., Church, R.L.: Constructing and selecting adjacency constraints. INFOR 34, 232–248 (1996)
Murray, A.T., Church, R.L.: Facets for node packing. Eur. J. Oper. Res. 101, 598–608 (1997)
Nemhauser, G., Sigismondi, G.: A strong cutting plane/branch-and-bound algorithm for node packing. Oper. Res. 43, 443–457 (1992)
Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8, 232–248 (1975)
Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5, 199–215 (1973)
Torres-Rojo, J.M., Brodie, J.D.: Adjacency constraints in harvest scheduling: an aggregation heuristic. Can. J. For. Res. 20, 978–986 (1990)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Murray, A.T., Kim, H. Efficient identification of geographic restriction conditions in anti-covering location models using GIS. Lett Spat Resour Sci 1, 159–169 (2008). https://doi.org/10.1007/s12076-008-0015-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12076-008-0015-3