US 12,146,750 B2
Peer-to-peer ride-sourcing system
Neda Masoud, Dexter, MI (US)
Assigned to The Regents of The University of Michigan, Ann Arbor, MI (US)
Filed by THE REGENTS OF THE UNIVERSITY OF MICHIGAN, Ann Arbor, MI (US)
Filed on Jun. 28, 2022, as Appl. No. 17/851,577.
Claims priority of provisional application 63/216,184, filed on Jun. 29, 2021.
Prior Publication US 2023/0019021 A1, Jan. 19, 2023
Int. Cl. G06Q 10/047 (2023.01); G01C 21/34 (2006.01); G06Q 50/40 (2024.01)
CPC G01C 21/3438 (2013.01) [G06Q 10/047 (2013.01); G06Q 50/40 (2024.01)] 3 Claims
OG exemplary drawing
 
1. A ride-sourcing method comprising:
a. at least one service provider receiving a plurality of ride-sourcing requests from at least one service recipient, each of the plurality of ride-sourcing requests comprising an origin, a destination, and a time window within which to start and end to define a trip;
b. grouping a first set of the plurality of ride-sourcing requests into a first cluster of trips and a second set of the plurality of ride-sourcing requests into a second cluster of trips;
c. computing a tour formation for each of the first cluster and the second cluster to define a series of stations and a cost function;
d. applying each of the trips to the first cluster and the second cluster under uniformity constraints to obtain approximately uniform clusters;
e. repeating steps c and d until the cost function between consecutive iterations is below a threshold to define a first cluster of trips and a second cluster of trips and performing dynamic re-optimization of steps c and d; and
f. assigning the first cluster of trips to a first driver and the second cluster of trips to a second driver.