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
Emergency Logistics
Can commercial logistics' ideas and solutions work in humanitarian supply chains? No. Why? Well, per[...]
Biting the hand that feeds. All firms are snakes.
'All firms are snakes'. So says Paul D. Cousins in A conceptual model for managing long-term inter-o[...]
BOOKS and BOOK CHAPTERS
Book Review: Operations Rules
Operations Rules by David Simchi-Levi comes with an ambiguous title. You can read this two ways: 1) [...]
ISCRiM 2010 Proceedings
Two weeks ago I attended the ISCRiM 2010 seminar at Loughborough University, a gathering of some of [...]
REPORTS and WHITEPAPERS
A risky business? The top 10 challenges of offshoring
Organisations embarking on offshoring face multiple challenges; many of which can be extremely daunt[...]
The UK Transport Network Resilience...and I
UK Transport Network Resilience
For a budding and even for a seasoned researcher, nothing is more rewarding than to have one's publi[...]