Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows


  • Youngseo Kim Cornell University
  • Danushka Edirimanna Cornell University
  • Michael Wilbur Vanderbilt University
  • Philip Pugliese Chattanooga Area Regional Transportation Authority
  • Aron Laszka Pennsylvania State University
  • Abhishek Dubey Vanderbilt University
  • Samitha Samaranayake Cornell University



APP: Transportation, PRS: Temporal Planning, PRS: Applications, PRS: Optimization of Spatio-Temporal Systems, PRS: Scheduling, APP: Mobility, Driving & Flight, SO: Applications


The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.




How to Cite

Kim, Y., Edirimanna, D., Wilbur, M., Pugliese, P., Laszka, A., Dubey, A., & Samaranayake, S. (2023). Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows. Proceedings of the AAAI Conference on Artificial Intelligence, 37(4), 5151-5159.



AAAI Technical Track on Domain(s) of Application