The Traffic Assignment Problem: Models and Methods
By Michael Patriksson. 2015
625 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/02cfa4c05fc0d548de42105c9b686b90e50a0a7e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
Citations in the corpus
- Boundedly Rational User Equilibria (BRUE): Mathematical Formulation and Solution Sets (2013, methodology): “…set when ε = 0: provided the topology of a network and the link cost functions,PUE can be determined by some established algorithms, e.g., column generation algorithm (Patriksson, 1994), gradient projection algorithm (Jayakrishnan et al., 1994b), or maximum entropy algorithm (Bell and Iida, 1997).”
- A Survey of Optimization Methods From a Machine Learning Perspective (2019, unknown): “Such a direction is not the best downward direction so that the FrankWolfe algorithm can be improved and extended in terms of the selection of the descending directions [108], [109], [110].”
- Selfish Routing in Capacitated Networks (2004, unknown): “…the most frequently used functions are polynomials whose degrees and coefficients are determined from real-world data through statistical methods (Patriksson 1994, p. 70).2 Branston (1976) and Larsson and Patriksson (1995) argue that functions of that kind are unrealistic in the sense that the…”