Abstract
Taxi routing is a complex task that involves the pickup and delivery by a fleet of vehicles in a specified time, taking into account many parameters and criteria. This paper describes issues related to this problem. It proposes a formal description of the problem and a goal function using a wide variety of criteria. Three heuristic algorithms: Ant Colony Optimization, Artificial Bee Colony and Genetic Algorithm are selected for testing. As a result three variants of these algorithms are implemented: Ant Colony System (ACS), Predict and Select - Artificial Bee Colony (PS-ABC) and Genetic Algorithm (GA) to conduct a survey. Operators used in the algorithms are adapted to a taxi dispatch problem. The analysis is performed in order to find the best parameters for the algorithms according to the data input. Finally, the efficiency of the algorithms are compared in order to determine the best algorithm. In several experiments the Ant Colony System outperforms any other algorithm presented here with respect to taxi working time currently in service.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fortnow, L., Homer, S.: A short history of computational complexity. Bull. EATCS 80, 95–133 (2003)
Gan, J., An, B., Miao, C.: Optimizing efficiency of taxi systems: scaling-up and handling arbitrary constraints. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, pp. 523–531 (2015)
Ge, Y., Xiong, H., Tuzhilin, A., Xiao, K., Gruteser, M., Pazzani, M.: An energy-efficient mobile recommender system. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2010, pp. 899–908. ACM, New York (2010)
Jung, J., Jayakrishnan, R., Park, J.Y.: Dynamic shared-taxi dispatch algorithm with hybrid-simulated annealing. Comput.-Aided Civ. Infrastruct. Eng. 31(4), 275–291 (2016)
Kaggle: ECML/PKDD 15: Taxi trajectory prediction (2015). https://www.kaggle.com/c/pkdd-15-predict-taxi-service-trajectory-i
Kuo, M.: Taxi dispatch algorithms: why route optimization reigns, March 2016. https://blog.routific.com/taxi-dispatch-algorithms-why-route-optimization-reigns-261cc428699f
Xu, M., Wang, D., Li, J.: DESTPRE: a data-driven approach to destination prediction for taxi rides. In: Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing, UbiComp 2016, pp. 729–739. ACM, New York (2016)
Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2010, pp. 99–108. ACM, New York (2010)
Zheng, Y., Liu, Y., Yuan, J., Xie, X.: Urban computing with taxicabs. In: Proceedings of the 13th International Conference on Ubiquitous Computing, UbiComp 2011, pp. 89–98. ACM, New York (2011)
Acknowledgments
The authors acknowledge the support from the statutory funds of the Wrocław University of Science and Technology.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Adamczyk, M., Król, D. (2019). Modelling of Taxi Dispatch Problem Using Heuristic Algorithms. In: Choroś, K., Kopel, M., Kukla, E., Siemiński, A. (eds) Multimedia and Network Information Systems. MISSI 2018. Advances in Intelligent Systems and Computing, vol 833. Springer, Cham. https://doi.org/10.1007/978-3-319-98678-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-98678-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98677-7
Online ISBN: 978-3-319-98678-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)