Faster Frank-Wolfe Traffic Assignment with New Flow Update Scheme

Chen, Anthony; Jayakrishnan, R.; Tsai, W.K.

doi:10.1061/(asce)0733-947x(2002)128:1(31)

Cited by 29 publications

(15 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, it would be interesting to study the effect on convergence speed of performing the line search and network loading per ODpair ('one-at-a-time'), rather than line search across all OD-pairs before performing the network loading ('all-at-once'). In tests with other models, such a strategy was found to work well for the GP algorithm, especially when only a few OD-pairs require path flow updating (Chen and Jayakrishnan, 1998;Chen et al, 2002a). Alternatively, the self-regulated averaging method has also been successfully implemented in recent SUE applications Kitthamkesorn and Chen, 2014), and the effect of using this averaging method would also be an interesting future research direction.…”

Section: Discussion and Future Research Directionsmentioning

confidence: 99%

Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family

Rasmussen

Watling

Prato

et al. 2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

We propose a new class of path-based solution algorithms to solve the Restricted Stochastic User Equilibrium (RSUE), as introduced in Watling et al (2014). The class allows a flexible specification of how the choice sets are 'systematically' grown by considering congestion effects and how the flows are allocated among routes. The specification allows adapting traditional pathbased stochastic user equilibrium flow allocation methods (designed for pre-specified choice sets) to the generic solution algorithm. We also propose a cost transformation function and show that by using this we can, for certain Logit-type choice models, modify existing path-based Deterministic User Equilibrium solution methods to fit the RSUE solution algorithm. The transformation function also leads to a two-part relative gap measure for consistently monitoring convergence to a RSUE solution. Numerical tests are reported on two real-life cases, in which we explore convergence patterns and choice set composition and size, for alternative specifications of the RSUE solution algorithm.

show abstract

Section: Discussion and Future Research Directionsmentioning

confidence: 99%

Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family

Rasmussen

Watling

Prato

et al. 2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

show abstract

“…In this work, this simplified approach was used due to the universality of the problem and its simple mathematical handling. In addition, the simple and commonly used Frank-Wolfe algorithm was used to solve the optimisation problem (Jayakrishnan et al 1994;Chen et al 2002). However, this does not affect the applicability of the proposed method, as it can be applied independently of the problem.…”

Section: Initial Traffic Flow Assignmentmentioning

confidence: 99%

Estimation of traffic flow changes using networks in networks approaches

Hackl

Adey

2019

Appl Netw Sci

View full text Add to dashboard Cite

Understanding traffic flow in urban areas has great importance and implications from an economic, social and environmental point of view. For this reason, numerous disciplines are working on this topic. Although complex network theory made their appearance in transportation research through empirical measures, the relationships between dynamic traffic patterns and the underlying transportation network structures have scarcely been investigated so far. In this work, a novel Networks in Networks (NiN) approach is presented to study changes in traffic flows, caused by topological changes in the transportation network. The NiN structure is a special type of multi-layer network in which vertices are networks themselves. This embedded network structure makes it possible to encode multiple pieces of information such as topology, paths, and origin-destination information, within one consistent graph structure. Since each vertex is an independent network in itself, it is possible to implement multiple diffusion processes with different physical meanings. In this way, it is possible to estimate how the travellers' paths will change and to determine the cascading effect in the network. Using the Sioux Falls benchmark network and a real-world road network in Switzerland, it is shown that NiN models capture both topological and spatial-temporal patterns in a simple representation, resulting in a better traffic flow approximation than single-layer network models.

show abstract

“…However, there might exist more efficient algorithms for this purpose that might lead to a better performance of the entire group of path-based methods. Moreover, special implementation techniques might further improve the performance of some groups of algorithms or particular algorithms (for example, "thread following" used to update shortest paths [50], flow update schemes for FW [51], multi-threaded implementations [39], etc). Therefore, the comparison of groups of algorithms should be considered with care as it possibly depends on particular implementations.…”

Section: Difficulties Of Comparison Of Groups Of Algorithmsmentioning

confidence: 99%

A framework for and empirical study of algorithms for traffic assignment

Perederieieva

Ehrgott

Raith

et al. 2015

Computers & Operations Research

View full text Add to dashboard Cite

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 to evaluate such projects is traffic assignment (TA). The goal of TA is to predict the behaviour of road users for a given period of time (morning and evening peaks, for example). Once such a model is created, it can be used to analyse the usage of a road network and to predict the impact of implementing a potential project. The most commonly used TA model is known as user equilibrium, which is based on the assumption that all drivers minimise their travel time or generalised cost. In this study, we consider the static deterministic user equilibrium TA model.The constant growth of road networks and the need of highly precise solutions (required for select link analysis, network design, etc) motivate researchers to propose numerous methods to solve this problem. Our study aims to provide a recommendation on what methods are more suitable depending on available computational resources, time and requirements on the solution. In order to achieve this goal, we implement a flexible software framework that maximises usage of common code and, hence, ensures comparison of algorithms on common ground. In order to identify similarities and differences of the methods, we analyse groups of algorithms that are based on common principles. In addition, we implement and compare several different methods for solving sub-problems and discuss issues related to accumulated numerical errors that might occur when highly accurate solutions are required.

show abstract

Faster Frank-Wolfe Traffic Assignment with New Flow Update Scheme

Cited by 29 publications

References 12 publications

Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family

Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family

Estimation of traffic flow changes using networks in networks approaches

A framework for and empirical study of algorithms for traffic assignment

Contact Info

Product

Resources

About