Skip to main content
SpringerLink
Log in

Dynamische Planung von Fahrgemeinschaften

  • Chapter
  • First Online:
Management digitaler Plattformen

Part of the book series: Informationsmanagement und digitale Transformation ((INDITR))

  • 12k Accesses

Zusammenfassung

Fahrgemeinschaften sind ein wichtiger Bestandteil des nachhaltigen Stadtverkehrs, da sie die Nutzung von Fahrzeugen erhöhen und gleichzeitig den Straßenverkehr verringern. Durch das Teilen von Fahrten bieten Autofahrer freie Plätze in ihren Fahrzeugen anderen Passagieren an, die in ähnliche Richtungen fahren möchten. Traditionelle Fahrgemeinschaften eignen sich für Fernreisen, insbesondere für Reisen zwischen Städten, sind jedoch für kurze Strecken innerhalb von Städten nicht flexibel genug. Ziel dieses Kapitels ist es, einen Service zu entwickeln, der dynamische Fahrgemeinschaften als Teil einer nachhaltigen urbanen Mobilität ermöglicht („Dynamic Ridesharing“).

Aufbauend auf der bereits von Schreieck et al. (2016a) durchgeführten Studie zum Thema Dynamic Ridesharing

Das Forschungsprojekt ExCELL wurde mit Mitteln des Bundesministeriums für Wirtschaft und Energie (BMWi) gefördert (Förderkennzeichen: 01MD15001D).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturverzeichnis

  • Agatz NAH, Erera AL, Savelsbergh MWP, Wang X (2011) Dynamic ride-sharing: A simulation study in metro Atlanta. Transportation Research Part B: Methodological 45 (9): S. 1450-1464.

    Google Scholar 

  • Arena M, Cheli F, Zaninelli D, Capasso A, Lamedica R, Piccolo A (2013) Smart mobility for sustainability, AEIT Annual Conference.

    Google Scholar 

  • Baláž P, Londarev A (2006) Oil and its position in the process of globalization of the world economy. Politická Ekonomie 2006 (4): S. 508-528.

    Google Scholar 

  • Bauer R, Delling D, Sanders P, Schieferdecker D, Schultes D, Wagner D (2008) Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm. Lecture Notes in Computer Science 5038 LNCS: S. 303-318.

    Google Scholar 

  • Bin C, Alarabi L, Mokbel MF, Basalamah A (2015) SHAREK: A Scalable Dynamic Ride Sharing System, 16th IEEE International Conference on Mobile Data Management (MDM).

    Google Scholar 

  • Dailey DJ, Loseff D, Meyers D (1999) Seattle smart traveler: dynamic ridematching on the World Wide Web. Transportation Research Part C: Emerging Technologies 7 (1): S. 17-32.

    Google Scholar 

  • Furuhata M, Dessouky M, Ordóñez F, Brunet ME, Wang X, Koenig S (2013) Ridesharing: The state-of-the-art and future directions. Transportation Research Part B: Methodological 57: S. 28-46.

    Google Scholar 

  • Garcia-Molina H, Ullman JD, Widom J (2009) Database Systems - The Complete Book. Pearson Education Inc., Upper Saddle River, NJ.

    Google Scholar 

  • Geisberger R, Luxen D, Neubauer S, Sanders P, Volker L (2010) Fast Detour Computation for Ride Sharing, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems.

    Google Scholar 

  • Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction Hierachies: Faster and Simpler Hierachical Routing in Road Networks. 7th Workshop on Experimental Algorithms 2: S. 319-333.

    Google Scholar 

  • Ghoseiri K, Haghani A, Hamedi M (2011) Real-Time Rideshare Matching Problem. Thesis.

    Google Scholar 

  • Goldberg AV, Harrelson C (2005) Computing the Shortest Path: A* meets Graph Theory. 16th ACM-SIAM Symposium on Discrete Algorithms: S. 156-165.

    Google Scholar 

  • Goldberg AV, Kaplan H, Werneck RF (2006) Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In workshop on algorithm engineering & experiments (October): S. 129-143.

    Google Scholar 

  • Gutman R (2004) Reach-based routing: A new approach to shortest path algorithms optimized for road networks, Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics.

    Google Scholar 

  • Hein A, Schreieck M, Wiesche M, Krcmar H (2016) Multiple-case analysis on governance mechanisms of multi-sided platforms, Multikonferenz Wirtschaftsinformatik, Ilmenau.

    Google Scholar 

  • Jung J, Jayakrishnan R, Park JY (2013) Design and Modeling of Real-time Shared-Taxi Dispatch Algorithms. TRB Annual Meeting 8: S. 1-20.

    Google Scholar 

  • Krcmar H (2016) TUMitfahrer. https://www.tumitfahrer.de/. Abgerufen am 12.02.2016.

  • May AD (2013) Urban Transport and Sustainability: The Key Challenges. International Journal of Sustainable Transportation 7 (March 2015): S. 170-185.

    Google Scholar 

  • OpenStreetMap (2016) OpenStreetMap. http://www.openstreetmap.de/. Abgerufen am 12.02.2016.

  • Pflügler C, Köhn T, Schreieck M, Wiesche M, Krcmar H (2016a) Predicting the Availability of Parking Spaces with Publicly Available Data, INFORMATIK 2016, Klagenfurt.

    Google Scholar 

  • Pflügler C, Schreieck M, Hernandez G, Wiesche M, Krcmar H (2016b) A concept for the architecture of an open platform for modular mobility services in the smart city. Transportation Research Procedia 19: S. 199-206.

    Google Scholar 

  • Pflügler C, Schreieck M, Wiesche M, Krcmar H (2017) Development and Evaluation of a Game Application for Parking Lot Identification, Intelligent Transport Systems in Theory and Practice mobil.TUM 2017, Munich, Germany.

    Google Scholar 

  • Schreieck M, Pflügler C, Setzke DS, Wiesche M, Krcmar H (2018) Improving Urban Transportation: an Open Platform for Digital Mobility Services. In: Linnhoff-Popien C, Schneider R, Zaddach M (Hrsg.) Digital Marketplaces Unleashed. Springer, S. 479-489.

    Google Scholar 

  • Schreieck M, Safetli H, Siddiqui SA, Pflügler C, Wiesche M, Krcmar H (2016a) A Matching Algorithm for Dynamic Ridesharing. Transportation Research Procedia 19: S. 272-285.

    Google Scholar 

  • Schreieck M, Wiesche M, Krcmar H (2016b) Modularization of digital services for urban transportation, Americas Conference on Information System, San Diego, USA.

    Google Scholar 

  • Schultes D (2008) Route Planning in Road Networks. Universität Karlsruhe, Karlsruhe.

    Google Scholar 

  • Schwabe G, Krcmar H (2000) Piloting Socio-Technical Innovation, European Conference on Information Systems (ECIS) 2000, Vienna, Austria.

    Google Scholar 

  • Tao C-C, Chen C-Y (2007) Heuristic Algorithms for the Dynamic Taxipooling Problem Based on Intelligent Transportation System Technologies. Fourth International Conference on Fuzzy Systems and Knowledge Discovery: S. 590-595.

    Google Scholar 

  • Tao CC, Chen CY (2008) Dynamic rideshare matching algorithms for the taxipooling service based on intelligent transportation system technologies. 14th International Conference on Management Science and Engineering: S. 399-404.

    Google Scholar 

  • Ying F, Yu F, Changjun J, Jiujun C (2008) Dynamic Ride Sharing Community Service on Traffic Information Grid, International Conference on Intelligent Computation Technology and Automation.

    Google Scholar 

  • Yunfei H, Xu L, Chunming Q (2012) TicTac: From transfer-incapable carpooling to transfer-allowed carpooling, Global Communications Conference (GLOBECOM), 2012 IEEE.

    Google Scholar 

  • Zhang F, Liu J (2009) An Algorithm of Shortest Path Based on Dijkstra for Huge Data, Sixth International Conference on Fuzzy Systems and Knowledge Discovery.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Wirtschaftsinformatik, Technische Universität München, Garching, Deutschland

    Maximilian Schreieck, Christoph Pflügler, Manuel Wiesche & Helmut Krcmar

Authors
  1. Maximilian Schreieck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Pflügler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manuel Wiesche
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Helmut Krcmar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maximilian Schreieck .

Editor information

Editors and Affiliations

  1. Lehrstuhl für Wirtschaftsinformatik I 17, Technische Univ München, Garching bei München, Germany

    Manuel Wiesche

  2. Germany, Berlin, Germany

    Petra Sauer

  3. Dresden, Dresden, Germany

    Jürgen Krimmling

  4. Garching, Garching, Germany

    Helmut Krcmar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Fachmedien Wiesbaden GmbH, ein Teil von Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Schreieck, M., Pflügler, C., Wiesche, M., Krcmar, H. (2018). Dynamische Planung von Fahrgemeinschaften. In: Wiesche, M., Sauer, P., Krimmling, J., Krcmar, H. (eds) Management digitaler Plattformen. Informationsmanagement und digitale Transformation. Springer Gabler, Wiesbaden. https://doi.org/10.1007/978-3-658-21214-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-658-21214-8_16

  • Published:

  • Publisher Name: Springer Gabler, Wiesbaden

  • Print ISBN: 978-3-658-21213-1

  • Online ISBN: 978-3-658-21214-8

  • eBook Packages: Business and Economics (German Language)

Publish with us

Policies and ethics

Search

Navigation