skip to main content
research-article

FROST: Movement History–Conscious Facility Relocation

Published: 17 January 2020 Publication History

Abstract

The facility relocation (FR) problem, which aims to optimize the placement of facilities to accommodate the changes of users’ locations, has a broad spectrum of applications. Despite the significant progress made by existing solutions to the FR problem, they all assume each user is stationary and represented as a single point. Unfortunately, in reality, objects (e.g., people, animals) are mobile. For example, a car-sharing user picks up a vehicle from a station close to where he or she is currently located. Consequently, these efforts may fail to identify a superior solution to the FR problem. In this article, for the first time, we take into account the movement history of users and introduce a novel FR problem, called motion-fr, to address the preceding limitation. Specifically, we present a framework called frost to address it. frost comprises two exact algorithms: index based and index free. The former is designed to address the scenario when facilities and objects are known a priori, whereas the latter solves the motion-fr problem by jettisoning this assumption. Further, we extend the index-based algorithm to solve the general k-motion-fr problem, which aims to relocate k inferior facilities. We devise an approximate solution due to NP-hardness of the problem. Experimental study over both real-world and synthetic datasets demonstrates the superiority of our framework in comparison to state-of-the-art FR techniques in efficiency and effectiveness.

References

[1]
Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, and Michael Segal. 2000. Mobile facility location. In Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’00). 46--53.
[2]
Muhammad Aamir Cheema, Xuemin Lin, Wei Wang, Wenjie Zhang, and Jian Pei. 2010. Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Transactions on Knowledge and Data Engineering 22, 4 (2010), 550--564.
[3]
Zitong Chen, Yubao Liu, Raymond Chi-Wing Wong, Jiamin Xiong, Ganglin Mai, and Cheng Long. 2014. Efficient algorithms for optimal location queries in road networks. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD’14). 123--134.
[4]
Jiangtao Cui, Meng Wang, Hui Li, and Yang Cai. 2018. Place your next branch with MILE-RUN: Min-dist location selection over user movement. Information Sciences 463--464 (2018), 1--20.
[5]
E. W. Dijkstra. 1959. A note on two problems in connection with graphs. Numerische Mathematics 1 (1959), 269--271.
[6]
Reza Zanjirani Farahani, Wai Yuen Szeto, and Saeed Ghadimi. 2015. The single facility location problem with time-dependent weights and relocation cost over a continuous time horizon. Journal of the Operational Research Society 66, 2 (2015), 265--277.
[7]
Parisa Ghaemi, Kaveh Shahabi, John P. Wilson, and Farnoush Banaei Kashani. 2010. Optimal network location queries. In Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems (CIS’10). 478--481.
[8]
Gramoz Goranci, Monika Henzinger, and Dariusz Leniowski. 2018. A tree structure for dynamic facility location. In Proceedings of the 2018 European Symposium on Algorithms. Article 39, 13 pages.
[9]
Russell D. Halper, S. Raghavan, and Mustafa Sahin. 2015. Local search heuristics for the mobile facility location problem. Computers 8 Operations Research 62 (2015), 210--223.
[10]
A. K. M. Mustafizur Rahman Khan, Lars Kulik, Egemen Tanin, Hua Hua, and Tanzima Hashem. 2018. Efficient computation of the optimal accessible location for a group of mobile agents. ACM Transactions on Spatial Algorithms and Systems 4, 4 (2018), Article 10, 32 pages.
[11]
Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, and Shang-Hua Teng. 2005. On trip planning queries in spatial databases. In Proceedings of the International Symposium on Spatial and Temporal Databases (SSTD’05). 273--290.
[12]
Yuhong Li, Yu Zheng, Shenggong Ji, Wenjun Wang, Leong Hou U, and Zhiguo Gong. 2015. Location selection for ambulance stations: A data-driven approach. In Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL’15). Article 85.
[13]
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays, and Peter Nye. 2010. Mining periodic behaviors for moving objects. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’10). 1099--1108.
[14]
Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, and Chun Kit Hui. 2005. Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems 30, 2 (2005), 529--576.
[15]
Jianzhong Qi, Rui Zhang, Lars Kulik, Dan Lin, and Yuan Xue. 2012. The min-dist location selection query. In Proceedings of the 2012 IEEE 28th International Conference on Data Engineering (ICDE’12). 366--377.
[16]
Jianzhong Qi, Rui Zhang, Yanqiu Wang, Andy Yuan Xue, Ge Yu, and Lars Kulik. 2014. The min-dist location selection and facility replacement queries. World Wide Web 17, 6 (2014), 1261--1293.
[17]
Ayse Durukan Sonmez and Gino J. Lim. 2012. A decomposition approach for facility location and relocation problem with uncertain number of future facilities. European Journal of Operational Research 218, 2 (2012), 327--338.
[18]
Benoit Thierry, Basile Chaix, and Yan Kestens. 2013. Detecting activity locations from raw GPS data: A novel kernel-based algorithm. International Journal of Health Geographics 12, 11 (2013), 213.
[19]
Waldo R. Tobler. 1970. A computer movie simulating urban growth in the detroit region. Economic Geography 46 (1970), 234--240.
[20]
Betül Turanoglu and Gökay Akkaya. 2018. A new hybrid heuristic algorithm based on bacterial foraging optimization for the dynamic facility layout problem. Expert Systems with Applications 98 (2018), 93--104.
[21]
Meng Wang, Hui Li, Jiangtao Cui, Ke Deng, Sourav S. Bhowmick, and Zhenhua Dong. 2016. PINOCCHIO: Probabilistic influence-based location selection over moving objects. IEEE Transactions on Knowledge and Data Engineering 28, 11 (2016), 3068--3082.
[22]
Peng Wang, Lifeng Sun, Shiqiang Yang, and Alan F. Smeaton. 2015. Improving the classification of quantified self activities and behaviour using a Fisher kernel. In Adjunct Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2015 International Symposium on Wearable Computers (UbiComp/ISWC’15 Adjunct). 979--984.
[23]
Qian Wang, Rajan Batta, Joyendu Bhadury, and Christopher M. Rump. 2003. Budget constrained location problem with opening and closing of facilities. Computers 8 Operations Research 30, 13 (2003), 2047--2069.
[24]
B. J. Worton. 1989. Kernel methods for estimating the utilization distribution in home-range studies. Ecology 70, 1 (1989), 164--168.
[25]
Feng Xia, Jinzhong Wang, Xiangjie Kong, Zhibo Wang, Jianxin Li, and Chengfei Liu. 2018. Exploring human mobility patterns in urban scenarios: A trajectory data perspective. IEEE Communications Magazine 56, 3 (2018), 142--149.
[26]
Xiaokui Xiao, Bin Yao, and Feifei Li. 2011. Optimal location queries in road network databases. In Proceedings of the 2011 IEEE 27th International Conference on Data Engineering (ICDE’11). 804--815.
[27]
Da Yan, Zhou Zhao, and Wilfred Ng. 2011. Efficient algorithms for finding optimal meeting point on road networks. Proceedings of the VLDB Endowment 4, 11 (2011), 968--979.
[28]
Mao Ye, Peifeng Yin, Wang-Chien Lee, and Dik Lun Lee. 2011. Exploiting geographical influence for collaborative point-of-interest recommendation. In Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR’11). 325--334.
[29]
Man Lung Yiu, Nikos Mamoulis, and Dimitris Papadias. 2005. Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineering 17, 6 (2005), 820--833.
[30]
Donghui Zhang, Yang Du, Tian Xia, and Yufei Tao. 2006. Progressive computation of the min-dist optimal-location query. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB’06). 643--654.
[31]
Yu Zheng, Yanchi Liu, Jing Yuan, and Xing Xie. 2011. Urban computing with taxicabs. In Proceedings of the 13th International Conference on Ubiquitous Computing (UbiComp’11). 89--98.
[32]
Yu Zheng, Lizhu Zhang, Xing Xie, and Wei-Ying Ma. 2009. Mining interesting locations and travel sequences from GPS trajectories. In Proceedings of the 18th International Conference on World Wide Web (WWW’09). 791--800.

Cited By

View all
  • (2024)On Efficiently Processing MIT Queries in Trajectory DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.336194836:7(3329-3347)Online publication date: Jul-2024
  • (2023)Why Did You Go There? Semantic Knowledge Extraction from Trajectory TracesIGARSS 2023 - 2023 IEEE International Geoscience and Remote Sensing Symposium10.1109/IGARSS52108.2023.10281714(6013-6016)Online publication date: 16-Jul-2023
  • (2023)Towards Efficient MIT query in Trajectory Data2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00170(2194-2206)Online publication date: Apr-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Intelligent Systems and Technology
ACM Transactions on Intelligent Systems and Technology  Volume 11, Issue 1
February 2020
304 pages
ISSN:2157-6904
EISSN:2157-6912
DOI:10.1145/3375625
Issue’s Table of Contents
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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 January 2020
Accepted: 01 September 2019
Revised: 01 August 2019
Received: 01 May 2019
Published in TIST Volume 11, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Facility relocation
  2. movement history
  3. spatial database

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • Doctoral Fund of Xi'an Polytechnic University
  • National Natural Science Foundation of China
  • Key Research and Development Plan of Jiangxi Province
  • Key Research and Development Plan of Shaanxi Province

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)On Efficiently Processing MIT Queries in Trajectory DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.336194836:7(3329-3347)Online publication date: Jul-2024
  • (2023)Why Did You Go There? Semantic Knowledge Extraction from Trajectory TracesIGARSS 2023 - 2023 IEEE International Geoscience and Remote Sensing Symposium10.1109/IGARSS52108.2023.10281714(6013-6016)Online publication date: 16-Jul-2023
  • (2023)Towards Efficient MIT query in Trajectory Data2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00170(2194-2206)Online publication date: Apr-2023
  • (2023)Joint alignment network preserving structural information for multimode process fault diagnosisThe Canadian Journal of Chemical Engineering10.1002/cjce.25106102:3(1139-1154)Online publication date: 10-Oct-2023
  • (2022)Multi‐source domains transfer learning strategy based on similarity measurement for batch process quality predictionThe Canadian Journal of Chemical Engineering10.1002/cjce.24657101:4(2018-2032)Online publication date: 2-Nov-2022
  • (2021)Adversarial Learning with Mask Reconstruction for Text-Guided Image InpaintingProceedings of the 29th ACM International Conference on Multimedia10.1145/3474085.3475506(3464-3472)Online publication date: 17-Oct-2021
  • (2021)TLDS: A Transfer-Learning-Based Delivery Station Location Selection PipelineACM Transactions on Intelligent Systems and Technology10.1145/346908412:4(1-24)Online publication date: 12-Aug-2021
  • (2021)Cross-Modality Transfer Learning for Image-Text Information ManagementACM Transactions on Management Information Systems10.1145/346432413:1(1-14)Online publication date: 5-Oct-2021
  • (2021)Addressing the Hardness of k-Facility Relocation ProblemProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482411(1919-1928)Online publication date: 26-Oct-2021
  • (2021)AdaRNNProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482315(402-411)Online publication date: 26-Oct-2021
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media