Revenue Maximization in Online Dial-a-ride
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server’s goal is to maximize its total revenue within a given time limit, T. We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem. We then provide a 3-competitive algorithm for the problem in a uniform metric space and a 6-competitive algorithm for the general case of weighted graphs (under reasonable assumptions about the input instance). We conclude with an experimental evaluation of our algorithm in simulated settings inspired by real-world Dial-a-Ride data. Experimental results show that our algorithm performs well when compared to an offline version of the algorithm and a greedy algorithm.
Christman, Ananya; Chung, Christine; Jaczko, Nicholas; Milan, Marina; Vasilchenko, Anna; and Westvold, Scott, "Revenue Maximization in Online Dial-a-ride" (2017). Computer Science Faculty Publications. 29.
The views expressed in this paper are solely those of the author.