{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T01:01:26Z","timestamp":1767142886313,"version":"build-2238731810"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0"},{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2019R1A2C1088126"],"award-info":[{"award-number":["NRF-2019R1A2C1088126"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11227-021-03776-7","type":"journal-article","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T06:02:47Z","timestamp":1617948167000},"page":"12561-12580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient methods for finding an optimal network location for travel planning"],"prefix":"10.1007","volume":"77","author":[{"given":"Junkyu","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4049-7950","authenticated-orcid":false,"given":"Seog","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"3776_CR1","doi-asserted-by":"crossref","unstructured":"Zhong R, Li G, Tan K -L, Zhou L (2013) G-Tree: an efficient index for knn search on road networks. In: ACM CIKM, pp. 39\u201348","DOI":"10.1145\/2505515.2505749"},{"issue":"8","key":"3776_CR2","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/TKDE.2015.2399306","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong R, Li G, Tan K-L, Zhou L, Gong Z (2015) G-tree: an efficient and scalable index for spatial search on road networks. IEEE Trans Knowl Data Eng 27(8):2175\u20132189","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3776_CR3","doi-asserted-by":"crossref","unstructured":"Yan D, Zhao Z, Ng W (2011) Efficient algorithms for finding optimal meeting point on road networks. In: Proceedings of the VLDB Endowment, pp 1\u201311","DOI":"10.14778\/3402707.3402734"},{"key":"3776_CR4","unstructured":"Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: IEEE, 20th International Conference on Data Engineering, pp 301\u2013312"},{"issue":"6","key":"3776_CR5","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. IEEE Trans Knowl Data Eng 17(6):820\u2013833","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"3776_CR6","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TKDE.2015.2509998","volume":"28","author":"S Shang","year":"2016","unstructured":"Shang S, Chen L, Wei Z, Jensen CS, Wen JR, Kalnis P (2016) Collective travel planning in spatial networks. IEEE Trans knowl Data Eng 28(5):1132\u20131146","journal-title":"IEEE Trans knowl Data Eng"},{"issue":"2","key":"3776_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1111\/j.1467-9787.1968.tb01323.x","volume":"8","author":"L Cooper","year":"1968","unstructured":"Cooper L (1968) An extension of the generalized Weber problem. J Reg Sci 8(2):181\u2013197","journal-title":"J Reg Sci"},{"issue":"3","key":"3776_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1111\/j.1467-9787.1977.tb00511.x","volume":"17","author":"L Cooper","year":"1977","unstructured":"Cooper L (1977) The multifacility location problem: applications and descent theorems. J Reg Sci 17(3):409\u2013419","journal-title":"J Reg Sci"},{"key":"3776_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"RF Sproull","year":"1991","unstructured":"Sproull RF (1991) Refinements to nearest-neighbor searching in $$k$$-dimensional trees. Algorithmica 6:579\u2013589","journal-title":"Algorithmica"},{"key":"3776_CR10","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: ACM SIGMOD, International Conference on Management of Data, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"issue":"2","key":"3776_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10115-013-0686-y","volume":"42","author":"D Yan","year":"2015","unstructured":"Yan D, Zhao Z, Ng W (2015) Efficient processing of optimal meeting point queries in euclidean space and road networks. Knowl Inf Syst 42(2):319\u2013351","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"3776_CR12","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM 45(6):891\u2013923","journal-title":"J ACM"},{"key":"3776_CR13","doi-asserted-by":"crossref","unstructured":"Ciaccia P, Patella M (2000) PAC nearest neighbor queries: approximate and controlled search in high dimensional and metric spaces. In: IEEE Proceedings of 16th International Conference on Data Engineering, pp 244\u2013255","DOI":"10.1109\/ICDE.2000.839417"},{"key":"3776_CR14","doi-asserted-by":"crossref","unstructured":"Corral A, Ca\u00f1adas J, Vassilakopoulos M (2002) Approximate algorithms for distance-based queries in high-dimensional data spaces using R-trees. In: East European Conference on Advances in Databases and Information Systems, pp163-176","DOI":"10.1007\/3-540-45710-0_14"},{"issue":"2","key":"3776_CR15","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1093\/comjnl\/bxh060","volume":"48","author":"A Corral","year":"2005","unstructured":"Corral A, Vassilakopoulos M (2005) On approximate algorithms for distance-based queries using R-trees. Comput J 48(2):220\u2013238","journal-title":"Comput J"},{"key":"3776_CR16","unstructured":"Demetrescu C (2010) Road network datasets. http:\/\/users.diag.uniroma1.it\/challenge9\/download.shtml Accessed 1 July 2020"},{"key":"3776_CR17","doi-asserted-by":"crossref","unstructured":"Li Z, Chen L, Wang Y (2019) G*-tree: an efficient spatial index on road networks. In: IEEE 35th International Conference on Data Engineering (ICDE), pp 268\u2013279","DOI":"10.1109\/ICDE.2019.00032"},{"key":"3776_CR18","doi-asserted-by":"publisher","unstructured":"Jung J, Park S, Kim Y, Park S (2019) Route recommendation with dynamic user preference on road networks. In: 2019 IEEE International Conference on Big Data and Smart Computing (BigComp), Kyoto, Japan, 2019, pp. 1\u20137. https:\/\/doi.org\/10.1109\/BIGCOMP.2019.8679379","DOI":"10.1109\/BIGCOMP.2019.8679379"},{"key":"3776_CR19","doi-asserted-by":"publisher","unstructured":"Chen F, Zhang P, Lin H, Tang S (2019) Continuous path-based range keyword queries on road networks. In: 2019 IEEE International Conference on Big Knowledge (ICBK), Beijing, China, 2019, pp. 42\u201349. https:\/\/doi.org\/10.1109\/ICBK.2019.00014","DOI":"10.1109\/ICBK.2019.00014"},{"key":"3776_CR20","doi-asserted-by":"publisher","unstructured":"Zhao J, Gao Y, Chen G, Chen R (2017) Towards efficient framework for time-aware spatial keyword queries on road networks. ACM Transactions on Information Systems (TOIS) 36, 3, Article 24 (April 2018), 48 pages. https:\/\/doi.org\/10.1145\/3143802","DOI":"10.1145\/3143802"}],"updated-by":[{"DOI":"10.1007\/s11227-021-03837-x","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:00:00Z","timestamp":1620000000000}}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03776-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03776-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03776-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T09:36:09Z","timestamp":1635154569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03776-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,9]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["3776"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03776-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,9]]},"assertion":[{"value":"25 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2021","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11227-021-03837-x","URL":"https:\/\/doi.org\/10.1007\/s11227-021-03837-x","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}