Systems and methods for transport capacity scheduling

Patent metadata

Field	Value
Publication number	US-11621921-B2
Application number	US-201916713047-A
Country	US
Kind code	B2
Filing date	Dec 13, 2019
Priority date	Jun 14, 2017
Publication date	Apr 4, 2023
Grant date	Apr 4, 2023

Abstract

The present disclosure relates to systems and methods for transport capacity scheduling. The systems and methods may determine a target region, wherein a plurality of service requests that satisfy a preset condition initiate from the target region. The systems and methods may determine a non-busy region based on information of the target region. The non-busy region may include one or more available service providers that are free to accept a service request. The systems and methods may transmit, via a network, a scheduling instruction associated with the plurality of service requests to a user terminal associated with at least one of the one or more available service providers in the non-busy region. The scheduling instruction may include information inquiring whether the at least one of the one or more available service providers in the non-busy region agrees to go to the target region.

First claim

We claim:

1. A system for transport capacity scheduling, comprising:
at least one storage device including a set of instructions;
at least one processor in communication with the at least one storage device, wherein when executing the set of instructions, the at least one processor is configured to cause the system to:
determine a target region, wherein a plurality of service requests that satisfy a preset condition initiate from the target region, the plurality of service requests being initiated via a plurality of user terminals associated with a plurality of service requesters;
determine a non-busy region based on information of the target region, the non-busy region including one or more available service providers that are free to accept a service request; and
transmit, via a network, a scheduling instruction associated with the plurality of service requests to a user terminal associated with at least one of the one or more available service providers in the non-busy region, the scheduling instruction including information inquiring whether the at least one of the one or more available service providers in the non-busy region agrees to go to the target region, wherein at least portion of the scheduling instruction is displayed via a graphic user interface of an application executed by the user terminal, wherein to determine the target region, the at least one processor is configured to cause the system further to:
determine a target radius and a target service request number;
divide a predetermined area into a plurality of candidate regions based on the target radius and the target service request number by using a clustering algorithm;
for at least one of the plurality of candidate regions,
determine whether an allocation rate is less than an allocation rate threshold;
determine whether a ratio of a number count of available service providers in the candidate region to a number count of service requests to be allocated in the candidate region is less than a ratio threshold based on a result of the determination that the allocation rate is less than the allocation rate threshold; and
determine the candidate region as the target region based on a result of the determination that the ratio of the number count of available service providers in the candidate region to the number count of service requests to be allocated in the candidate region is less than the ratio threshold,
wherein to determine the target radius and the target service request number, the at least one processor is configured to cause the system further to:
determine a plurality of data pairs, each of the plurality of data pairs including a predetermined radius and a predetermined service request number;
determine a plurality of distribution entropies corresponding to the plurality of data pairs based on the clustering algorithm;
identify a maximum distribution entropy among the plurality of distribution entropies;
select a data pair among the plurality of data pairs that correspond to the maximum distribution entropy; and
determine a predetermined radius and a predetermined service request number corresponding to the selected data pair as the target radius and the target service request number.

2. The system of claim 1 , wherein to determine the non-busy region based on the information of the target region, the at least one processor is configured to cause the system further to:
determine a boundary of the target region;
obtain an expansion parameter associated with the target region;
determine a modified boundary based on the expansion parameter; and
determine the non-busy region based on the modified boundary.

3. The system of claim 1 , wherein the at least one processor is configured to cause the system further to:
in response to an acceptance of the scheduling instruction received from the user terminal associated with the at least one of the one or more available service providers in the non-busy region, transmit information of at least one of the plurality of service requests to the user terminal associated with the at least one of the one or more available service providers in the non-busy region, wherein
the information of the at least one of the plurality of service requests transmitted to the user terminal associated with the at least one of the one or more available service providers in the non-busy region includes a location associated with the at least one of the plurality of service request, the location associated with the at least one of the plurality of service requests being determined according to GPS data transmitted by a user terminal associated with the at least one of the plurality of service requests.

4. The system of claim 3 , wherein the at least one processor is configured to cause the system further to:
transmit the scheduling instruction to one or more user terminals associated with the one or more available service providers in the non-busy region;
receive, from the one or more user terminals of the one or more available service providers, one or more acceptances indicating that corresponding part of the one or more available service providers agree to go to the target region;
determine a number count of the received one or more acceptances;
determine whether the number count of the one or more acceptances is larger than a predetermined threshold; and
stop transmitting the scheduling instruction to the one or more user terminals associated with the one or more available service providers in the non-busy region based on a result of the determination that the number count of the one or more acceptances is larger than the predetermined threshold.

5. The system of claim 1 , wherein the at least one processor is configured to cause the system further to:
determine a location of the at least one of the one or more available service providers in the non-busy region based on GPS (Global Positioning System) data received from the application executed by the user terminal associated with the at least one of the one or more available service providers, the GPS data being determined by a GPS chipset of the user terminal.

6. The system of claim 5 , wherein the at least one processor is configured to cause the system further to:
identify a scheduling location in the target region, wherein a service request density within a predetermined range of the scheduling location is larger than a density threshold;
determine a distance between the location of the at least one of the one or more available service providers and the scheduling location;
determine whether the distance between the location of the at least one of the one or more available service providers and the scheduling location is less than a distance threshold; and
transmit information of the scheduling location to the user terminal associated with the at least one of the one or more available service providers based on a result of the determination that the distance between the location of the at least one of the one or more available service providers and the scheduling location is less than the distance threshold.

7. The system of claim 5 , wherein to transmit the scheduling instruction associated with the plurality of service requests to the user terminal associated with the at least one of the one or more available service providers in the non-busy region, the at least one processor is configured to cause the system further to:
determine an estimated travel time from the location of the at least one of the one or more available service providers to the target region;
determine a profit value associated with the at least one of the one or more available service providers if the at least one of the one or more available service providers arrives in the target region;
determine whether a

Assignees

• Beijing Didi Infinity Technology & Dev Co Ltd

Inventors

• Zhang Lingyu
• Wang Gongzheng
• Zhang Niping
• Li Lu

Classifications

• H04L47/762

  triggered by the network · CPC title

• G08G1/202

  Dispatching vehicles on the basis of a location, e.g. taxi dispatching · CPC title

• H04L47/525

  by redistribution of residual bandwidth · CPC title

• H04L47/522 Primary

  Dynamic queue service slot or variable bandwidth allocation · CPC title

• H04L67/51

  Discovery or management thereof, e.g. service location protocol [SLP] or web services · CPC title