Algorithms for optimizing taxi paths for ride-sharing
This project demonstrates an efficient algorithm to route ride-sharing cabs. The input to the algorithm is a real-world dataset from New York, containing a list of 'cab requests'. Each request consists of:
- the starting point,
- the destination (both in GPS coordinates),
- the number of passengers, and
- the time at which the request was made.
The goal was to designate routes to multiple requests to maximize ride-sharing and minimize cost to the customers. The result was satisfactory -- with a 40% saving in cost.