Computer-implemented systems and methods for pack optimization
First Claim
Patent Images
1. A computer-implemented method for optimizing a distribution, comprising:
- receiving, using one or more data processors, inner pack definition data identifying a number of items within an inner pack, wherein each item is available in one or more varieties, and wherein the inner pack definition data includes a number of each variety in the inner pack;
receiving, using the one or more data processors, outer pack definition data associating a number of inner packs with an outer pack;
receiving, using the one or more data processors, demand data identifying a predicted demand for each variety of an item at one or more stores;
receiving, using the one or more data processors, one or more constraint values, wherein each constraint value identifies one or more limitations on a planned distribution of packs;
generating, using the one or more data processors, a pack optimization problem using the inner pack definition data, the outer pack definition data, the demand data, and the one or more constraints;
generating, using the one or more data processors, a revised pack optimization problem using one or more heuristics, wherein a heuristic performs a linear programming relaxation upon the pack optimization problem, and wherein solving the revised pack optimization problem requires less computation time than solving the pack optimization problem; and
generating, using the one or more data processors, the planned distribution of packs by solving the revised pack optimization problem, wherein solving includes using a mixed-integer linear programming solver to determine the number of inner packs and the number of outer packs that best fulfill the predicted demand for each of the one or more stores, and wherein solving further includes subtracting an inner pack from a particular store and adding the subtracted inner pack to another store based on a particular constraint value.
1 Assignment
0 Petitions
Accused Products
Abstract
Computer-implemented systems and methods are provided for optimizing the distribution of packs of an item across an entity'"'"'s distribution network. Constraint values may be specified to limit the values that may be included in a planned distribution of packs. Also, heuristics may be used to reduce the computation time required to determine optimal values for a planned distribution of packs. Modeling of the planned distribution of packs and optimization of the number of packs to be distributed can be accomplished using a mixed-integer linear programming solver.
192 Citations
16 Claims
-
1. A computer-implemented method for optimizing a distribution, comprising:
-
receiving, using one or more data processors, inner pack definition data identifying a number of items within an inner pack, wherein each item is available in one or more varieties, and wherein the inner pack definition data includes a number of each variety in the inner pack; receiving, using the one or more data processors, outer pack definition data associating a number of inner packs with an outer pack; receiving, using the one or more data processors, demand data identifying a predicted demand for each variety of an item at one or more stores; receiving, using the one or more data processors, one or more constraint values, wherein each constraint value identifies one or more limitations on a planned distribution of packs; generating, using the one or more data processors, a pack optimization problem using the inner pack definition data, the outer pack definition data, the demand data, and the one or more constraints; generating, using the one or more data processors, a revised pack optimization problem using one or more heuristics, wherein a heuristic performs a linear programming relaxation upon the pack optimization problem, and wherein solving the revised pack optimization problem requires less computation time than solving the pack optimization problem; and generating, using the one or more data processors, the planned distribution of packs by solving the revised pack optimization problem, wherein solving includes using a mixed-integer linear programming solver to determine the number of inner packs and the number of outer packs that best fulfill the predicted demand for each of the one or more stores, and wherein solving further includes subtracting an inner pack from a particular store and adding the subtracted inner pack to another store based on a particular constraint value. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computer-implemented system for optimizing a distribution, comprising:
-
one or more data processors; one or more computer-readable storage mediums containing instructions configured to cause the one or more processors to perform operations including; receiving inner pack definition data identifying a number of items within an inner pack, wherein each item is available in one or more varieties, and wherein the inner pack definition data includes a number of each variety in the inner pack; receiving outer pack definition data associating a number of inner packs with an outer pack; receiving demand data identifying a predicted demand for each variety of an item at one or more stores; receiving one or more constraint values, wherein each constraint value identifies one or more limitations on a planned distribution of packs; generating a pack optimization problem using the inner pack definition data, the outer pack definition data, the demand data, and the one or more constraints; generating a revised pack optimization problem using one or more heuristics, wherein a heuristic performs a linear programming relaxation upon the pack optimization problem, and wherein solving the revised pack optimization problem requires less computation time than solving the pack optimization problem; and generating the planned distribution of packs by solving the revised pack optimization problem, wherein solving includes using a mixed-integer linear programming solver to determine the number of inner packs and the number of outer packs that best fulfill the predicted demand for each of the one or more stores.
-
-
15. A computer-program product for optimizing a distribution, tangibly embodied in a machine-readable non-transitory storage medium, including instructions configured to cause a data processing apparatus to:
-
receive inner pack definition data identifying a number of items within an inner pack, wherein each item is available in one or more varieties, and wherein the inner pack definition data includes a number of each variety in the inner pack; receive outer pack definition data associating a number of inner packs with an outer pack; receive demand data identifying a predicted demand for each variety of an item at one or more stores; receive one or more constraint values, wherein each constraint value identifies one or more limitations on a planned distribution of packs; generate a pack optimization problem using the inner pack definition data, the outer pack definition data, the demand data, and the one or more constraints; generate a revised pack optimization problem using one or more heuristics, wherein a heuristic performs a linear programming relaxation upon the pack optimization problem, and wherein solving the revised pack optimization problem requires less computation time than solving the pack optimization problem; and generate the planned distribution of packs by solving the revised pack optimization problem, wherein solving includes using a mixed-integer linear programming solver to determine the number of inner packs and the number of outer packs that best fulfill the predicted demand for each of the one or more stores. - View Dependent Claims (16)
-
Specification