Multipath Traffic Assignment: A Review of the Literature
-
1990-09-01
Details
-
Creators:
-
Corporate Creators:
-
Corporate Contributors:
-
Subject/TRT Terms:
-
Publication/ Report Number:
-
Resource Type:
-
Geographical Coverage:
-
Edition:Interim Report
-
Corporate Publisher:
-
Abstract: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 incremental. Burrell's algorithm can be implemented either in a single-pass procedure or with the capacity-restraint procedure. Paths are enumerated by repeating simulations of link impedances for each origin zone (or a number of origin zones) in a single-pass procedure; paths are enumerated by repeating simulations of link impedances for each assignment stage when combined with the capacity-restraint procedure. In theory, Dial's algorithm can be implemented with the capacity-restraint procedure although his algorithm is a single-pass procedure.
-
Format:
-
Funding:
-
Collection(s):
-
Main Document Checksum:urn:sha-512:cb20c12f35aaf4c828a61fa1ce1cd1c968d54a7ea7b094764ce0eb8e8db3db35c9d85333c6b0ac2c7d7fce46e87a554e79f7d163a47a50aa7ae4b211d2b80bba
-
Download URL:
-
File Type: