Kardi Teknomo
Kardi Teknomo Kardi Teknomo Kardi Teknomo

Visit Tutorials below:
Adaptive Learning from Histogram
Adjacency matrix
Analytic Hierarchy Process (AHP)
Analysis of Algorithm
ArcGIS tutorial
Arithmetic Mean
Aroon Oscillator
Bayes Theorem
Bootstrap Sampling
Bray Curtis Distance
Break Even Point
Chebyshev Distance
City Block Distance
Conditional Probability
Complex Number
Continued Fraction
Data Analysis from Questionnaire
Data Revival from Statistics
Decimal to Rational
Decision tree
Difference equations
Digital Root
Discriminant analysis
Eigen Value using Excel
Euclidean Distance
Euler Integration
Euler Number
Excel Iteration
Excel Macro
Excel Tutorial
Expectation Maximization (EM) Algorithm
Factorial Function
Feasibility Study
Financial Analysis
Financial Education
Gaussian Mixture Model
Generalized Inverse
Generalized Mean
Geometric Mean
Ginger Bread Man and Chaos
Graph Theory
Growth Model
Hamming Distance
Harmonic Mean
Hierarchical Clustering
Independent Events
Incident matrix
Jaccard Coefficient
Kernel basis function
Kernel Regression
k-Means clustering
K Nearest Neighbor
LAN Connections Switch
Learning from data
Lehmer Mean
Linear Algebra
Logarithm Rules
Mahalanobis Distance
Market Basket Analysis
Mean Absolute Deviation
Mean and Average
Mean, median, mode
Minkowski Distance
Minkowski Mean
Monte Carlo Simulation
Multi Agent System
Maximum Likelihood
Multicriteria decision making
Mutivariate Distance
Neural Network
Newton Raphson
Non-Linear Transformation
Normalization Index
Normalized Rank
Ordinary Differential Equation
Page Rank
Power rules
Prime Factor
Prime Number
Q Learning
Quadratic Function
Queueing Theory
Rank Reversal
Recursive Statistics
Regression Model
Reinforcement Learning
Root of Polynomial
Scenario Analysis
Sierpinski gasket
Sieve of Erastosthenes
Similarity and Distance
Solving System Equation
Standard deviation
String Distance
Summation Tricks
Support Vector Machines
System dynamic
Time Average
Tower of Hanoi
Vedic Square
Visual Basic (VB) tutorial
What If Analysis


Relationship between Generalized Origin Destination and Flow Matrix – A Tutorial

By Kardi Teknomo, PhD.

<| Next >

What is lacking from graph theory in general is the existence of moving agents. Moving agents create trajectories. Based on the ordinal graph trajectories that utilize the network, 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.  In summary, the relationship between network structure and network utilization can be simplified into simple algebraic equation of element wise product of the matrices and matrix addition:


Where the utilization matrices are
D = generalized origin-destination matrix
F= flow matrix
T= alternative route matrix
and the network structure is represented by
A= adjacency matrix.
When there is no alternative route, the formula is even shorter


In this tutorial, I give 2 numerical examples of the key concepts presented in our paper.

This tutorial is a companion of our paper in ATR (Teknomo, K. and Fernandez, P., A theoretical foundation for the relationship between generalized origin–destination matrix and flow matrix based on ordinal graph trajectories, Journal of Advance Transportation Research DOI: 10.1002/atr.1214). It is recommended to read the full paper from Wiley. Personal copy of the published paper is available upon request.

The topic of this tutorial is as follow:
                Relationship between Network Structure and Network Utilization
                Numerical Examples
                                Weaving Section
                                General Network Graph

Printer friendly version

Java Program Documentation (contribution of Michael F. Ybanez). The program is available for download.

Press release: Automatic Gathering Origin Destination Data

Share and save this tutorial
Add to: Del.icio.us  Add to: Digg  Add to: StumbleUpon   Add to: Reddit   Add to: Slashdot   Add to: Technorati   Add to: Netscape   Add to: Newsvine   Add to: Mr. Wong Add to: Webnews Add to: Folkd Add to: Yigg Add to: Linkarena Add to: Simpy Add to: Furl Add to: Yahoo Add to: Google Add to: Blinklist Add to: Blogmarks Add to: Diigo Add to: Blinkbits Add to: Ma.Gnolia Information


These tutorial is copyrighted.

Preferable reference for this tutorial is

Teknomo, Kardi. (2013) Relationship between Generalized Origin Destination and Flow Matrix – A Tutorial


© 2007 Kardi Teknomo. All Rights Reserved.
Designed by CNV Media