{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:06:50Z","timestamp":1780337210312,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62162012"],"award-info":[{"award-number":["62162012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62173278"],"award-info":[{"award-number":["62173278"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-023-15498-4","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T04:02:05Z","timestamp":1689307325000},"page":"16313-16335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A bidirectional-a-star-based ant colony optimization algorithm for big-data-driven taxi route recommendation"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0151-9643","authenticated-orcid":false,"given":"Dawen","family":"Xia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bingqi","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongling","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dewei","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huaqing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,14]]},"reference":[{"key":"15498_CR1","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.compeleceng.2018.05.004","volume":"68","author":"P Ashokkumar","year":"2018","unstructured":"Ashokkumar P, Arunkumar N, Don S (2018) Intelligent optimal route recommendation among heterogeneous objects with keywords. Comput Electr Eng 68:526\u2013535","journal-title":"Comput Electr Eng"},{"key":"15498_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.robot.2016.12.008","volume":"89","author":"A Bakdi","year":"2017","unstructured":"Bakdi A, Hentout A, Boutami H, Maoudj A, Hachour O, Bouzouia B (2017) Optimal path planning and execution for mobile robots using genetic algorithm and adaptive fuzzy-logic control. Robot Auton Syst 89:95\u2013109","journal-title":"Robot Auton Syst"},{"key":"15498_CR3","doi-asserted-by":"crossref","unstructured":"Chen RM, Fang PJ (2019) Solving vehicle routing problem with simultaneous pickups and deliveries based on a two-layer particle swarm optimization. In: 2019 IEEE\/ACIS International conference on software engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD), pp 212\u2013216","DOI":"10.1109\/SNPD.2019.8935815"},{"key":"15498_CR4","unstructured":"Chen K, Franko K, Sang R (2021) Structured model pruning of convolutional networks on tensor processing units. arXiv:2107.04191"},{"key":"15498_CR5","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1109\/TITS.2014.2298892","volume":"15","author":"C Chen","year":"2014","unstructured":"Chen C, Zhang D, Li N, Zhou Z (2014) B-planner: planning bidirectional night bus routes using large-scale taxi GPS traces. IEEE Trans Intell Transp Syst 15:1451\u20131465","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"15498_CR6","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1080\/17538947.2017.1326535","volume":"11","author":"G Cui","year":"2018","unstructured":"Cui G, Luo J, Wang X (2018) Personalized travel route recommendation using collaborative filtering based on GPS trajectories. Int J Digit Earth 11:284\u2013307","journal-title":"Int J Digit Earth"},{"key":"#cr-split#-15498_CR7.1","unstructured":"Dewantoro RW, Sihombing P (2019) Sutarman, the combination of ant colony optimization (ACO) and tabu search"},{"key":"#cr-split#-15498_CR7.2","unstructured":"(TS) algorithm to solve the traveling salesman problem (TSP). In: 2019 3rd International conference on electrical, telecommunication and computer engineering, ELTICOM, IEEE, pp 160-164"},{"key":"15498_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.robot.2018.04.007","volume":"106","author":"B Fu","year":"2018","unstructured":"Fu B, Chen L, Zhou Y, Zheng D, Wei Z, Dai J, Pan H (2018) An improved a* algorithm for the industrial robot path planning with high success rate and short length. Robot Auton Syst 106:26\u201337","journal-title":"Robot Auton Syst"},{"key":"15498_CR9","doi-asserted-by":"crossref","unstructured":"Garg N, Ranu S (2018) Route recommendations for idle taxi drivers: find me the shortest route to a customer. In: 2018 ACM SIGKDD International conference, pp 1425\u20131434","DOI":"10.1145\/3219819.3220055"},{"key":"15498_CR10","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1109\/TMC.2020.3033274","volume":"21","author":"S Guo","year":"2022","unstructured":"Guo S, Chen C, Wang J, Ding Y, Liu Y, Ke X, Yu Z, Zhang D (2022) A force-directed approach to seeking route recommendation in ride-on-demand service using multi-source urban data. IEEE Trans Mob Comput 21:1909\u20131926","journal-title":"IEEE Trans Mob Comput"},{"key":"15498_CR11","unstructured":"Hu X, Jiang Z, Xu C (2020) Vehicle path planning fusion algorithm based on road network. In: 2020 IEEE 4th information technology, networking, electronic and automation control conference (ITNEC), vol 1, IEEE, pp 98\u2013102"},{"key":"15498_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2020.106302","volume":"205","author":"S Ji","year":"2020","unstructured":"Ji S, Wang Z, Li T, Zheng Y (2020) Spatio-temporal feature fusion for dynamic taxi route recommendation via deep reinforcement learning. Knowl-Based Syst 205:1\u201312","journal-title":"Knowl-Based Syst"},{"key":"15498_CR13","doi-asserted-by":"crossref","unstructured":"Jing Y, Chen Y, Jiao M, Huang J, Niu B, Zheng W (2019) Mobile robot path planning based on improved reinforcement learning optimization. In: 2019 International conference on robotics systems and vehicle technology, pp 138\u2013143","DOI":"10.1145\/3366715.3366717"},{"key":"15498_CR14","doi-asserted-by":"crossref","unstructured":"Khairnar HS, Sonkamble B (2020) Aggregated time series based vehicular traffic path recommendation. In: 2020 5th International conference on computer and communication systems, ICCCS, IEEE, pp 191\u2013195","DOI":"10.1109\/ICCCS49078.2020.9118575"},{"key":"15498_CR15","doi-asserted-by":"publisher","first-page":"3024","DOI":"10.1109\/TITS.2018.2870990","volume":"20","author":"Y Lai","year":"2019","unstructured":"Lai Y, Lv Z, Li K, Liao M (2019) Urban traffic coulomb\u2019s law: a new approach for taxi route recommendation. IEEE Trans Intell Transp Syst 20:3024\u20133037","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"15498_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.procs.2018.01.113","volume":"127","author":"C Lamini","year":"2018","unstructured":"Lamini C, Benhlima S, Elbekri A (2018) Genetic algorithm based approach for autonomous mobile robot path planning. Proc Comput Sci 127:180\u2013189","journal-title":"Proc Comput Sci"},{"key":"15498_CR17","doi-asserted-by":"crossref","unstructured":"Le V, Prabakaran V, Sivanantham V, Mohan RE (2018) Modified A-star algorithm for efficient coverage path planning in tetris inspired self-reconfigurable robot with integrated laser sensor. Sensors 18:1\u201317","DOI":"10.3390\/s18082585"},{"key":"15498_CR18","doi-asserted-by":"crossref","unstructured":"Li J (2020) Faster parallel algorithm for approximate shortest path. In: 2020 Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp 308\u2013321","DOI":"10.1145\/3357713.3384268"},{"key":"15498_CR19","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.apm.2020.12.031","volume":"93","author":"B Lin","year":"2021","unstructured":"Lin B, Zhao Y, Lin R, Liu C (2021) Integrating traffic routing optimization and train formation plan using simulated annealing algorithm. Appl Math Model 93:811\u2013830","journal-title":"Appl Math Model"},{"key":"15498_CR20","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/TKDE.2020.2985954","volume":"34","author":"H Liu","year":"2022","unstructured":"Liu H, Tong Y, Han J, Zhang P, Lu X, Xiong H (2022) Incorporating multi-source urban data for personalized and context-aware multi-modal transportation recommendation. IEEE Trans Knowl Data Eng 34:723\u2013735","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"15498_CR21","doi-asserted-by":"crossref","unstructured":"Mazur V (2016) Planning of routes based on distribution of passenger flows in time and space. In: 2016 International conference on perspective technologies and methods in MEMS design (MEMSTECH), pp 196\u2013198","DOI":"10.1109\/MEMSTECH.2016.7507541"},{"key":"15498_CR22","doi-asserted-by":"crossref","unstructured":"Mckenna C, Clarke S, Golpayegani F (2019) Floating buses: dynamic route planning and passenger allocation based on real-time demand. In: 2019 International conference on computer and communications (ICCC), pp 2203\u20132207","DOI":"10.1109\/ICCC47050.2019.9064471"},{"key":"15498_CR23","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","volume":"115","author":"M Nazarahari","year":"2019","unstructured":"Nazarahari M, Khanmirza E, Doostie S (2019) Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm. Expert Syst Appl 115:106\u2013120","journal-title":"Expert Syst Appl"},{"key":"15498_CR24","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.oceaneng.2018.01.025","volume":"161","author":"H Niu","year":"2018","unstructured":"Niu H, Lu Y, Savvaris A, Tsourdos A (2018) An energy-efficient path planning algorithm for unmanned surface vehicles. Ocean Eng 161:308\u2013321","journal-title":"Ocean Eng"},{"key":"15498_CR25","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s40747-021-00430-w","volume":"7","author":"M Parimala","year":"2021","unstructured":"Parimala M, Broumi S, Prakash K, Topal S (2021) Bellman\u2013ford algorithm for solving shortest path problem of a network under picture fuzzy environment. Compl Intel Syst 7:2373\u20132381","journal-title":"Compl Intel Syst"},{"key":"15498_CR26","doi-asserted-by":"crossref","unstructured":"Qiu Y, Xu X (2018) RPSBPT: a route planning scheme with best profit for taxi. In: 2018 International conference on mobile Ad-Hoc and sensor networks (MSN), pp 121\u2013126","DOI":"10.1109\/MSN.2018.00027"},{"key":"15498_CR27","doi-asserted-by":"crossref","unstructured":"Sub-R-Pa C, Chakraborty G, Sinha BP (2018) Optimum route recommendation system to escape disaster environment. In: 2018 International conference on computing and information technology, pp 264\u2013274","DOI":"10.1007\/978-3-319-60663-7_25"},{"key":"15498_CR28","doi-asserted-by":"crossref","unstructured":"Wu N, Wang J, Zhao W, Jin Y (2019) Learning to effectively estimate the travel time for fastest route recommendation. In: 2019 Proceedings of the 28th ACM International conference on information and knowledge management, pp 1923\u20131932","DOI":"10.1145\/3357384.3357907"},{"key":"15498_CR29","doi-asserted-by":"crossref","unstructured":"Xia D, Bai Y, Zheng Y, Hu Y, Li Y, Li H A parallel SP-DBSCAN algorithm on Spark for waiting spot recommendation. Multimed Tools Appl :1\u201324 (2021c)","DOI":"10.1007\/s11042-021-11639-9"},{"key":"15498_CR30","doi-asserted-by":"crossref","unstructured":"Xia D, Jiang S, Yang N, Hu Y, Li Y, Li H, Wang L (2021b) Discovering spatiotemporal characteristics of passenger travel with mobile trajectory big data. Phys A Stat Mech Appl 578:1\u201315","DOI":"10.1016\/j.physa.2021.126056"},{"key":"15498_CR31","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.neucom.2015.12.013","volume":"179","author":"D Xia","year":"2016","unstructured":"Xia D, Wang B, Li H, Li Y, Zhang Z (2016) A distributed spatial-temporal weighted model on MapReduce for short-term traffic flow forecasting. Neurocomputing 179:246\u2013263","journal-title":"Neurocomputing"},{"key":"15498_CR32","doi-asserted-by":"crossref","unstructured":"Xia D, Zhang M, Yan X, Bai Y, Zheng Y, Li Y, Li H (2021a) A distributed WND-LSTM Model on MapReduce for short-term traffic flow prediction. Neural Comput Applic 33:2393\u20132410","DOI":"10.1007\/s00521-020-05076-2"},{"key":"15498_CR33","doi-asserted-by":"publisher","first-page":"150539","DOI":"10.1109\/ACCESS.2020.3017132","volume":"8","author":"J Xiong","year":"2020","unstructured":"Xiong J, Qi X, Fu Z, Zha W (2020) Split demand one-to-one pickup and delivery problems with the shortest-path transport along real-life paths. IEEE Access 8:150539\u2013150554","journal-title":"IEEE Access"},{"key":"15498_CR34","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1007\/s00500-017-2705-5","volume":"22","author":"X Xu","year":"2017","unstructured":"Xu X, Yuan H, Liptrott M, Trovati M (2017) Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput 22:6567\u20136581","journal-title":"Soft Comput"},{"key":"15498_CR35","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.comcom.2020.02.043","volume":"154","author":"Y Xu","year":"2020","unstructured":"Xu Y, Guan G, Song Q, Jiang C, Wang L (2020) Heuristic and random search algorithm in optimization of route planning for robot\u2019s geomagnetic navigation. Comput Commun 154:12\u201317","journal-title":"Comput Commun"},{"key":"15498_CR36","first-page":"100502","volume":"38","author":"G Yang","year":"2021","unstructured":"Yang G, Yuan E, Zhang X, Zhou H (2021) A route planning mechanism for supermarket shuttle service based on taxi traces. Res Transp Bus Manag 38:100502","journal-title":"Res Transp Bus Manag"},{"key":"15498_CR37","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10846-018-0894-5","volume":"94","author":"G Zhang","year":"2019","unstructured":"Zhang G, Hsu LT (2019) A new path planning algorithm using a GNSS localization error map for UAVs in an urban area. J Intell Robot Syst 94:219\u2013235","journal-title":"J Intell Robot Syst"},{"key":"15498_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10619-019-07256-z","volume":"38","author":"H Zhou","year":"2020","unstructured":"Zhou H, Zhao Y, Pang J, Chen X, Zeng K (2020) Hybrid route recommendation with taxi and shared bicycles. Distrib Paral Database 38:1\u201321","journal-title":"Distrib Paral Database"},{"key":"15498_CR39","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.trc.2016.12.009","volume":"75","author":"M Zimmermann","year":"2017","unstructured":"Zimmermann M, Mai T, Frejinger E (2017) Bike route choice modeling using GPS data without choice sets of paths. Transp Res Part C Emerg Technol 75:183\u2013196","journal-title":"Transp Res Part C Emerg Technol"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-15498-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-15498-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-15498-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T08:34:29Z","timestamp":1706690069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-15498-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,14]]},"references-count":40,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,2]]}},"alternative-id":["15498"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-15498-4","relation":{},"ISSN":["1573-7721"],"issn-type":[{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,14]]},"assertion":[{"value":"19 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}