Activity Overview
Angel, Bella, Chris, Dion and Eric are all using their Zippy-Rood Ride-Share App to book a vehicle. There are five vehicles nearby. Your task is to figure out how the vehicles should be allocated based on the amount of time it takes for each vehicle to get to each rider. Watch the video to help understand the Hungarian Algorithm and how it applies to this problem. Download the free Widget!
Objectives
Students use the expected wait times for five ride-share customers and determine the minimum overall wait time.
Vocabulary
- Hungarian Algorithm
- Allocation
- Matrix
- Minimum Total Wait Time
About the Lesson
Students are provided with the information about five riders and the corresponding wait time for five vehicles in a ride share scenario. Students are required to determine the lowest total wait time allocation. No prior knowledge of the Hungarian Algorithm is required if students watch the video. (QR Code on the worksheet) A Widget is also supplied with the activity files. Information on how to install the Widget is included in the activity and via a link in the Hungarian Algorithm video.