People and parcels sharing a taxi for Tokyo city

This paper introduces a practical hybrid transportation model for Tokyo city that allows a passenger and parcels are handled in a same taxi. We inherit the recent model given by Li et al. in 2014 and make it much more realistic by adding some constraints related to the real-life case. We propose the time-dependent model to facilitate formulating constraints. The feasibility and the efficacy of the model are proved by two proposed heuristic algorithms. Especially, we use the real-case experimental data set recorded by Tokyo-Musen Taxi company. The data set includes more than 20,000 requests per day, more than 4,500 served taxis per day and more than 130,000 crossing points on the Tokyo map. The experimental results are analyzed on various factors such as the total benefit, the accumulating distances during the day, the number of used taxis and the number of shared requests.

[1]  Kalon L Kelley Casual carpooling—enhanced , 2007 .

[2]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[3]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

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

[5]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .

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

[7]  Hajo A. Reijers,et al.  The Share-a-Ride Problem: People and parcels sharing taxis , 2014, Eur. J. Oper. Res..

[8]  Hajo A. Reijers,et al.  An adaptive large neighborhood search heuristic for the share-a-ride problem , 2016, Comput. Oper. Res..

[9]  Anna Trentini,et al.  Toward a Shared Urban Transport System Ensuring Passengers & Goods Cohabitation , 2010 .

[10]  E. Ferguson The rise and fall of the American carpool: 1970–1990 , 1997 .

[11]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[12]  C. Morency The ambivalence of ridesharing , 2007 .

[13]  Susan Shaheen,et al.  Ridesharing in North America: Past, Present, and Future , 2012 .

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

[15]  Jens Lysgaard,et al.  The pyramidal capacitated vehicle routing problem , 2010, Eur. J. Oper. Res..

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

[17]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[18]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..