 |
    |
Ride-Sharing: A Multi Source-Destination Path Planning Approach
Jamal Yousaf1, Juanzi Li1, Lu Chen2, Jie Tang1, Xiaowen Dai2, and John Du2
1Department of Computer Science and Technology, Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing, 100084, China
jamalyousaf@keg.tsinghua.edu.cn
ljz@keg.tsinghua.edu.cn
jietang@keg.tsinghua.edu.cn
2General Motors, China Science Lab, Shanghai, China
lu.chen@gm.com
xiaowen.dai@gm.com
john.du@gm.com
Abstract. Ride-sharing is considered as one of the promising solutions for reducing fuel consumption of fuel and reducing the congestion in urban cities, hence reducing the environmental pollution. With the advancement of mobile social networking technologies, it is necessary to reconsider the principles and desired characteristics of ride-sharing systems. Ride-sharing systems can be popular among people if we can provide more flexible and adaptive solution according to preferences of the participants and solve the social challenges. In this paper, we focus on encouraging people to use a ride-sharing system by satisfying their demands in terms of safety, privacy, convenience and also provide enough incentives for drivers and riders. We formalized the ride sharing problem as a multi source-destination path planning problem. An objective function is developed which models different conflicting objectives in a unified framework. We provide the flexibility to each driver that he can generate the sub-optimal paths according to his own requirements by suitably adjusting the weights. These sub-optimal paths are generated in an order of priority (optimality). The simulation results have shown that the system has the potential to compute multiple optimal paths.
Keywords: Ride-sharing, Path Planning, Dynamic Optimization
LNAI 7691, p. 815 ff.
lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2012