Berbeglia, G. ; Cordeau, J.-F. ; Gribkovskaia, I. ; Laporte, G. Static pickup and delivery problems: a classification scheme and survey. 2007 TOP. 15 1-31
Berbeglia, G. ; Pesant, G. ; Rousseau, L.-M. Checking the feasibility of dial-a-ride instances using constraint programming. 2011 Transp. Sci.. 45 399-412
Bösch, P.M. ; Becker, F. ; Becker, H. ; Axhausen, K.W. Cost-based analysis of autonomous mobility services. 2018 Transp. Policy. 64 76-91
Braekers, K. ; Kovacs, A.A. A multi-period dial-a-ride problem with driver consistency. 2016 Transp. Res. B Methodol.. 94 355-377
Cai, H. ; Wang, X. ; Adriaens, P. ; Xu, M. Environmental benefits of taxi ride sharing in Beijing. 2019 Energy. 174 503-508
Camarero, L. ; Oliva, J. Thinking in rural gap: mobility and social inequalities. 2019 Palgrave Commun. 5 95-
- Cauchi, M. ; Scerri, K. An improved variable neighbourhood search algorithm for selective dial-a-ride problems. 2020 En : 20th Mediterranean Electrotechnical Conference (MELECON). IEEE:
Paper not yet in RePEc: Add citation now
- Chen, M.H. ; Jauhri, A. ; Shen, J.P. Data driven analysis of the potentials of dynamic ride pooling. 2017 En : Proceedings of the 10th ACM SIGSPATIAL Workshop on Computational Transportation Science. :
Paper not yet in RePEc: Add citation now
Cordeau, J.-F. A branch-and-cut algorithm for the dial-a-ride problem. 2006 Oper. Res.. 54 573-586
Cordeau, J.-F. ; Laporte, G. The dial-a-ride problem: models and algorithms. 2007 Annals of Operations Research. 153 29-46
- Curtis, C. ; Stone, J. ; Legacy, C. ; Ashmore, D. Governance of future urban mobility: a research agenda. 2019 Urban Policy Res.. 37 393-404
Paper not yet in RePEc: Add citation now
- Dandl, F. ; Engelhardt, R. ; Hyland, M. ; Tilg, G. ; Bogenberger, K. ; Mahmassani, H.S. Regulating mobility-on-demand services: tri-level model and bayesian optimization solution approach. 2021 Transp. Res. Part C Emerging Technol.. 125 -
Paper not yet in RePEc: Add citation now
- Deutscher Bundestag, 2021. Personenbeförderungsgesetz [WWW Document] accessed 1.11.23 https://www.gesetze-im-internet.de/pbefg/.
Paper not yet in RePEc: Add citation now
- Engelhardt, R. ; Dandl, F. ; Bilali, A. ; Bogenberger, K. Quantifying the benefits of autonomous on-demand ride-pooling: a simulation study for Munich, Germany. 2019 En : Intelligent Transportation Systems Conference (ITSC). IEEE:
Paper not yet in RePEc: Add citation now
Ennen, D. ; Heilker, T. Ride-hailing services in Germany: potential impacts on public transport, motorized traffic, and social welfare. 2020 Institut für Verkehrswissenschaft:
- Erhardt, G.D. ; Roy, S. ; Cooper, D. ; Sana, B. ; Chen, M. ; Castiglione, J. Do transportation network companies decrease or increase congestion?. 2019 Sci. Adv.. 5 -
Paper not yet in RePEc: Add citation now
- Flexibus, 2024. Der FLEXIBUS in Krumbach [WWW Document]. Flexibus. URL https://www.flexibus.net/krumbach (accessed 9.11.24).
Paper not yet in RePEc: Add citation now
Gaul, D. ; Klamroth, K. ; Pfeiffer, C. ; Stiglmayr, M. ; Schulz, A. A tight formulation for the dial-a-ride problem. 2025 Eur. J. Oper. Res.. 321 363-382
Gaul, D. ; Klamroth, K. ; Stiglmayr, M. Event-based MILP models for ridepooling applications. 2022 Eur. J. Oper. Res.. 301 1048-1063
- Gurobi, 2024. Version 11.0.0 [WWW Document]. Gurobi Optimization. URL https://www.gurobi.com/ (accessed 5.14.24).
Paper not yet in RePEc: Add citation now
Ho, S.C. ; Szeto, W.Y. ; Kuo, Y.-H. ; Leung, J.M.Y. ; Petering, M. ; Tou, T.W.H. A survey of dial-a-ride problems: literature review and recent developments. 2018 Transp. Res. B Methodol.. 111 395-421
Hosni, H. ; Naoum-Sawaya, J. ; Artail, H. The shared-taxi problem: formulation and solution methods. 2014 Transp. Res. B Methodol.. 70 303-318
- Hungerländer, P. ; Maier, K. ; Pachatz, V. ; Truden, C. Improving sharing rates of a dial-a-ride problem implemented for an Austrian mobility provider. 2021 Transp. Res. Procedia. 52 525-532
Paper not yet in RePEc: Add citation now
Jaw, J.-J. ; Odoni, A.R. ; Psaraftis, H.N. ; Wilson, N.H.M. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. 1986 Transp. Res. B Methodol.. 20 243-257
Kirchler, D. ; Wolfler Calvo, R. A granular tabu search algorithm for the dial-a-ride problem. 2013 Transp. Res. B Methodol.. 56 120-135
- Liobikienė, G. ; Miceikienė, A. Influence of informational, social, convenience and financial tools on sustainable transport behaviour: the case of Lithuania. 2022 J. Clean. Prod.. 362 -
Paper not yet in RePEc: Add citation now
- Ma, Z. ; Koutsopoulos, H.N. Near-on-demand mobility. The benefits of user flexibility for ride-pooling services. 2022 Transp. Res. Part C Emerging Technol.. 135 -
Paper not yet in RePEc: Add citation now
- Martinez, L.M. ; Viegas, J.M. Assessing the impacts of deploying a shared self-driving urban mobility system: an agent-based model applied to the city of Lisbon, Portugal. 2017 Int. J. Transp. Sci. Technol.. 6 13-27
Paper not yet in RePEc: Add citation now
Molenbruch, Y. ; Braekers, K. ; Caris, A. Typology and literature review for dial-a-ride problems. 2017 Annals of Operations Research. 259 295-325
Parragh, S.N. ; Pinho De Sousa, J. ; Almada-Lobo, B. The dial-a-ride problem with split requests and profits. 2015 Transp. Sci.. 49 311-334
Pillac, V. ; Gendreau, M. ; Guéret, C. ; Medaglia, A.L. A review of dynamic vehicle routing problems. 2013 Eur. J. Oper. Res.. 225 1-11
- Powell, W.B., 2011. Approximate Dynamic Programming: Solving the Curses of Dimensionality, 1st ed, Wiley Series in Probability and Statistics. Wiley. https://doi.org/10.1002/9781118029176.
Paper not yet in RePEc: Add citation now
- Python, 2024. Version 3.9 [WWW Document]. Python.org. URL https://www.python.org/ (accessed 5.14.24).
Paper not yet in RePEc: Add citation now
- Qiu, H., Li, R., Zhao, J., 2018. Dynamic Pricing in Shared Mobility on Demand Service.
Paper not yet in RePEc: Add citation now
Reinhardt, L.B. ; Clausen, T. ; Pisinger, D. Synchronized dial-a-ride transportation of disabled passengers at airports. 2013 Eur. J. Oper. Res.. 225 106-117
- Riedler, M. ; Raidl, G. Solving a selective dial-a-ride problem with logic-based benders decomposition. 2018 Comput. Oper. Res.. 96 30-54
Paper not yet in RePEc: Add citation now
Rist, Y. ; Forbes, M.A. A New Formulation for the Dial-a-Ride Problem. 2021 Transp. Sci.. 55 1113-1135
- Ropke, S. ; Cordeau, J. ; Laporte, G. Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows. 2007 Networks. 49 258-272
Paper not yet in RePEc: Add citation now
- Shaheen, S., Cohen, A., 2020. Mobility on demand (MOD) and mobility as a service (MaaS): early understanding of shared mobility impacts and public transit partnerships, in: Demand for Emerging Transportation Systems. Elsevier, pp. 37–59. https://doi.org/10.1016/B978-0-12-815018-4.00003-6.
Paper not yet in RePEc: Add citation now
- Sörensen, L. ; Bossert, A. ; Jokinen, J.-P. ; Schlüter, J. How much flexibility does rural public transport need? – Implications from a fully flexible DRT system. 2021 Transp. Policy. 100 5-20
Paper not yet in RePEc: Add citation now
- VDV, 2023. Linienbedarfsverkehr: zukunftsgerecht, integriert und nachfragegesteuert [WWW Document]. URL https://www.vdv.de/positionensuche.aspx?id=ecb3bf26-1e30-42ba-80b9-579f839075a9&mode=detail&coriander=V3_43e70abd-7d56-e24f-47b1-ba66f00c017d.
Paper not yet in RePEc: Add citation now
- Wolfler Calvo, R. ; Colorni, A. An effective and fast heuristic for the dial-a-ride problem. 2007 4OR. 5 61-73
Paper not yet in RePEc: Add citation now
Yu, B. ; Ma, Y. ; Xue, M. ; Tang, B. ; Wang, B. ; Yan, J. ; Wei, Y.-M. Environmental benefits from ridesharing: A case of Beijing. 2017 Appl. Energy. 191 141-152
Zhang, Z. ; Liu, M. ; Lim, A. A memetic algorithm for the patient transportation problem. 2015 Omega. 54 60-71
Zwick, F. ; Axhausen, K.W. Ride-pooling demand prediction: a spatiotemporal assessment in Germany. 2022 J. Transp. Geogr.. 100 -