MFworks Tutorial – 16 Shortest Path II

Creating proximity surfaces for path(s) in time interval 2 and adding these together yield the shortest path(s) through time interval 2.

SpreadFromCutoff1_Time2 = Spread Cutoff_Point1
To 600
In costoftravel_time2
Outof direction
;

SpreadFromCutoff2_Time2 = Spread Cutoff_Point2
To 600
In costoftravel_time2
Outof direction
;

SpreadFromCutoff3_Time2 = Spread Cutoff_Point3
To 600
In costoftravel_time2
Outof direction
;

SpreadFromCutoff4_Time2 = Spread Cutoff_Point4
To 600
In costoftravel_time2
Outof direction
;

SpreadFromStop_Time2 = Spread stopTo 600
In costoftravel_time2
Outof direction
;

ShortestPath1_InNetwork_time2 =
SpreadFromCutoff1_Time2 + SpreadFromStop_Time2
;

ShortestPath2_InNetwork_time2
= SpreadFromCutoff2_Time2 + SpreadFromStop_Time2
;

ShortestPath3_InNetwork_time2 =
SpreadFromCutoff3_Time2 + SpreadFromStop_Time2
;

ShortestPath4_InNetwork_time2 = SpreadFromCutoff4_Time2 + SpreadFromStop_Time2
;

The shortest path is delineated by the cells with the lowest value(s). The value is the actual cost of using this path. Using the Legend function this path can be derived by changing the color of the cells with the lowest value until a continuous path from origin to detination can be seen.

Here, path 4 is the sought path.

The total cost for the path is 170 + 85 = 235. (Cutoff in time interval 1 plus the cell valuefor the path in time interval 2)

MFworks – step by step

•  01 MFworks

• 02 Network Modelling

•  03 Incremental Linkage

• 04 Directional Identifier

• 05 Cost surface

• 06 Travel cost – path length

•  07 Dynamic Cost Surface

•  08 Artefacts

• 09 Map Layers Needed

•  10 Deriving Linkage

• 11 Deriving Directions

• 12 Deriving the Shortest Path

• 13 Viewing the Shortest Path

• 14 Dynamic Networks

• 15 Shortest Path I

• 16 Shortest Path II

• 17 Shortest Path I+II