Seite - (000431) - in Autonomes Fahren - Technische, rechtliche und gesellschaftliche Aspekte

Autonomous Mobility-on-Demand Systems for Future Urban Mobility416 19. R. C. Larson and A. R. Odoni. Urban operations research. Prentice-Hall, 1981. 20. D. J. Bertsimas and G. J. van Ryzin. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research, 39:601–615, 1991. 21. D. J. Bertsimas and D. Simchi-Levi. A new generation of vehicle routing research: robust algo- rithms, addressing uncertainty. Operations Research, 44(2):286–304, 1996. 22. D. J. Bertsimas and G. J. van Ryzin. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research, 41(1):60–76, 1993. 23. D. J. Bertsimas and G. J. van Ryzin. Stochastic and dynamic vehicle routing with general inter- arrival and service time distributions. Advances in Applied Probability, 25:947–978, 1993. 24. T. L. Friesz, J. Luque, R. L. Tobin, and B. W. Wie. Dynamic network traffic assignment consid- ered as a continuous time optimal control problem. Operations Research, 37(6):893–901, 1989. 25. S. Peeta and A. Ziliaskopoulos. Foundations of dynamic traffic assignment: The past, the present and the future. Networks and Spatial Economics, 1:233–265, 2001. 26. E. Feuerstein and L. Stougie. On-line single-server dial-a-ride problems. Theoretical Computer Science, 268(1):91–105, 2001. 27. P. Jaillet and M. R. Wagner. Online routing problems: Value of advanced information and improved competitive ratios. Transportation Science, 40(2):200–210, 2006. 28. G. Berbeglia, J. F. Cordeau, and G. Laporte. Dynamic pickup and delivery problems. European Journal of Operational Research, 202(1):8–15, 2010. 29. D. K. George and C. H. Xia. Fleet-sizing and service availability for a vehicle rental system via closed queueing networks. European Journal of Operational Research, 211(1):198–207, 2011. 30. J. R. Jackson. Networks of waiting lines. Operations Research, 5(4):518–521, 1957. 31. J. R. Jackson. Jobshop-like queueing systems. Management science, 10(1):131–142, 1963. 32. L. Ruschendorf. The Wasserstein distance and approximation theorems. Probability Theory and Related Fields, 70:117–129, 1985. 33. M. Pavone, K. Treleaven, and E. Frazzoli. Fundamental performance limits and efficient policies for transportation-on-demand systems. In Proc. IEEE Conf. on Decision and Control, pages 5622–5629, 2010. 34. Singapore Land Transport Authority. 2008 Household interview travel survey background infor- mation, 2008. 35. Land Transport Authority. Singapore land transit statistics in brief, 2012. 36. HEATCO. Harmonized European approaches for transport costing and project assessment. Online: http://heatco.ier.uni-stuttgart.de, 2006. 37. H. Huang and W. H. K. Lam. Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues. Transportation Research Part B: Methodological, 36(3):253–273, 2002.