# US 2023/0058078 A1 · Systems and methods for optimizing delivery routes using fleet vehicles and third-party deliverers

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

- Number: US 2023/0058078 A1
- Document ID: US20230058078A1
- Status: Published application
- Kind: A1
- Application number: 17/982,394
- Filed: 2022-11-07
- Published: 2023-02-23
- Earliest claimed: 2016-12-06
- Assignees: Walmart Apollo, LLC
- Applicants: Walmart Apollo, LLC
- Inventors: Mingang Fu; Deepak Deshpande; Prakash Seetharaman; Devadas Pattathil
- Web page: https://patentgrep.com/patent/US20230058078A1

## CPC

- G06Q 10/08355: {Routing methods}
- 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

Systems and methods including one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform functions comprising: determining at least one fleet delivery route for delivery of one or more items of one or more orders to one or more locations using a vehicle fleet; dynamically shuffling the at least one fleet delivery route by at least evaluating a cost differential; when the cost differential satisfies a threshold: removing the first order from the source route; inserting the first order into the first other delivery route; and communicating the first order to a first other deliverer associated with the first other delivery route. Additional embodiments are disclosed herein.

## Claims

### Claim 1

A system comprising:
one or more processors; and
one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform functions comprising:
determining at least one fleet delivery route for delivery of one or more items of one or more orders to one or more locations using a vehicle fleet;
dynamically shuffling the at least one fleet delivery route by at least evaluating a cost differential between (a) removing a first order of the one or more orders from a source route, and (b) inserting the first order into a first other delivery route of one or more other delivery routes;
when the cost differential satisfies a threshold:
removing the first order from the source route;
inserting the first order into the first other delivery route; and
communicating the first order to a first other deliverer associated with the first other delivery route for delivery of the first order at a first location of the one or more locations.

### Claim 2 (depends on 1)

The system of claim 1, wherein dynamically shuffling the at least one fleet delivery route comprises:
selecting the source route from the at least one fleet delivery route;
selecting the first order of the one or more orders from the source route, wherein the first order is scheduled to be delivered to the first location of the one or more locations as part of the at least one fleet delivery route and before dynamically shuffling the at least one fleet delivery route; and
selecting, using a random number generator, the first other delivery route associated with the first other deliverer of one or more other deliverers from the one or more other delivery routes.

### Claim 3 (depends on 1)

The system of claim 1, wherein evaluating the cost differential comprises using simulated annealing.

### Claim 4 (depends on 1)

The system of claim 1, wherein the computing instructions, when executed on the one or more processors, further cause the one or more processors to perform functions comprising:
receiving the one or more orders;
determining whether an additional order of the one or more orders are for delivery at an additional location of the one or more locations that is within (i) a predetermined distance from the first location for the first order or (ii) a predetermined traveling time from the first location for the first order;
when the additional order is for delivery at the additional location that is within at least the predetermined distance or the predetermined traveling time, removing the additional order from the at least one fleet delivery route; and
communicating the additional order to the first other deliverer for delivery of the additional order at the additional location.

### Claim 5 (depends on 4)

The system of claim 4, wherein receiving the one or more orders, determining the at least one fleet delivery route, dynamically shuffling the at least one fleet delivery route, and communicating the first order to the first other deliverer are performed in real-time.

### Claim 6 (depends on 1)

The system of claim 1, wherein the first other deliverer comprises a commercial delivery service or a crowdsourced delivery service that does not use the vehicle fleet.

### Claim 7 (depends on 1)

The system of claim 1, wherein determining the at least one fleet delivery route comprises using a heuristic greedy insertion algorithm.

### Claim 8 (depends on 1)

The system of claim 1, wherein:
the at least one fleet delivery route comprises a plurality of nodes; and
each node of the plurality of nodes comprises a different location of the one or more locations.

### Claim 9 (depends on 8)

The system of claim 8, wherein dynamically shuffling the at least one fleet delivery route further comprises:
performing a randomized node movement on the at least one fleet delivery route.

### Claim 10 (depends on 8)

The system of claim 8, wherein inserting the first order into the first other delivery route comprises:
upon removing a first node of the plurality of nodes from the source route, inserting the first node of the plurality of nodes into the first other delivery route of the one or more other delivery routes, when inserting the first node into the first other delivery route satisfies the threshold of the cost differential.

### Claim 11

A method being implemented via execution of computing instructions configured to run on one or more processors and stored at one or more non-transitory computer-readable media, the method comprising:
determining at least one fleet delivery route for delivery of one or more items of one or more orders to one or more locations using a vehicle fleet;
dynamically shuffling the at least one fleet delivery route by at least evaluating a cost differential between (a) removing a first order of the one or more orders from a source route, and (b) inserting the first order into a first other delivery route of one or more other delivery routes;
when the cost differential satisfies a threshold:
removing the first order from the source route;
inserting the first order into the first other delivery route; and
communicating the first order to a first other deliverer associated with the first other delivery route for delivery of the first order at a first location of the one or more locations.

### Claim 12 (depends on 11)

The method of claim 11, wherein dynamically shuffling the at least one fleet delivery route comprises:
selecting the source route from the at least one fleet delivery route;
selecting the first order of the one or more orders from the source route, wherein the first order is scheduled to be delivered to the first location of the one or more locations as part of the at least one fleet delivery route and before dynamically shuffling the at least one fleet delivery route; and
selecting, using a random number generator, the first other delivery route associated with the first other deliverer of one or more other deliverers from the one or more other delivery routes.

### Claim 13 (depends on 11)

The method of claim 11, wherein evaluating the cost differential comprises using simulated annealing.

### Claim 14 (depends on 11)

The method of claim 11, further comprising:
receiving the one or more orders;
determining whether an additional order of the one or more orders are for delivery at an additional location of the one or more locations that is within (i) a predetermined distance from the first location for the first order or (ii) a predetermined traveling time from the first location for the first order;
when the additional order is for delivery at the additional location that is within at least the predetermined distance or the predetermined traveling time, removing the additional order from the at least one fleet delivery route; and
communicating the additional order to the first other deliverer for delivery of the additional order at the additional location

### Claim 15 (depends on 14)

The method of claim 14, wherein receiving the one or more orders, determining the at least one fleet delivery route, dynamically shuffling the at least one fleet delivery route, and communicating the first order to the first other deliverer are performed in real-time.

### Claim 16 (depends on 11)

The method of claim 11, wherein the first other deliverer comprises a commercial delivery service or a crowdsourced delivery service that does not use the vehicle fleet.

### Claim 17 (depends on 11)

The method of claim 11, wherein determining the at least one fleet delivery route comprises using a heuristic greedy insertion algorithm.

### Claim 18 (depends on 11)

The method of claim 11, wherein:
the at least one fleet delivery route comprises a plurality of nodes; and
each node of the plurality of nodes comprises a different location of the one or more locations.

### Claim 19 (depends on 18)

The method of claim 18, wherein dynamically shuffling the at least one fleet delivery route further comprises:
performing a randomized node movement on the at least one fleet delivery route.

### Claim 20 (depends on 18)

The method of claim 18 wherein inserting the first order into the first other delivery route comprises:
upon removing a first node of the plurality of nodes from the source route, inserting the first node of the plurality of nodes into the first other delivery route of the one or more other delivery routes, when inserting the first node into the first other delivery route satisfies the threshold of the cost differential.
