{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:40:08Z","timestamp":1750185608204,"version":"3.41.0"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T00:00:00Z","timestamp":1700438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council of Taiwan","doi-asserted-by":"crossref","award":["111-2636-E-006-026, 110-2636-E-006-011, and 109-2636-E-006-025"],"award-info":[{"award-number":["111-2636-E-006-026, 110-2636-E-006-011, and 109-2636-E-006-025"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ministry of Education (MOE) of Taiwan"},{"name":"Focused Fields at Top Foreign University"},{"name":"Information Sciences Institute and Viterbi School of Engineering from University of Southern California"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>Transportation between satellite cities or inside the city center has always been a crucial factor in contributing to a better quality of life. This article focuses on multi-criteria distributed and competitive route planning for stationary resources in regions where neither real-time nor historical availability of the targeted resource is accessible. We propose an inference-than-planning approach, with an availability inference for stationary resources in areas with no sensor coverage and a distributed routing where no information is shared among agents. We leverage the inferred availability and network structure in the searching space to suggest a two-stage algorithm with three relaxing policies: adjacent cruising, on-orbital annealing, and orbital transitioning. We take two publicly accessible parking-slot datasets from San Francisco and Melbourne for evaluation. Overall results show that the proposed availability inference model can retain decent performance. Furthermore, our proposed routing algorithm maintains the quality of solutions by achieving the Pareto-optimal between searching experience and resource utilization among baseline and state-of-the-art methods under various circumstances.<\/jats:p>","DOI":"10.1145\/3569937","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T05:00:50Z","timestamp":1700542850000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Network Structure in Multi-criteria Distributed and Competitive Stationary-resource Searching"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7024-2476","authenticated-orcid":false,"given":"Fandel","family":"Lin","sequence":"first","affiliation":[{"name":"USC Information Sciences Institute, USA and National Cheng Kung University, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6924-1337","authenticated-orcid":false,"given":"Hsun-Ping","family":"Hsieh","sequence":"additional","affiliation":[{"name":"National Cheng Kung University, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2023,11,20]]},"reference":[{"issue":"8","key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1177\/0734242X19833152","article-title":"Simulation and optimization of dynamic waste collection routes","volume":"37","author":"Abdallah Mohamed","year":"2019","unstructured":"Mohamed Abdallah, Mohamad Adghim, Munjed Maraqa, and Elkhalifa Aldahab. 2019. Simulation and optimization of dynamic waste collection routes. Waste Manage. Res. 37, 8 (2019), 793\u2013802.","journal-title":"Waste Manage. Res."},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.future.2018.07.050","article-title":"Autonomic computation offloading in mobile edge for IoT applications","volume":"90","author":"Alam Md Golam Rabiul","year":"2019","unstructured":"Md Golam Rabiul Alam, Mohammad Mehedi Hassan, Md ZIa Uddin, Ahmad Almogren, and Giancarlo Fortino. 2019. Autonomic computation offloading in mobile edge for IoT applications. Fut. Gener. Comput. Syst. 90 (2019), 149\u2013157.","journal-title":"Fut. Gener. Comput. Syst."},{"issue":"1","key":"e_1_3_2_4_2","first-page":"143","article-title":"Where am i parking: Incentive online parking-space sharing mechanism with privacy protection","volume":"19","author":"An Dou","year":"2020","unstructured":"Dou An, Qingyu Yang, Donghe Li, Wei Yu, Wei Zhao, and Chao-Bo Yan. 2020. Where am i parking: Incentive online parking-space sharing mechanism with privacy protection. IEEE Trans. Autom. Sci. Eng. 19, 1 (2020), 143\u2013162.","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"e_1_3_2_5_2","first-page":"1","article-title":"Spatio-temporal matching for urban transportation applications","volume":"3","author":"Ayala Daniel","year":"2018","unstructured":"Daniel Ayala, Ouri Wolfson, Bhaskar Dasgupta, Jie Lin, and Bo Xu. 2018. Spatio-temporal matching for urban transportation applications. ACM Trans. Spatial Algor. Syst. 3, 4 (2018), 1\u201339.","journal-title":"ACM Trans. Spatial Algor. Syst."},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/2093973.2094014","volume-title":"Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","author":"Ayala Daniel","year":"2011","unstructured":"Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar Dasgupta, and Jie Lin. 2011. Parking slot assignment games. In Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 299\u2013308."},{"key":"e_1_3_2_7_2","first-page":"27","volume-title":"Proceedings of the IEEE 13th International Conference on Mobile Data Management","author":"Ayala Daniel","year":"2012","unstructured":"Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar DasGupta, and Jie Lin. 2012. Parking in competitive settings: A gravitational approach. In Proceedings of the IEEE 13th International Conference on Mobile Data Management. IEEE, 27\u201332."},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/2424321.2424328","volume-title":"Proceedings of the 20th International Conference on Advances in Geographic Information Systems","author":"Ayala Daniel","year":"2012","unstructured":"Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar DasGupta, and Jie Lin. 2012. Pricing of parking for congestion reduction. In Proceedings of the 20th International Conference on Advances in Geographic Information Systems. 43\u201351."},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"44059","DOI":"10.1109\/ACCESS.2018.2864157","article-title":"Predicting available parking slots on critical and regular services by exploiting a range of open data","volume":"6","author":"Badii Claudio","year":"2018","unstructured":"Claudio Badii, Paolo Nesi, and Irene Paoli. 2018. Predicting available parking slots on critical and regular services by exploiting a range of open data. IEEE Access 6 (2018), 44059\u201344071.","journal-title":"IEEE Access"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-642-03456-5_24","volume-title":"Efficient Algorithms","author":"Bast Hannah","year":"2009","unstructured":"Hannah Bast. 2009. Car or public transport\u2013Two worlds. In Efficient Algorithms. Vol. 5760, Springer, 355\u2013367."},{"key":"e_1_3_2_11_2","first-page":"290","volume-title":"European Symposium on Algorithms","author":"Bast Hannah","year":"2010","unstructured":"Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, and Fabien Viger. 2010. Fast routing in very large public transportation networks using transfer patterns. In European Symposium on Algorithms. Springer, 290\u2013301."},{"key":"e_1_3_2_12_2","article-title":"Transit ultrafast shortest-path queries with linear-time preprocessing","author":"Bast Holger","year":"2006","unstructured":"Holger Bast, Stefan Funke, and Domagoj Matijevic. 2006. Transit ultrafast shortest-path queries with linear-time preprocessing. In 9th DIMACS Implementation Challenge [1].","journal-title":"9th DIMACS Implementation Challenge [1]"},{"key":"e_1_3_2_13_2","first-page":"1","volume-title":"Proceedings of the IEEE 91st Vehicular Technology Conference (VTC\u201920)","author":"Baza Mohamed","year":"2020","unstructured":"Mohamed Baza, Mohamed Mahmoud, Gautam Srivastava, Waleed Alasmary, and Mohamed Younis. 2020. A light blockchain-powered privacy-preserving organization scheme for ride sharing services. In Proceedings of the IEEE 91st Vehicular Technology Conference (VTC\u201920). IEEE, 1\u20136."},{"issue":"7","key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"4496","DOI":"10.1109\/TITS.2020.3022612","article-title":"A two-phase anomaly detection model for secure intelligent transportation ride-hailing trajectories","volume":"22","author":"Belhadi Asma","year":"2020","unstructured":"Asma Belhadi, Youcef Djenouri, Gautam Srivastava, Djamel Djenouri, Alberto Cano, and Jerry Chun-Wei Lin. 2020. A two-phase anomaly detection model for secure intelligent transportation ride-hailing trajectories. IEEE Trans. Intell. Transport. Syst. 22, 7 (2020), 4496\u20134506.","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"e_1_3_2_15_2","article-title":"On-street parking data in San Francisco\u2013sfpark sensor data and simulated crowd-sensing data","volume":"10","author":"Bock Fabian","year":"2018","unstructured":"Fabian Bock, Y. Attanasio, and S. Di Martino. 2018. On-street parking data in San Francisco\u2013sfpark sensor data and simulated crowd-sensing data. Harvard Dataverse 10.","journal-title":"Harvard Dataverse"},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1145\/3347146.3363351","volume-title":"Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","author":"Borutta Felix","year":"2019","unstructured":"Felix Borutta, Sebastian Schmoll, and Sabrina Friedl. 2019. Optimizing the spatio-temporal resource search problem with reinforcement learning (gis cup). In Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 628\u2013631."},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3362693","article-title":"Real-time traffic assignment using engineered customizable contraction hierarchies","volume":"24","author":"Buchhold Valentin","year":"2019","unstructured":"Valentin Buchhold, Peter Sanders, and Dorothea Wagner. 2019. Real-time traffic assignment using engineered customizable contraction hierarchies. J. Exp. Algor. 24 (2019), 1\u201328.","journal-title":"J. Exp. Algor."},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1145\/3347146.3363348","volume-title":"Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","author":"Buchin Kevin","year":"2019","unstructured":"Kevin Buchin, Irina Kostitsyna, Bram Custers, and Martijn Struijs. 2019. A sampling-based strategy for distributing taxis in a road network for occupancy maximization (gis cup). In Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 616\u2013619."},{"key":"e_1_3_2_19_2","article-title":"Front-to-end bidirectional heuristic search with near-optimal node expansions","author":"Chen Jingwei","year":"2017","unstructured":"Jingwei Chen, Robert C. Holte, Sandra Zilles, and Nathan R. Sturtevant. 2017. Front-to-end bidirectional heuristic search with near-optimal node expansions. arXiv:1703.03868. Retrieved from https:\/\/arxiv.org\/abs\/1703.03868.","journal-title":"arXiv:1703.03868"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1145\/2939672.2939785","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Chen Tianqi","year":"2016","unstructured":"Tianqi Chen and Carlos Guestrin. 2016. Xgboost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 785\u2013794."},{"issue":"3","key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1016\/j.eswa.2007.07.042","article-title":"Dynamic parking negotiation and guidance using an agent-based platform","volume":"35","author":"Chou Shuo-Yan","year":"2008","unstructured":"Shuo-Yan Chou, Shih-Wei Lin, and Chien-Chang Li. 2008. Dynamic parking negotiation and guidance using an agent-based platform. Expert Syst. Appl. 35, 3 (2008), 805\u2013817.","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"e_1_3_2_22_2","first-page":"12","article-title":"Entropy, relative entropy and mutual information","volume":"2","author":"Cover Thomas M.","year":"1991","unstructured":"Thomas M. Cover, Joy A. Thomas, et\u00a0al. 1991. Entropy, relative entropy and mutual information. Elements Inf. Theory 2, 1 (1991), 12\u201313.","journal-title":"Elements Inf. Theory"},{"issue":"9","key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.1016\/j.na.2005.10.049","article-title":"Honey-pot constrained searching with local sensory information","volume":"65","author":"DasGupta Bhaskar","year":"2006","unstructured":"Bhaskar DasGupta, Joao P. Hespanha, James Riehl, and Eduardo Sontag. 2006. Honey-pot constrained searching with local sensory information. Nonlin. Anal.: Theory Methods Appl. 65, 9 (2006), 1773\u20131793.","journal-title":"Nonlin. Anal.: Theory Methods Appl."},{"key":"e_1_3_2_24_2","first-page":"54","volume-title":"Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX\u201919)","author":"Delling Daniel","year":"2019","unstructured":"Daniel Delling, Julian Dibbelt, and Thomas Pajor. 2019. Fast and exact public transit routing with restricted pareto sets. In Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX\u201919). SIAM, 54\u201365."},{"issue":"3","key":"e_1_3_2_25_2","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/trsc.2014.0534","article-title":"Round-based public transit routing","volume":"49","author":"Delling Daniel","year":"2015","unstructured":"Daniel Delling, Thomas Pajor, and Renato F. Werneck. 2015. Round-based public transit routing. Transport. Sci. 49, 3 (2015), 591\u2013604.","journal-title":"Transport. Sci."},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"Delling Daniel","year":"2009","unstructured":"Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner. 2009. Engineering route planning algorithms. In Algorithmics of Large and Complex Networks. Vol. 5515, Springer, 117\u2013139."},{"key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/0-387-23550-7_15","volume-title":"Applied Research in Uncertainty Modeling and Analysis","author":"Dell\u2019Orco Mauro","year":"2005","unstructured":"Mauro Dell\u2019Orco and Du\u0161an Teodorovi\u0107. 2005. Multi agent systems approach to parking facilities management. In Applied Research in Uncertainty Modeling and Analysis. Vol. 20, Springer, 321\u2013339."},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/2068984.2068990","volume-title":"Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science","author":"Efentakis Alexandros","year":"2011","unstructured":"Alexandros Efentakis, Dieter Pfoser, and Agn\u00e8s Voisard. 2011. Efficient data management in support of shortest-path computation. In Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science. 28\u201333."},{"issue":"1","key":"e_1_3_2_29_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0377-2217(96)00116-6","article-title":"Connectedness of efficient solutions in multiple criteria combinatorial optimization","volume":"97","author":"Ehrgott Matthias","year":"1997","unstructured":"Matthias Ehrgott and Kathrin Klamroth. 1997. Connectedness of efficient solutions in multiple criteria combinatorial optimization. Eur. J. Operat. Res. 97, 1 (1997), 159\u2013166.","journal-title":"Eur. J. Operat. Res."},{"key":"e_1_3_2_30_2","first-page":"308","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Fang Jie-Yu","year":"2020","unstructured":"Jie-Yu Fang, Fandel Lin, and Hsun-Ping Hsieh. 2020. A multi-criteria system for recommending taxi routes with an advance reservation. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 308\u2013322."},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/B978-1-55860-377-6.50039-6","volume-title":"Machine Learning Proceedings 1995","author":"Gambardella Luca M.","year":"1995","unstructured":"Luca M. Gambardella and Marco Dorigo. 1995. Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Machine Learning Proceedings 1995. Elsevier, 252\u2013260."},{"key":"e_1_3_2_32_2","article-title":"Computers and intractability","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. 1979. Computers and intractability. A Guide to the Theory of NP-completeness (1979).","journal-title":"A Guide to the Theory of NP-completeness"},{"key":"e_1_3_2_33_2","first-page":"47","volume-title":"Proceedings of the 6th Annual ACM Symposium on Theory of Computing","author":"Garey Michael R.","year":"1974","unstructured":"Michael R. Garey, David S. Johnson, and Larry Stockmeyer. 1974. Some simplified NP-complete problems. In Proceedings of the 6th Annual ACM Symposium on Theory of Computing. 47\u201363."},{"issue":"1","key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","article-title":"Distance labeling in graphs","volume":"53","author":"Gavoille Cyril","year":"2004","unstructured":"Cyril Gavoille, David Peleg, St\u00e9phane P\u00e9rennes, and Ran Raz. 2004. Distance labeling in graphs. J. Algor. 53, 1 (2004), 85\u2013112.","journal-title":"J. Algor."},{"issue":"3","key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s11067-012-9183-1","article-title":"Modeling parking behavior under uncertainty: A static game theoretic versus a sequential neo-additive capacity modeling approach","volume":"13","author":"Guo Liya","year":"2013","unstructured":"Liya Guo, Shan Huang, Jun Zhuang, and Adel W. Sadek. 2013. Modeling parking behavior under uncertainty: A static game theoretic versus a sequential neo-additive capacity modeling approach. Netw. Spatial Econ. 13, 3 (2013), 327\u2013350.","journal-title":"Netw. Spatial Econ."},{"issue":"2","key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart Peter E.","year":"1968","unstructured":"Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet. 4, 2 (1968), 100\u2013107.","journal-title":"IEEE Trans. Syst. Sci. Cybernet."},{"key":"e_1_3_2_37_2","first-page":"6","volume-title":"Proceedings of the IEEE 8th International Conference on Smart City and Informatization (iSCI\u201920)","author":"Huang Xinxin","year":"2020","unstructured":"Xinxin Huang, Yingguo Gao, and Xiaohui Duan. 2020. An autonomous parking space planning system based on pattern searching algorithm. In Proceedings of the IEEE 8th International Conference on Smart City and Informatization (iSCI\u201920). IEEE, 6\u201312."},{"issue":"3","key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1162\/evco_a_00226","article-title":"How to specify a reference point in hypervolume calculation for fair performance comparison","volume":"26","author":"Ishibuchi Hisao","year":"2018","unstructured":"Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, and Yusuke Nojima. 2018. How to specify a reference point in hypervolume calculation for fair performance comparison. Evol. Comput. 26, 3 (2018), 411\u2013440.","journal-title":"Evol. Comput."},{"issue":"2","key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1049\/iet-its.2013.0184","article-title":"Short-term forecasting of available parking space using wavelet neural network model","volume":"9","author":"Ji Yanjie","year":"2015","unstructured":"Yanjie Ji, Dounan Tang, Phil Blythe, Weihong Guo, and Wei Wang. 2015. Short-term forecasting of available parking space using wavelet neural network model. IET Intell. Transport Syst. 9, 2 (2015), 202\u2013209.","journal-title":"IET Intell. Transport Syst."},{"key":"e_1_3_2_40_2","first-page":"2119","volume-title":"Proceedings of the IEEE International Conference on Communications (ICC\u201912)","author":"Jin Cheng","year":"2012","unstructured":"Cheng Jin, Lei Wang, Lei Shu, Yuyao Feng, and Xueqing Xu. 2012. A fairness-aware smart parking scheme aided by parking lots. In Proceedings of the IEEE International Conference on Communications (ICC\u201912). IEEE, 2119\u20132123."},{"key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1145\/2525314.2525458","volume-title":"Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","author":"Joss\u00e9 Gregor","year":"2013","unstructured":"Gregor Joss\u00e9, Matthias Schubert, and Hans-Peter Kriegel. 2013. Probabilistic parking queries using aging functions. In Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 452\u2013455."},{"key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/2632951.2632955","volume-title":"Proceedings of the 15th ACM International Symposium on Mobile ad hoc Networking and Computing","author":"Karaliopoulos Merkourios","year":"2014","unstructured":"Merkourios Karaliopoulos, Konstantinos Katsikopoulos, and Lambros Lambrinos. 2014. Bounded rationality can increase parking search efficiency. In Proceedings of the 15th ACM International Symposium on Mobile ad hoc Networking and Computing. 195\u2013204."},{"key":"e_1_3_2_43_2","first-page":"624","volume-title":"Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","author":"Kim Joon-Seok","year":"2019","unstructured":"Joon-Seok Kim, Dieter Pfoser, and Andreas Z\u00fcfle. 2019. Distance-aware competitive spatiotemporal searching using spatiotemporal resource matrix factorization (gis cup). In Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 624\u2013627."},{"issue":"3","key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1109\/TASE.2019.2948200","article-title":"Parking assignment: Minimizing parking expenses and balancing parking demand among multiple parking lots","volume":"17","author":"Kim Oanh Tran Thi","year":"2019","unstructured":"Oanh Tran Thi Kim, Nguyen H. Tran, Chuan Pham, Tuan LeAnh, My T. Thai, and Choong Seon Hong. 2019. Parking assignment: Minimizing parking expenses and balancing parking demand among multiple parking lots. IEEE Trans. Autom. Sci. Eng. 17, 3 (2019), 1320\u20131331.","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"e_1_3_2_45_2","first-page":"920","volume-title":"Proceedings of the IEEE Intelligent Vehicles Symposium (IV\u201911)","author":"Kobayashi Yuichi","year":"2011","unstructured":"Yuichi Kobayashi, Noboru Kiyama, Hirokazu Aoshima, and Masamori Kashiyama. 2011. A route search method for electric vehicles in consideration of range and locations of charging stations. In Proceedings of the IEEE Intelligent Vehicles Symposium (IV\u201911). IEEE, 920\u2013925."},{"issue":"9","key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1109\/TITS.2016.2531636","article-title":"iParker\u2013A new smart car-parking system based on dynamic resource allocation and pricing","volume":"17","author":"Kotb Amir O.","year":"2016","unstructured":"Amir O. Kotb, Yao-Chun Shen, Xu Zhu, and Yi Huang. 2016. iParker\u2013A new smart car-parking system based on dynamic resource allocation and pricing. IEEE Trans. Intell. Transport. Syst. 17, 9 (2016), 2637\u20132647.","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.jtrangeo.2015.06.015","article-title":"GIS-based method for assessing city parking patterns","volume":"46","author":"Levy Nadav","year":"2015","unstructured":"Nadav Levy and Itzhak Benenson. 2015. GIS-based method for assessing city parking patterns. J. Transport Geogr. 46 (2015), 220\u2013231.","journal-title":"J. Transport Geogr."},{"issue":"2","key":"e_1_3_2_48_2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MVT.2007.912927","article-title":"Routing in vehicular ad hoc networks: A survey","volume":"2","author":"Li Fan","year":"2007","unstructured":"Fan Li and Yu Wang. 2007. Routing in vehicular ad hoc networks: A survey. IEEE Vehic. Technol. Mag. 2, 2 (2007), 12\u201322.","journal-title":"IEEE Vehic. Technol. Mag."},{"key":"e_1_3_2_49_2","first-page":"105","volume-title":"Proceedings of International Conference on Soft Computing Techniques and Engineering Application","author":"Li Peng","year":"2014","unstructured":"Peng Li, Demin Li, and Xiaolu Zhang. 2014. CGPS: A collaborative game in parking-lot search. In Proceedings of International Conference on Soft Computing Techniques and Engineering Application. Springer, 105\u2013113."},{"key":"e_1_3_2_50_2","first-page":"012116","volume-title":"Journal of Physics: Conference Series","volume":"1314","author":"Li Y. H.","year":"2019","unstructured":"Y. H. Li, H. J. Mao, and Y. M. Qin. 2019. Vehicle routing problem with multiple time windows and batch splitting based on inferior first bidirectional search algorithm. In Journal of Physics: Conference Series, Vol. 1314. IOP Publishing, 012116."},{"issue":"3","key":"e_1_3_2_51_2","first-page":"18","article-title":"Classification and regression by randomForest","volume":"2","author":"Liaw Andy","year":"2002","unstructured":"Andy Liaw, Matthew Wiener, et\u00a0al. 2002. Classification and regression by randomForest. R News 2, 3 (2002), 18\u201322.","journal-title":"R News"},{"issue":"1","key":"e_1_3_2_52_2","first-page":"1","article-title":"A joint passenger flow inference and path recommender system for deploying new routes and stations of mass transit transportation","volume":"16","author":"Lin Fandel","year":"2021","unstructured":"Fandel Lin and Hsun-Ping Hsieh. 2021. A joint passenger flow inference and path recommender system for deploying new routes and stations of mass transit transportation. ACM Trans. Knowl. Discov. Data 16, 1 (2021), 1\u201336.","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"3","key":"e_1_3_2_53_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3510034","article-title":"Traveling transporter problem: Arranging a new circular route in a public transportation system based on heterogeneous non-monotonic urban data","volume":"13","author":"Lin Fandel","year":"2022","unstructured":"Fandel Lin and Hsun-Ping Hsieh. 2022. Traveling transporter problem: Arranging a new circular route in a public transportation system based on heterogeneous non-monotonic urban data. ACM Trans. Intell. Syst. Technol. 13, 3 (2022), 1\u201325.","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"e_1_3_2_54_2","first-page":"275","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Lin Fandel","year":"2020","unstructured":"Fandel Lin, Hsun-Ping Hsieh, and Jie-Yu Fang. 2020. A route-affecting region based approach for feature extraction in transportation route planning. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 275\u2013290."},{"issue":"7","key":"e_1_3_2_55_2","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1080\/13658810600661508","article-title":"GIS-based multicriteria decision analysis: A survey of the literature","volume":"20","author":"Malczewski Jacek","year":"2006","unstructured":"Jacek Malczewski. 2006. GIS-based multicriteria decision analysis: A survey of the literature. Int. J. Geogr. Inf. Sci. 20, 7 (2006), 703\u2013726.","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"e_1_3_2_56_2","doi-asserted-by":"crossref","first-page":"105400","DOI":"10.1016\/j.cor.2021.105400","article-title":"Reinforcement learning for combinatorial optimization: A survey","volume":"134","author":"Mazyavkina Nina","year":"2021","unstructured":"Nina Mazyavkina, Sergey Sviridov, Sergei Ivanov, and Evgeny Burnaev. 2021. Reinforcement learning for combinatorial optimization: A survey. Comput. Operat. Res. 134 (2021), 105400.","journal-title":"Comput. Operat. Res."},{"key":"e_1_3_2_57_2","first-page":"1","volume-title":"Proceeedings of the IEEE International Smart Cities Conference (ISC2\u201916)","author":"Mejri Naourez","year":"2016","unstructured":"Naourez Mejri, Mouna Ayari, Rami Langar, and Leila Saidane. 2016. Reservation-based multi-objective smart parking approach for smart cities. In Proceeedings of the IEEE International Smart Cities Conference (ISC2\u201916). IEEE, 1\u20136."},{"key":"e_1_3_2_58_2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/3397536.3427187","volume-title":"Proceedings of the 28th International Conference on Advances in Geographic Information Systems","author":"Ming Lingfeng","year":"2020","unstructured":"Lingfeng Ming, Qi Hu, Ming Dong, and Bolong Zheng. 2020. An effective fleet management strategy for collaborative spatio-temporal searching: GIS cup. In Proceedings of the 28th International Conference on Advances in Geographic Information Systems. 651\u2013654."},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.sbspro.2013.10.603","article-title":"Travel time forecasting and dynamic routes design for emergency vehicles","volume":"87","author":"Musolino Giuseppe","year":"2013","unstructured":"Giuseppe Musolino, Antonio Polimeni, Corrado Rindone, and Antonino Vitetta. 2013. Travel time forecasting and dynamic routes design for emergency vehicles. Soc. Behav. Sci. 87 (2013), 193\u2013202.","journal-title":"Soc. Behav. Sci."},{"issue":"1","key":"e_1_3_2_60_2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","article-title":"Equilibrium points in n-person games","volume":"36","author":"Jr John F. Nash","year":"1950","unstructured":"John F. Nash Jr. 1950. Equilibrium points in n-person games. Proc. Natl. Acad. Sci. 36, 1 (1950), 48\u201349.","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"5","key":"e_1_3_2_61_2","first-page":"4614","article-title":"Public curb parking demand estimation with poi distribution","volume":"23","author":"Nie Yiwen","year":"2021","unstructured":"Yiwen Nie, Wei Yang, Zhi Chen, Nanxue Lu, Liusheng Huang, and Huan Huang. 2021. Public curb parking demand estimation with poi distribution. IEEE Trans. Intell. Transport. Syst. 23, 5 (2021), 4614\u20134624.","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"e_1_3_2_62_2","unstructured":"City of Melbourne. 2020. On-street Car Parking Sensor Data\u20132019. Retrieved October 13 2022 from https:\/\/data.melbourne.vic.gov.au\/Transport\/On-street-Car-Parking-Sensor-Data-2019\/7pgd-bdf2."},{"issue":"1865","key":"e_1_3_2_63_2","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1038\/072294b0","article-title":"The problem of the random walk","volume":"72","author":"Pearson Karl","year":"1905","unstructured":"Karl Pearson. 1905. The problem of the random walk. Nature 72, 1865 (1905), 294\u2013294.","journal-title":"Nature"},{"key":"e_1_3_2_64_2","volume-title":"International Symposium on Combinatorial Search","author":"Rice Michael","year":"2012","unstructured":"Michael Rice and Vassilis Tsotras. 2012. Bidirectional A* search with additive approximation bounds. In International Symposium on Combinatorial Search, Vol. 3."},{"issue":"2","key":"e_1_3_2_65_2","first-page":"1","article-title":"Using GIS-based, hitchcock algorithm to optimize parking allocations for special events","volume":"7","author":"Sarasua Wayne A.","year":"2011","unstructured":"Wayne A. Sarasua, Prashant Malisetty, and Mashrur Chowdhury. 2011. Using GIS-based, hitchcock algorithm to optimize parking allocations for special events. Appl. GIS 7, 2 (2011), 1\u201313.","journal-title":"Appl. GIS"},{"key":"e_1_3_2_66_2","first-page":"3349","volume-title":"Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence","author":"Schmoll Sebastian","year":"2021","unstructured":"Sebastian Schmoll and Matthias Schubert. 2021. Semi-markov reinforcement learning for stochastic resource collection. In Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence. 3349\u20133355."},{"issue":"4","key":"e_1_3_2_67_2","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1287\/trsc.2013.0490","article-title":"The electric vehicle-routing problem with time windows and recharging stations","volume":"48","author":"Schneider Michael","year":"2014","unstructured":"Michael Schneider, Andreas Stenger, and Dominik Goeke. 2014. The electric vehicle-routing problem with time windows and recharging stations. Transport. Sci. 48, 4 (2014), 500\u2013520.","journal-title":"Transport. Sci."},{"key":"e_1_3_2_68_2","volume-title":"Proceedings of the 11th Annual Symposium on Combinatorial Search","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 11th Annual Symposium on Combinatorial Search."},{"issue":"2","key":"e_1_3_2_69_2","first-page":"802","article-title":"Traveling officer problem: Managing car parking violations efficiently using sensor data","volume":"5","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 IoT J. 5, 2 (2017), 802\u2013810.","journal-title":"IEEE IoT J."},{"issue":"23","key":"e_1_3_2_70_2","first-page":"26","article-title":"SFpark: San Francisco knows how to park it","author":"Simons Dani","year":"2012","unstructured":"Dani Simons. 2012. SFpark: San Francisco knows how to park it. Sust. Transport23 (2012), 26\u201327.","journal-title":"Sust. Transport"},{"issue":"2","key":"e_1_3_2_71_2","doi-asserted-by":"crossref","first-page":"e0192274","DOI":"10.1371\/journal.pone.0192274","article-title":"Accurate and fast path computation on large urban road networks: A general approach","volume":"13","author":"Song Qing","year":"2018","unstructured":"Qing Song, Meng Li, and Xiaolei Li. 2018. Accurate and fast path computation on large urban road networks: A general approach. PLoS One 13, 2 (2018), e0192274.","journal-title":"PLoS One"},{"issue":"1","key":"e_1_3_2_72_2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.jtrangeo.2004.11.003","article-title":"Sustainable transportation and quality of life","volume":"13","author":"Steg Linda","year":"2005","unstructured":"Linda Steg and Robert Gifford. 2005. Sustainable transportation and quality of life. J. Transport Geogr. 13, 1 (2005), 59\u201369.","journal-title":"J. Transport Geogr."},{"issue":"3","key":"e_1_3_2_73_2","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1016\/j.ejor.2005.02.033","article-title":"Intelligent parking systems","volume":"175","author":"Teodorovi\u0107 Du\u0161an","year":"2006","unstructured":"Du\u0161an Teodorovi\u0107 and Panta Lu\u010di\u0107. 2006. Intelligent parking systems. Eur. J. Oper. Res. 175, 3 (2006), 1666\u20131681.","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"e_1_3_2_74_2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/net.21856","article-title":"An exact bidirectional A* approach for solving resource-constrained shortest path problems","volume":"73","author":"Thomas Barrett W.","year":"2019","unstructured":"Barrett W. Thomas, Tobia Calogiuri, and Mike Hewitt. 2019. An exact bidirectional A* approach for solving resource-constrained shortest path problems. Networks 73, 2 (2019), 187\u2013205.","journal-title":"Networks"},{"key":"e_1_3_2_75_2","first-page":"141","volume-title":"Proceedings of the IEEE 12th International Conference on Mobile Data Management","volume":"1","author":"Verroios Vasilis","year":"2011","unstructured":"Vasilis Verroios, Vasilis Efstathiou, and Alex Delis. 2011. Reaching available public parking spaces in urban environments using ad hoc networking. In Proceedings of the IEEE 12th International Conference on Mobile Data Management, Vol. 1. IEEE, 141\u2013151."},{"key":"e_1_3_2_76_2","first-page":"1","article-title":"Geometric containers for efficient shortest-path computation","volume":"10","author":"Wagner Dorothea","year":"2005","unstructured":"Dorothea Wagner, Thomas Willhalm, and Christos Zaroliagis. 2005. Geometric containers for efficient shortest-path computation. J. Exp. Algor. 10 , Article No. 1.3, (2005), 1\u201330.","journal-title":"J. Exp. Algor."},{"issue":"2","key":"e_1_3_2_77_2","doi-asserted-by":"crossref","first-page":"855","DOI":"10.3390\/app11020855","article-title":"Automated parking space allocation during transition with both human-operated and autonomous vehicles","volume":"11","author":"Wu Mingkang","year":"2021","unstructured":"Mingkang Wu, Haobin Jiang, and Chin-An Tan. 2021. Automated parking space allocation during transition with both human-operated and autonomous vehicles. Appl. Sci. 11, 2 (2021), 855.","journal-title":"Appl. Sci."},{"key":"e_1_3_2_78_2","first-page":"631","volume-title":"Proceedings of the 14th International Conference on Computer Science & Education (ICCSE\u201919)","author":"Xiangdong Li","year":"2019","unstructured":"Li Xiangdong, Cen Yuefeng, C. E. N. Gang, and Xu Zengwei. 2019. Prediction of short-term available parking space using LSTM model. In Proceedings of the 14th International Conference on Computer Science & Education (ICCSE\u201919). IEEE, 631\u2013635."},{"issue":"1","key":"e_1_3_2_79_2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TSMC.2014.2327053","article-title":"Modeling user activity preference by leveraging user spatial temporal characteristics in LBSNs","volume":"45","author":"Yang Dingqi","year":"2014","unstructured":"Dingqi Yang, Daqing Zhang, Vincent W. Zheng, and Zhiyong Yu. 2014. Modeling user activity preference by leveraging user spatial temporal characteristics in LBSNs. IEEE Trans. Syst. Man Cybernet.: Syst. 45, 1 (2014), 129\u2013142.","journal-title":"IEEE Trans. Syst. Man Cybernet.: Syst."},{"key":"e_1_3_2_80_2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.trc.2019.08.010","article-title":"A deep learning approach to real-time parking occupancy prediction in transportation networks incorporating multiple spatio-temporal data sources","volume":"107","author":"Yang Shuguan","year":"2019","unstructured":"Shuguan Yang, Wei Ma, Xidong Pi, and Sean Qian. 2019. A deep learning approach to real-time parking occupancy prediction in transportation networks incorporating multiple spatio-temporal data sources. Transport. Res. Part C: Emerg. Technol. 107 (2019), 248\u2013265.","journal-title":"Transport. Res. Part C: Emerg. Technol."},{"issue":"2","key":"e_1_3_2_81_2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.disopt.2010.08.001","article-title":"The minimum spanning tree problem with conflict constraints and its variations","volume":"8","author":"Zhang Ruonan","year":"2011","unstructured":"Ruonan Zhang, Santosh N. Kabadi, and Abraham P. Punnen. 2011. The minimum spanning tree problem with conflict constraints and its variations. Discr. Optimiz. 8, 2 (2011), 191\u2013205.","journal-title":"Discr. Optimiz."},{"issue":"8","key":"e_1_3_2_82_2","doi-asserted-by":"crossref","first-page":"3984","DOI":"10.1109\/TKDE.2020.3034140","article-title":"Semi-supervised city-wide parking availability prediction via hierarchical recurrent graph neural network","volume":"34","author":"Zhang Weijia","year":"2020","unstructured":"Weijia Zhang, Hao Liu, Yanchi Liu, Jingbo Zhou, Tong Xu, and Hui Xiong. 2020. Semi-supervised city-wide parking availability prediction via hierarchical recurrent graph neural network. IEEE Trans. Knowl. Data Eng. 34, 8 (2020), 3984\u20133996.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_83_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2017\/9184891","article-title":"Dynamic path planning of emergency vehicles based on travel time prediction","volume":"2017","author":"Zhao Jiandong","year":"2017","unstructured":"Jiandong Zhao, Yujie Guo, and Xiaohong Duan. 2017. Dynamic path planning of emergency vehicles based on travel time prediction. J. Adv. Transport. 2017, Article No. 9184891, (2017), 1\u201314.","journal-title":"J. Adv. Transport."},{"issue":"2","key":"e_1_3_2_84_2","first-page":"2034","article-title":"SOUP: Spatial-temporal demand forecasting and competitive supply","volume":"35","author":"Zheng Bolong","year":"2021","unstructured":"Bolong Zheng, Qi Hu, Lingfeng Ming, Jilin Hu, Lu Chen, Kai Zheng, and Christian S. Jensen. 2021. SOUP: Spatial-temporal demand forecasting and competitive supply. IEEE Trans. Knowl. Data Eng. 35, 2 (2021), 2034\u20132047.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_85_2","first-page":"412","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS\u201908)","author":"Ziebart Brian D.","year":"2008","unstructured":"Brian D. Ziebart, Anind K. Dey, and J. Andrew Bagnell. 2008. Fast planning for dynamic preferences. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS\u201908). 412\u2013419."},{"key":"e_1_3_2_86_2","doi-asserted-by":"crossref","first-page":"1819","DOI":"10.1145\/2623330.2623359","volume-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Zoeter Onno","year":"2014","unstructured":"Onno Zoeter, Christopher Dance, St\u00e9phane Clinchant, and Jean-Marc Andreoli. 2014. New algorithms for parking demand management and a city-scale deployment. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1819\u20131828."}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:51Z","timestamp":1750183671000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,20]]},"references-count":85,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1145\/3569937"],"URL":"https:\/\/doi.org\/10.1145\/3569937","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"type":"print","value":"2374-0353"},{"type":"electronic","value":"2374-0361"}],"subject":[],"published":{"date-parts":[[2023,11,20]]},"assertion":[{"value":"2022-01-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}