A pickup and delivery problem for ridesharing considering congestion

Traffic congestion is a significant social concern that is credited with considerable economic costs, wasted time, and associated public health risks. Efficient ridesharing solutions could help mitigate congestion. Some of the actions that government agencies have taken to encourage ridesharing include the availability of high occupancy vehicle (HOV) lanes and existing policies of discounted toll rates on HOVs. These measures encourage ridesharing by reducing costs or travel times of such trips. To study how the optimal routes change as a function of incentives for ridesharing, we modified existing pickup and delivery problems with time windows to consider changes in passenger travel time and toll cost due to vehicle load. Our computational results explore how the total route cost and time are affected by the use of HOV lanes and toll savings. In addition, our results show that it can be beneficial from a time and cost perspective to take detours to pick up additional passengers and use HOV lanes when the time saving on HOV lanes is significant.

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

[2]  Sven Koenig,et al.  Ridesharing : The state-ofthe-art and future directions , 2013 .

[3]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[4]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[5]  J. Levy,et al.  Evaluation of the Public Health Impacts of Traffic Congestion: A Health Risk Assessment , 2010 .

[6]  Michael G. H. Bell,et al.  Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints , 2006, Int. Trans. Oper. Res..

[7]  Richard F. Hartl,et al.  Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..

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

[9]  H. Psaraftis An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[10]  Raymond Chiong,et al.  Natural Intelligence for Scheduling, Planning and Packing Problems , 2009, Natural Intelligence for Scheduling, Planning and Packing Problems.

[11]  Jacques Desrosiers,et al.  Large Scale Multi-Vehicle Dial-a-Ride Problems , 1989 .

[12]  A. Santos,et al.  Summary of Travel Trends: 2009 National Household Travel Survey , 2011 .

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

[14]  P. S. Hu,et al.  Summary of Travel Trends , 2004 .

[15]  Sérgio Ricardo de Souza,et al.  An Application of the Ant Colony System Metaheuristic to the Vehicle Routing Problem with Pickup and Delivery and Time Windows , 2010, 2010 Eleventh Brazilian Symposium on Neural Networks.

[16]  Jonathan F. Bard,et al.  Large-scale constrained clustering for rationalizing pickup and delivery operations , 2009 .

[17]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[18]  José Brandão,et al.  A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

[19]  Gilbert Laporte,et al.  Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.

[20]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[21]  Jacques Desrosiers,et al.  An Algorithm for Mini-Clustering in Handicapped Transport , 1991 .

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

[23]  G. Laporte,et al.  The diala-ride problem : models and algorithms , .

[24]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

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

[26]  Bülent Çatay,et al.  Ant Colony Optimization and Its Application to the Vehicle Routing Problem with Pickups and Deliveries , 2009, Natural Intelligence for Scheduling, Planning and Packing Problems.

[27]  Jean-Yves Potvin,et al.  Constraint-Directed Search for the Advanced Request Dial-a-Ride Problem with Service Quality Constraints , 1992, Computer Science and Operations Research.

[28]  One Gateway Plaza,et al.  Metropolitan Transportation Authority , 1998 .

[29]  Andrew Lim,et al.  A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

[30]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[31]  Martin W. P. Savelsbergh,et al.  Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..

[32]  Maged M. Dessouky,et al.  A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows , 2006, Eur. J. Oper. Res..

[33]  Chengbin Chu,et al.  A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints , 2006, Eur. J. Oper. Res..

[34]  Gilbert Laporte,et al.  A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem , 2012, INFORMS J. Comput..

[35]  Christine L. Mumford,et al.  The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms , 2010, J. Heuristics.

[36]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[37]  Voratas Kachitvichyanukul,et al.  Multi‐depot Vehicle Routing Problem with Pickup and Delivery Requests , 2010 .

[38]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[39]  Jacques Desrosiers,et al.  A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..

[40]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[41]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

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

[43]  Martin Davies,et al.  Computer Science and Operations Research: New Developments in Their Interfaces , 1992 .

[44]  Martin W. P. Savelsbergh,et al.  Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..

[45]  Gilbert Laporte,et al.  Recent Models and Algorithms for One-to-One Pickup and Delivery Problems , 2008 .

[46]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..