Dynamic Routing for Ride-Sharing
The research report explored the use of High Occupancy Vehicle (HOV) lanes and meeting points in a ride-sharing system where drivers have their own origin and destination. A two-stage heuristic algorithm is proposed, which consists of an insertion heuristic to solve the pickup and delivery problem (PDP) problem and a second stage algorithm that can solve the meeting points problem optimally in polynomial time. The experimental results show that the HOV lanes and meeting points can increase the efficiency of a dynamic ride-sharing system.
- Record URL:
- Summary URL:
- Dataset URL:
- Dataset URL:
- Summary URL:
- Record URL:
-
Supplemental Notes:
- This document was sponsored by the U.S. Department of Transportation, University Transportation Centers Program. Supporting datasets available at: https://doi.org/10.7910/DVN/P6ROMD; https://rosap.ntl.bts.gov/view/dot/60488
-
Corporate Authors:
METRANS Transportation Consortium
University of Southern California
Los Angeles, CA United StatesNational Center for Sustainable Transportation
University of California, Davis
Davis, CA United StatesOffice of the Assistant Secretary for Research and Technology
University Transportation Centers Program
Department of Transportation
Washington, DC United States 20590 -
Authors:
- Dessouky, Maged M
-
0000-0002-9630-6201
- Hu, Shichun
-
0000-0001-9185-2599
- Publication Date: 2021-11
Language
- English
Media Info
- Media Type: Digital/other
- Edition: Final Report
- Features: Appendices; Figures; References; Tables;
- Pagination: 36p
Subject/Index Terms
- TRT Terms: Algorithms; High occupancy vehicle lanes; Origin and destination; Ridesharing; Routes and routing
- Subject Areas: Highways; Operations and Traffic Management; Passenger Transportation; Planning and Forecasting;
Filing Info
- Accession Number: 01789225
- Record Type: Publication
- Report/Paper Numbers: NCST-USC-RR-21-22
- Contract Numbers: 69A3551747114
- Files: UTC, NTL, TRIS, ATRI, USDOT
- Created Date: Nov 22 2021 5:10PM