{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:58:50Z","timestamp":1767085130310,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T00:00:00Z","timestamp":1579219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Doctoral Fund of Xi'an Polytechnic University","award":["BS201919"],"award-info":[{"award-number":["BS201919"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61672408, 61976168, 61972309"],"award-info":[{"award-number":["61672408, 61976168, 61972309"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100013064","name":"Key Research and Development Plan of Jiangxi Province","doi-asserted-by":"crossref","award":["20181ACE50029"],"award-info":[{"award-number":["20181ACE50029"]}],"id":[{"id":"10.13039\/501100013064","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Research and Development Plan of Shaanxi Province","award":["2019ZDLGY13-09"],"award-info":[{"award-number":["2019ZDLGY13-09"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2020,2,29]]},"abstract":"<jats:p>\n            The facility relocation (FR) problem, which aims to optimize the placement of facilities to accommodate the changes of users\u2019 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\n            <jats:sc>motion-fr<\/jats:sc>\n            , to address the preceding limitation. Specifically, we present a framework called\n            <jats:sc>frost<\/jats:sc>\n            to address it.\n            <jats:sc>frost<\/jats:sc>\n            comprises two exact algorithms:\n            <jats:italic>index based<\/jats:italic>\n            and\n            <jats:italic>index free<\/jats:italic>\n            . The former is designed to address the scenario when facilities and objects are known\n            <jats:italic>a priori<\/jats:italic>\n            , whereas the latter solves the\n            <jats:sc>motion-fr<\/jats:sc>\n            problem by jettisoning this assumption. Further, we extend the index-based algorithm to solve the general\n            <jats:italic>k<\/jats:italic>\n            -\n            <jats:sc>motion-fr<\/jats:sc>\n            problem, which aims to relocate\n            <jats:italic>k<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.1145\/3361740","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T22:12:06Z","timestamp":1585951926000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["FROST"],"prefix":"10.1145","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6699-6902","authenticated-orcid":false,"given":"Meng","family":"Wang","sequence":"first","affiliation":[{"name":"Xi\u2019an Polytechnic University, Shaanxi, China"}]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[{"name":"Xidian University, Shaanxi, China"}]},{"given":"Jiangtao","family":"Cui","sequence":"additional","affiliation":[{"name":"Xidian University, Shaanxi, China"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}]},{"given":"Ping","family":"Liu","sequence":"additional","affiliation":[{"name":"Xidian University, Shaanxi, China"}]}],"member":"320","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/345848.345858"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.108"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612172"},{"key":"e_1_2_1_4_1","volume-title":"Place your next branch with MILE-RUN: Min-dist location selection over user movement. Information Sciences 463--464","author":"Cui Jiangtao","year":"2018","unstructured":"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. 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."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.169"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869866"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 2018 European Symposium on Algorithms. Article 39","author":"Goranci Gramoz","year":"2018","unstructured":"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. 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."},{"key":"e_1_2_1_9_1","volume-title":"Local search heuristics for the mobile facility location problem. Computers 8 Operations Research 62","author":"Halper Russell D.","year":"2015","unstructured":"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. 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."},{"key":"e_1_2_1_10_1","article-title":"Efficient computation of the optimal accessible location for a group of mobile agents","volume":"4","author":"Mustafizur Rahman Khan A. K. M.","year":"2018","unstructured":"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. 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.","journal-title":"ACM Transactions on Spatial Algorithms and Systems"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_16"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820876"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835942"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071616"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.45"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0223-7"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.10.028"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1186\/1476-072X-12-14"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.2307\/143141"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.01.011"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2580138"},{"key":"e_1_2_1_22_1","volume-title":"Smeaton","author":"Wang Peng","year":"2015","unstructured":"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\u201915 Adjunct) . 979--984. 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\u201915 Adjunct). 979--984."},{"key":"e_1_2_1_23_1","volume-title":"Rump","author":"Wang Qian","year":"2003","unstructured":"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. 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."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.2307\/1938423"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1700242"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402734"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009962"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.87"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164183"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030112.2030126"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526816"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3361740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3361740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:09Z","timestamp":1750202589000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3361740"}},"subtitle":["Movement History\u2013Conscious Facility Relocation"],"short-title":[],"issued":{"date-parts":[[2020,1,17]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2,29]]}},"alternative-id":["10.1145\/3361740"],"URL":"https:\/\/doi.org\/10.1145\/3361740","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2020,1,17]]},"assertion":[{"value":"2019-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}