Traditional models of traffic assignment usually assume that flow is distributed along paths of the underlying network. In this presentation, we argue that several models can be enhanced by considering that the physical path travelled by a given user
|
441
|
Principles of Artificial Intelligence
– NILSSON
- 1980
|
|
232
|
H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae
– Dowling, Gallier
- 1984
|
|
168
|
Algorithm 97 (shortest path
– Floyd
- 1962
|
|
152
|
Some theoretical aspects of road traffic research
– Wardrop
- 1952
|
|
75
|
The Traffic Assignment Problem, Models and Methods
– Patriksson
- 1994
|
|
60
|
Algorithms for testing the satisfiability of propositional formulae
– GALLO, URBANI
- 1989
|
|
56
|
Directed hypergraphs and applications
– Gallo, Longo, et al.
- 1993
|
|
37
|
Shortest path methods: a unifying approach
– Gallo, Pallottino
- 1986
|
|
25
|
Additive and/or graphs
– Martelli, Montanari
- 1973
|
|
23
|
Minimal representation of directed hypergraphs
– Ausiello, D'Atri, et al.
- 1986
|
|
19
|
Equilibrium traffic assignment for large scale transit networks
– Nguyen, Pallottino
- 1988
|
|
17
|
A Probabilistic Multipath Traffic Assignment Algorithm Which Obviates Path Enumeration.” Transportation Research 5
– Dial
- 1971
|
|
16
|
Bounding flows in traffic assignment models
– Hearn
- 1980
|
|
15
|
Graph algorithms for functional dependency manipulation
– Ausiello, D'Atri, et al.
- 1983
|
|
12
|
Dynamic maintenance of directed hypergraphs
– Ausiello, Nanni, et al.
- 1990
|
|
12
|
S.Pallottino, Hyperpaths and shortest hyperpaths
– Nguyen
- 1989
|
|
12
|
Optimal Strategies: A New Assignment Model for Transit Networks
– Speiss, Florian
- 1989
|
|
10
|
A dual simplex algorithm for finding all shortest paths
– Florian, Nguyen, et al.
- 1981
|
|
9
|
Generalized and-or graphs
– Levi, Sirovich
- 1976
|
|
8
|
Dynamic programming as graph searching: An algebraic approach
– GNESI, MONTANARI, et al.
- 1981
|
|
5
|
Queue spillovers in transportation networks with a route choice
– Daganzo
- 1998
|
|
5
|
A new algorithm to find the shortest paths between all pairs of nodes
– Gallo, Pallottino
- 1982
|
|
5
|
Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks. Transportation Science 32(1
– Nguyen, Pallottino, et al.
- 1998
|
|
4
|
Strongly equivalent directed hypergraphs
– Ausiello, D'Atri, et al.
- 1985
|
|
4
|
Minimum covers in the relational data base model
– Maier
- 1980
|
|
4
|
On some path problems on oriented hypergraphs
– Nguyen, Pretolani, et al.
- 1998
|
|
3
|
Passenger waiting strategies for overlapping bus routes
– Marguier, Ceder
- 1984
|
|
2
|
Directed recursive label node hypergraphs: a new representation language
– Boley
- 1977
|
|
2
|
An equilibrium- point model for passenger assignment in congested transit networks
– Bouzaene-Ayari, Gendreau, et al.
- 1995
|
|
2
|
A computational study of shortest hyperpath algorithms
– Nguyen, Pretolani
- 1995
|
|
2
|
Monotone Variational Inequality Problem Study and its Application to Transportation Network Equilibrium Problem
– Wu
- 1991
|
|
2
|
A simplicial decomposition method for the transit equilibrium assignment problem
– Wu, Florian
- 1993
|
|
1
|
Hypergraphs: Combinatorics Of Finite Sets
– FORMULATIONS
- 1989
|
|
1
|
Une 'etude approfondie d'un mod`ele d"equilibre pour l'affectation des passagers dans les r'eseaux de transport en commun. PhD dissertation, Universit'e de Montr'eal, D'epartement d'informatique et de recherche op'erationnelle
– Gendreau
- 1984
|
|
1
|
Public Transportation Planning -- A Mathematical Programming Approach
– Hasseltrom
- 1981
|
|
1
|
MAESTRO: Uno strumento per la pianificasione del trasporto publico. Ricerca Operativa
– Inaudi, Morello
- 1986
|
|
1
|
Gainfree Leontiev substitution problems
– Jeroslow, Martin, et al.
- 1992
|
|
1
|
A public transport assignment method. Traffic Engineering and Control
– Leclercq
- 1972
|
|
