Unlock instant, AI-driven research and patent intelligence for your innovation.
Method for storing batch objects through batch containers
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
An object and container technology, applied in the field of computer optimization, can solve problems such as box waste, reduce the number of boxes, improve the utilization rate of boxes, and improve the effect of boxing
Active Publication Date: 2021-10-08
EAST CHINA NORMAL UNIVERSITY
View PDF8 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
But since the size of the item is randomly generated, when t i (No more than ) of type a i When packing, if there is no K-t i K-t i For items of type -1, a i Can only fit into B with Next Fit 2 , but apparently a i with K-t i Items of type -1 have a utilization ratio of at least is also good
Additionally, when item a i with a j The type satisfies t i +t j = K, there is Therefore a i with a j It is possible to place items of type 1 in paired boxes, so closing the box after paired boxing may cause a certain amount of waste
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0108] like figure 1 As shown, an online binning method OnGPA, that is, the algorithm presses a 1 ,...,a n Pack each item in the order of , and in the pair a 1 When packing a 1 ,…,a i-1 The boxing position of w cannot be changed, w i+1 ,...,w n Sequence unknown. It is stipulated here that K is an odd number. The method mainly includes the following steps:
[0109] S101, K=K+1-K%2, set the iteration variable i=1.
[0110] S102. When i≤n, execute S103 for a i Carry out packing, otherwise execute S110.
[0111] S103. Calculate a i of type t if Execute S104, otherwise execute S105.
[0112] S104, open an empty box b, a i put into b, add b to B 1 end of , assuming b is B 1In the p-th box, add p to the sequence Q t in, that is, Q t Recorded B 1 The subscript of the box whose type is t, go to S109.
[0113] S105, record y=K-t, Follow Q y ,...,Q z Sequentially find the first non-empty set Q x .
[0114] S106. If there is x that satisfies the condition, execu...
Embodiment 2
[0121] like figure 2 As shown, an offline box packing method OffGPA, that is, before loading items, the sequence w 1 ,...,w n It is known.
[0122] according to a 1 ,...,a n Each item is boxed in order of . I x The definition of (1≤x≤K), for all items a with 1≤i≤n i type of t i . The method mainly includes the following steps:
[0123] S101. For all 1≤i≤n, calculate a i type of t i .
[0124] S102. Command set S x ={i|t i =x}, representing the set of subscripts of items of type x. will satisfy |S x |>0 and The x is inserted into a balanced binary tree KTree, where |S x | represents the set S x the number of elements. The tree records those types that are small (no more than ) and a collection of non-empty types.
[0125] S103. Pack items of type K, that is, for all i∈S K , will a i Pack into an empty box b, put b into B 1 tail of , and close b.
[0126] S104. Let the iteration variable t=K-1.
[0127] S105, when , execute S106 for S t The elemen...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention discloses a method for storing batch objects through batch containers. The method comprises the following steps: acquiring information of to-be-stored objects and information of to-be-stored containers; grouping a plurality of containers, performing interval division on the capacity of a single container, and defining the type of a to-be-stored object in combination with the information of the to-be-stored object; obtaining the type number of containers which can be adapted to the object; obtaining the maximum number of objects which can be placed in a single container; constructing an adaptationalgorithm of the to-be-stored objects and the containers on the basis of the type number of the containers which can be adapted to the objects and the maximum number of the objects which can be placed in a single container, and storing the to-be-stored objects into the adapted containers after the to-be-stored objects are adapted to the containers in a selected container group; and storing the unadapted to-be-stored objects in the containers in the non-selected container group by using the adaptationalgorithm. The operation time and effect of the algorithm can be balanced, and a storage result with better comprehensive performance is obtained.
Description
technical field [0001] The invention relates to the technical field of computer optimization, in particular to a method for storing batch objects through batch containers. Background technique [0002] Packing algorithms are used in many practical applications, including blanking problems, transportation problems, cloud storage, etc., for example, the problem of container stacking on the dock, the problem of loading in containers, and the problem of product inventory storage in industry , Cloud disk storage problems in cloud computing, etc., all need to use the box packing problem. [0003] The classic box packing problem is formulated as follows: Given a sequence of n items L=L n =(a 1 ,...,a n ), whose size is w 1 ,...,w n , and for all 1≤i≤n, 0<w i ≤C. Now to put items into a box with a capacity of C, it is required to use as few boxes as possible while meeting the box capacity requirements. According to whether the algorithm predicts the size of all items, the...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More