The Journal of China Universities of Posts and Telecommunications ›› 2020, Vol. 27 ›› Issue (5): 82-90.doi: 10.19682/j.cnki.1005-8885.2020.0028

Previous Articles     Next Articles

City-wide vehicle dispatching for multi-hop ridesharing package delivery

Zhao Xiyu, Zhang Xuefei , Liu Junjie, Wang Yining   

  1. Beijing University of Posts and Telecommunications
  • Received:2020-07-13 Revised:2020-08-06 Online:2020-10-22 Published:2020-10-23
  • Contact: Xuefei Zhang
  • Supported by:

    the National Natural Science Foundation of China and the National Undergraduate Innovation and Entrepreneurship Taining Program


The city-wide ridesharing package delivery is becoming popular as it provides a convenience such as extra profits to the vehicle-s driver and high traffic efficiency to the city. The vehicle dispatching is a significant issue to improve the ridesharing efficiency in package delivery. The classic one-hop ridesharing package delivery requires the highly similar paths between the package and the vehicle given by the limited detour time, which depresses the ridesharing efficiency. To tackle this problem, a city-wide vehicle dispatching strategy for the multi-hop ridesharing package delivery was proposed, where a package is permitted to be delivered sequentially by different vehicles, until arriving the destination. The study formulates the vehicle dispatching as a maximum multi-dimensional bipartite matching problem with the goal of maximizing the total saving distance given by the limited detour time and ridesharing capacity. A multi-hop ridesharing vehicle dispatching algorithm was proposed to solve this problem by selecting the farthest reachable locker and multi-dimensional matching. Simulation results based on real vehicle dataset of Beijing demonstrate the effectiveness and efficiency of the proposed vehicle dispatching strategy.

Key words: multi-hop ridesharing, package delivery, vehicle dispatching

CLC Number: