The Non-Stop Disjoint Trajectories Problem

Given an undirected network with traversal times on its edges and connection requests from sources to destinations for commodities with release dates. The non-stop disjoint trajectories problem is to find trajectories that fulfill all requests, such that the commodities never meet. In this extension to the \NP-complete disjoint paths problem, trajectories must satisfy a non-stop … Read more

Mathematical Optimization and Machine Learning for Efficient Urban Traffic

Traffic jams cause economical damage which has been estimated between 10 and 100 billion Euros per year in Germany, also due to inefficient urban traffic. It is currently open how the situation will change with upcoming technological advances in autonomous and electric mobility. On the one hand, autonomous cars may lead to an increased number … Read more