Abstract
We introduce the balanced dispatching problem in passengers transport services on demand, such as taxi services, and propose an easy-to-implement algorithm in an online scenario, where all necessary information is only revealed with the arrival of requested transport services, seeking to guarantee quality of service for the passengers as well as balancing the income received by the drivers of the vehicles who perform the transportation services. The algorithm is based on theoretical results from the balanced incomes per worked time through the income variance minimization problem for two transport vehicles, considering the incoming service tariff, the performed services and the worked time by the transport vehicle drivers during the pay period in an online scenario. We compare our algorithm with the online dispatching algorithm currently used by Chilean companies on real instances. The numerical experiments are based on three different data sets of real instances such a labour day, one week, and one month, respectively. The obtained results show that the proposed algorithm is able to efficiently reduce the income dispersion among transport vehicle drivers within reduced running times, allowing a practical implementation into an automated dispatching system.
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
Similar content being viewed by others
References
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (2005)
Gao, G., Xiao, M., Zhao, Z.: Optimal multi-taxi dispatch for mobile taxi-hailing systems. In: 2016 45th International Conference on Parallel Processing (ICPP), pp. 294–303. IEEE (2016)
Hyland, M., Mahmassani, H.S.: Dynamic autonomous vehicle fleet operations: optimization-based strategies to assign AVs to immediate traveler demand requests. Transp. Res. Part C: Emerg. Technol. 92, 278–297 (2018)
Liu, Y.-W., Zhang, X.-Y., Gong, Y.-J., Chen, W.-N., Zhang, J.: A parallel genetic algorithm with region division strategy to solve taxi-passenger matching problem. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1–7. IEEE (2017)
Maciejewski, M., Bischoff, J., Nagel, K.: An assignment-based approach to efficient real-time city-scale taxi dispatching. IEEE Intell. Syst. 31(1), 68–77 (2016)
Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, vol. 18. SIAM, Philadelphia (2014)
Acknowledgement
This work is partially supported by DICYT No061817OP, Universidad de Santiago de Chile.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Araya-Córdova, P.J., Díaz-Nuñez, F., Moraga, J., Quezada, F., Rojo-González, L., Vásquez, Ó.C. (2018). The Balanced Dispatching Problem in Passengers Transport Services on Demand. In: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-00898-7_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00897-0
Online ISBN: 978-3-030-00898-7
eBook Packages: Computer ScienceComputer Science (R0)