Research on Optimization of Vehicle Routing Problem for Ride-sharing Taxi

In order to improve transportation efficiency of taxi and mitigate urban traffic congestion, it is necessary to carry out ride-sharing strategy which contributes to reducing operating cost and saving road resources. This study focuses on the routing optimization of ride-sharing taxis, in which interests of both taxi drivers and passengers are taken into account. Minimization of operating cost and maximization of customer satisfaction are considered as the objective, and travel mileage, waiting time and extra riding time due to ride-sharing are used to quantify them respectively. Routing optimization model for ride-sharing taxis is established and then appropriate simulated annealing algorithm satisfying constraints of the model proposed is designed. At last, a computational experiment is conducted to verify the model and the result shows that this method is able to save 19% mileage as well as 66% taxis available.

[1]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[2]  Xia Xi The route choice and rate optimization model of taxi-pooling , 2011 .

[3]  Xu Chen Study of the Mode of Combined-taxi Optimal Scheduling , 2009 .

[4]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[5]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[6]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[7]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[8]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[9]  Hao Zhong-na Research on Dynamic Combined-taxi , 2008 .

[10]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[11]  Hokey Min,et al.  A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..

[12]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[13]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[14]  Shi Qin,et al.  Research on the combined-taxi mode , 2006 .

[15]  Zheng Li-juan Research on Issue of Carpooling , 2010 .

[16]  Liping Fu,et al.  Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .

[17]  Maged Dessouky,et al.  A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .

[18]  Zhang Shuang The Combined-taxi , 2008 .

[19]  Mark Wardman,et al.  Public transport values of time , 2004 .

[20]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .