A transport network consists of a graph and a family of functions associated to each arc that measure the travel time on the arc. For some pairs of nodes there is a demand of vehicles that want to go from the first node to the second one.
Under the assumption that the flow will be distributed according the Wardrop criterium, the toolbox provides a variety of algorithms to compute such flow.
In the following example we can see the well known Siouf Falls network (dessigned for academic purposes) with the flow obtained after the assignment. The width of the arcs is proportional to the assigned flow. The arcs in magenta represent the origin-destination pairs.
|
January 2003.