AbstractRecently introduced optimization formulations of the asymmetric traffic assignment problem are developed. The duality of two formulations is shown, and conditions for convexity and differentiability of the objective functions are given. Convexity conditions are also given for the family of formulations recently introduced by Smith (1983). When the travel cost vector is affine and monotone, all of the formulations are shown to be convex programming problems. Algorithmic implications of the results are discussed.
Convex programming formulations of the asymmetric traffic assignment problem
Transportation Research Part B: Methodological ; 18 , 4-5 ; 357-365
1983-11-15
9 pages
Article (Journal)
Electronic Resource
English
Simplical decomposition of the asymmetric traffic assignment problem
Elsevier | 1983
|9 HYPERPATH FORMULATIONS OF TRAFFIC ASSIGNMENT PROBLEMS
British Library Conference Proceedings | 1998
|Stochastic and deterministic formulations of dynamic traffic assignment
British Library Conference Proceedings | 1997
|Convex formulations of air traffic flow optimization problems
Tema Archive | 2008
|