Purposefully selecting longer routes to improve user satisfaction
First Claim
1. An automated ridesharing dispatch system, comprising:
- a communications interface configured to;
receive ride requests from a plurality of users, wherein each ride request includes a starting point and a desired destination;
receive from a plurality of communication devices associated with a plurality of ridesharing vehicles, indications of current locations of the plurality of ridesharing vehicles;
memory configured to store a plurality of rules including a rule to select a fastest route for guiding a ridesharing vehicle, and a rule for reducing backtracking, even in instances where backtracking would result in shorter travel time; and
at least one processor configured to;
assign the plurality of users to a common ridesharing vehicle;
use the stored plurality of rules to determine a route for the ridesharing vehicle other than the fastest route, the determined route is selected to account for the rule for reducing backtracking and includes a plurality of pick-up and drop-off locations associated with the starting points and desired destinations of the plurality of users;
in order to reduce backtracking, direct the ridesharing vehicle along the determined route other than the fastest route; and
receive real time traffic data and calculate an expected travel-time change associated with users currently riding in the ridesharing vehicle when the ridesharing vehicle is directed along a route with backtracking as compared to a route with reduced backtracking.
3 Assignments
0 Petitions
Accused Products
Abstract
An automated ridesharing dispatch system includes a communications interface configured to receive ride requests from a plurality of users and to receive from a plurality of communication devices associated with a plurality of ridesharing vehicles, indications of current locations of the plurality of ridesharing vehicles. The system also includes a memory configured to store a plurality of rules including a rule to select a fastest route for guiding a ridesharing vehicle, and a rule for reducing backtracking, even in instances where backtracking would result in shorter travel time. The system also includes at least one processor configured to assign the plurality of users to a common ridesharing vehicle, use the stored plurality of rules to determine a route for the ridesharing vehicle other than the fastest route, and in order to reduce backtracking, direct the ridesharing vehicle along the determined route other than the fastest route.
-
Citations
19 Claims
-
1. An automated ridesharing dispatch system, comprising:
-
a communications interface configured to; receive ride requests from a plurality of users, wherein each ride request includes a starting point and a desired destination; receive from a plurality of communication devices associated with a plurality of ridesharing vehicles, indications of current locations of the plurality of ridesharing vehicles; memory configured to store a plurality of rules including a rule to select a fastest route for guiding a ridesharing vehicle, and a rule for reducing backtracking, even in instances where backtracking would result in shorter travel time; and at least one processor configured to; assign the plurality of users to a common ridesharing vehicle; use the stored plurality of rules to determine a route for the ridesharing vehicle other than the fastest route, the determined route is selected to account for the rule for reducing backtracking and includes a plurality of pick-up and drop-off locations associated with the starting points and desired destinations of the plurality of users; in order to reduce backtracking, direct the ridesharing vehicle along the determined route other than the fastest route; and receive real time traffic data and calculate an expected travel-time change associated with users currently riding in the ridesharing vehicle when the ridesharing vehicle is directed along a route with backtracking as compared to a route with reduced backtracking. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A non-transitory computer-readable storage medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform a method for managing a fleet of ridesharing vehicles, the method comprising:
-
receiving ride requests from a plurality of users, wherein each ride request includes a starting point and a desired destination; receiving from a plurality of communication devices associated with a plurality of ridesharing vehicles, indications of current locations of the plurality of ridesharing vehicles; accessing memory configured to store a plurality of rules including a rule to select a fastest route for guiding a ridesharing vehicle and a rule for reducing backtracking, even in instances where backtracking would result in shorter travel time; assigning the plurality of users to a common ridesharing vehicle; using the stored plurality of rules to determine a route for the ridesharing vehicle other than the fastest route, the determined route is selected to account for the rule for reducing backtracking and includes a plurality of pick-up and drop-off locations associated with the starting points and desired destinations of the plurality of users; in order to reduce backtracking, directing the ridesharing vehicle along the determined route other than the fastest route; and receiving real time traffic data and calculating an expected travel-time change associated with users currently riding in the ridesharing vehicle when the ridesharing vehicle is directed along a route with backtracking as compared to a route with reduced backtracking. - View Dependent Claims (17, 18, 19)
-
Specification