# US 2019/0244142 A1 · Method and system for maximizing share-ride bookings > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0244142 A1 - Document ID: US20190244142A1 - Status: Published application - Kind: A1 - Application number: 16/000,574 - Filed: 2018-06-05 - Published: 2019-08-08 - Earliest claimed: 2018-02-06 - Assignees: Ani Technologies Private Limited - Applicants: Ani Technologies Private Limited - Inventors: Rajesh Kumar Singh; Shailesh Kumar; Kunal Sachdeva - Web page: https://patentgrep.com/patent/US20190244142A1 ## CPC - G06Q 10/02: Reservations, e.g. for tickets, services or events - G01C 21/3438: {Rendezvous; Ride sharing} - G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202) - G06Q 30/0206: {Price or cost determination based on market factors} - G06Q 30/0284: {Time or distance, e.g. usage of parking meters or taximeters} - H04W 4/021: Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences - H04W 4/40: for vehicles, e.g. vehicle-to-pedestrians [V2P] - G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR - G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S) - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract A method and a system for maximizing share-ride bookings in a geographical area in a ride-sharing system are provided. Historical share-ride demands for the geographical area are estimated. A time period is segmented into time intervals such that each time interval has an equal count of the estimated historical share-ride demands. A conversion rate and a gross merchandise value (GMV) per unit of distance are determined for a first time interval at a check point of a second time interval. Error signals are generated at the check point based on deviations in the conversion rate and the GMV per unit of distance with respect to a defined conversion rate and a defined GMV per unit of distance, respectively. A share-ride fare in the second time interval is controlled based on the error signals to maximize the share-ride bookings during the second time interval. ## Claims ### Claim 1 A method for maximizing share-ride bookings in a geographical area, the method comprising: determining a set of source-destination clusters for the geographical area based on historical share-ride booking data; estimating historical share-ride demands for the geographical area based on historical share-ride demand data; segmenting a time period into a plurality of time intervals such that each of the plurality of time intervals has an equal count of the estimated historical share-ride demands, wherein a start time of each of the plurality of time intervals is a check point of each of the plurality of time intervals; determining a conversion rate and a gross merchandise value (GMV) per unit of distance for a first time interval of the plurality of time intervals at the check point of a second time interval of the plurality of time intervals based on first share-ride bookings associated with the first time interval; generating first and second error signals at the check point of the second time interval based on deviations in the determined conversion rate and the determined GMV per unit of distance of the first time interval with respect to a defined conversion rate and a defined GMV per unit of distance, respectively; and controlling a share-ride fare of second share-ride bookings in the second time interval based on the first and second error signals that maximizes the second share-ride bookings in the second time interval, wherein the second share-ride bookings are associated with a subset of source-destination clusters selected from the set of source-destination clusters. ### Claim 2 (depends on 1) The method of claim 1, wherein the historical share-ride booking and demand data are extracted from a database server over a communication network. ### Claim 3 (depends on 2) The method of claim 2, wherein the set of source-destination clusters is determined based on pick-up and drop-off latitude and longitude information associated with the extracted historical share-ride booking data. ### Claim 4 (depends on 1) The method of claim 1, wherein each of the plurality of time intervals is associated with an end time, wherein the end time of the first time interval is the start time of the second time interval. ### Claim 5 (depends on 1) The method of claim 1, wherein the conversion rate for the first time interval is determined based on a ratio of a first count of the first share-ride bookings associated with the first time interval and a second count of the estimated historical share-ride demands associated with the first time interval. ### Claim 6 (depends on 1) The method of claim 1, wherein the GMV per unit of distance for the first time interval is determined based a ratio of a total share-ride fare associated with the first time interval and a total share-ride distance associated with the first time interval. ### Claim 7 (depends on 6) The method of claim 6, wherein the total share-ride fare associated with the first time interval is determined based on a first sum of share-ride fares of the first share-ride bookings associated with the first time interval, and wherein the total share-ride distance associated with the first time interval is determined based on a second sum of share-ride distances of the first share-ride bookings associated with the first time interval. ### Claim 8 (depends on 1) The method of claim 1, wherein the subset of source-destination clusters is selected from the set of source-destination clusters based on at least one of the estimated historical share-ride demands of each of the set of source-destination clusters in the second time interval or the conversion rate of each of the set of source-destination clusters in the first time interval. ### Claim 9 (depends on 1) The method of claim 1, further comprising generating first and second control signals based on the generated first and second error signals, respectively, to change the share-ride fare of each of the second share-ride bookings associated with the subset of source-destination clusters in the second time interval, wherein the generated first and second control signals are utilized to increase or decrease the share-ride fare of each of the second share-ride bookings associated with the subset of source-destination clusters in the second time interval. ### Claim 10 A system for maximizing share-ride bookings in a geographical area, the system comprising: a processor configured to: determine a set of source-destination clusters for the geographical area based on historical share-ride booking data; estimate historical share-ride demands for the geographical area based on historical share-ride demand data; segment a time period into a plurality of time intervals such that each of the plurality of time intervals has an equal count of the estimated historical share-ride demands, wherein a start time of each of the plurality of time intervals is a check point of each of the plurality of time intervals; and determine a conversion rate and a gross merchandise value (GMV) per unit of distance for a first time interval of the plurality of time intervals at the check point of a second time interval of the plurality of time intervals based on first share-ride bookings associated with the first time interval; and a feedback loop controller configured to: generate first and second error signals at the check point of the second time interval based on deviations in the determined conversion rate and the determined GMV per unit of distance of the first time interval with respect to a defined conversion rate and a defined GMV per unit of distance, respectively; and control a share-ride fare of second share-ride bookings in the second time interval based on the first and second error signals that maximizes the second share-ride bookings in the second time interval, wherein the second share-ride bookings are associated with a subset of source-destination clusters selected from the set of source-destination clusters. ### Claim 11 (depends on 10) The system of claim 10, wherein the processor is further configured to extract the historical share-ride booking and demand data from a database server over a communication network. ### Claim 12 (depends on 11) The system of claim 11, wherein the processor is further configured to determine the set of source-destination clusters based on pick-up and drop-off latitude and longitude information associated with the extracted historical share-ride booking data. ### Claim 13 (depends on 10) The system of claim 10, wherein each of the plurality of time intervals is associated with an end time, wherein the end time of the first time interval is the start time of the second time interval. ### Claim 14 (depends on 10) The system of claim 10, wherein the processor is further configured to determine the conversion rate for the first time interval based on a ratio of a first count of the first share-ride bookings associated with the first time interval and a second count of the estimated historical share-ride demands associated with the first time interval. ### Claim 15 (depends on 10) The system of claim 10, wherein the processor is further configured to determine the GMV per unit of distance for the first time interval based a ratio of a total share-ride fare associated with the first time interval and a total share-ride distance associated with the first time interval. ### Claim 16 (depends on 15) The system of claim 15, wherein the processor is further configured to: determine the total share-ride fare associated with the first time interval based on a first sum of share-ride fares of the first share-ride bookings associated with the first time interval; and determine the total share-ride distance associated with the first time interval based on a second sum of share-ride distances of the first share-ride bookings associated with the first time interval. ### Claim 17 (depends on 10) The system of claim 10, wherein the processor is further configured to select the subset of source-destination clusters from the set of source-destination clusters based on at least one of the estimated historical share-ride demands of each of the set of source-destination clusters in the second time interval or the conversion rate of each of the set of source-destination clusters in the first time interval. ### Claim 18 (depends on 10) The system of claim 10, wherein the feedback loop controller is further configured to generate first and second control signals based on the generated first and second error signals, respectively, to change the share-ride fare of each of the second share-ride bookings associated with the subset of source-destination clusters in the second time interval, wherein the generated first and second control signals are utilized to increase or decrease the share-ride fare of each of the second share-ride bookings associated with the subset of source-destination clusters in the second time interval.