# US 2018/0025407 A1 · Methods and systems for order processing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0025407 A1
- Document ID: US20180025407A1
- Status: Published application
- Kind: A1
- Application number: 15/547,528
- Filed: 2016-01-29
- Published: 2018-01-25
- Earliest claimed: 2015-02-02
- Assignees: Beijing Didi Infinity Technology and Development Co., Ltd.
- Applicants: Beijing Didi Infinity Technology and Development Co., Ltd.
- Inventors: Lingyu ZHANG; Mingcong SUN; Wei CUI; Kaijie QIN; Tao HU; Zhilin HU; Haiyang LU; Xiangxin BAO
- Web page: https://patentgrep.com/patent/US20180025407A1

## CPC

- G06Q 30/0635: {replenishment orders; recurring orders}
- G06Q 10/02: Reservations, e.g. for tickets, services or events
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- 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

## Abstract

The present disclosure discloses an order allocation method. The method may include: receiving orders and extracting order information; extracting service provider information and obtaining features of service providers; determining whether the order information matches the features of the service providers, or determining whether the features of the service providers satisfy a preset condition to generate a determination result; ranking the service providers based on the determination result; generating orders to be allocated; and allocating the orders to be allocated to the service providers based on the ranking. The present disclosure also discloses an order allocation system that can perform the method above.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A system, comprising:
at least one storage medium including a set of instructions for order processing; and
logic circuits connected to the at least one storage medium, wherein during operation, the logic circuits load the set of instructions and:
obtain electronic signals from a bus, the electronic signals encoding orders;
extract order information based on the orders;
extract service provider information;
obtain features of service providers;
determine a result as to whether the order information matches the features of the service providers or whether the features of the service providers satisfy a preset condition;
rank the service providers based on the result;
generate orders to be allocated; and
send out electronic signals encoding the orders to be allocated to the service providers based on the ranking.

### Claim 22 (depends on 21)

The system of claim 21, wherein the order information includes a time point, a time interval, a location, and a region.

### Claim 23 (depends on 21)

The system of claim 21, wherein the features of the service providers includes an order similarity, a preference rate, a failure rate, characteristics of responding to orders, and a response time.

### Claim 24 (depends on 23)

The system of claim 23, wherein the order similarity includes a cosine similarity between a historical order and a current order.

### Claim 25 (depends on 23)

The system of claim 23, wherein the preference rate includes a preferential region and a preferential time interval.

### Claim 26 (depends on 23)

The system of claim 23, wherein the logic circuits further:
obtain the preference rate from the service provider or determine the preference rate by the at least one processor.

### Claim 27 (depends on 23)

The system of claim 23, wherein the logic circuits further:
send out electronic signals to access the at least one storage medium to obtain a longitude-latitude coordinate point corresponding to a destination of the order to be allocated;
determine a distance Az between the longitude-latitude coordinate point of the destination of the order to be allocated and a center of a preferential destination region of the service provider;
determine a preference rate L of the service provider for the destination of the order to be allocated based on the distance Az and a covering radius d of the preferential destination region of the service provider, wherein: L=Σ1/(1+eAz-d).

### Claim 28 (depends on 23)

The system of claim 23, wherein to obtain the failure rate, the logic circuits further:
determine the failure rate with a formula as:
Tx=Σi=0kCnk*pk*(1−p)n-k,
wherein Tx represents the failure rate, k represents a number of orders that the service provider x has failed to complete among n orders allocated to the service provider, Cnk represents a number of combinations of selecting k from n, p represents an average failure rate.

### Claim 29 (depends on 23)

The system of claim 23, wherein the logic circuits further:
determine candidate requests from the service providers based on the response times; and
select one request for processing from the candidate requests.

### Claim 30 (depends on 21)

The system of claim 21, wherein the logic circuits further:
determine a geographic region;
determine an order group and a service provider group based on the geographic region;
analyze the order group and the service provider group to determine a completion rate, a success rate for responding to orders, and a receiving-responding rate for orders;
determine a weighted sum of the completion rate, the success rate for responding to orders, and the receiving-responding rate for orders; and
determine a mode for allocating orders based on the weighted sum.

### Claim 31

A method for order processing, comprising:
receiving, by at least one processor, orders;
extracting, by the at least one processor, order information based on the orders;
extracting, by the at least one processor, service provider information;
obtaining, by the at least one processor, features of service providers;
determining, by the at least one processor, a result as to whether the order information matches the features of the service providers or whether the features of the service providers satisfy a preset condition;
ranking, by the at least one processor, the service providers based on the result;
generating, by the at least one processor, orders to be allocated; and
allocating, by the at least one processor, the orders to be allocated to the service providers based on the ranking.

### Claim 32 (depends on 31)

The method for order processing of claim 31, wherein the order information includes a time point, a time interval, a location, and a region.

### Claim 33 (depends on 31)

The method for order processing of claim 31, wherein the features of the service providers include an order similarity, a preference rate, a failure rate, characteristics of responding to orders, and a response time.

### Claim 34 (depends on 33)

The method for order processing of claim 33, wherein the order similarity includes a cosine similarity between a historical order and a current order.

### Claim 35 (depends on 33)

The method for order processing of claim 33, wherein the preference rate includes a preferential region and a preferential time interval.

### Claim 36 (depends on 33)

The method for order processing of claim 33, further comprising:
obtaining, by the at least one processor, the preference rate from the service provider; or
determining, by the at least one processor, the preference rate.

### Claim 37 (depends on 33)

The method for order processing of claim 33, further comprising:
obtaining, by the at least one processor, a longitude-latitude coordinate point corresponding to a destination of the order to be allocated;
determining, by the at least one processor, a distance Az between the longitude-latitude coordinate point of the destination of the order to be allocated and a center of a preferential destination region of the service provider;
determining, by the at least one processor, a preference rate L of the service provider for the destination of the order to be allocated based on the distance Az and a covering radius d of the preferential destination region of the service provider, wherein: L=Σ1/(1+eAz-d).

### Claim 38 (depends on 33)

The method for order processing of claim 33, wherein the obtaining of the failure rate includes determining the failure rate with a formula as:
Tx=Σi=0kCnk*pk*/(1−p)n-k,
wherein Tx represents the failure rate, k represents a number of orders that the service provider x has failed to complete among n orders allocated to the service provider, Cnk represents a number of combinations of selecting k from n, and p represents an average failure rate.

### Claim 39 (depends on 33)

The method for order processing of claim 33, further comprising:
determining, by the at least one processor, candidate requests from the service providers based on the response times; and
selecting, by the at least one processor, one request for processing from the candidate requests.

### Claim 40 (depends on 31)

The method for order processing of claim 31, further comprising:
determining, by the at least one processor, a geographic region;
determining, by the at least one processor, an order group and a service provider group based on the geographic region;
analyzing, by the at least one processor, the order group and the service provider group to determine a completion rate, a success rate for responding to orders, and a receiving-responding rate for orders;
determining, by the at least one processor, a weighted sum of the completion rate, the success rate for responding to orders, and the receiving-responding rate for orders; and
determining, by the at least one processor, a mode for allocating orders based on the weighted sum.