Skip to main content
SpringerLink
Log in
Book cover

Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data

APWeb-WAIM 2020: Web and Big Data pp 470–477Cite as

Seamless Incorporation of Appointment-Based Requests on Taxi-Rider Match Scheduling

  • Conference paper
  • First Online:

  • 1605 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12317))

Abstract

Rider demand responsive systems (RDRS) makes a match between numerous requests and vehicles, it is a challenging problem to make the maximal match as soon as the real-time requests pop up in the RDRS. Much research has been addressed on this issue. However, there is still not much work on handling the appointment-based requests. In this paper, we propose an algorithm called BMF (Bipartite Minimal-cost Flow) to solve the taxi-rider match scheduling problem with appointment-based rider requests on a time-dependent road network. Riders and vehicles are modeled as vertices in a bipartite graph, and the maximal utility calculation is transformed to the minimal cost flow problem that could be solved efficiently. Experimental results show that the proposed scheme can effectively decrease the average waiting time of riders (>44% reduction) at the cost of acceptable increase on the running time.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Abadi, A., Rajabioun, T., Ioannou, P.A.: Traffic flow prediction for road transportation networks with limited traffic data. IEEE Trans. Intell. Transp. Syst. 16(2), 653–662 (2015)

    Google Scholar 

  2. Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30(3), 377–387 (2004)

    Article  Google Scholar 

  3. Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29–46 (2007). https://doi.org/10.1007/s10479-007-0170-8

    Article  MathSciNet  MATH  Google Scholar 

  4. Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM (JACM) 36(4), 873–886 (1989)

    Article  MathSciNet  Google Scholar 

  5. Hassan, U.U., Curry, E.: A multi-armed bandit approach to online spatial task assignment. In: Ubiquitous Intelligence and Computing, pp. 212–219. IEEE (2014)

    Google Scholar 

  6. Li, M., et al.: Efficient ridesharing order dispatching with mean field multi-agent reinforcement learning, pp. 983–994 (2019)

    Google Scholar 

  7. Ma, S., Zheng, Y., Wolfson, O.: T-share: a large-scale dynamic taxi ridesharing service. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 410–421. IEEE (2013)

    Google Scholar 

  8. Tang, X., Qin, Z.T., Zhang, F., Wang, Z., Ye, J.: A deep value-network based approach for multi-driver order dispatching. In: The 25th ACM SIGKDD International Conference (2019)

    Google Scholar 

  9. Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. Proc. VLDB Endow. 9(12), 1053–1064 (2016)

    Article  Google Scholar 

  10. Tong, Y., She, J., Ding, B., Wang, L., Chen, L.: Online mobile micro-task allocation in spatial crowdsourcing. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 49–60. IEEE (2016)

    Google Scholar 

  11. Tong, Y., et al.: Flexible online task assignment in real-time spatial data. Proc. VLDB Endow. 10(11), 1334–1345 (2017)

    Article  Google Scholar 

  12. Wong, R.C.W., Tao, Y., Fu, A.W.C., Xiao, X.: On efficient spatial matching. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 579–590 (2007). VLDB Endow

    Google Scholar 

  13. Yiu, M.L., Mouratidis, K., Mamoulis, N., et al.: Capacity constrained assignment in spatial databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 15–28. ACM (2008)

    Google Scholar 

Download references

Acknowledgements

This research is in part supported by the Natural Science Foundation of China (61672441, 61872154, 61862051), the Shenzhen Basic Research Program (JCYJ20170818141325209, JCYJ20190809161603551), Natural Science Foundation of Fujian(2018J01097), Special Fund for Basic Scientific Research Operation Fees of Central Universities (20720200031).

Author information

Authors and Affiliations

  1. Shenzhen Research Institute, Xiamen University, Shenzhen, 518057, China

    Yongxuan Lai, Shipeng Yang, Anshu Xiong & Fan Yang

  2. School of Informatics, Xiamen University, Xiamen, 361005, China

    Yongxuan Lai, Shipeng Yang & Anshu Xiong

  3. School of Aerospace Engineering, Xiamen University, Xiamen, 361005, China

    Fan Yang

Authors
  1. Yongxuan Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shipeng Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anshu Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fan Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongxuan Lai .

Editor information

Editors and Affiliations

  1. Tianjin University, Tianjin, China

    Xin Wang

  2. University of Melbourne, Melbourn, NSW, Australia

    Rui Zhang

  3. Kyung Hee University, Yongin, Korea (Republic of)

    Young-Koo Lee

  4. Nanjing University of Information Science and Technology, Nanjing, China

    Le Sun

  5. Kangwon National University, Chunchon, Korea (Republic of)

    Yang-Sae Moon

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lai, Y., Yang, S., Xiong, A., Yang, F. (2020). Seamless Incorporation of Appointment-Based Requests on Taxi-Rider Match Scheduling. In: Wang, X., Zhang, R., Lee, YK., Sun, L., Moon, YS. (eds) Web and Big Data. APWeb-WAIM 2020. Lecture Notes in Computer Science(), vol 12317. Springer, Cham. https://doi.org/10.1007/978-3-030-60259-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-60259-8_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-60258-1

  • Online ISBN: 978-3-030-60259-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation