skip to main content
10.1145/3543507.3583859acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Facility Relocation Search For Good: When Facility Exposure Meets User Convenience

Published: 30 April 2023 Publication History

Abstract

In this paper, we propose a novel facility relocation problem where facilities (and their services) are portable, which is a combinatorial search problem with many practical applications. Given a set of users, a set of existing facilities, and a set of potential sites, we decide which of the existing facilities to relocate to potential sites, such that two factors are satisfied: (1) facility exposure: facilities after relocation have balanced exposure, namely serving equivalent numbers of users; (2) user convenience: it is convenient for users to access the nearest facility, which provides services with shorter travel distance. This problem is motivated by applications such as dynamically redistributing vaccine resources to align supply with demand for different vaccination centers, and relocating the bike sharing sites daily to improve the transportation efficiency. We first prove that this problem is NP-hard, and then we propose two algorithms: a non-learning best response algorithm () and a reinforcement learning algorithm (). In particular, the best response algorithm finds a Nash equilibrium to balance the facility-related and the user-related goals. To avoid being confined to only one Nash equilibrium, as found in the method, we also propose the reinforcement learning algorithm for long-term benefits, where each facility is an agent and we determine whether a facility needs to be relocated or not. To verify the effectiveness of our methods, we adopt multiple metrics to evaluate not only our objective, but also several other facility exposure equity and user convenience metrics to understand the benefits after facility relocation. Finally, comprehensive experiments using real-world datasets provide insights into the effectiveness of the two algorithms in practice.

References

[1]
2021. Health Engine Australia. https://healthengine.com.au/.
[2]
Matteo Almanza, Alessandro Epasto, Alessandro Panconesi, and Giuseppe Re. 2022. k-Clustering with Fair Outliers. In WSDM. 5–15.
[3]
Suman Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019. Fair algorithms for clustering. NeurIPS 32 (2019).
[4]
Lucian Busoniu, Robert Babuska, and Bart De Schutter. 2008. A comprehensive survey of multiagent reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 38, 2 (2008), 156–172.
[5]
Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, and Inmaculada Ventura. 2005. Reverse facility location problems. In Proceedings of the 17th Canadian Conference on Computational Geometry. 68–71.
[6]
Jean Cardinal and Stefan Langerman. 2006. Min-max-min geometric facility location problems. In EWCG. 149–152.
[7]
TH Hubert Chan, Arnaud Guerqin, and Mauro Sozio. 2018. Fully dynamic k-center clustering. In WWW. 579–587.
[8]
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 SIGMOD. 123–134.
[9]
Yong Huat Chew, Boon-Hee Soong, 2016. Potential game theory.
[10]
Ashish Chiplunkar, Sagar Kale, and Sivaramakrishnan Natarajan Ramamoorthy. 2020. How to solve fair k-center in massive data models. In ICML. 1877–1886.
[11]
Dong-Wan Choi, Chin-Wan Chung, and Yufei Tao. 2012. A Scalable Algorithm for Maximizing Range Sum in Spatial Databases. PVLDB 5, 11 (2012).
[12]
Phillip Coorey. [n. d.]. Vaccination challenge switches from supply to demand. https://www.afr.com/politics/federal/vaccination-challenge-switches-from-supply-to-demand-20210906-p58p2j. Accessed April 21 2022.
[13]
Zvi Drezner and Horst W Hamacher. 2001. Facility Location: Applications and Theory.
[14]
Yang Du, Donghui Zhang, and Tian Xia. 2005. The optimal-location query. In International Symposium on Spatial and Temporal Databases. 163–180.
[15]
Junhao Gan and Yufei Tao. 2015. DBSCAN revisited: Mis-claim, un-fixability, and approximation. In SIGMOD. 519–530.
[16]
Nicolas Gast, Guillaume Massonnet, Daniël Reijsbergen, and Mirco Tribastone. 2015. Probabilistic forecasts of bike-sharing systems for journey planning. In CIKM. 703–712.
[17]
Yingqiang Ge, Xiaoting Zhao, Lucia Yu, Saurabh Paul, Diane Hu, Chu-Cheng Hsieh, and Yongfeng Zhang. 2022. Toward Pareto Efficient Fairness-Utility Trade-off in Recommendation through Reinforcement Learning. In WSDM. 316–324.
[18]
Sandhya Harikumar and PV Surya. 2015. K-medoid clustering for heterogeneous datasets. Procedia Computer Science 70 (2015), 226–237.
[19]
Christopher Jung, Sampath Kannan, and Neil Lutz. 2019. A center in your neighborhood: Fairness in facility location. arXiv preprint arXiv:1908.09041 (2019).
[20]
Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. 85–103.
[21]
Matthäus Kleindessner, Pranjal Awasthi, and Jamie Morgenstern. 2019. Fair k-center clustering for data summarization. In ICML. 3448–3457.
[22]
Vijay Konda and John Tsitsiklis. 1999. Actor-critic algorithms. NeurIPS 12 (1999).
[23]
Mingzhao Li, Zhifeng Bao, Timos Sellis, and Shi Yan. 2016. Visualization-aided exploration of the real estate data. In ADC. 435–439.
[24]
Mingzhao Li, Zhifeng Bao, Timos Sellis, Shi Yan, and Rui Zhang. 2018. HomeSeeker: A visual analytics system of real estate data. Journal of Visual Languages & Computing 45 (2018), 1–16.
[25]
Ruifeng Liu, Ada Wai-Chee Fu, Zitong Chen, Silu Huang, and Yubao Liu. 2016. Finding multiple new optimal locations in a road network. In SIGSPATIAL. 1–10.
[26]
Yubao Liu, RaymondChi-Wing Wong, Ke Wang, Zhijie Li, Cheng Chen, and Zhitong Chen. 2013. A new approach for maximizing bichromatic reverse nearest neighbor search. Knowledge and Information Systems 36, 1 (2013), 23–58.
[27]
Zhaoyang Liu, Yanyan Shen, and Yanmin Zhu. 2018. Inferring dockless shared bike distribution in new cities. In WSDM. 378–386.
[28]
Hui Luo, Zhifeng Bao, Farhana M Choudhury, and J Shane Culpepper. 2019. Dynamic ridesharing in peak travel periods. TKDE 33, 7 (2019), 2888–2902.
[29]
Hui Luo, Farhana M Choudhury, Zhifeng Bao, J Shane Culpepper, and Bang Zhang. 2018. MaxBRkNN Queries for Streaming Geo-Data. In DASFAA 2018. 647–664.
[30]
Ziyan Luo and Congcong Miao. 2022. RLMob: Deep Reinforcement Learning for Successive Mobility Prediction. In WSDM. 648–656.
[31]
Roger B Myerson. 1978. Refinements of the Nash equilibrium concept. International journal of game theory 7, 2 (1978), 73–80.
[32]
Susan Hesse Owen and Mark S Daskin. 1998. Strategic facility location: A review. European journal of operational research 111, 3 (1998), 423–447.
[33]
Nenad N. Petrovic, Vlado Dimovski, Judita Peterlin, Maja Mesko, and Vasja Roblek. 2021. Data-Driven Solutions in Smart Cities: The case of Covid-19. In Companion of The Web Conference 2021. 648–656.
[34]
Martin L Puterman. 2014. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons.
[35]
Jianzhong Qi, Rui Zhang, Lars Kulik, Dan Lin, and Yuan Xue. 2012. The min-dist location selection query. In ICDE. 366–377.
[36]
Jianzhong Qi, Rui Zhang, Yanqiu Wang, Andy Yuan Xue, Ge Yu, and Lars Kulik. 2014. The min-dist location selection and facility replacement queries. WWW 17, 6 (2014), 1261–1293.
[37]
Sayan Sen Sarma, Koushik Sinha, Goutam Chakraborty, Bhabani P Sinha, 2020. Optimal distribution of traffic in manhattan road networks for minimizing routing-time. TITS 22, 11 (2020), 6799–6820.
[38]
SBSNews. [n. d.]. Not enough COVID-19 vaccine supply. https://www.sbs.com.au/news/not-enough-covid-19-vaccine-supply-for-victoria-as-state-records-64-new-cases/100c39e8-7434-4cfd-82dd-09dce5a7812f. Accessed April 21 2022.
[39]
Erich Schubert, Jörg Sander, Martin Ester, Hans Peter Kriegel, and Xiaowei Xu. 2017. DBSCAN revisited, revisited: why and how you should (still) use DBSCAN. TODS 42, 3 (2017), 1–21.
[40]
David B Shmoys, Éva Tardos, and Karen Aardal. 1997. Approximation algorithms for facility location problems. In Proceedings of the twenty-ninth annual ACM Symposium on Theory of Computing. 265–274.
[41]
Till Speicher, Hoda Heidari, Nina Grgic-Hlaca, Krishna P Gummadi, Adish Singla, Adrian Weller, and Muhammad Bilal Zafar. 2018. A unified approach to quantifying algorithmic unfairness: Measuring individual &group unfairness via inequality indices. In SIGKDD. 2239–2248.
[42]
Tom Sühr, Asia J Biega, Meike Zehlike, Krishna P Gummadi, and Abhijnan Chakraborty. 2019. Two-sided fairness for repeated matchings in two-sided markets: A case study of a ride-hailing platform. In SIGKDD. 3082–3092.
[43]
Richard S Sutton, David McAllester, Satinder Singh, and Yishay Mansour. 1999. Policy gradient methods for reinforcement learning with function approximation. NeurIPS 12 (1999).
[44]
Hu Wang, Hui Li, Meng Wang, and Jiangtao Cui. 2021. Addressing the Hardness of k-Facility Relocation Problem: A Pair of Approximate Solutions. In CIKM. 1919–1928.
[45]
Shuai Wang, Tian He, Desheng Zhang, Yunhuai Liu, and Sang H. Son. 2019. Towards efficient sharing: A usage balancing mechanism for bike sharing systems. In WWW. 2011–2021.
[46]
Tingting Wang, Hui Luo, Zhifeng Bao, and Lei Duan. 2022. Dynamic ridesharing with minimal regret: Towards an enhanced engagement among three stakeholders. TKDE (2022).
[47]
Raymond Chi-Wing Wong, M. Tamer Özsu, Ada Wai-Chee Fu, Philip S. Yu, Lian Liu, and Yubao Liu. 2011. Maximizing bichromatic reverse nearest neighbor for Lp-norm in two and three-dimensional spaces. PVLDB 20, 6 (2011), 893–919.
[48]
Raymond Chi-Wing Wong, M Tamer Özsu, Philip S Yu, Ada Wai-Chee Fu, and Lian Liu. 2009. Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2, 1 (2009), 1126–1137.
[49]
Xiaokui Xiao, Bin Yao, and Feifei Li. 2011. Optimal location queries in road network databases. In ICDE. 804–815.
[50]
Dingqi Yang, Daqing Zhang, Vincent W Zheng, and Zhiyong Yu. 2014. Modeling user activity preference by leveraging user spatial temporal characteristics in LBSNs. IEEE Transactions on Systems, Man, and Cybernetics: Systems 45, 1 (2014), 129–142.
[51]
Donghui Zhang, Yang Du, Tian Xia, and Yufei Tao. 2006. Progressive computation of the min-dist optimal-location query. In PVLDB. 643–654.
[52]
Qiaoping Zhang and Isabelle Couloigner. 2005. A new and efficient k-medoid algorithm for spatial clustering. In International Conference on Computational Science and its Applications. 181–189.
[53]
Zenan Zhou, Wei Wu, Xiaohui Li, Mong Li Lee, and Wynne Hsu. 2011. Maxfirst for maxbrknn. In ICDE. 828–839.

Index Terms

  1. Facility Relocation Search For Good: When Facility Exposure Meets User Convenience

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      WWW '23: Proceedings of the ACM Web Conference 2023
      April 2023
      4293 pages
      ISBN:9781450394161
      DOI:10.1145/3543507
      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 the author(s) 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].

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 30 April 2023

      Permissions

      Request permissions for this article.

      Check for updates

      Badges

      Author Tags

      1. facility exposure
      2. facility relocation
      3. user convenience

      Qualifiers

      • Research-article
      • Research
      • Refereed limited

      Funding Sources

      • ARC

      Conference

      WWW '23
      Sponsor:
      WWW '23: The ACM Web Conference 2023
      April 30 - May 4, 2023
      TX, Austin, USA

      Acceptance Rates

      Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 202
        Total Downloads
      • Downloads (Last 12 months)84
      • Downloads (Last 6 weeks)4
      Reflects downloads up to 08 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      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

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media