The user equilibrium traffic assignment principle is very important in the traffic assignment
problem. Mathematical programming models are designed to solve the user equilibrium …

We present versions of the Frank-Wolfe method for linearly constrained convex programs, in
which consecutive search directions are made conjugate. Preliminary computational studies …

Traffic congestion is an issue in most cities worldwide. Transportation engineers and urban
planners develop various traffic management projects in order to solve this issue. One way …

Finding an equilibrium state of the traffic assignment plays a significant role in the design of
transportation networks. We adapt the path finding mathematical model of slime mold …

We present improvements of the Frank–Wolfe (FW) method for static vehicular traffic and
telecom routing. The FW method has been the dominating method for these problem types …

This research paper introduces a novel framework for assessing the resilience of urban
transport networks. Traditional approaches to quantify resilience primarily focus on …

In this paper we study numerical stability of path-based algorithms for the traffic assignment
problem. These algorithms are based on decomposition of the original problem into smaller …

Modelling traffic consists roughly of four steps, this is known as the 'four-step model'. The first
step is 'trip generation'. It determines the frequency of trips that are going in and out of zones …

In recent papers, eg [1, 2, 3], CFW, Conjugate Frank-Wolfe Methods, have shown to be
competitive with other state of the art algorithms for Traffic Assignment, in particular when …

In spite of the fact that most traffic phenomena are temporal, the network route choice
models most commonly used in transportation planning are steady state models (eg Florian …