ReasoningAbility.com

Transportation Schedule - Absolute-Beginner Level: core concept mastery Transportation Schedule ABSOLUTE BEGINNER

This skill primer 🌟 worksheet focuses on Transportation Schedule - a key topic in Scheduling. You'll solve 20 absolute-beginner-level problems (Worksheet 1 of 10). The primary focus is on core concept mastery. Master transportation schedule problems, transportation schedule reasoning questions, and transportation schedule practice through systematic practice.

📝 Worksheet 1 of 10 • 20 questions • ⏱️ Estimated time: 20 minutes • 🎯 Absolute Beginner level

What you'll learn in this worksheet:
Your progress through Transportation Schedule
Worksheet 1 of 10 (0% complete)

Question 1

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 10:00, Arrives 12:00 PM - T2: City A to City C, Departs 08:00, Arrives 10:02 AM - T3: City B to City D, Departs 10:30, Arrives 12:41 PM - T4: City B to City C, Departs 15:00, Arrives 4:43 PM - T5: City C to City D, Departs 13:00, Arrives 2:30 PM - T6: City C to City B, Departs 15:00, Arrives 5:20 PM - T7: City E to City D, Departs 15:30, Arrives 5:57 PM - T8: City E to City B, Departs 15:00, Arrives 5:59 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (08:00 - 10:02 AM)
- Connection time: 178 minutes
- T5: City C to City D (13:00 - 2:30 PM)

Earliest arrival: 2:30 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 2

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 08:30, Arrives 11:12 AM - T2: City A to City C, Departs 08:30, Arrives 11:28 AM - T3: City B to City E, Departs 14:00, Arrives 3:54 PM - T4: City B to City C, Departs 12:30, Arrives 2:46 PM - T5: City C to City E, Departs 10:30, Arrives 12:48 PM - T6: City C to City B, Departs 11:30, Arrives 1:58 PM - T7: City D to City E, Departs 15:00, Arrives 4:54 PM - T8: City D to City B, Departs 10:30, Arrives 12:32 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (08:30 - 11:12 AM)
- Connection time: 168 minutes
- T3: City B to City E (14:00 - 3:54 PM)

Earliest arrival: 3:54 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 3

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 08:30, Arrives 10:34 AM - T2: City A to City C, Departs 07:30, Arrives 9:33 AM - T3: City B to City E, Departs 16:00, Arrives 6:21 PM - T4: City B to City C, Departs 13:30, Arrives 3:16 PM - T5: City C to City E, Departs 13:30, Arrives 4:11 PM - T6: City C to City B, Departs 14:30, Arrives 4:36 PM - T7: City D to City E, Departs 14:30, Arrives 4:04 PM - T8: City D to City B, Departs 10:00, Arrives 12:16 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (07:30 - 9:33 AM)
- Connection time: 237 minutes
- T5: City C to City E (13:30 - 4:11 PM)

Earliest arrival: 4:11 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 4

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 06:30, Arrives 8:37 AM - T2: City A to City C, Departs 07:00, Arrives 9:34 AM - T3: City B to City D, Departs 16:30, Arrives 6:00 PM - T4: City B to City C, Departs 16:00, Arrives 6:29 PM - T5: City C to City D, Departs 15:30, Arrives 6:01 PM - T6: City C to City B, Departs 16:00, Arrives 5:37 PM - T7: City E to City D, Departs 11:30, Arrives 1:01 PM - T8: City E to City B, Departs 12:30, Arrives 3:22 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (06:30 - 8:37 AM)
- Connection time: 473 minutes
- T3: City B to City D (16:30 - 6:00 PM)

Earliest arrival: 6:00 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 5

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 06:00, Arrives 8:00 AM - T2: City A to City C, Departs 06:00, Arrives 9:59 AM - T3: City B to City D, Departs 10:00, Arrives 12:16 PM - T4: City B to City C, Departs 11:30, Arrives 1:13 PM - T5: City C to City D, Departs 12:30, Arrives 2:14 PM - T6: City C to City B, Departs 12:30, Arrives 3:28 PM - T7: City E to City D, Departs 14:00, Arrives 4:06 PM - T8: City E to City B, Departs 15:30, Arrives 5:33 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (06:00 - 8:00 AM)
- Connection time: 120 minutes
- T3: City B to City D (10:00 - 12:16 PM)

Earliest arrival: 12:16 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 6

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 08:00, Arrives 11:55 AM - T2: City A to City C, Departs 09:30, Arrives 1:12 PM - T3: City B to City D, Departs 11:00, Arrives 1:04 PM - T4: City B to City C, Departs 10:00, Arrives 11:53 AM - T5: City C to City D, Departs 13:00, Arrives 3:16 PM - T6: City C to City B, Departs 12:30, Arrives 3:15 PM - T7: City E to City D, Departs 12:30, Arrives 3:08 PM - T8: City E to City B, Departs 10:00, Arrives 12:28 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

No feasible route found with 45 min connection requirement.

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 7

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 08:30, Arrives 11:28 AM - T2: City A to City C, Departs 06:30, Arrives 10:13 AM - T3: City B to City E, Departs 15:30, Arrives 5:30 PM - T4: City B to City C, Departs 12:30, Arrives 2:01 PM - T5: City C to City E, Departs 15:00, Arrives 4:43 PM - T6: City C to City B, Departs 11:00, Arrives 12:52 PM - T7: City D to City E, Departs 13:00, Arrives 2:31 PM - T8: City D to City B, Departs 11:00, Arrives 12:38 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (06:30 - 10:13 AM)
- Connection time: 287 minutes
- T5: City C to City E (15:00 - 4:43 PM)

Earliest arrival: 4:43 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 8

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 06:00, Arrives 8:57 AM - T2: City A to City C, Departs 10:30, Arrives 1:52 PM - T3: City B to City E, Departs 11:00, Arrives 12:50 PM - T4: City B to City C, Departs 13:30, Arrives 3:40 PM - T5: City C to City E, Departs 14:00, Arrives 4:03 PM - T6: City C to City B, Departs 13:00, Arrives 2:38 PM - T7: City D to City E, Departs 11:00, Arrives 12:53 PM - T8: City D to City B, Departs 16:00, Arrives 6:35 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (06:00 - 8:57 AM)
- Connection time: 123 minutes
- T3: City B to City E (11:00 - 12:50 PM)

Earliest arrival: 12:50 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 9

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 09:00, Arrives 11:55 AM - T2: City A to City C, Departs 08:00, Arrives 10:09 AM - T3: City B to City E, Departs 15:30, Arrives 5:18 PM - T4: City B to City C, Departs 11:00, Arrives 1:14 PM - T5: City C to City E, Departs 14:30, Arrives 4:54 PM - T6: City C to City B, Departs 11:00, Arrives 12:50 PM - T7: City D to City E, Departs 11:30, Arrives 1:26 PM - T8: City D to City B, Departs 11:00, Arrives 1:42 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (08:00 - 10:09 AM)
- Connection time: 261 minutes
- T5: City C to City E (14:30 - 4:54 PM)

Earliest arrival: 4:54 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 10

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 07:30, Arrives 10:56 AM - T2: City A to City C, Departs 07:00, Arrives 9:48 AM - T3: City B to City E, Departs 15:00, Arrives 4:58 PM - T4: City B to City C, Departs 10:30, Arrives 1:16 PM - T5: City C to City E, Departs 16:00, Arrives 6:18 PM - T6: City C to City B, Departs 15:00, Arrives 5:06 PM - T7: City D to City E, Departs 15:00, Arrives 4:50 PM - T8: City D to City B, Departs 12:00, Arrives 2:45 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (07:30 - 10:56 AM)
- Connection time: 244 minutes
- T3: City B to City E (15:00 - 4:58 PM)

Earliest arrival: 4:58 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 11

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 09:00, Arrives 11:17 AM - T2: City A to City C, Departs 08:30, Arrives 10:47 AM - T3: City B to City D, Departs 11:30, Arrives 1:00 PM - T4: City B to City C, Departs 15:00, Arrives 5:11 PM - T5: City C to City D, Departs 16:00, Arrives 6:30 PM - T6: City C to City B, Departs 11:30, Arrives 1:46 PM - T7: City E to City D, Departs 10:00, Arrives 11:31 AM - T8: City E to City B, Departs 15:30, Arrives 5:09 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (08:30 - 10:47 AM)
- Connection time: 313 minutes
- T5: City C to City D (16:00 - 6:30 PM)

Earliest arrival: 6:30 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 12

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 09:00, Arrives 12:56 PM - T2: City A to City C, Departs 07:30, Arrives 10:20 AM - T3: City B to City D, Departs 10:00, Arrives 12:26 PM - T4: City B to City C, Departs 12:00, Arrives 2:43 PM - T5: City C to City D, Departs 12:30, Arrives 2:05 PM - T6: City C to City B, Departs 11:00, Arrives 1:35 PM - T7: City E to City D, Departs 16:00, Arrives 6:21 PM - T8: City E to City B, Departs 11:00, Arrives 12:58 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (07:30 - 10:20 AM)
- Connection time: 130 minutes
- T5: City C to City D (12:30 - 2:05 PM)

Earliest arrival: 2:05 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 13

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 06:00, Arrives 9:08 AM - T2: City A to City C, Departs 07:00, Arrives 9:37 AM - T3: City B to City E, Departs 15:30, Arrives 5:44 PM - T4: City B to City C, Departs 12:00, Arrives 2:00 PM - T5: City C to City E, Departs 13:30, Arrives 4:20 PM - T6: City C to City B, Departs 14:30, Arrives 5:10 PM - T7: City D to City E, Departs 15:30, Arrives 6:06 PM - T8: City D to City B, Departs 13:00, Arrives 3:00 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (07:00 - 9:37 AM)
- Connection time: 233 minutes
- T5: City C to City E (13:30 - 4:20 PM)

Earliest arrival: 4:20 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 14

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 07:00, Arrives 9:42 AM - T2: City A to City C, Departs 07:30, Arrives 11:06 AM - T3: City B to City D, Departs 16:00, Arrives 6:27 PM - T4: City B to City C, Departs 10:00, Arrives 11:41 AM - T5: City C to City D, Departs 11:00, Arrives 12:47 PM - T6: City C to City B, Departs 10:30, Arrives 12:23 PM - T7: City E to City D, Departs 13:00, Arrives 3:38 PM - T8: City E to City B, Departs 11:30, Arrives 1:06 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (07:00 - 9:42 AM)
- Connection time: 378 minutes
- T3: City B to City D (16:00 - 6:27 PM)

Earliest arrival: 6:27 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 15

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 06:00, Arrives 8:55 AM - T2: City A to City C, Departs 08:00, Arrives 11:32 AM - T3: City B to City E, Departs 12:00, Arrives 2:54 PM - T4: City B to City C, Departs 11:00, Arrives 12:49 PM - T5: City C to City E, Departs 16:30, Arrives 6:50 PM - T6: City C to City B, Departs 11:30, Arrives 1:13 PM - T7: City D to City E, Departs 10:00, Arrives 12:36 PM - T8: City D to City B, Departs 14:30, Arrives 4:03 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (06:00 - 8:55 AM)
- Connection time: 185 minutes
- T3: City B to City E (12:00 - 2:54 PM)

Earliest arrival: 2:54 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 16

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 09:30, Arrives 12:34 PM - T2: City A to City C, Departs 08:00, Arrives 11:24 AM - T3: City B to City D, Departs 15:30, Arrives 6:11 PM - T4: City B to City C, Departs 10:00, Arrives 11:51 AM - T5: City C to City D, Departs 16:30, Arrives 7:05 PM - T6: City C to City B, Departs 16:00, Arrives 6:53 PM - T7: City E to City D, Departs 12:00, Arrives 1:55 PM - T8: City E to City B, Departs 14:00, Arrives 3:42 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (09:30 - 12:34 PM)
- Connection time: 176 minutes
- T3: City B to City D (15:30 - 6:11 PM)

Earliest arrival: 6:11 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 17

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 07:00, Arrives 9:53 AM - T2: City A to City C, Departs 07:00, Arrives 9:29 AM - T3: City B to City D, Departs 12:30, Arrives 2:12 PM - T4: City B to City C, Departs 13:30, Arrives 3:12 PM - T5: City C to City D, Departs 12:30, Arrives 3:08 PM - T6: City C to City B, Departs 13:30, Arrives 3:47 PM - T7: City E to City D, Departs 16:00, Arrives 6:34 PM - T8: City E to City B, Departs 12:00, Arrives 1:58 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (07:00 - 9:53 AM)
- Connection time: 157 minutes
- T3: City B to City D (12:30 - 2:12 PM)

Earliest arrival: 2:12 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 18

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 06:00, Arrives 8:41 AM - T2: City A to City C, Departs 07:30, Arrives 11:27 AM - T3: City B to City E, Departs 15:30, Arrives 5:10 PM - T4: City B to City C, Departs 10:30, Arrives 12:52 PM - T5: City C to City E, Departs 10:00, Arrives 12:47 PM - T6: City C to City B, Departs 16:00, Arrives 6:28 PM - T7: City D to City E, Departs 12:00, Arrives 2:00 PM - T8: City D to City B, Departs 16:00, Arrives 5:46 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (06:00 - 8:41 AM)
- Connection time: 409 minutes
- T3: City B to City E (15:30 - 5:10 PM)

Earliest arrival: 5:10 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 19

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 10:00, Arrives 12:44 PM - T2: City A to City C, Departs 06:00, Arrives 9:12 AM - T3: City B to City E, Departs 13:00, Arrives 3:39 PM - T4: City B to City C, Departs 12:30, Arrives 2:42 PM - T5: City C to City E, Departs 15:30, Arrives 6:13 PM - T6: City C to City B, Departs 14:00, Arrives 3:45 PM - T7: City D to City E, Departs 14:00, Arrives 4:36 PM - T8: City D to City B, Departs 12:00, Arrives 2:12 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (06:00 - 9:12 AM)
- Connection time: 378 minutes
- T5: City C to City E (15:30 - 6:13 PM)

Earliest arrival: 6:13 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 20

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 09:00, Arrives 12:06 PM - T2: City A to City C, Departs 08:30, Arrives 11:07 AM - T3: City B to City D, Departs 15:30, Arrives 5:14 PM - T4: City B to City C, Departs 15:30, Arrives 5:05 PM - T5: City C to City D, Departs 14:30, Arrives 4:38 PM - T6: City C to City B, Departs 11:30, Arrives 1:31 PM - T7: City E to City D, Departs 16:30, Arrives 7:19 PM - T8: City E to City B, Departs 11:30, Arrives 1:48 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (08:30 - 11:07 AM)
- Connection time: 203 minutes
- T5: City C to City D (14:30 - 4:38 PM)

Earliest arrival: 4:38 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.
Next Worksheet