# US 2024/0005265 A1 · Efficient same day package return routing with distributed fleet

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

- Number: US 2024/0005265 A1
- Document ID: US20240005265A1
- Status: Published application
- Kind: A1
- Application number: 18/345,179
- Filed: 2023-06-30
- Published: 2024-01-04
- Earliest claimed: 2022-06-30
- Assignees: DoorDash, Inc.
- Applicants: DoorDash, Inc.
- Inventors: Gagan Gupta; Viraj Bindra; Larry Waldman; Rajat Shroff
- Web page: https://patentgrep.com/patent/US20240005265A1

## CPC

- G06Q 10/08355: {Routing methods}
- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G06Q 10/08345: {Pricing}
- G06Q 10/0837: Return transactions
- 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

A method includes a server computer receiving data relating to a plurality of delivery orders from service providers to end users, and data relating to a plurality of delivery orders from end users to service providers. The server computer determines a plurality of routes corresponding to the plurality of delivery orders. The server computer can then determine a set of optimal route plans by combining delivery order routes. The server computer can then receive acceptances from a plurality of transporters that will execute the set of optimal route plans. The server computer can then facilitate execution of the optimal route plans.

## Claims

### Claim 1

A method comprising:
receiving, by a server computer, data relating to a first plurality of delivery orders from first service providers to first end users, and data relating to a second plurality of delivery orders from second end users to second service providers;
determining, by the server computer, a first plurality of routes corresponding to the first plurality of delivery orders from the first service providers to the first end users;
determining, by the server computer, a second plurality of routes corresponding to the second end users to the second service providers;
determining, by the server computer, a set of optimal route plans by combining one or more of the first plurality of routes and one or more of the second plurality of routes;
receiving, by the server computer, acceptances from one or more transporters that will execute the set of optimal route plans; and
facilitating, by the server computer, execution of the set of optimal route plans.

### Claim 2 (depends on 1)

The method of claim 1, wherein the delivery orders from the second end users to the second service providers are return orders.

### Claim 3 (depends on 2)

The method of claim 2, wherein determining the set of optimal route plans for performing the first plurality of delivery orders from the first service providers and the return orders comprises using a composite scoring algorithm to determine the set of optimal route plans, the composite scoring algorithm comprising a first scoring algorithm that uses a first plurality of metrics to improve delivery efficiencies and a second scoring algorithm that uses a second plurality of metrics to improve return order efficiencies.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
offering, by the server computer, to a first end user of the first end users, a greater discount on a first delivery order provided by a first service provider of the first service providers that is closer to a route corresponding to a return order associated with a second end user of the second end users, than a second delivery order provided by a second service provider that is further from the route corresponding to the return order.

### Claim 5 (depends on 1)

The method of claim 1, wherein the second plurality of delivery orders from the second end users to the second service providers comprise dry cleaning delivery requests, person to person delivery requests, and donation delivery requests.

### Claim 6 (depends on 1)

The method of claim 1, wherein the data relating to the second plurality of delivery orders include delivery time ranges.

### Claim 7 (depends on 1)

The method of claim 1, wherein the data of each of the second plurality of delivery orders comprises a pickup location and a drop-off location.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
generating, by the server computer, a delivery order bundle comprising one or more of the plurality of first delivery orders and one of more of the second plurality of delivery orders, the delivery order bundle being based at least on the pickup locations and/or drop-off locations associated with the one or more of the first plurality of delivery orders and the one or more of the second plurality of delivery orders.

### Claim 9 (depends on 8)

The method of claim 8, wherein after generating the delivery order bundle, the method further comprises:
identifying, by the server computer, one or more transporter user devices that are proximate to a pickup location of an item associated with the one or more of the first plurality of delivery orders, or the one or more of the second plurality of delivery orders.

### Claim 10 (depends on 1)

The method of claim 1, wherein the data relating to the first plurality of delivery orders is received from delivery applications installed on one or more end user devices or a website accessed by the one or more end user devices.

### Claim 11 (depends on 1)

The method of claim 1, wherein facilitating the execution of the set of optimal route plans further comprises:
notifying, by the server computer, one or more end user devices and/or one or more service provider computers associated with an optimal route plan associated with an acceptance by a transporter.

### Claim 12 (depends on 1)

The method of claim 1, wherein facilitating the execution of the set of optimal route plans further comprises:
tracking, by the server computer, progress of a transporter user device of a transporter that accepted an optimal route plan along the optimal route plan; and
notifying, by the server computer, one or more end user devices and/or one or more service provider computers associated with the optimal route plan of the progress.

### Claim 13

A server computer comprising:
a processor; and
a computer-readable medium coupled to the processor, the computer-readable medium comprising code executable by the processor for implementing a method comprising:
receiving data relating to a first plurality of delivery orders from first service providers to first end users, and data relating to a second plurality of delivery orders from second end users to second service providers;
determining a first plurality of routes corresponding to the first plurality of delivery orders from the first service providers to the first end users;
determining a second plurality of routes corresponding to the second end users to the second service providers;
determining a set of optimal route plans by combining one or more of the first plurality of routes and one or more of the second plurality of routes;
receiving acceptances from one or more transporters that will execute the set of optimal route plans; and
facilitating execution of the set of optimal route plans.

### Claim 14 (depends on 13)

The server computer of claim 13, wherein the method further comprises:
generating, by the server computer, a delivery order bundle comprising one or more of the plurality of first delivery orders and one of more of the second plurality of delivery orders, the delivery order bundle being based on at least the pickup locations and/or drop-off locations associated with the one or more of the first plurality of delivery orders and the one or more of the second plurality of delivery orders.

### Claim 15 (depends on 14)

The server computer of claim 14, wherein the second plurality of delivery orders comprise item return requests.

### Claim 16 (depends on 13)

The server computer of claim 13, wherein the first plurality of delivery orders comprise food delivery orders.

### Claim 17 (depends on 13)

The server computer of claim 13, wherein facilitating the execution of the set of optimal route plans further comprises:
notifying one or more end user devices and/or one or more service provider computers associated with an optimal route plan of an acceptance by a transporter;
tracking progress of a transporter user device of the transporter that accepted the optimal route plan along the optimal route plan; and
notifying the one or more end user devices and/or the one or more service provider computers associated with the optimal route plan of the progress.

### Claim 18

A method comprising:
accessing, by a transporter user device, a delivery platform that includes a set of optimal route plans from a central server computer;
selecting, by the transporter user device, an optimal route plan of the set of optimal route plans;
providing, by the transporter user device, an acceptance of the optimal route plan that indicates that a transporter of the transporter user device is to execute the optimal route plan; and
notifying, by the transporter user device, the central server computer of progress of the transporter along the optimal route plan.

### Claim 19 (depends on 18)

The method of claim 18, wherein the set of optimal route plans are generated by the central server computer based on a plurality of delivery orders, wherein the delivery orders are dry cleaning requests, P2P deliveries, donation, and return orders.

### Claim 20 (depends on 18)

The method of claim 18, wherein the central server computer receives data relating to a first plurality of delivery orders from first service providers to first end users, and data relating to a second plurality of delivery orders from second end users to second service providers; determines a first plurality of routes corresponding to the first plurality of delivery orders; determines a second plurality of routes corresponding to the second plurality of delivery orders; and determines the set of optimal route plans by combining one or more of the first plurality of routes and one or more of the second plurality of routes; receives acceptances from a plurality of transporters that will execute the set of optimal route plans; and facilitates execution of the set of optimal route plans.
