We have developed two indirect control methods to optimize the set of waiting locations of the drivers, thereby minimizing the expected wait time of the customers: 1) sharing the location of all drivers with a subset of drivers, and 2) paying the drivers to relocate. We have shown that finding the optimal control for each method is NP-hard. Despite this, we have developed algorithms that can find near-optimal controls in each case. We have evaluated the performance of the proposed control methods on real-world data showing significant improvements in customer wait-time.