Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive
Dynamic taxi and ride sharing problems with Money as an Incentive are studied. Heuristics are proposed and compared with others achieving better results. In the dynamic problem our approach is based on fast computation of minimum paths. Simulations show that users can save up to 30% on shared trips compared to private ones.
dial-a-ride heuristics taxi-sharing ride-sharing grasp