The Balanced Dispatching Problem in Passengers Transport Services on Demand

  • Patricio J. Araya-Córdova
  • Fabián Díaz-Nuñez
  • Javier Moraga
  • Franco Quezada
  • Luis Rojo-González
  • Óscar C. VásquezEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11184)


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.


Dispatching problem Online dispatching algorithm Passengers transport services 



This work is partially supported by DICYT No061817OP, Universidad de Santiago de Chile.


  1. 1.
    Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (2005)zbMATHGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, vol. 18. SIAM, Philadelphia (2014)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Patricio J. Araya-Córdova
    • 1
  • Fabián Díaz-Nuñez
    • 2
  • Javier Moraga
    • 2
  • Franco Quezada
    • 3
  • Luis Rojo-González
    • 2
  • Óscar C. Vásquez
    • 2
    Email author
  1. 1.Department of Economics, Faculty of Economics and BusinessUniversity of ChileSantiagoChile
  2. 2.Industrial Engineering DepartmentUniversidad de Santiago de ChileEstación CentralChile
  3. 3.Laboratoire d’Informatique de Paris 6, LIP6, Sorbonne UniversitéParisFrance

Personalised recommendations