标题： 基于约束编程的非固定路线交通优化：佐治亚州萨凡纳案例研究 显示英文标题

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

摘要： 无障碍交通服务对无法使用固定路线公共交通的人士至关重要，包括残疾人。 优化这些服务对于交通机构高效提供高质量服务至关重要。 本文介绍了一种约束编程模型，用于共同优化无障碍交通运营的路线规划和班次安排，并提供了实际实施的指导建议。 在佐治亚州萨凡纳市的一个案例研究中，结果表明该新方法与现有最先进的方法具有竞争力，并且相比现行做法显著增加了可处理的请求数量。 此外，该方法也更容易实施，并为交通规划者提供了本质上实用的解决方案。 另一个优势是，该模型允许在不将开始时间限制在整点的情况下优化班次，应用后可进一步提高5%的请求处理量。 显示英文摘要

摘要： 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 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 the state of the art and significantly increases the number of requests served compared to current practices. It is also significantly easier to implement and provides an inherently practical solution for transportation planners. An additional advantage is that the model allows for optimizing shifts without restricting start times to the top of the hour, yielding a further 5% improvement in requests served when applied.