{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:22Z","timestamp":1750220242038,"version":"3.41.0"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology (MOST) of Taiwan","doi-asserted-by":"crossref","award":["MOST 108-2221-E-006-142, MOST 108-2636-E-006-013, MOST 109-2636-E-006-025, and MOST 110-2636-E-006-011"],"award-info":[{"award-number":["MOST 108-2221-E-006-142, MOST 108-2636-E-006-013, MOST 109-2636-E-006-025, and MOST 110-2636-E-006-011"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2022,9,30]]},"abstract":"<jats:p>As the demand for taxi reservation services has increased, increasing the income of taxi drivers with advanced services has attracted attention. In this article, we propose a path decision framework that considers real-time spatial-temporal predictions and traffic network information. The goal is to optimize a taxi driver's profit when considering a reservation. Our framework contains four components. First, we build a grid-based road network graph for modeling traffic network information for speeding up the search process. Next, we conduct two prediction modules that adopt advanced deep learning techniques to guide proper search directions for recommending cruising locations. One module of the taxi demand prediction is used to estimate the pick-up probabilities of passengers in the city. Another one is destination prediction, which can predict the distribution of drop-off probabilities and capture the flow of potential passengers. Finally, we propose the H* (Heuristic-star) algorithm, which jointly considers pick-up probabilities, drop-off distribution, road network, distance, and time factors based on the attentive heuristic function to dynamically recommend next cruising locations. Compared with existing route planning methods, the experimental results on a real-world dataset have shown that our proposed approach is more effective and robust. Moreover, our designed search scheme in H* can decrease the computing time and allow the search process to be more efficient. To the best of our knowledge, this is the first work that focuses on guiding a route, which can increase the income of taxi drivers under the constraint of booking information.<\/jats:p>","DOI":"10.1145\/3490687","type":"journal-article","created":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T12:48:09Z","timestamp":1644583689000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Decision Framework to Recommend Cruising Locations for Taxi Drivers under the Constraint of Booking Information"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6924-1337","authenticated-orcid":false,"given":"Hsun-Ping","family":"Hsieh","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan"}]},{"given":"Fandel","family":"Lin","sequence":"additional","affiliation":[{"name":"Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan"}]},{"given":"Nai-Yu","family":"Chen","sequence":"additional","affiliation":[{"name":"Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan"}]},{"given":"Tzu-Hsin","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of California, Davis, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,2,11]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1177\/0734242X19833152"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.07.050"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.05.070"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"e_1_3_1_6_2","volume-title":"9th DIMACS Implementation Challenge\u2014Shortest Path (DIMACS\u201906)","author":"Bast Hannah","year":"2006","unstructured":"Hannah Bast, Stefan Funke, Domagoj Matijevi\u0107, Camil Demetrescu, Andrew Goldberg, and David Johnson. 2006. TRANSIT: Ultrafast shortest-path queries with linear-time preprocessing. In 9th DIMACS Implementation Challenge\u2014Shortest Path (DIMACS\u201906)."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2020-Spring48590.2020.9129197"},{"key":"e_1_3_1_8_2","article-title":"B-Ride: Ride sharing with privacy-preservation, trust and fair payment atop public blockchain","author":"Baza M.","year":"2019","unstructured":"M. Baza, N. Lasla, M. Mahmoud, and M. M. Abdallah. 2019. B-Ride: Ride sharing with privacy-preservation, trust and fair payment atop public blockchain. IEEE Transactions on Network Science and Engineering 8, 2 (2019), 1214--1229. DOI:10.1109\/TNSE.2019.2959230","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"e_1_3_1_9_2","article-title":"A two-phase anomaly detection model for secure intelligent transportation ride-hailing trajectories. 2020","author":"Belhadi A.","year":"2020","unstructured":"A. Belhadi, Y. Djenouri, G. Srivastava, D. Djenouri, A. Cano, and J. C.-W. Lin. 2020. A two-phase anomaly detection model for secure intelligent transportation ride-hailing trajectories. 2020. IEEE Transactions on Intelligent Transportation Systems 22, 7 (2020), 4496--4506. DOI:10.1109\/TITS.2020.3022612","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3363351"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/3056172.3056178"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3362693"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/PerCom.2013.6526736"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/3171642.3171713"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.5"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0534"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.12.020"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2068984.2068990"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00116-6"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57454-7_13"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/3091622.3091654"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365447"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5819"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_1_27_2","volume-title":"IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA\u201920)","author":"Kim J.-S.","year":"2020","unstructured":"J.-S. Kim, D. Pfoser, and A. Z\u00fcfle. 2020. IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA\u201920). 589--598. DOI:10.1109\/DSAA49011.2020.00074"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2017.8317888"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2915525"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2013.2262376"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2016.2518685"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.3141\/2634-10"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1314\/1\/012116"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.5555\/3201607.3201712"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3451393"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00137"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2937910"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2881419"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigComp.2018.00021"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2013.6728224"},{"key":"e_1_3_1_41_2","doi-asserted-by":"crossref","unstructured":"Nina Mazyavkina Sergey Sviridov Sergei Ivanov and Evgeny Burnaev. 2020. Reinforcement learning for combinatorial optimization: A survey. arXiv:2003.03600v3.","DOI":"10.1016\/j.cor.2021.105400"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2013.10.603"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSN.2018.00027"},{"key":"e_1_3_1_44_2","volume-title":"Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS'12)","author":"Rice Michael N.","year":"2012","unstructured":"Michael N. Rice and Vassilis Tsotras. 2012. Bidirectional A* Search with additive approximation bounds. In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS'12). 80--87."},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2018.07.007"},{"key":"e_1_3_1_46_2","article-title":"Modelling taxi drivers' behaviour for the next destination prediction","author":"Rossi A.","year":"2019","unstructured":"A. Rossi, G. Barlacchi, M. Bianchini, and B. Lepri. 2019. Modelling taxi drivers' behaviour for the next destination prediction. IEEE Transactions on Intelligent Transportation Systems 21, 7 (2020), 2980--2989. DOI:10.1109\/TITS.2019.2922002","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.5555\/1768570.1768573"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.5555\/1796151"},{"key":"e_1_3_1_49_2","first-page":"81","volume-title":"Proceedings of the Eleventh Annual Symposium on Combinatorial Search (SoCS'18)","author":"Shaham Eshed","year":"2018","unstructured":"Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, and Jeffrey S. Rosenschein. 2018. Minimizing node expansions in bidirectional search with consistent heuristics. In Proceedings of the Eleventh Annual Symposium on Combinatorial Search (SoCS'18). 81\u201398."},{"key":"e_1_3_1_50_2","article-title":"Traveling officer problem: Managing car parking violations efficiently using sensor data","author":"Shao Wei","year":"2017","unstructured":"Wei Shao, Flora D. Salim, Tao Gu, Ngoc-Thanh Dinh, and Jeffrey Chan. 2017. Traveling officer problem: Managing car parking violations efficiently using sensor data. IEEE Internet of Things Journal 5, 2 (2018), 802--810. DOI:10.1109\/JIOT.2017.2759218","journal-title":"IEEE Internet of Things Journal"},{"key":"e_1_3_1_51_2","first-page":"26","article-title":"SFpark: San Francisco knows how to park it","volume":"23","author":"Simons Dani","year":"2012","unstructured":"Dani Simons. 2012. SFpark: San Francisco knows how to park it. Sustainable Transportation 23 (2012), 26\u201327.","journal-title":"Sustainable Transportation"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2006.1706730"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0192274"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/7.869506"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21856"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1103378"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.5038\/2375-0901.17.3.8"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.5555\/2969239.2969329"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2755684"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015668"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.5555\/3504035.3504351"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.5555\/3037281.3037333"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.3390\/a11040044"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2016.51"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0194629"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840676"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/9184891"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.08.001"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.09.090"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490687","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:29Z","timestamp":1750188629000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9,30]]}},"alternative-id":["10.1145\/3490687"],"URL":"https:\/\/doi.org\/10.1145\/3490687","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"type":"print","value":"2158-656X"},{"type":"electronic","value":"2158-6578"}],"subject":[],"published":{"date-parts":[[2022,2,11]]},"assertion":[{"value":"2020-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}