short-paper

Optimal mobile facility localization

Authors:

Tanzima HashemAuthors Info & Claims

SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems

Article No.: 72, Pages 1 - 4

https://doi.org/10.1145/2820783.2820862

Published: 03 November 2015 Publication History

Get Access

Abstract

We introduce a new type of spatial query, Optimal Accessible Location (OAL) query. When a set of paths is provided the query finds the best location from a set of locations that has the optimal accessibility from these paths. OAL queries have many applications such as the selection of the optimal location for a mobile facility such as a food truck or selection of a venue for an event. We exploit geometric properties and develop pruning techniques to eliminate unrelated path segments as well as locations. Our experimental results demonstrate that we provide a readily deployable solution for real-life applications.

References

[1]

S. Cabello, J. M. Díaz-Báñez, S. Langerman, C. Seara, and I. Ventura. Reverse facility location problems. University of Ljubljana, Inst. of Mathematics, Physics and Mechanics, Department of Mathematics, 2006.

Google Scholar

[2]

A. M. R. Khan, T. Hashem, E. Tanin, and L. Kulik. Location oblivious privacy protection for group nearest neighbor queries. In Geographic Information Science, pages 301--317. 2014.

Google Scholar

[3]

Q. Lin, C. Xiao, M. A. Cheema, and W. Wang. Finding the sites with best accessibilities to amenities. In DASFAA, pages 58--72, 2011.

Digital Library

Google Scholar

[4]

D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group nearest neighbor queries. In ICDE, pages 301--312, 2004.

Digital Library

Google Scholar

[5]

S. Shang, B. Yuan, K. Deng, K. Xie, and X. Zhou. Finding the most accessible locations: reverse path nearest neighbor query in road networks. In SIGSPATIAL, pages 181--190, 2011.

Digital Library

Google Scholar

[6]

T. Xia, D. Zhang, E. Kanoulas, and Y. Du. On computing top-t most influential spatial sites. In VLDB, pages 946--957, 2005.

Digital Library

Google Scholar

[7]

X. Xiao, B. Yao, and F. Li. Optimal location queries in road network databases. In ICDE, pages 804--815, 2011.

Digital Library

Google Scholar

[8]

J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, G. Sun, and Y. Huang. T-drive: driving directions based on taxi trajectories. In SIGSPATIAL, pages 99--108, 2010.

Digital Library

Google Scholar

[9]

D. Zhang, Y. Du, T. Xia, and Y. Tao. Progressive computation of the min-dist optimal-location query. In VLDB, pages 643--654, 2006.

Digital Library

Google Scholar

Cited By

View all

Qi ZWang HHe TWang CLi JGao H(2020)TAILOR: time-aware facility location recommendation based on massive trajectoriesKnowledge and Information Systems10.1007/s10115-020-01477-wOnline publication date: 20-May-2020
https://doi.org/10.1007/s10115-020-01477-w
Khan AKulik LTanin EHua HHashem T(2018)Efficient Computation of the Optimal Accessible Location for a Group of Mobile AgentsACM Transactions on Spatial Algorithms and Systems10.1145/32391244:4(1-32)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3239124

Index Terms

Optimal mobile facility localization
1. Information systems
  1. Information systems applications

Recommendations

Efficient Computation of the Optimal Accessible Location for a Group of Mobile Agents

Nowadays, people can access location-based services (LBSs) as a group via mobile devices to plan their daily activities with friends and relatives. In this article, we introduce an important class of group-oriented LBSs, group optimal accessible ...
Efficient Processing of Reverse Top-k Dominating Queries
CSAI '18: Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence

The top-k dominating queries (kDQ) are very useful to the users who hope to select their favorite products. It combines the characteristics of top-k query and skyline query. Although kDQ has been well-studied in the literature, there is, to the best of ...
Predicting Optimal Facility Location without Customer Locations
KDD '17: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Deriving meaningful insights from location data helps businesses make better decisions. One critical decision made by a business is choosing a location for its new facility. Optimal location queries ask for a location to build a new facility that ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 2015

646 pages

ISBN:9781450339674

DOI:10.1145/2820783

General Chairs:
Mohamed Ali
University of Washington, Tacoma
,
Yan Huang
University of North Texas
,
Program Chairs:
Michael Gertz
Heidelberg University, Germany
,
Matthias Renz
LMU Munich, Germany
,
Jagan Sankaranarayanan
NEC Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

SIGSPATIAL'15

Sponsor:

SIGSPATIAL

SIGSPATIAL'15: 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 3 - 6, 2015

Washington, Seattle

Acceptance Rates

SIGSPATIAL '15 Paper Acceptance Rate 38 of 212 submissions, 18%;

Overall Acceptance Rate 257 of 1,238 submissions, 21%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
142
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Qi ZWang HHe TWang CLi JGao H(2020)TAILOR: time-aware facility location recommendation based on massive trajectoriesKnowledge and Information Systems10.1007/s10115-020-01477-wOnline publication date: 20-May-2020
https://doi.org/10.1007/s10115-020-01477-w
Khan AKulik LTanin EHua HHashem T(2018)Efficient Computation of the Optimal Accessible Location for a Group of Mobile AgentsACM Transactions on Spatial Algorithms and Systems10.1145/32391244:4(1-32)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3239124

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Efficient Computation of the Optimal Accessible Location for a Group of Mobile Agents

Efficient Processing of Reverse Top-k Dominating Queries

Predicting Optimal Facility Location without Customer Locations

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations