Walmart Apollo, LLC

Ti Zhang

Mingang Fu

Jing Huang

Kunlei Lian

Tiantian Nie

Yu Zheng

Liqing Zhang

Ming Ni

Xiaojie Wang

A method including obtaining an optimization request at a coordinating engine. The method also can include triggering engines to process the optimization request. At least one of the engines divides the optimization request into subproblems. At least a portion of the engines solve the subproblems. Respective instances of at least one of the engines are triggered to handle respective ones of the subproblems. Each of the engines provides a dynamic algorithmic flow using modularized algorithmic solvers. The dynamic algorithmic flow is adjusted based on a respective input to each of the engines. The method additionally can include outputting, from the coordinating engine, one or more results in response to the optimization request, based on results for the subproblems generated by the engines. Other embodiments are described.

Divide-and-conquer framework and modularized algorithmic scheme for large-scale optimization

A system 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: obtaining a first load plan, wherein the first load plan comprises a set of stacks assigned to floor spots of a trailer; determining that at least one of (a) there is an empty floor spot in the first load plan for the trailer or (b) the first load plan is infeasible; determining a target number of stacks for an updated load plan; iterating, via simulated annealing, through modifications to the updated load plan; terminating the iterating when a predetermined termination criteria is satisfied; and outputting the updated load plan. Other embodiments are disclosed.

Unstacking optimization

Growing community of inventors

Rocklin, CA, United States of America

Ti Zhang