MFworks Tutorial – 14 Dynamic Networks

The procedure is similar to finding the shortest path through a network with no time-dependent travel cost.

First calculate the path(s) from origin to the cutoff-point(s), where the new time interval starts. In other words spread until the available time in time interval 1, depending on your starting time, has been used up. From the cutoff-point(s) in time interval 1, calculate the shortest path(s) to the destination through time interval 2. The path with the lowest value is the sought path. Join the paths.
The cell value at the cutoff-point for time interval 1added to the cell values of the shortest path in time interval 2 is the total cost for the joined path.

If using 3 time intervals, repeat the procedure for time interval 1 in time interval 2. If using 4 time intervals, repeat the procedure for time interval 2 in time interval 3, and so forth.
See the theory behind it.

Map layers needed:



network.mfm
costoftravel_time1.mfm
costoftravel_time2.mfm
start.mfm
stop.mfm

MFworks – step by step

Posted in mfworks
Tags: ,

ARTICLES and PAPERS
Community resilience in times of disaster
Can public-private partnerships improve community resilience? This question is posed in Leveraging p[...]
SCRIM is the new SCRM
Does supply chain risk management SCRM need another model? Perhaps. That's what a group of academics[...]
BOOKS and BOOK CHAPTERS
Risk Management in Global Supply Chain Networks
Supply Chain Risks can be classified as either one of these three, Deviation, Disruption or Disaster[...]
Book Review: Logistics Management and Strategy
Logistics Management and Strategy by Alan Harrison and Remko van Hoek does come at very hefty price,[...]
REPORTS and WHITEPAPERS
America’s Crumbling Infrastructure
My daily morning routine includes a cup of coffee while watching the World Business Report on BBC Wo[...]
Highway Vulnerability and Criticality Assessment
Transportation vulnerability and resilience have been the focus of this blog for the past two days, [...]