Junction interactions and monotonicity in traffic assignment
We consider the traffic equilibrium problem when the travel demand is inelastic and stationary in time. Junction interactions, which abound in urban road networks, are permitted. We prove that the set of equilibria (solutions to the assignment problem) is convex when certain monotonicity and continuity conditions are statisfied at each junction.
Volume (Year): 16 (1982)
Issue (Month): 1 (February)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:16:y:1982:i:1:p:1-3. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.