Homework 4
.pdf
School
Rutgers University, Newark**We aren't endorsed by this school
Course
PRODUCT &O 4
Subject
Geography
Date
Dec 17, 2024
Pages
7
Uploaded by Mlaudia
Problem 1 Solution: Shortest Routes from Inglewood Warehouse Step-by-Step Analysis Permanent SetBranchTime{1}1-21-51-61-725485032{1, 2}1-51-61-72-32-44850326043{1, 2, 7}1-51-62-32-47-87-9485060437261{1, 2, 5, 7}1-62-32-45-850604375
5-107-87-9727261{1, 2, 4, 5, 7}1-62-34-65-85-107-87-950606875727261{1, 2, 4, 5, 6, 7}{1, 2, 3, 4, 5, 6, 7}2-35-85-106-76-97-87-95-85-106-97-87-9607572958672617572867261
{1, 2, 3, 4, 5, 6, 7, 9}5-85-107-8757272Summary of Shortest Routes From Inglewood (Node 1)ToRouteTime (minutes)Westwood (Node 2)1-225San Fernando Valley (Node3)1-2-360Burbank (Node 4)1-2-443Long Beach (Node 5)1-548Pasadena (Node 6)1-650Downey (Node 7)1-732Anaheim (Node 8)1-5-872Pomona (Node 9)1-7-961Huntington Beach (Node10)1-5-1072Total Time: 463 minutes
Problem 2 Solution: Minimal Spanning Tree Area 1 to Area 3: 4.1Area 1 to Area 4: 4.8Area 3 to Area 2: 3.6Area 4 to Area 8: 5.5Area 8 to Area 7: 2.7Area 5 to Area 6: 2.1Area 6 to Area 7: 2.8Area 7 to Area 9: 2.7Area 9 to Area 10: 4.6Total Distance: 32.9 thousand feet
Problem 3 Solution: Maximum Flow of Cars Path 1:•1 → 2 → 5 → 7 → 12 → 15oNodes:1 → 2 → 5 → 7 → 12 → 15oFlow Amount:12 thousand carsPath 2:•1 → 2 → 6 → 7 → 12 → 15oNodes:1 → 2 → 6 → 7 → 12 → 15oFlow Amount:4 thousand carsPath 3:•1 → 3 → 9 → 10 → 13 → 14 → 15oNodes:1 → 3 → 9 → 10 → 13 → 14 → 15oFlow Amount:4 thousand carsPath 4:•1 → 3 → 9 → 11 → 12 → 15oNodes:1 → 3 → 9 → 11 → 12 → 15oFlow Amount:2 thousand carsPath 5:•1 → 3 → 4 → 8 → 14 → 15oNodes:1 → 3 → 4 → 8 → 14 → 15oFlow Amount:12 thousand carsPath 6:•1 → 3 → 4 → 10 → 13 → 14 → 15oNodes:1 → 3 → 4 → 10 → 13 → 14 → 15oFlow Amount:4 thousand cars
flows for all road segments:•1–2 = 16•3–4 = 16•2–5 = 12•4–10 = 4•5–7 = 12•9–10 = 4•2–6 = 12•10–13 = 8•6–7 = 4•13–14 = 4•7–12 = 16•4–8 = 12•12–15 = 22•8–14 = 12•1–3 = 22•14–15 = 16•3–9 = 6•9–11 = 2•11–12 = 2•13–12 = 4
Total traffic = 38,000 cars.