Definition
An optimal location query concerns three spatial point sets on a road network: a set F of facilities, a set C of clients, and a set P of candidate locations. The objective of this query is to identify a candidate location p ∈ P, such that a new facility built at p can optimize a certain cost metric that is defined based on the network distances between the facilities and the clients. Optimal location queries find important applications in the strategic planning of resources (e.g., hospitals, post offices, banks, retail facilities) in both public and private sectors (Cabello et al. 2005; Du et al. 2005; Zhang et al. 2006). As an example, we illustrate three optimal location queries based on different cost metrics.
Example 1.
Julie would like to open a new supermarket in San Francisco that can attract as many customers as possible. Given the set F (resp. C) of all existing supermarkets (resp. residential locations) in the city, Julie may look for a candidate location p, such...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin
Cabello S, Díaz-Báñez JM, Langerman S, Seara C, Ventura I (2005) Reverse facility location problems. In: Proceedings of the Canadian conference on computational geometry (CCCG), pp 68–71
Chen Z, Liu Y, Wong RC, Xiong J, Mai G, Long C (2014) Efficient algorithms for optimal location queries in road networks. In: SIGMOD, pp 123–134
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269–271
Drezner Z (1995) Facility location: a survey of applications and methods. Springer series in operations research and financial engineering. Springer, New York
Du Y, Zhang D, Xia T (2005) The optimal-location query. In: Proceedings of symposium on advances in spatial and temporal databases (SSTD), pp 163–180
Erwig M, Hagen F (2000) The graph Voronoi diagram with applications. Networks 36:156–163
Farahani RZ, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies, 1st edn. Physica-Verlag HD
Fotakis D (2006) Incremental algorithms for facility location and k-median. Theor Comput Sci 361(2–3): 275–313
Meyerson A (2001) Online facility location. In: Symposium on foundations of computer science (FOCS), pp 426–431
Nickel S, Puerto J (2005) Location theory: a unified approach, 1st edn. Springer, Berlin/New York
Wong RC-W, Özsu T, Yu PS, Fu AW-C, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. Proc VLDB Endow (PVLDB) 2(1):1126–1137
Xiao X, Yao B, Li F (2011) Optimal location queries in road network databases. In: ICDE, pp 804–815
Zhang D, Du Y, Xia T, Tao Y (2006) Progressive computation of the min-dist optimal-location query. In: Proceedings of very large data bases (VLDB), pp 643–654
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this entry
Cite this entry
Xiao, X. (2017). Optimal Location Queries on Road Networks. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1517
Download citation
DOI: https://doi.org/10.1007/978-3-319-17885-1_1517
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17884-4
Online ISBN: 978-3-319-17885-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering