Most multipath assignment techniques are generated based on either path enumeration or path diversion. Path enumeration models primarily reiterate the assignment procedure with variable link impedance inputs. Burrell's algorithm is a typical path enumeration model in which the link impedances are assumed to be randomly distributed to account for errors in the driver's perception in link travel time. Path diversion models assign trips to alternate paths without repeating the assignment procedure. The most noted path diversion model is Dial's algorithm. Dial's technique originated from logit discrete choice theory in that each 'reasonable' path between a particular O-D pair is assigned a portion of the trips according to a route-choice probability. The literature review indicates that these multiple path algorithms can be incorporated into the capacity-restraint process, either iterative or incrementa.
Multipath Traffic Assignment: A Review of the Literature
1990
149 pages
Report
No indication
English
Multipath traffic assignment with dynamic input flows
Elsevier | 1973
|On the probabilistic origin of dial's multipath traffic assignment model
Elsevier | 1976
|Slope-Based Multipath Flow Update Algorithm for Static User Equilibrium Traffic Assignment Problem
Transportation Research Record | 2010
|Slope-Based Multipath Flow Update Algorithm for Static User Equilibrium Traffic Assignment Problem
Online Contents | 2010
|