no code implementations • 10 Aug 2023 • Fynn Wolf, Roman Engelhardt, Yunfei Zhang, Florian Dandl, Klaus Bogenberger
As travel times in real street networks are dynamic and stochastic, assigned routes considered feasible by the control algorithm in one time step might become infeasible in the next.
no code implementations • 10 Aug 2023 • Roman Engelhardt, Hani S. Mahmassani, Klaus Bogenberger
This imbalance would lead to low fleet utilization and high customer waiting times.
no code implementations • 29 Jul 2023 • Max T. M. Ng, Hani S. Mahmassani, Ömer Verbas, Taner Cokyasar, Roman Engelhardt
This study addresses a large-scale multimodal transit network design problem, with Shared Autonomous Mobility Services (SAMS) as both transit feeders and an origin-to-destination mode.
no code implementations • 13 Oct 2022 • Roman Engelhardt, Florian Dandl, Klaus Bogenberger
That the graph-based batch optimization is superior to a basic insertion method in terms of solution quality and run-time.
no code implementations • 3 Apr 2021 • Florian Dandl, Roman Engelhardt, Klaus Bogenberger
Under certain assumptions, which are reasonable for an attractive MoD business model, it can be shown that an operator using dynamic state optimization can communicate a rejection to users after the first iteration, thereby eliminating unnecessary waiting time before these users would leave the system.