A Public Vehicle System with Multiple Origin-Destination Pairs on Traffic Networks

Substantial technology advances have been made in areas of autonomous and connected vehicles, which opens a wide landscape for future transportation systems. We propose a new type of transportation system, Public Vehicle (PV) system, to provide effective, comfortable, and convenient service. The PV system is to improve the efficiency of current transportation systems, \eg, taxi system. Meanwhile, the design of such a system targets on significant reduction in energy consumption, traffic congestion, and provides solutions with affordable cost. The key issue of implementing an effective PV system is to design efficient scheduling algorithms. We formulate it as the PV Path (PVP) problem, and prove it is NP-Complete. Then we introduce a real time approach, which is based on solutions of the Traveling Salesman Problem (TSP) and it can serve people efficiently with lower costs. Our results show that to achieve the same performance (e.g., the total time: waiting and travel time), the number of vehicles can be reduced by 47%-69%, compared with taxis. The number of vehicles on roads is reduced, thus traffic congestion is relieved.

[1]  G. Correia,et al.  Carpooling and carpool clubs: Clarifying concepts and assessing value enhancement possibilities through a Stated Preference web survey in Lisbon, Portugal , 2011 .

[2]  Emmanuel Prados,et al.  Calibration of an Integrated Land-Use and Transportation Model Using Maximum-Likelihood Estimation , 2014, IEEE Transactions on Computers.

[3]  Dennis Luxen,et al.  Multi-Hop Ride Sharing , 2013, SOCS.

[4]  Gerhard J. Woeginger,et al.  Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh , 2011, Oper. Res. Lett..

[5]  Ming Zhu,et al.  The charging-scheduling problem for electric vehicle networks , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[6]  Fan Zhang,et al.  coRide: carpool service with a win-win fare model for large-scale taxicab networks , 2013, SenSys '13.

[7]  Fernando Ordóñez,et al.  Ridesharing: The state-of-the-art and future directions , 2013 .

[8]  Abdelhamid Mellouk,et al.  ITS-cloud: Cloud computing for Intelligent transportation system , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[9]  Nicos Christofides,et al.  Algorithms for Large-scale Travelling Salesman Problems , 1972 .

[10]  Juraj Hromkovic,et al.  On the Approximation Hardness of Some Generalizations of TSP , 2006, SWAT.

[11]  Pau Fonseca i Casas,et al.  Simulation analysis of a dynamic ridesharing model , 2014, Proceedings of the Winter Simulation Conference 2014.

[12]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[13]  Yu Zheng,et al.  T-share: A large-scale dynamic taxi ridesharing service , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).