Structured shared automotive travel

A computer-implemented method for managing shared automotive travel, the method comprising:

• accessing a database associating ride constraint information with each rider of a plurality of potential riders to identify a cluster of riders for shared use of an automobile from the plurality of potential riders in dependence upon first ride constraint information for a first rider and second ride constraint information for a second rider;
• determining a route for the automobile in dependence upon the first ride constraint information and the second ride constraint information;
• associating the route with a trip;
• identifying a third rider from the plurality of potential riders that is within a distance metric threshold of the route in dependence upon ride constraint information associated with the third rider;
• and
• providing a notification of the trip to at least the first rider, the second rider, and the third rider.

A computer-implemented method for managing shared automotive travel, the method comprising:

• accessing a database associating ride constraint information with each rider of a plurality of potential riders to identify a cluster of riders for shared use of an automobile from the plurality of potential riders in dependence upon constraint information comprising:
• first origin location information associated with a first rider of the plurality of potential riders and indicative of a first pickup location constraint for the first rider;
• first origin time information associated with the first rider and indicative of a first pickup time constraint for the first rider;
• first destination location information associated with the first rider and indicative of a first drop-off location constraint for the first rider;
• first destination time information associated with the first rider and indicative of a first drop-off time constraint for the first rider;
• second origin location information associated with a second rider of the plurality of potential riders and indicative of a second pickup location constraint for the second rider;
• second origin time information associated with the second rider and indicative of a second pickup time constraint for the second rider;
• second destination location information associated with the second rider and indicative of a second drop-off location constraint for the second rider;
• and
• second destination time information associated with the second rider and indicative of a second drop-off time constraint for the second rider;
• determining a route for the automobile in dependence upon at least:
• the first origin location information;
• the first origin time information;
• the first destination location information;
• the first destination time information;
• the second origin location information;
• the second origin time information;
• the second destination location information;
• and
• the second destination time information;
• associating the route with a trip;
• identifying a third rider from the plurality of potential riders that is within a distance metric threshold of the route in dependence upon ride constraint information associated with the third rider;
• and
• providing a notification of the trip to at least the first rider, the second rider, and the third rider.

A computer-implemented method for managing shared automotive travel, the method being performed by one or more processors and comprising:

• receiving ride constraint information from each rider of a plurality of potential riders, the ride constraint information for each rider comprising origin location information indicative of a pick-up location for a recurring automobile ride and destination location information indicative of a drop-off location for the recurring automobile ride;
• processing the origin location information and the destination location information for the plurality of potential riders to identify:
• a first cluster of riders from the plurality of potential riders wherein i) the pick-up location for each rider in the first cluster lies within a pickup distribution threshold and ii) the drop-off location for each rider in the first cluster lies within a drop-off distribution threshold, and
• a second cluster of riders from the plurality of potential riders wherein i) the pick-up location for each rider in the second cluster lies within a pickup distribution threshold;
• and ii) the drop-off location for each rider in the second cluster lies within a drop-off distribution threshold;
• and
• associating each rider in the first cluster with the first cluster in a database;
• associating each rider in the second cluster with the second cluster in the database.