A comment on some test networks for the traffic assignment problem
(English)Manuscript (preprint) (Other academic)
We show that many published test problems for traffic assignment algorithms have peculiarities. First and foremost, several of them have incorrectly specified attributes, such as the number of nodes. In other test-problems, the network contains subnetworks with constant travel times; subnetworks which to a large extent can be reduced or eliminated. In further test problems, the constant travel time subnetworks imply that the solution has nonunique arc flows.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-85563OAI: oai:DiVA.org:liu-85563DiVA: diva2:571692