Abstract Three network design problems are formulated for optimizing discrete additions to link capacities. Trip distribution and assignment are functions of travel expenditure in each problem. A reformulation of Wilson's doubly-constrained trip distribution problem, in which entropy instead of total travel expenditure is constrained, provides zone-to-zone flows in each problem. Entropy is interpreted as a measure of zone-to-zone trip-making interaction. Computational results for a toy network are reported.
A discrete transportation network design problem with combined trip distribution and assignment
Transportation Research Part B: Methodological ; 14 , 1-2 ; 147-154
01.01.1980
8 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A combined trip distribution modal split and trip assignment model
Elsevier | 1977
|A Combined Trip Generation, Trip Distribution, Modal Split and Traffic Assignment Model
DSpace@MIT | 1982
|Traffic assignment and trip distribution
Elsevier | 1989
Combined Model for Time-Dependent Trip Distribution and Traffic Assignment
Online Contents | 2002
|