Annals of Operations Research

, Volume 236, Issue 2, pp 405–424 | Cite as

Minimising average passenger waiting time in personal rapid transit systems

Article

Abstract

Personal Rapid Transit (PRT) is an emerging urban transport mode. A PRT system operates much like a conventional hackney taxi system, except that the vehicles are driven by computer (no human driver) between stations in a dedicated network of guideways. The world’s first two PRT systems began operating in 2010 and 2011. In both PRT and taxi systems, passengers request immediate service; they do not book ahead. Perfect information about future requests is therefore not available, but statistical information about future requests is available from historical data. If the system does not use this statistical information to position empty vehicles in anticipation of future requests, long passenger waiting times result, which makes the system less attractive to passengers, but using it gives rise to a difficult stochastic optimisation problem. This paper develops three lower bounds on achievable mean passenger waiting time, one based on queuing theory, one based on the static problem, in which it is assumed that perfect information is available, and one based on a Markov Decision Process model. An evaluation of these lower bounds, together with a practical heuristic developed previously, in simulation shows that these lower bounds can often be nearly attained, particularly when the fleet size is large. The results also show that low waiting times and high utilisation can be simultaneously obtained when the fleet size is large, which suggests important economies of scale.

Keywords

Personal rapid transit Empty vehicle redistribution Taxi Queuing model Markov decision process Waiting time 

References

  1. 2getthere (2011). Masdar operations. Accessed 11 May, 2011, URL http://www.2getthere.eu/?p=128.
  2. Adan, I., & Resing, J. (2002). Queueing theory. Course Notes, Eindhoven University of Technology. Google Scholar
  3. Anderson, J. E. (1978). Transit systems theory. Totowa: Lexington Books. Google Scholar
  4. Bell, M. G. H., & Wong, K. I. (2005). A rolling horizon approach to the optimal dispatching of taxis. In H. S. Mahmassani (Ed.), Transportation and traffic theory: flow, dynamics and human interaction: proceedings of the 16th international symposium on transportation and traffic theory (pp. 629–648). Amsterdam: Elsevier. Google Scholar
  5. Bent, R. W., & Van Hentenryck, P. (2004). Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research, 52(6), 977–987. CrossRefGoogle Scholar
  6. Berbeglia, G., Cordeau, J. F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: a classification scheme and survey. TOP, 15(1), 1–31. CrossRefGoogle Scholar
  7. Berbeglia, G., Cordeau, J. F., & Laporte, G. (2010). Dynamic pickup and delivery problems. European Journal of Operational Research, 202(1), 8–15. CrossRefGoogle Scholar
  8. Bertsekas, D. P., & Tsitsiklis, J. N. (1996). Neuro-dynamic programming. Cambridge: Athena Scientific. Google Scholar
  9. Bertsimas, D., & Tsitsiklis, J. (1997). Introduction to linear optimization. Cambridge: Athena Scientific. Google Scholar
  10. Bertsimas, D. J., & Levi, D. S. (1996). A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Operations Research, 44(2), 286–304. CrossRefGoogle Scholar
  11. Bly, P. H., & Teychenne, P. (2005). Three financial and socio-economic assessments of a personal rapid transit system. In Proceedings of the tenth international conference on automated people movers (p 39). Reston: American Society of Civil Engineers. http://link.aip.org/link/?ASC/174/39. Google Scholar
  12. Boxma, O. J., Cohen, J. W., & Huffels, N. (1979). Approximations of the mean waiting time in an M/G/s queueing system. Operations Research, 27(6). Google Scholar
  13. van Eijl, C. A. (1995). A polyhedral approach to the delivery man problem. Tech. Rep. COSOR 95-19, Eindhoven University of Technology. Google Scholar
  14. Gupta, V., Harchol-Balter, M., Dai, J., & Zwart, B. (2010). On the inapproximability of M/G/k: why two moments of job size distribution are not enough. Queueing Systems, 64(1), 5–48. CrossRefGoogle Scholar
  15. Horn, M. (2002). Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research. Part C, Emerging Technologies, 10(1), 35–63. CrossRefGoogle Scholar
  16. Hvattum, L. M. Løkketangen, A., & Laporte, G. (2006). Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science, 40(4), 421–438. CrossRefGoogle Scholar
  17. Lee, D. H., Wang, H., Cheu, R., & Teo, S. (2004). Taxi dispatch system based on current demands and Real-time traffic conditions. Transportation Research Record: Journal of the Transportation Research Board, 1882, 193–200. CrossRefGoogle Scholar
  18. Lees-Miller, J. D. (2011). Empty vehicle redistribution for personal rapid transit. PhD thesis, University of Bristol. Google Scholar
  19. Lees-Miller, J. D., & Wilson, R. E. (2011). Sampling for personal rapid transit empty vehicle redistribution. Transportation Research Record: Journal of the Transportation Research Board Google Scholar
  20. Lees-Miller, J. D., & Wilson, R. E. (2012). Proactive empty vehicle redistribution for personal rapid transit and taxis. Transportation Planning and Technology. Google Scholar
  21. Lees-Miller, J. D., Hammersley, J., & Davenport, N. (2009). Ride sharing in personal rapid transit capacity planning. In R. R. Griebenow (Ed.), Automated people movers 2009 (pp. 321–332). Reston: American Society of Civil Engineers. CrossRefGoogle Scholar
  22. Lees-Miller, J. D., Hammersley, J. C., & Wilson, R. E. (2010). Theoretical maximum capacity as benchmark for empty vehicle redistribution in personal rapid transit. Transportation Research Record, 2146, 76–83. CrossRefGoogle Scholar
  23. Li, S. (2006). Multi-attribute taxi logistics optimization. Master’s thesis, Massachusetts Institute of Technology. Google Scholar
  24. Nagarajan, V., & Ravi, R. (2008). The directed minimum latency problem. In A. Goel, K. Jansen, J. D. P. Rolim, & R. Rubinfeld (Eds.), Lecture notes in computer science: Vol. 5171. Approximation, randomization and combinatorial optimization. Algorithms and techniques (pp. 193–206). Berlin: Springer. CrossRefGoogle Scholar
  25. Powell, W. B. (2007). Approximate dynamic programming: solving the curses of dimensionality. New York: Wiley-Interscience. CrossRefGoogle Scholar
  26. Puterman, M. L. (2005). Markov decision processes: discrete stochastic dynamic programming. New York: Wiley-Interscience. Google Scholar
  27. Seow, K. T., Dang, N. H., & Lee, D. H. (2010). A collaborative multiagent taxi-dispatch system. IEEE Transactions on Automation Science and Engineering, 7(3), 607–616. CrossRefGoogle Scholar
  28. Sutton, R. S., & Barto, A. G. (1999). Reinforcement learning: an introduction. Cambridge: MIT Press. Google Scholar
  29. Swihart, M. R., & Papastavrou, J. D. (1999). A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. European Journal of Operational Research, 114(3), 447–464. CrossRefGoogle Scholar
  30. Tijms, H. (2006). New and old results for the M/D/c queue. AEÜ. International Journal of Electronics and Communications, 60(2), 125–130. CrossRefGoogle Scholar
  31. Toth, P., & Vigo, D. (2002). The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia: Society for Industrial and Applied Mathematics. CrossRefGoogle Scholar
  32. ULTra PRT (2010). ULTra at London Heathrow airport. Accessed July 31, URL http://www.ultraprt.com/applications/existing-systems/heathrow/.
  33. Vis, I. F. A. (2006). Survey of research in the design and control of automated guided vehicle systems. European Journal of Operational Research, 170(3), 677–709. CrossRefGoogle Scholar
  34. Wang, H., Lee, D. H., & Cheu, R. (2009). PDPTW based taxi dispatch modeling for booking service. In Fifth international conference on natural computation (pp. 242–247). New York: IEEE Press. Google Scholar
  35. Wesselowski, K., & Cassandras, C. G. (2006). The elevator dispatching problem: hybrid system modeling and receding horizon control. In C. Cassandras, A. Giua, C. Seatzu, & J. Zaytoon (Eds.), Analysis and design of hybrid systems 2006: a proceedings volume from the 2nd IFAC conference (pp. 136–141). Amsterdam: Elsevier. CrossRefGoogle Scholar
  36. Yang, H., Wong, S., & Wong, K. (2002). Demand-supply equilibrium of taxi services in a network under competition and regulation. Transportation Research. Part B: Methodological, 36(9), 799–819. CrossRefGoogle Scholar
  37. Yang, J., Jaillet, P., & Mahmassani, H. (2004). Real-time multivehicle truckload pickup and delivery problems. Transportation Science, 38(2), 135–148. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Transportation Research GroupUniversity of SouthamptonSouthamptonUK

Personalised recommendations