Algorithms and Computational Study on a Transportation System Integrating Public Transit and Ridesharing of Personal Vehicles
Qian-Ping Gu, Jiajian Leo Liang

TL;DR
This paper proposes an integrated transit and ridesharing system with algorithms that optimize rider-driver matching to reduce commute times and increase vehicle occupancy, validated through real-world data from Chicago.
Contribution
It introduces an ILP-based exact algorithm and approximation algorithms using LP-rounding and hypergraph matching for integrated transit-ridesharing optimization.
Findings
Over 60% rider assignment rate achieved
Riders' commute time reduced by 23%
Vehicle occupancy rate increased to nearly 3
Abstract
The potential of integrating public transit with ridesharing includes shorter travel time for commuters and higher occupancy rate of personal vehicles and public transit ridership. In this paper, we describe a centralized transit system that integrates public transit and ridesharing to reduce travel time for commuters. In the system, a set of ridesharing providers (drivers) and a set of public transit riders are received. The optimization goal of the system is to assign riders to drivers by arranging public transit and ridesharing combined routes subject to shorter commuting time for as many riders as possible. We give an exact algorithm, which is an ILP formulation based on a hypergraph representation of the problem. By using the ILP and the hypergraph, we give approximation algorithms based on LP-rounding and hypergraph matching/weighted set packing, respectively. As a case study, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTransportation and Mobility Innovations · Transportation Planning and Optimization · Sharing Economy and Platforms
