This project simulates how a taxi dispatch system matches a map with multiple users and multiple taxis.
A novel algorithm was designed and employed to solve this dynamic planning problem which results in optimal overall waiting time and journey lengths.