 |
|
|
|
|
|
||||||||||||
|
|||||||||||||||||
 |
 |
|
|
||||||||||||||
 |
 |
 |
|
|
|||||||||||||
 |
|
||||||||||||||||
| Trajectory Research (Multi-Agent System) Relationship between Generalized Origin Destination and Flow Matrix What is lacking from graph theory in general is the existence of moving agents. Moving agents create trajectories. I have related the structure of a graph (e.g. adjacency matrix or path distance matrix) with the utilization of the graph (e.g. flow matrix or origin-destination matrix) by the agents.
Ideal Flow is a steady state relative flow distribution in a strongly connected network where the flows are conserved. Check new traffic assignment method based on ideal flow, network efficiency and more...
Sink Propagation Value (SPV) is a fast propagation method that turns a network graph into a tree rooted at one sink node, to give immediate estimates of how far each node is from that root. This is useful to transform global optimal information into local decision rule to reach the global optima. Every link can be evaluated as the direct cost of moving plus the continuation cost toward the sink.
|
|||||||||||||
|
||||||||||||||
|
||||||||||||||