Google Professional Machine Learning Engineer

Get started today

Ultimate access to all questions.

Quick Answer

Answer-first summary for fast verification

Answer: 1. Define the optimal route as the shortest route that passes by all shuttle stations with confirmed attendance at the given time under capacity constraints. 2. Dispatch an appropriately sized shuttle and indicate the required stops on the map.

The correct answer is C. Since the users must confirm their presence and shuttle station one day in advance, you already have the necessary information on which stations require stops and the number of passengers at each station. This makes predictions about passenger numbers or shuttle stops unnecessary. Instead, the focus should be on optimizing the route, which involves defining the shortest path that covers all stations with confirmed attendance, considering capacity constraints. Therefore, a classical routing algorithm that optimizes the route is the most efficient approach in this case.

Author: LeetQuiz Editorial Team

Quick Answer

Answer-first summary for fast verification

Author: LeetQuiz Editorial Team

Comments (0)

No comments yet.

Your organization operates an internal shuttle service for employees, covering multiple pick-up points across the city. Currently, these shuttles stop at all points every 30 minutes between 7 am and 10 am, regardless of passenger presence. To enhance efficiency, the development team has already built an application on Google Kubernetes Engine, which requires users to confirm their presence and select their shuttle station one day in advance. With this setup, what approach should you take to optimize the shuttle service route and size?

Exam-Like

Build a tree-based regression model that predicts how many passengers will be picked up at each shuttle station. 2. Dispatch an appropriately sized shuttle and provide the map with the required stops based on the prediction.

7.1%

Build a tree-based classification model that predicts whether the shuttle should pick up passengers at each shuttle station. 2. Dispatch an available shuttle and provide the map with the required stops based on the prediction.

6.4%

Define the optimal route as the shortest route that passes by all shuttle stations with confirmed attendance at the given time under capacity constraints. 2. Dispatch an appropriately sized shuttle and indicate the required stops on the map.

74.3%

Build a reinforcement learning model with tree-based classification models that predict the presence of passengers at shuttle stops as agents and a reward function around a distance-based metric. 2. Dispatch an appropriately sized shuttle and provide the map with the required stops based on the simulated outcome.