The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Jul 2017 |
| Last Sign in: | 304 Weeks Ago, 5 Days Ago |
| Questions Answered: | 15833 |
| Tutorials Posted: | 15827 |
MBA,PHD, Juris Doctor
Strayer,Devery,Harvard University
Mar-1995 - Mar-2002
Manager Planning
WalMart
Mar-2001 - Feb-2009
1. A taxi app matches customers’ ride requests to drivers by minimizing the response time, and it does so by choosing for each new request among all available drivers the one within the shortest distance to the pick-up location. However, in a big city with a high frequency of requests, such greedy algorithm is not always optimal at minimizing the total response time of all assignments. Therefore, the app has developed a new algorithm that collects all the customer requests that arrive in a minute, compares them with all the available drivers at that time by distance using current GPS data, and makes an optimal one-to-one assignment that minimizes the total distance traveled by drivers to the requested pick-up locations. Sheet 3 of Assignment2.xlsx shows all the requests arrived in a minute, from first to last, and the distance to all the drivers available in the area. Please,
(viii) find the assignment and total distance that drivers would have had to travel to reach their assigned pick-up location if the greedy algorithm was used. Also,
(ix) find the total distance traveled with the new algorithm and compare the two results. What do you notice and why?
Finally, some customers also express a preference for a particular car type or driver’s rating, and if the app is able to make that assignment it is like cutting the total distance by 1 mile in the objective function. Please,
(x) find the new optimal assignment.
Â
Â
Attachments:
Hel-----------lo -----------Sir-----------/Ma-----------dam----------- T-----------han-----------k y-----------ou -----------for----------- yo-----------ur -----------int-----------ere-----------st -----------and----------- bu-----------yin-----------g m-----------y p-----------ost-----------ed -----------sol-----------uti-----------on.----------- Pl-----------eas-----------e p-----------ing----------- me----------- on----------- ch-----------at -----------I a-----------m o-----------nli-----------ne -----------or -----------inb-----------ox -----------me -----------a m-----------ess-----------age----------- I -----------wil-----------l b-----------e q-----------uic-----------kly-----------