DROPS

Document

DOI: 10.4230/LIPIcs.CP.2026.31

Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia

Authors: Liam Jagrowski, Kevin Dalmeijer, Tinghan Ye, and Pascal Van Hentenryck

Published in: LIPIcs, Volume 379, 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)

Abstract

Paratransit services are vital for individuals who cannot use fixed-route public transit, including those with disabilities. Optimizing these services is essential for transit agencies to deliver high-quality service efficiently. This paper introduces a Constraint Programming (CP) model to jointly optimize route planning and shift scheduling for paratransit operations, along with practical guidance for real-world implementation. A case study in Savannah, Georgia, demonstrates that the new approach is competitive with a recently proposed, highly effective AI-accelerated column generation framework, and significantly increases the number of requests served compared to current practices. The method is also easier to implement and provides an inherently practical solution for transportation planners. CP further provides the flexibility to optimize schedules without requiring shifts to start exactly on the hour, yielding an additional 5% improvement in the number of requests served.

Cite as

Liam Jagrowski, Kevin Dalmeijer, Tinghan Ye, and Pascal Van Hentenryck. Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia. In 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 379, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{jagrowski_et_al:LIPIcs.CP.2026.31,
  author =	{Jagrowski, Liam and Dalmeijer, Kevin and Ye, Tinghan and Van Hentenryck, Pascal},
  title =	{{Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia}},
  booktitle =	{32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)},
  pages =	{31:1--31:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-432-1},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{379},
  editor =	{Beldiceanu, Nicolas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.31},
  URN =		{urn:nbn:de:0030-drops-266635},
  doi =		{10.4230/LIPIcs.CP.2026.31},
  annote =	{Keywords: Paratransit, Mobility as a Service, Constraint Programming, Case Study}
}

Search Results

Documents authored by Ye, Tinghan

Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia

Abstract

Cite as

Thanks for your feedback!

Could not send message