Multi-dimensional physical arrangement techniques using bin-packing with per-branch combination tries
First Claim
1. A computer system comprising a processor for executing program instructions coupled to a memory for storing the program instructions, wherein the program instructions are program instructions for placing objects in partitions of a physical layout, and wherein the program instructions comprise:
- program instructions for first determining requirements vectors corresponding to the objects, wherein the requirements vectors contain values specifying requirements of the object in multiple dimensions; and
program instructions for assigning the objects to the partitions of the physical layout by implementing a bin-packing algorithm that recursively explores partial solutions for assigning the objects to individual ones of the partitions in order to satisfy the requirements vectors for the objects, wherein the bin-packing algorithm extends the partial solutions via the recursion until the requirements in the requirements vectors are met by assignment of the corresponding object to partitions having sufficient resources in the multiple dimensions to meet the values specified in the requirements vectors, wherein the bin-packing algorithm tests requirements vectors of remaining unassigned ones of objects for both assignment and non-assignment to a current individual partition in a current partial solution until the current partial solution becomes a complete solution that satisfies the requirements vectors for the objects.
6 Assignments
0 Petitions
Accused Products
Abstract
A recursive solution to a bin-packing algorithm provides efficient placement of objects in a physical layout. The algorithm determines requirement vectors for the objects that specify requirement for placement of the object in multiple dimensions, thereby forming a multi-dimensional bin-packing problem. The algorithm assigns the objects to physical partitions or “bins” by recursively exploring partial solutions that place the objects in the partitions by extending the partial solutions via recursion until the objects are placed. The bin-packing algorithm tests requirements vectors for remaining unassigned ones of the objects for both assignment and non-assignment to a current partition in a current partial solution until the current partial solution becomes a complete solution that satisfies the requirement vectors for the plurality of objects.
30 Citations
13 Claims
-
1. A computer system comprising a processor for executing program instructions coupled to a memory for storing the program instructions, wherein the program instructions are program instructions for placing objects in partitions of a physical layout, and wherein the program instructions comprise:
-
program instructions for first determining requirements vectors corresponding to the objects, wherein the requirements vectors contain values specifying requirements of the object in multiple dimensions; and program instructions for assigning the objects to the partitions of the physical layout by implementing a bin-packing algorithm that recursively explores partial solutions for assigning the objects to individual ones of the partitions in order to satisfy the requirements vectors for the objects, wherein the bin-packing algorithm extends the partial solutions via the recursion until the requirements in the requirements vectors are met by assignment of the corresponding object to partitions having sufficient resources in the multiple dimensions to meet the values specified in the requirements vectors, wherein the bin-packing algorithm tests requirements vectors of remaining unassigned ones of objects for both assignment and non-assignment to a current individual partition in a current partial solution until the current partial solution becomes a complete solution that satisfies the requirements vectors for the objects. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer program product comprising a computer-readable storage device storing program instructions for placing objects in partitions of a physical layout, wherein the program instructions comprise program instructions for:
-
first determining requirements vectors corresponding to the objects, wherein the requirements vectors contain values specifying requirements of the object in multiple dimensions; and assigning the objects to the partitions of the physical layout by implementing a bin-packing algorithm that recursively explores partial solutions for assigning the objects to individual ones of the partitions in order to satisfy the requirements vectors for the objects, wherein the bin-packing algorithm extends the partial solutions via the recursion until the requirements in the requirements vectors are met by assignment of the corresponding object to partitions having sufficient resources in the multiple dimensions to meet the values specified in the requirements vectors, wherein the bin-packing algorithm tests requirements vectors of remaining unassigned ones of objects for both assignment and non-assignment to a current individual partition in a current partial solution until the current partial solution becomes a complete solution that satisfies the requirements vectors for the objects. - View Dependent Claims (9, 10, 11, 12, 13)
-
Specification