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
;

…

Read more

Now, the shortest path(s) can be extracted as follows:

ShortestPath_time2 = Recode ShortestPath4_InNetwork_time2
Assigning 999 To 83…85
;

For time interval 1, first add proximity surfaces, then extract path.
SpreadFromCutoff4_time1 = Spread Cutoff_Point4
To 600
In costoftravel_time1
Outof direction
;

ShortestPath_InNetwork_time1 = SpreadFromStart_Time1
+ SpreadFromCutoff4_time1
;

ShortestPath_time1 = Recode ShortestPath_InNetwork_time1
Assigning 999 To 169…171;

The extracted paths can now be joined and overlayed over the study area map for visualization.

ShortestPath_time = Cover ShortestPath_time1 With ShortestPath_time2
;

ShortestPath_OverMap_time = Cover BrownsPond With ShortestPath_time
;

…

Read more