Skip to main content
SpringerLink
Log in

A bidirectional-a-star-based ant colony optimization algorithm for big-data-driven taxi route recommendation

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

To address the critical problems of high fuel consumption and severe traffic congestion of brought by blindly cruising in a vast transportation system, we propose a Bidirectional-A-star-based Ant Colony Optimization (BiA*-ACO) algorithm to recommend the fastest route for taxicabs in a complex urban road network with passenger prediction results in this paper. More specifically, the cost estimation function of the Bidirectional A-star (BiA*) algorithm is employed to optimize the heuristic function of the Ant Colony (AC) algorithm for enhancing the global searching ability of ACO. Furthermore, the optimal route obtained from each cycle is introduced to improve the pheromone updating rules of AC for accelerating the convergence speed of ACO. Finally, the BiA*-ACO algorithm is applied to recommend the fastest route successfully. The experimental results of real-world taxi GPS trajectory big data with an urban road network demonstrate that the BiA*-ACO algorithm is at least 47.05% more efficient than the traditional ACO algorithm when the data set is small. As the big GPS trajectory data grows exponentially, the BiA*-ACO algorithm is at least 49.81% more efficient than ACO, Dijkstra, and Bellman-Ford. In particular, compared with the A-star algorithm, the Acyclic algorithm, and the Gurobi algorithm, the fastest route length recommended by the BiA*-ACO algorithm is reduced by 102.73m, 73.27m, and 23.08m.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Algorithm 1
Fig. 5
Algorithm 2
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Algorithm 3
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Data Availability

The datasets generated during and analysed during the current study are available from the corresponding author on reasonable request.

Notes

  1. http://www.datatang.com

References

  1. Ashokkumar P, Arunkumar N, Don S (2018) Intelligent optimal route recommendation among heterogeneous objects with keywords. Comput Electr Eng 68:526–535

    Article  Google Scholar 

  2. 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–109

    Article  Google Scholar 

  3. 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–216

  4. Chen K, Franko K, Sang R (2021) Structured model pruning of convolutional networks on tensor processing units. arXiv:2107.04191

  5. 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–1465

    Article  Google Scholar 

  6. Cui G, Luo J, Wang X (2018) Personalized travel route recommendation using collaborative filtering based on GPS trajectories. Int J Digit Earth 11:284–307

    Article  Google Scholar 

  7. Dewantoro RW, Sihombing P (2019) Sutarman, the combination of ant colony optimization (ACO) and tabu search (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

  8. 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–37

    Article  Google Scholar 

  9. 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–1434

  10. 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–1926

    Article  Google Scholar 

  11. 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–102

  12. 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–12

    Article  Google Scholar 

  13. 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–143

  14. 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–195

  15. Lai Y, Lv Z, Li K, Liao M (2019) Urban traffic coulomb’s law: a new approach for taxi route recommendation. IEEE Trans Intell Transp Syst 20:3024–3037

    Article  Google Scholar 

  16. Lamini C, Benhlima S, Elbekri A (2018) Genetic algorithm based approach for autonomous mobile robot path planning. Proc Comput Sci 127:180–189

    Article  Google Scholar 

  17. 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–17

  18. 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–321

  19. 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–830

    Article  MathSciNet  Google Scholar 

  20. 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–735

    Article  Google Scholar 

  21. 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–198

  22. 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–2207

  23. 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–120

    Article  Google Scholar 

  24. Niu H, Lu Y, Savvaris A, Tsourdos A (2018) An energy-efficient path planning algorithm for unmanned surface vehicles. Ocean Eng 161:308–321

    Article  Google Scholar 

  25. Parimala M, Broumi S, Prakash K, Topal S (2021) Bellman–ford algorithm for solving shortest path problem of a network under picture fuzzy environment. Compl Intel Syst 7:2373–2381

    Article  Google Scholar 

  26. 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–126

  27. 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–274

  28. 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–1932

  29. 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–24 (2021c)

  30. 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–15

  31. 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–263

    Article  Google Scholar 

  32. 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–2410

  33. 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–150554

    Article  Google Scholar 

  34. Xu X, Yuan H, Liptrott M, Trovati M (2017) Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput 22:6567–6581

    Article  Google Scholar 

  35. Xu Y, Guan G, Song Q, Jiang C, Wang L (2020) Heuristic and random search algorithm in optimization of route planning for robot’s geomagnetic navigation. Comput Commun 154:12–17

    Article  Google Scholar 

  36. 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

    Google Scholar 

  37. 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–235

    Article  Google Scholar 

  38. Zhou H, Zhao Y, Pang J, Chen X, Zeng K (2020) Hybrid route recommendation with taxi and shared bicycles. Distrib Paral Database 38:1–21

    Google Scholar 

  39. 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–196

    Article  Google Scholar 

Download references

Acknowledgements

This work described in this paper was supported in part by the National Natural Science Foundation of China (Grant nos. 62162012 and 62173278), the Science and Technology Support Program of Guizhou Province, China (Grant no. QKHZC2021YB531), the Natural Science Research Project of Department of Education of Guizhou Province, China (Grant nos. QJJ2022015 and QJJ2022047), the Science and Technology Foundation of Guizhou Province, China (Grant nos. QKHJCZK2022YB195, QKHJCZK2022YB197, and QKHJCZK2023YB143), and the Scientific Research Platform Project of Guizhou Minzu University, China (Grant no. GZMUSYS[2021]04).

Author information

Authors and Affiliations

  1. College of Data Science and Information Engineering, Guizhou Minzu University, Guiyang, 550025, China

    Dawen Xia, Bingqi Shen, Yongling Zheng, Wenyong Zhang & Dewei Bai

  2. Department of Automotive Engineering, Guizhou Traffic Technician and Transportation College, Guiyang, 550008, China

    Yang Hu

  3. College of Electronic and Information Engineering, Southwest University, Chongqing, 400715, China

    Huaqing Li

Authors
  1. Dawen Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bingqi Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yongling Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenyong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Dewei Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yang Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Huaqing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Dawen Xia or Huaqing Li.

Ethics declarations

Conflict of Interests

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xia, D., Shen, B., Zheng, Y. et al. A bidirectional-a-star-based ant colony optimization algorithm for big-data-driven taxi route recommendation. Multimed Tools Appl 83, 16313–16335 (2024). https://doi.org/10.1007/s11042-023-15498-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-023-15498-4

Keywords

Search

Navigation