Framework for optimized packing of items into a container
AssigneeOracle International Corporation
InventorSundararajan Arunapuram
Life of this patent
Estimating the term…
Abstract
One embodiment is directed to a method of optimally packing items into at least one resource. The method includes receiving at least one of items, resources, and parameters, and setting up a set partitioning mixed integer programming (MIP) using the received items, resources, and parameters. The method further includes solving liner programming (LP) relaxation of the MIP, generating new packings, and checking whether new packings have been generated. When no new packings have been generated, solving the final MIP and creating a model of at least one resource packed according to the final MIP.
Claims20
A non-transitory computer readable medium storing instructions that, when executed by a processor, perform a process for optimally packing items into at least one resource, the process comprising:
- receiving at least one of items, resources, or parameters;
- setting up a set partitioning mixed integer programming (MIP) using the received items, resources, or parameters;
- solving a linear programming (LP) relaxation of the MIP;
- generating new packings;
- checking whether new packings have been generated;
- when no new packings have been generated,
- solving a final MIP;
- and
- creating a model of the at least one resource packed according to the final MIP.
An apparatus, comprising:
- at least one processor;
- and
- at least one memory including computer program code,
- the at least one memory and the computer program code configured, with the at least on processor, to cause the apparatus at least to
- receive at least one of items, resources, or parameters;
- setup a set partitioning mixed integer programming (MIP) using the received items, resources, or parameters;
- solve a linear programming (LP) relaxation of the MIP;
- generate new packings;
- check whether new packings have been generated;
- when no new packings have been generated,
- solve a final MIP;
- and
- create a model of the at least one resource packed according to the final MIP.
A computer-implemented method of optimally packing items into at least one resource, the method comprising:
- receiving at least one of items, resources, or parameters;
- setting up a set partitioning mixed integer programming (MIP) using the received items, resources, or parameters;
- solving a linear programming (LP) relaxation of the MIP;
- generating new packings;
- checking whether new packings have been generated;
- when no new packings have been generated,
- solving a final MIP;
- and
- creating a model of the at least one resource packed according to the final MIP.
Dependencies are inferred from the claim text.