This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: (by using the smallest capacity rule) Documentation The results for Model 2.0 shows that path 1-2-6-9-11 can handle 300 cars per hour. while path 1-3-7-10-11 can handle up to 800 cars traveling along its path per hour, this is due to a larger capacity (flow) along its path. On the other hand path 1-4-7-10-11 has a flow of zero, therfore it was ignored in the model. And path 1-5-8-10-11 flow was 200 cars per hour, making the total cars that can travel between Internation Drive and Disney World 1300 cars per hour...
View Full Document
- Three '10
- Economics, Flow network, Disney World, Maximum flow problem, Max-flow min-cut theorem, smallest capacity