Walmart Apollo, LLC

Devadas Pattathil

Mingang Fu

Deepak R Deshpande

Prakash Seetharaman

Rahul Ramkumar

Gaurav Agarwal

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 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.

In some embodiments, a method can comprise retrieving an inventory layout of a facility and determining multiple pick lists at the facility. A first pick list for a first user and a second pick list of a second user each comprise a first common item. Receiving a first indication from the first mobile device that the first common item is not available at the facility. Analyzing a first set of rules of a substitute system to locate a first substitute item that is within a first predetermined percentage of a size of the first common item. After analyzing the first set of rules, automatically sending instructions to transfer the first route and the first pick list to the first mobile device.

Systems and methods for order filling

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.

In some embodiments, a method can comprise receiving a request for one or more orders, and analyzing the one or more orders. Each of the one or more orders can comprise one or more items and at least a portion of the one or more items are available at a warehouse. The method can further comprise determining one or more pick lists based at least in part on the analyzing the one or more orders and also based at least in part on an inventory layout of the warehouse, determining a first route for a first pick list of the one or more pick lists, and determining a second route for a second pick list of the one or more pick lists, wherein the first pick list and the second pick list each comprise a first common item. Other embodiments of related methods and systems are also provided.

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

San Jose, CA, United States of America

Devadas Pattathil