Walmart Apollo, LLC

Prakash Seetharaman

Deepak R Deshpande

Mingang Fu

Devadas Pattathil

Vidyanand Krishnan

Austin Lee Smith

Michael Gilbert Ebener

Arnon Katz

Rohit Jain

Amritayan Nayak

Pushkar Raj Pande

Kumar Malyala

A system including one or more processors and one or more non-transitory storage media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform operations including: receiving an order list for delivery at a delivery address; determining an estimated order collection time; continuously monitoring, in real-time, a respective location of each delivery driver of one or more delivery drivers of at least one delivery service by receiving the respective location of each delivery driver of the one or more delivery drivers from a respective delivery driver electronic device of each delivery driver; and instructing a first delivery driver of the one or more delivery drivers to pick up one or more items in the order list and deliver the one or more items to the delivery address. Other embodiments are disclosed herein.

Systems and methods for automatically invoking a delivery request for an in- progress order

Horizontally-scalable systems and methods for scheduling and optimizing deliveries are described herein. At least one scheduler is configured to receive a request to schedule a delivery for an origination location. The request includes a desired time slot. The request is compared to a persistent delivery snapshot for the origination location to determine availability of the desired time slot. An interim delivery snapshot including the requested delivery is generated when the persistent delivery snapshot has an available time slot corresponding to the desired time slot. At least one optimizer is configured to receive the interim delivery snapshot and generate an updated persistent delivery snapshot by applying an optimization process to the interim delivery snapshot.

Systems and methods for combinatorial resource optimization

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.

Systems and methods for optimizing delivery routes using fleet vehicles and third-party deliverers

Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving a request from a user; determining, using a regression analysis, an estimated order collection time for a collection of the one or more items of the order list by at least one collector; continuously monitoring a respective location of each respective delivery driver; continuously determining a respective estimated order pickup time for each respective delivery driver; and instructing the first delivery driver of the one or more delivery drivers to pick up the one or more items and deliver the one or more items to the delivery address. Other embodiments are disclosed herein.

Systems and methods for automatically invoking a delivery request for an in-progress order

Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving a plurality of website orders on a website of an online retailer for delivery of a plurality of products; determining at least one fleet delivery route for delivery of the plurality of products of the plurality of website orders to a plurality of locations using a vehicle fleet of the online retailer; dynamically shuffling the at least one fleet delivery route, wherein dynamically shuffling the at least one fleet delivery route comprises: selecting a source route from the at least one fleet delivery route; selecting a first order of the plurality of web site orders from the source route, the first order scheduled to be delivered to a first location of the plurality of locations; selecting a destination route from (1) the at least one fleet delivery route and (2) one or more third-party delivery routes; evaluating a cost differential of removing the first order of the plurality of orders from the source route, as selected; and inserting the first order into a first third-party delivery route of the one or more third-party delivery routes when the cost differential of (1) removing the first order from the source route and (2) inserting the first order into the first third-party delivery route satisfies a predetermined cost differential level; and communicating the first order to a first third-party deliverer associated with the first third-party delivery route for delivery at the first location when the cost differential of (1) removing the first order from the source route and (2) inserting the first order into the first third-party delivery route satisfies the predetermined cost differential level. Additional embodiments are disclosed herein.

Systems and methods including one or more processing modules and one or more non-transitory storage modules storing computing instructions configured to run on the one or more processing modules and perform acts of receiving an order request from a customer, transmitting an order list from the order request to an employee of the store for a collection of products on the order list at the store by the employee, determining an estimated order collection time, continuously monitoring an estimated order pickup time for a delivery driver of a third-party delivery service, and, when the estimated order pickup time for the delivery driver is substantially equal to the estimated order collection time, transmitting a delivery request to the third-party delivery service requesting the delivery driver to pick up the products from the store and deliver the products to the delivery address.

Systems and methods including one or more processing modules and one or more non-transitory storage modules storing computing instructions configured to run on the one or more processing modules and perform acts of receiving website orders on a website of an online retailer for delivery of products, determining at least one fleet delivery route for delivery of the products using a vehicle fleet of the online retailer, and performing a randomized node movement on the at least one fleet delivery route to optimize delivery of the products. Performing the randomized node movement can include selecting a source route, selecting a first node from the source route, selecting a destination route from the at least one fleet delivery route and one or more third-party delivery routes, evaluating a cost differential of inserting the first node into a third-party delivery route, and inserting the first node into first third-party delivery route.

Systems and methods including one or more processing modules and one or more non-transitory storage modules storing computing instructions configured to run on the one or more processing modules and perform an act of preparing an initial shortest path matrix including a plurality of elements, an initial number of a plurality of map intersection nodes, and a plurality of full shortest paths between an origination map intersection node and a destination map intersection node. Each element can include a full shortest path, and each full shortest path can include one or more map intersection nodes. The one or more processing modules also can be configured to compress the initial shortest path matrix to form a compressed shortest path matrix that includes a compressed number of the plurality of map intersection nodes that is fewer than the initial number of the plurality of map intersection nodes.

Growing community of inventors

Santa Clara, CA, United States of America

Prakash Seetharaman