{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:27:28Z","timestamp":1767637648301,"version":"3.48.0"},"reference-count":31,"publisher":"Maximum Academic Press","issue":"2","license":[{"start":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T00:00:00Z","timestamp":1395360000000},"content-version":"unspecified","delay-in-days":20,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Traditional Route Search aims at finding the path that goes through geographical entities that are relevant to the provided search terms from the start point to the end point. Without constraints, traditional Route Search visiting multiple locations is unreliable because locations may close after a specified time. In this paper, time constraint (operating hours of each location) is drawn into Route Search query in order to make the query more realistic. Two methods are proposed in this paper, namely Route Search for fixed locations (\n                    <jats:italic>RFix<\/jats:italic>\n                    ) and Route Search for flexible locations (\n                    <jats:italic>RFlex<\/jats:italic>\n                    ). These two queries are different from the existing Route Search query because (1) the end point is not pre-defined and (2) time constraint is involved. Our two proposal queries consider whether the locations are specifically pre-defined by the user or only the location types are specified. In each method, two propositions are presented for pruning expansion branches, which highly improves the performance. Our experiments verified the applicability of\n                    <jats:italic>RFix<\/jats:italic>\n                    and\n                    <jats:italic>RFlex<\/jats:italic>\n                    to solve Route Search queries with time constraint queries.\n                  <\/jats:p>","DOI":"10.1017\/s0269888914000058","type":"journal-article","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T11:20:53Z","timestamp":1395400853000},"page":"217-233","source":"Crossref","is-referenced-by-count":2,"title":["Time constraint route search over multi-locations"],"prefix":"10.48130","volume":"29","author":[{"given":"Geng","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefeng","family":"Xuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Taniar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maytham","family":"Safar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bala","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2014,3,21]]},"reference":[{"key":"S0269888914000058_ref6","doi-asserted-by":"crossref","unstructured":"Goh J. Y. , Taniar D. 2004b. Mobile data mining by location dependencies. In IDEAL, Lecture Notes in Computer Science, Yang, Z. R., Everson, R. M. & Yin, H. (eds), 3177, 225\u2013231. Springer, ISBN 3-540-22881-0.","DOI":"10.1007\/978-3-540-28651-6_33"},{"key":"S0269888914000058_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"S0269888914000058_ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/269495"},{"key":"S0269888914000058_ref12","doi-asserted-by":"crossref","unstructured":"Ku W.-S. , Zimmermann R. , Wang H. , Wan C.-N. 2005. Adaptive nearest neighbor queries in travel time networks. In Proceedings of ACM GIS, Shahabi, C. & Boucelma, O. (eds). Bremen, Germany, 210\u2013219. ACM Press, November.","DOI":"10.1145\/1097064.1097094"},{"key":"S0269888914000058_ref8","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/386472"},{"key":"S0269888914000058_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-010-0498-y"},{"key":"S0269888914000058_ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2008.31"},{"key":"S0269888914000058_ref4","first-page":"345","volume-title":"Communications and Computer Networks","author":"Ehliar","year":"2005"},{"key":"S0269888914000058_ref5","doi-asserted-by":"crossref","unstructured":"Goh J. , Taniar D. 2004a. Mining frequency pattern from mobile users. In KES, Lecture Notes in Computer Science, Negoita, M. G., Howlett, R. J. & Jain, L. C. (eds), 3215, 795\u2013801. Springer, ISBN 3-540-23205-2.","DOI":"10.1007\/978-3-540-30134-9_106"},{"key":"S0269888914000058_ref7","unstructured":"Huang X. , Jensen C. S. 2004. In-route skyline querying for location-based services. In W2GIS, Lecture Notes in Computer Science, Kwon, Y. J., Bouju, A. & Claramunt, C. (eds), 3428, 120\u2013135. Springer, ISBN 3-540-26004-8."},{"key":"S0269888914000058_ref10","doi-asserted-by":"crossref","unstructured":"Kanza Y. , Safra E. , Sagiv Y. 2009. Route search over probabilistic geospatial data. In SSTD, Lecture Notes in Computer Science, Mamoulis, N., Seidl, T., Pedersen, T. B., Torp, K. & Assent, I. (eds), 5644, 153\u2013170. Springer, ISBN 978-3-642-02981-3.","DOI":"10.1007\/978-3-642-02982-0_12"},{"key":"S0269888914000058_ref11","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M. R. , Shahabi C. 2004. Voronoi-based k nearest neighbor search for spatial network databases. In Proceedings of 30th VLDB, Nascimento, M. A., \u00d6zsu, M. T., Kossmann, D., Miller, R. J., Blakeley, J. A. & Schiefer, K. B. (eds). Toronto, Canada, 840\u2013851. Morgan Kaufmann Publishers Inc., ISBN 0-12-088469-0.","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"S0269888914000058_ref14","doi-asserted-by":"publisher","DOI":"10.1002\/9780470317013"},{"key":"S0269888914000058_ref15","doi-asserted-by":"crossref","unstructured":"Papadias D. , Zhang J. , Mamoulis N. , Tao Y. 2003. Query processing in spatial network databases. In Proceedings of 29th VLDB, Freytag, J. C., Lockemann, P. C., Abiteboul, S., Carey, M. J., Selinger, P. G. & Heuer, A. (eds). Berlin, Germany, 802\u2013813. Morgan Kaufmann Publishers Inc., ISBN 0-12-722442-4.","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"S0269888914000058_ref17","doi-asserted-by":"crossref","unstructured":"Roussopoulos N. , Kelley S. , Vincent F. 1995. Nearest neighbor queries. In Proceedings of ACM SIGMOD, San Jose, California, 71\u201379. ACM Press.","DOI":"10.1145\/223784.223794"},{"key":"S0269888914000058_ref18","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/692568"},{"key":"S0269888914000058_ref19","first-page":"69","article-title":"On mining movement pattern from mobile users","volume":"3","author":"Taniar","year":"2007","journal-title":"IJDSN"},{"key":"S0269888914000058_ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015682215394"},{"key":"S0269888914000058_ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.01.017"},{"key":"S0269888914000058_ref22","doi-asserted-by":"crossref","unstructured":"Terrovitis M. , Bakiras S. , Papadias D. , Mouratidis K. 2005. Constrained shortest path computation. In Proceedings of SSTD, Lecture Notes in Computer Science, Medeiros, C. B., Egenhofer, M. J. & Bertino, E. (eds), 3633, 181\u2013199. Springer, ISBN 3-540-28127-4.","DOI":"10.1007\/11535331_11"},{"key":"S0269888914000058_ref23","doi-asserted-by":"crossref","unstructured":"Waluyo A. B. , Srinivasan B. , Taniar D. 2003. Optimal broadcast channel for data dissemination in mobile database environment. In Proceedings of APPT, Lecture Notes in Computer Science, Zhou, X., J\u00e4hnichen, S., Xu, M. & Cao, J. (eds), 2834, 655\u2013664. Springer, ISBN 3-540-20054-1.","DOI":"10.1007\/978-3-540-39425-9_76"},{"key":"S0269888914000058_ref24","doi-asserted-by":"crossref","unstructured":"Waluyo A. B. , Srinivasan B. , Taniar D. 2004. A taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile database. In Proceedings of AINA. IEEE Computer Society, Fukuoka, Japan, 213\u2013218, ISBN 0-7695-2051-0.","DOI":"10.1109\/AINA.2004.1283913"},{"key":"S0269888914000058_ref16","unstructured":"Pearson J. , Guesgen H. W. 1998. Some experimental results of applying heuristic search to route finding. In Proceedings of FLAIRS Conference, Cook D. J. (ed.). Sanibel Island, Florida, USA, 394\u2013398. AAAI Press, ISBN 1-57735-051-0."},{"key":"S0269888914000058_ref26","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/161239"},{"key":"S0269888914000058_ref27","doi-asserted-by":"crossref","unstructured":"Xuan K. , Zhao G. , Taniar D. , Srinivasan B. 2008. Continuous range search query processing in mobile navigation. In Proceedings of ICPADS. IEEE, Melbourne, Australia, 361\u2013368.","DOI":"10.1109\/ICPADS.2008.69"},{"key":"S0269888914000058_ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2009.2026372"},{"key":"S0269888914000058_ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2011.2167113"},{"key":"S0269888914000058_ref9","doi-asserted-by":"crossref","unstructured":"Kanza Y. , Safra E. , Sagiv Y. , Doytsher Y. 2008b. Heuristic algorithms for route-search queries over geographical data. In Proceedings of ACM GIS, Aref, W. G., Mokbel, M. F. & Schneider, M. (eds). Irvine, California, USA, 11. ACM Press, November.","DOI":"10.1145\/1463434.1463449"},{"key":"S0269888914000058_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.09.019"},{"key":"S0269888914000058_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-005-6671-1"},{"key":"S0269888914000058_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.02.005"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888914000058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:41:57Z","timestamp":1767624117000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888914000058\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["S0269888914000058"],"URL":"https:\/\/doi.org\/10.1017\/s0269888914000058","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}