Single-to-many Dynamic Traffic Assignment for Container Freight on a Multimodal Network

This research presents a mathematical programming formulation for a Dynamic Traffic Assignment model and an implemented iterative shortest-path algorithm. Freight transport demand is assigned to a dynamic network of roads and waterways with the goal to minimize transportation costs. The challenge is to assign paths to a network with time-varying travel speeds and capacities, the assignment of limited capacities to different freight shipments and determining of travel and waiting times. Assigning on a multimodal and dynamic network lead to a non-classical shortest path problem.