Fundamentals of Transportation/Route Choice/Problem: Difference between revisions
Jump to navigation
Jump to search
imported>Pi zero {{BOOKCATEGORY}} |
(No difference)
|
Latest revision as of 00:22, 9 September 2017

Given a flow of six (6) units from origin “o” to destination “r”. Flow on each route ab is designated with Qab in the Time Function. Apply Wardrop's Network Equilibrium Principle (Users Equalize Travel Times on all used routes)
A. What is the flow and travel time on each link? (complete the table below) for Network A
| Link | Link Performance Function | Flow | Time |
|---|---|---|---|
| o-p | |||
| p-r | |||
| o-q | |||
| q-r |
B. What is the system optimal assignment?
C. What is the Price of Anarchy?
[[Template:BOOKCATEGORY/Problems]]