The need for additional capacity in motorway networks during periods of high demand is unavoidable if congestion is to be prevented. Increasing capacity by building new roads is often infeasible, leaving operation-based traffic control measures as the primary approach to exploit the existing infrastructure. In this paper, the novel concept of dynamic lane configuration is introduced, which opens a new avenue in motorway traffic control that harnesses the infrastructure for traffic improvement. The lateral capacity of the existing motorway infrastructure is under-utilized due to lanes that are much wider than the vehicle's width. Dynamic lane configuration suggests that while current wide lanes ensure safety during high-speed driving, lower speed limits can be actively imposed during times of high traffic demand, allowing the lane width to be reduced, thanks to the reduced required lateral gap between vehicles at lower longitudinal speeds. By narrowing the lanes prior to congestion, it is possible to reclaim wasted space and add lanes to the road, leading to a dynamic capacity increase during the operation. This dynamic infrastructure layout with demand-responsive lane configuration during operation bridges the traffic management and infrastructure design. A model-based optimal control approach is developed to model the dynamic lane configuration and to define the times and locations of changing lane configuration. The proposed approach is tested in a simulation environment on two different motorway networks, each with a different configuration and demand profile. The promising results indicate the potential of the proposed approach in congestion mitigation and reducing travel time.

The growing popularity of mobility-on-demand fleets increases the importance to understand the impact of mobility-on-demand fleets on transportation networks and how to regulate them. For this purpose, transportation network simulations are required to contain corresponding routing methods. We study the trade-off between computational efficiency and routing accuracy of different approaches to routing fleets in a dynamic network simulation with endogenous edge travel times: a computationally cheap but less accurate Network Fundamental Diagram (NFD) based method and a more typical Dynamic Traffic Assignment (DTA) based method. The NFD-based approach models network dynamics with a network travel time factor that is determined by the current average network speed and scales free-flow travel times. We analyze the different computational costs of the approaches in a case study for 10,000 origin-destination (OD) pairs in a network of the city of Munich, Germany that reveals speedup factors in the range of 100. The trade-off for this is less accurate travel time estimations for individual OD pairs. Results indicate that the NFD-based approach overestimates the DTA-based travel times, especially when the network is congested. Adjusting the network travel time factor based on pre-processed DTA results, the NFD-based routing approach represents a computationally very efficient methodology that also captures traffic dynamics in an aggregated way.