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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Jagrowski, Liam, Dalmeijer, Kevin, Ye, Tinghan, Van Hentenryck, Pascal
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918490202439680
author Jagrowski, Liam
Dalmeijer, Kevin
Ye, Tinghan
Van Hentenryck, Pascal
author_facet Jagrowski, Liam
Dalmeijer, Kevin
Ye, Tinghan
Van Hentenryck, Pascal
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2508_00241
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia
Jagrowski, Liam
Dalmeijer, Kevin
Ye, Tinghan
Van Hentenryck, Pascal
Optimization and Control
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.
title Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia
topic Optimization and Control
url https://arxiv.org/abs/2508.00241