Jakob Erdmann

Jakob Erdmann

Auto-generated profile, based on publicly available information

Jakob Erdmann

German Aerospace Center

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 March 2015
Verified
Book Chapter
Closed access
PDF file
JEJakob Erdmann
Jakob Erdmann

14 September 2023 in Transportmetrica A: Transport Science
Verified
Journal Article
Closed access
BMBehzad Bamdad Mehrabani
Behzad Bamdad Mehrabani
JEJakob Erdmann
Jakob Erdmann
LSLuca Sgambi
Luca Sgambi
SSSeyedehsan Seyedabrishami
Seyedehsan Seyedabrishami
MSMaaike Snelder
Maaike Snelder

29 September 2022 in SUMO Conference Proceedings
Verified
Journal Article
Open access
PDF file
BMBehzad Bamdad Mehrabani
Behzad Bamdad Mehrabani
JEJakob Erdmann
Jakob Erdmann
LSLuca Sgambi
Luca Sgambi
MSMaaike Snelder
Maaike Snelder
User equilibrium (UE) and system optimal (SO) are among the essential principles for solving the traffic assignment problem. Many studies have been performed on solving the UE and SO traffic assignment problem; however, the majority of them are either static (which can lead to inaccurate predictions due to long aggregation intervals) or analytical (which is computationally expensive for large-scale networks). Besides, most of the well-known micro/meso traffic simulators, do not provide a SO solution of the traffic assignment problem. To this end, this study proposes a new simulation-based dynamic system optimal (SB-DSO) traffic assignment algorithm for the SUMO simulator, which can be applied on large-scale networks. A new swapping/convergence algorithm, which is based on the logit route choice model, is presented in this study. This swapping algorithm is compared with the Method of Successive Average (MSA) which is very common in the literature. Also, a surrogate model of marginal travel time was implemented in the proposed algorithm, which was tested on real and abstract road networks (both on micro and meso scales). The results indicate that the proposed swapping algorithm has better performance than the classical swapping algorithms (e.g. MSA). Furthermore, a comparison was made between the proposed SB-DSO and the current simulation-based dynamic user equilibrium (SB-DUE) traffic assignment algorithm in SUMO. This proposed algorithm helps researchers to better understand the impacts of vehicles that may follow SO routines in future (e.g., Connected and Autonomous Vehicles (CAVs)).

1 December 2018
Verified
Conference Paper
Closed access
LCLara Codeca
Lara Codeca
JEJakob Erdmann
Jakob Erdmann
JHJérôme Härri
Jérôme Härri
We collectively decided that investing in smart cities, and consequently smart mobility, is the appropriate direction to solve traffic congestion and sustainable growth issues. Among the problems linked to traffic congestion, we find the complexity of efficient multi-modal commuting and the eventual search of a parking spot. Ideally, mobility should be a transparent service for the users and the quest to find parking should not exist in the first place. In order to achieve this goal, we need to study large-scale parking management optimizations. Recently we reached the computational power to simulate and optimize large-scale cities, but problems such as the complexity of the models, the availability of a reliable source of data, and flexible simulation frameworks are still a reality. We present the general-purpose Python Parking Monitoring Library (PyPML) and the mobility simulation framework. We discuss the implementation details, focusing on multi-modal mobility capabilities. We present multiple use-cases to showcase features and highlight why we need large-scale simulations. Finally, we evaluate PyPML performances, and we discuss its evolution.

7 November 2014
Verified
Book Chapter
Closed access
PDF file
JEJakob Erdmann
Jakob Erdmann
DKDaniel Krajzewicz
Daniel Krajzewicz

25 June 2018 in EPiC Series in Engineering
Verified
Conference Paper
Open access
MBMichael Behrisch
Michael Behrisch
JEJakob Erdmann
Jakob Erdmann
We present an algorithm which calculates a list of routes in a street network, approximating the flows given on the streets by traffic counts. We prove optimality with respect to maximizing the flows treating the counts as constraints and show that the algorithm can cope very well with missing data using a real motorway example.