Skip to main content
Download PDF
- Main
Dynamic Routing for Ride-Sharing
Published Web Location
https://doi.org/10.7922/G2D798QKThe data associated with this publication are available at:
https://doi.org/10.7910/DVN/P6ROMDAbstract
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.
Main Content
For improved accessibility of PDF content, download the file to your device.
If you recently published or updated this item, please wait up to 30 minutes for the PDF to appear here.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%