Ngoc-Quang Nguyen
ABSTRACT
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.
- N. Agatz, A. Erera, A. Savelsbergh, and X. Wang. Dynamic ridesharing: A simulation study in metro atlanta. Transportation Research Part B, 45(2):1450--1464, 2011.Google Scholar
Cross Ref
- G. V. Brummelen. In Heavenly mathematics. Princeton University Press, 2013.Google Scholar
- C. Morency. The ambivalence of ridesharing. Transportation, 34(2):239--253, 2007.Google ScholarCross Ref
- E. Ferguson. The rise and fall of the American carpool: 1970--1990. Transportation, 24(4):349--376, 1997.Google ScholarCross Ref
- G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science, 6(1):80--92, 1959. Google ScholarDigital Library
- G. Berbeglia and J. P. Cordeau, and G. Laporte. Dynamic pickup and delivery problems. European Journal of Operational Research, 202(1):8--15, 2010.Google ScholarCross Ref
- G. Clarke and J. W. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4):568--582, 1964. Google ScholarDigital Library
- J. Lysgaard. The pyramidal capacitated vehicle routing problem. European Journal of Operational Research, 205(1):59--64, 2010.Google ScholarCross Ref
- J. P. Cordeau and G. Laporte. The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR: A Quarterly Journal of Operations Research, 1:89--101, 2003.Google Scholar
- J. P. Cordeau and G. Laporte. The dial-a-ride problem: models and algorithms. Annals of Operations Research, 203(1):29--46, 2007.Google ScholarCross Ref
- L. Japan Post Co. http://www.post.japanpost.jp/fee/index.html. Website, 2009.Google Scholar
- K. Kelley. Casual carpooling enhanced. Journal of Public Transportation, 10(4):119--130, 2007.Google ScholarCross Ref
- B. Li, D. Krushinsky, H. Reijers, and T. Woensel. The share-a-ride problem: people and parcels sharing taxis. European Journal of Operational Research, 238(1):31--40, 2014.Google ScholarCross Ref
- B. Li, D. Krushinsky, W. Van, and H. Reijers. An Adaptive Large Neighborhood Search Heuristic for the Share-a-Ride Problem. Computers & Operations Research, 66:170--180, 2016.Google ScholarDigital Library
- M. Furuhata and M. Dessouky and F. Ordóñez and M. Brunet and X. Wang and S. Koenig. Ridesharing: The state-of-the-art and future directions. Transportation Research Part B: Methodological, 57:28--46, 2013.Google ScholarCross Ref
- Musen Taxi Company. http://www.tokyomusen.or.jp/. Website, 2009.Google Scholar
- N. D. Chan and S. A. Shaheen. Ridesharing in North America: past, present, and future. Transport Reviews, 32(1):93--112, 2012.Google ScholarCross Ref
- O. Bräysy and M. Gendreau. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science, 39(1):104--118, 2005. Google ScholarDigital Library
- R. Baldacci and A. Mingozzi and R. Roberti. Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1):1--6, 2012.Google ScholarCross Ref
- A. Trentini and N. Malhene. Toward a shared urban transport system ensuring passengers & goods cohabitation. TeMA - Trimestrale del Laboratorio Territorio Mobility Ambiente, 3(2):37--44, 2010.Google Scholar
- V. Pillac and M. Gendreau and C. Guéret and A. L. Medaglia. A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1):1--11, 2013.Google ScholarCross Ref
Recommendations
Real-Time Distributed Taxi Ride Sharing
2018 21st International Conference on Intelligent Transportation Systems (ITSC)Taxicabs play an important role in urban public transportation. Analyzing taxi traffic of Shanghai, San Francisco, and New York City, we have found that the short trips within city are mostly of commuters during office hours and span a specific city area. ...
Real-Time City-Scale Taxi Ridesharing
We proposed and developed a taxi-sharing system that accepts taxi passengers' real-time ride requests sent from smart phones and schedules proper taxis to pick up them via ride sharing, subject to time, capacity, and monetary constraints. The monetary ...
Dynamic Taxi Ride Sharing using Localized Communication
ICDCN '20: Proceedings of the 21st International Conference on Distributed Computing and NetworkingWith the rise of on-demand taxi services, like Uber, Lyft, etc., urban public transportation started to heavily depend on taxicabs. While increasing demand leads to passenger stranding, higher supply may result in traffic congestion. In order to strike ...
Comments