CN110070246B - Method and device for generating boxing scheme - Google Patents
Method and device for generating boxing scheme Download PDFInfo
- Publication number
- CN110070246B CN110070246B CN201810068705.5A CN201810068705A CN110070246B CN 110070246 B CN110070246 B CN 110070246B CN 201810068705 A CN201810068705 A CN 201810068705A CN 110070246 B CN110070246 B CN 110070246B
- Authority
- CN
- China
- Prior art keywords
- boxing
- maximum storage
- box
- articles
- actual
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 24
- 238000004590 computer program Methods 0.000 claims description 9
- 230000002159 abnormal effect Effects 0.000 abstract description 10
- 238000012856 packing Methods 0.000 description 26
- 238000010586 diagram Methods 0.000 description 13
- 238000004891 communication Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 230000000694 effects Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 238000012423 maintenance Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000004806 packaging method and process Methods 0.000 description 5
- 206010033307 Overweight Diseases 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000005192 partition Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 238000005303 weighing Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 239000000945 filler Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Container Filling Or Packaging Operations (AREA)
Abstract
The embodiment of the invention provides a method and a device for generating a boxing scheme, which can adaptively maintain the maximum storage capacity of each article, and provide a boxing scheme for selecting the specification and the filling quantity of containers, thereby reducing the abnormal kicking rate and increasing the filling level of a vertical warehouse. The generating method comprises the following steps: acquiring selectable box information and article information, wherein the article information comprises the number of articles and the maximum storage capacity, and the maximum storage capacity refers to the maximum number of one grid of a container of a certain box type; and generating a boxing scheme by using a recommendation algorithm according to the selectable box type information and the relation between the number of the articles and the maximum storage capacity.
Description
Technical Field
The invention relates to the field of warehouse logistics, in particular to a method and a device for generating a boxing scheme.
Background
In warehouse management, it is necessary to put items in a vertical warehouse. When articles are put into the vertical warehouse, firstly, the articles are usually required to be put into specific containers, then the containers are put on a conveying line, and finally, the automatic putting into the vertical warehouse is completed. Generally, the container can be designed into different specifications according to different articles. Taking the following three specifications as examples: 1/1, 1/2, 1/4, wherein 1/1 may represent no partition in the container; 1/2 means that the container is provided with a baffle plate which divides the container into two parts in equal proportion; 1/4 means that there are three baffles in the vessel, dividing the vessel into four parts in equal proportion. Each portion separated by a partition is referred to as a cell, i.e., 1/1 has one cell, 1/2 has two cells, and 1/4 has four cells.
When filling the container with the articles, it is generally set that only one article is stored in each compartment, and the vertical warehouse has a limit to the height and weight of the container. If the super-high type garage is ultrahigh, overweight can be kicked out abnormally, and the garage cannot be put into a vertical warehouse normally. Therefore, how to reduce the abnormal kicking rate becomes an important problem for improving the work efficiency of the boxing personnel.
In the prior art, the boxing is typically performed manually by a boxer, and the filling quantity and boxing scheme are estimated manually. However, since the packer cannot accurately calculate how many articles the container can be filled, the following problems are liable to occur:
1. Excessive filling results in the container being too high and overweight, and is abnormally kicked out;
2. Too little filling, thereby reducing the filling level of the storage site of the vertical warehouse;
3. the manual maintenance of the container loading by the cartoning personnel is too labor intensive.
Disclosure of Invention
In view of this, the embodiments of the present invention provide a method and an apparatus for generating a boxing scheme, which can adaptively maintain the maximum storage amount of each article, and provide a boxing scheme for selecting the specification and the filling amount of containers, so as to reduce the abnormal kick rate and increase the filling level of the vertical warehouse.
In order to achieve the above object, according to an aspect of the embodiment of the present invention, there is provided a method for generating a boxing scheme.
The method for generating the boxing scheme comprises the following steps: acquiring selectable box information and article information, wherein the article information comprises the number of articles and the maximum storage capacity, and the maximum storage capacity refers to the maximum number of one grid of a container of a certain box type; and generating a boxing scheme by using a recommendation algorithm according to the selectable box type information and the relation between the number of the articles and the maximum storage capacity.
Optionally, the generating method further includes: after the articles are boxed according to the boxing scheme, the actual maximum storage amount after boxing is obtained, and the maximum storage amount of the articles is updated by utilizing the actual maximum storage amount.
Optionally, in the generating method, the selectable box information is sorted according to the number of the grids from small to large, the larger the number is, the smaller the maximum storage amount of the article is, and updating the maximum storage amount of the article by using the actual maximum storage amount comprises: and determining box type information corresponding to the actual maximum storage amount of the article, and updating the actual maximum storage amount of the preset multiple to the maximum storage amount of the article corresponding to the previous box type of the current box type.
Optionally, generating the boxing scheme by using a recommendation algorithm according to the selectable box type information and the relation between the number of the articles and the maximum storage amount comprises: determining an actual boxing box type from the selectable box types according to the size relation between the number of the articles and the maximum storage capacity; generating sub-boxing schemes of the actual boxing boxes by using the maximum storage amount of the articles corresponding to the actual boxing boxes; the set of sub-packing schemes for each actual packing box is referred to as a packing scheme.
Optionally, the sub-boxing scheme for actually boxing the box-type container comprises: the total number of the required openings of the box, the maximum filling number of one opening of the box, and the filling number when the last opening of the box does not reach the maximum filling number.
In the embodiment of the invention, the quantity of the articles can be automatically acquired from the outside through manual input acquisition by a boxer, the selectable box type information can be selected and input by the boxer to form a selectable box type set (in the selectable box type set, selectable box types can be ordered according to the number of the grids from small to large, the larger the number of the grids is, the smaller the maximum storage quantity of the articles is), and the set of the maximum storage quantity corresponding to the containers of each box type can be obtained through the input of the article codes by the boxer and is obtained through the inquiry of a database. If the maximum storage amount is not full, the recommendation of the packing scheme is not made, and the parameters are prompted to be empty. For example: if the user selects 1/1 and 1/4 of the box sets, and the maximum storage amount data of 1/4 is empty, prompting that the maximum storage amount of 1/4 of the boxes is empty, and requesting self-boxing. And after the boxed container passes the verification, updating the maximum storage capacity of the box type into the database. In the embodiment of the invention, the specification of the box type is not limited to the existing ones, and the box type with other specifications can be added appropriately according to actual requirements.
Optionally, the specific steps of the recommendation algorithm are as follows:
1. and acquiring input parameters, namely the optional box type set and the article information obtained in the previous step.
2. And obtaining the number of types of the selectable boxes, and if the number of types of the selectable boxes is equal to 1, the selectable boxes are actual boxing boxes. If the number of the articles is smaller than the maximum storage amount of the current box, the total number of the required box grids is 1, the maximum filling number of one grid of the box is 0, and the filling number when the last grid of the box does not reach the maximum filling number is the number of the articles; if the number of items is greater than the maximum storage of the current bin, then the total number of bins for the bin is the quotient of the number of items divided by the maximum storage of the current bin (where quotient is an integer), the maximum loading number for one bin of the bin is the maximum storage of the current bin, and the loading number when the last bin of the bin has not reached the maximum loading number is the remainder of the number of items divided by the maximum storage of the current bin, then the total number of bins for the bin is equal to the quotient obtained above plus 1 if the loading number when the last bin of the bin has not reached the maximum loading number is equal to 0. And (3) enabling the sub-boxing scheme of the actual boxing box type container to be equal to the calculated numerical value, enabling the boxing scheme to be equal to the sub-boxing scheme of the actual boxing box type container, returning to the boxing scheme, and ending the algorithm.
3. If the number of types of the selectable boxes is greater than 1, the 1 st box is made to be the actual boxing box which is currently selected.
4. The total number of the required grid ports of the current box is the quotient (the quotient is an integer here) of dividing the number of the articles by the maximum storage capacity of the current box, and the remainder of dividing the number of the articles by the maximum storage capacity of the current box is the number of new articles, and the remainder is taken as a parameter of subsequent calculation. If the quotient of the number of items divided by the maximum storage of the current bin is equal to 0, the maximum packing number of one bin of the bin is equal to 0, otherwise the maximum packing number of one bin of the bin is equal to the maximum storage of the current bin.
5. If the number of the articles calculated in the step4 is equal to 0, the filling number when the last grid of the box is not equal to the maximum filling number is equal to 0, outputting a sub-box filling scheme of the container of the actual box filling box, returning to the box filling scheme, and ending the algorithm.
6. If the number of the articles calculated in the step 4 is not equal to 0 and is greater than or equal to (the maximum storage capacity of the current box divided by 2) a downward rounding value, the total number of the required boxes is equal to the calculated result in the step 4 plus 1, the filling number when the last box does not reach the maximum filling number is equal to the number of the articles calculated in the step 4, the calculated value of the sub-boxing scheme of the container of the actual boxing box at the moment is output, the boxing scheme is equal to the sub-boxing scheme of the container of the actual boxing box, the boxing scheme is returned, and the algorithm is finished.
7. If the number of the articles calculated in the step 4 is not equal to 0 and is smaller than (the maximum storage amount of the current box divided by 2) the value rounded downwards, the filling amount when the last grid of the box does not reach the maximum filling amount is equal to 0, the calculated value of the sub-packing scheme of the container of the actual box is output, and the packing scheme is equal to the sub-packing scheme of the container of the actual box.
And enabling the next box type of the current box type to be used as a new current box type. If the sequence number of the current bin in the set of selectable bins is not equal to the number of selectable bins minus 1, returning to step 4, otherwise, continuing the next step.
8. If the number of the articles calculated in the step 4 is smaller than the maximum storage amount of the current box type selected in the step 7, the total number of the required grid openings of the current box type is equal to 1, the maximum filling number of one grid opening of the box type is 0, and the filling number when the last grid opening of the current box type does not reach the maximum filling number is the number of the articles calculated in the step 4; if not, the total number of the required openings of the current box is the quotient (the quotient is an integer) obtained by dividing the number of the articles calculated in the step 4 by the maximum storage amount of the current box, the maximum filling number of one opening of the current box is the maximum storage amount of the current box, and the filling number when the last opening of the box does not reach the maximum filling number is the remainder of dividing the number of the articles calculated in the step 4 by the maximum storage amount of the current box. If the remainder of dividing the number of articles calculated in the step 4 by the maximum storage amount of the current box is 0, adding 1 to the total number of the grids of the current box. Outputting the sub-boxing scheme of the current box type, enabling the sub-boxing scheme of the current box type and the sub-boxing scheme obtained in the step 7 to form a boxing scheme together for outputting, and ending the algorithm.
In order to achieve the above object, according to another aspect of the embodiments of the present invention, there is provided a generating device of a boxing scheme.
The generating device of the boxing scheme comprises the following steps: the system comprises an acquisition module, a storage module and a storage module, wherein the acquisition module is used for acquiring selectable box information and article information, the article information comprises the number of articles and the maximum storage capacity, and the maximum storage capacity refers to the maximum number of one grid of a container of a certain box type; and the generation module is used for generating a boxing scheme by using a recommendation algorithm according to the selectable box type information and the relation between the number of the articles and the maximum storage capacity.
Optionally, the generating device further includes: and the updating module is used for acquiring the actual maximum storage amount after the articles are boxed according to the boxing scheme, and updating the maximum storage amount of the articles by utilizing the actual maximum storage amount.
Optionally, in the generating device, the selectable box information is sorted according to the number of the grids from small to large, the larger the number is, the smaller the maximum storage amount of the article is, and the updating module is further configured to: and determining the box type information corresponding to the actual maximum storage amount of the article, and updating the actual maximum storage amount of the preset multiple to the maximum storage amount of the article corresponding to the box type before the current box type.
Optionally, the generating module is further configured to: determining an actual boxing box type from the selectable box types according to the size relation between the number of the articles and the maximum storage capacity; generating sub-boxing schemes of the actual boxing boxes by using the maximum storage amount of the articles corresponding to the actual boxing boxes; the set of sub-packing schemes for each actual packing box is referred to as a packing scheme.
Optionally, the sub-boxing scheme for actually boxing the box-type container comprises: the total number of the required openings of the box, the maximum filling number of one opening of the box, and the filling number when the last opening of the box does not reach the maximum filling number.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided an electronic device.
An electronic device of an embodiment of the present invention includes: one or more processors; and the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the generation method of the boxing scheme.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided a computer-readable medium.
A computer readable medium of an embodiment of the present invention has stored thereon a computer program which, when executed by a processor, implements a method of generating a packaging scheme of an embodiment of the present invention.
One embodiment of the above invention has the following advantages or benefits: because the technical means of how to select the specification of the containers and the boxing scheme of the filling quantity of each container are provided according to the relation between the quantity of the articles and the maximum storage quantity and the selectable box type information, the technical problems of large workload of manually maintaining the filling quantity of the containers and inaccurate calculation are solved, the automatic boxing scheme recommendation is further achieved, the abnormal kicking rate of the containers is reduced, and the efficiency of putting the articles into a vertical warehouse is improved; the embodiment of the invention can automatically maintain the maximum storage capacity of the articles, so that the work of manually maintaining the maximum storage capacity is reduced, and meanwhile, the maximum storage capacity data of all the articles can be gradually perfected along with the time without manual maintenance; in view of the fact that the selectable box type information is ordered from small to large according to the number of the grid openings, the larger the number is, the smaller the maximum storage amount of the articles is, therefore, the maximum storage amount of containers with other specifications is maintained according to preset multiple, the technical effect that the maximum storage amounts of all articles corresponding to all boxes in the selectable box type set are perfected according to the maximum storage amount of individual box types can be achieved, and the maximum storage amount multiple is preset, so that the maximum storage amount data system of the articles can be accurately determined; the sub-boxing scheme set of the containers with the optional boxes is used as a boxing scheme for recommendation, so that the boxing strategy of the articles can be flexibly recommended according to the optional box set, and the boxing requirements of different articles can be met.
Further effects of the above-described non-conventional alternatives are described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main steps of a method of generating a packaging solution according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a method of generating a packing solution to implement a process of article entry into a vertical warehouse in accordance with an embodiment of the present invention;
FIG. 3 is a flow chart of generating a boxing scheme using a recommendation algorithm in a method of generating a boxing scheme in accordance with an embodiment of the present invention;
FIG. 4 is a schematic diagram of the main modules of a generating device of a boxing scheme in accordance with embodiments of the present invention;
FIG. 5 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
fig. 6 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In the embodiment of the invention, in order to solve the problems of large manual workload, high abnormal extraction rate and low vertical warehouse filling level in the existing boxing scheme, the self-adaptive recommendation algorithm is provided, the maximum storage capacity of each article can be automatically maintained according to the boxing scheme generation process, and a recommendation scheme for how to select the specification and the filling quantity of the container is provided for a boxing member, so that the abnormal kicking rate can be reduced, the filling level of the vertical warehouse can be increased, and the maximum filling quantity of each article can be adaptively updated without manual maintenance.
The following are major term interpretations referred to in the embodiments of the present invention:
/: representing integer division;
Percent: representing remainder;
And (3) standing a warehouse: an apparatus for storing items;
Conveying line: the equipment for connecting the vertical warehouse and the packing table can transmit the share container to equipment beside the vertical warehouse;
A shartle container: a container for storing articles in the vertical warehouse, namely a container which can be used in the embodiment of the invention;
Bar code scanning device: a scanning device can identify the marks (such as two-dimension codes, bar codes, etc.) of a shortcut container and check the weight and the volume of the shortcut container;
visual equipment: an apparatus for checking whether a shortcut container is ultrahigh;
Weighing equipment: an apparatus for checking whether a shed container is overweight;
The boxing personnel: the items are loaded into a shed container and the container is delivered to warehouse personnel of the conveyor line.
Fig. 1 is a schematic diagram of main steps of a method for generating a boxing scheme according to an embodiment of the present invention, as shown in fig. 1, the method for generating a boxing scheme according to the embodiment of the present invention mainly includes the following steps:
Step S101: optional bin information and item information are obtained, the item information including a number of items and a maximum storage, wherein the maximum storage refers to a maximum number of one bin of a container of a certain bin type into which an item can be loaded.
Step S102: and generating a boxing scheme for the articles by using a recommendation algorithm according to the selectable box type information and the relation between the number of the articles and the maximum storage amount. The method specifically comprises the following steps: determining an actual boxing box type from the selectable box types according to the size relation between the number of the articles and the maximum storage capacity; generating sub-boxing schemes of the actual boxing boxes by using the maximum storage amount of the articles corresponding to the actual boxing boxes; the set of sub-packing schemes for each actual packing box is referred to as a packing scheme.
In the above generating method, the selectable box information may be sorted according to the number of the grids from small to large, and the larger the number is, the smaller the maximum storage amount of the articles is. In the embodiment of the invention, the selectable box type information refers to a collection of different specifications of shtle containers which can be used for boxing, for example, the specification of the selectable box type is 1/1,1/2,1/4, i.e. the selectable box type is 1 st box type: 1/1 specification, type 2 box: 1/2 specification, 3 rd box: 1/4 specification, the specific data form of the optional bin information may be boxModel = {1/1,1/2,1/4}.
In the embodiment of the invention, after the articles are boxed according to the boxing scheme, the actual maximum storage amount after the boxing can be obtained, and the maximum storage amount of the articles is updated by utilizing the actual maximum storage amount. Specifically, the bin type information corresponding to the actual maximum storage amount of the article is determined, and then the actual maximum storage amount of the preset multiple is updated to the maximum storage amount of the article corresponding to the previous bin type of the current bin type.
In the embodiment of the invention, the sub-boxing scheme of the actual boxing-shaped container comprises the following steps: the total number of the required openings of the box, the maximum filling number of one opening of the box, and the filling number when the last opening of the box does not reach the maximum filling number.
Fig. 2 is a schematic diagram of a process for implementing article loading into a vertical warehouse according to a method for generating a packing scheme according to an embodiment of the present invention.
As shown in fig. 2, the process of loading the container into the vertical warehouse by applying the generating method of the boxing scheme of the embodiment of the invention mainly comprises the following steps:
1. The boxer scans the item bar code, obtains item basic information (e.g., detailed information including item name, item SKU, item category, number of items, etc.) and maximum storage, inputs the number of items by the boxer, and selects a box set.
2. If the maximum storage amount of the articles is not empty, a recommendation algorithm is operated, a boxing scheme is given, boxing is completed by using the boxing scheme, and otherwise, boxing is carried out by a boxer.
3. After the boxing is completed, a boxer puts the container on a conveying line, a vision device and a weighing device on the conveying line can automatically check the volume and the weight of the container, and when the volume and the weight of the container meet the warehouse-in conditions, the container can use a bar code scanning device to maintain the maximum filling quantity of the articles in one grid of the container as the maximum storage quantity of the articles in a database.
The following strategy may be adopted for maintaining the maximum memory capacity:
If the bar code scanning device returns a maximum storage capacity m 3 of 1/4 box, if the maximum storage capacity m 2 of 1/2 box is empty or smaller than 2m 3, updating m 2 to 2m 3 (i.e. the preset multiple is 2 times), and if the maximum storage capacity m 1 of 1/1 box is empty or smaller than 4m 3, updating m 1 to 4m 3;
If the maximum storage amount m 2 of 1/2 box is returned, if the maximum storage amount m 1 of 1/1 box is empty or less than 2m 2, then m 1 is updated to 2m 2.
4. If the conditions of entering the warehouse are not met, the container is kicked out from the abnormal opening, the step 1 is repeated, and the container is rebuilt.
FIG. 3 is a flow chart of a method of generating a packaging scheme using a recommendation algorithm in accordance with an embodiment of the present invention
As shown in fig. 3, the main flow of generating the boxing scheme by using the recommendation algorithm is as follows:
Inputting parameters:
1. the number of articles to be put on the rack is goodsQty, which can be manually input by a box filler or transmitted from other equipment or modules;
2. Selectable bin set boxModel, the maximum storage set of items for which selectable bins correspond: packingMaxQty = { m 1,m2,……,mn }, where m i represents the maximum storage of the ith bin.
Outputting a result:
The packing scheme PACKINGSCHEME = { s 1,s2,……,sn }, where s i represents a sub-packing scheme of a box of type i, s i＝{ki,fi,ri }, where k i represents the total number of bins requiring the type i box, f i represents the maximum packing number of bins of the type i box, r i represents the number of packing when the last bin of the type i box is not full (i.e., does not reach the maximum storage), and r i = 0 if all bins of the type i box reach the maximum storage.
The recommendation algorithm comprises the following steps:
1. Acquiring input parameters:
The number goodsQty of articles to be put on can be manually input by a packer, the box set boxModel can be selectively input by the packer, the maximum storage set packingMaxQty corresponding to the box can be obtained by the packer inputting the article code goodsNo, the database is queried, if the maximum storage data is not complete, the recommendation is not made, and the parameters are prompted to be empty. For example: if the user selects 1/1 and 1/4 of the box sets, and if the 1/4 sets are empty, prompting that the maximum storage capacity of the 1/4 box sets is empty, and requesting self-boxing. And after the cased shell passes the verification, updating the maximum storage amount into the database. In the embodiment of the invention, the specification of the box type is not limited to the existing ones, and the box type with other specifications can be added appropriately according to actual requirements.
2. Let N denote the type of optional bin, if N is equal to 1 and goodsQty < m 1, k 1＝1,f1＝0,r1 = goodsQty; if N is equal to 1 and goodsQty is equal to or greater than m 1, then k 1＝goodsQty/m1,f1＝m1,r1＝goodsQty％m1, where/represents integer division,% represents taking the remainder, and if r i is equal to 0, then k 1＝k1 +1. Let s i＝{ki,fi,ri}, packingScheme[1]＝s1 return to PACKINGSCHEME and the algorithm ends.
3. If the number of selected bins N >1, i=1.
4. Let k 1＝goodsQty/m1,goodsQty＝goodsQty％m1 (i.e., assign the remainder to goodsQty). Let f i =0 if k i is equal to 0, otherwise let f i＝mi.
5. If goodsQty is equal to 0, let r i＝0,si＝{ki,fi,ri}, packingScheme[i]＝s1 return PACKINGSCHEME and the algorithm ends.
6. If goodsQty is not equal to 0, andLet k1＝k1+1, ri＝goodsQty,si＝{ki,fi,ri},packingScheme[i]＝s1, return to PACKINGSCHEME and the algorithm ends. For example, the input parameters goodsQty =16, packingMaxQty = {10,5} represent the maximum storage amounts of 1/1 and 1/2, respectively. Go to the end of step 6 and return result PACKINGSCHEME = [ {2,10,6}, {0, 0} ].
7. If goodsQty is not equal to 0, and(I.e., rounded down), let r i＝0,si＝{ki,fi,ri},packingScheme[i]＝s1. If i is not equal to N-1, let i=i+1, i.e. continue to select the i+1th bin as the actual bin, and return to step 4. Otherwise, continuing the next step.
8. Let k i+1＝1,fi+1＝0,ri+1 = goodsQty if goodsQty < m i+1, otherwise let k i+1＝goodsQty/mi+1,fi+1＝mi+1,ri+1＝goodsQty％mi+1, let k i+1＝ki+1 +1 if r i+1 is equal to 0. Let s i+1＝{ki+1,fi+1,ri+1}, packingScheme[i+1]＝s1+1 return to PACKINGSCHEME and the algorithm ends.
According to the generation scheme of the boxing scheme, the technical means of how to select the container specification and the boxing scheme of the filling quantity of each container are provided according to the relation between the quantity of the objects and the maximum storage quantity and the optional box type information, so that the technical problems of large workload and inaccurate calculation of manually maintaining the filling quantity of the containers are solved, the automatic boxing scheme recommendation is further achieved, the abnormal kicking rate of the containers is reduced, and the efficiency of putting the objects into a vertical warehouse is improved; the embodiment of the invention can automatically maintain the maximum storage capacity of the articles, so that the work of manually maintaining the maximum storage capacity is reduced, and meanwhile, the maximum storage capacity data of all the articles can be gradually perfected along with the time without manual maintenance; in view of the fact that the selectable box type information is ordered from small to large according to the number of the grid openings, the larger the number is, the smaller the maximum storage amount of the articles is, therefore, the maximum storage amount of containers with other specifications is maintained according to preset multiple, the technical effect that the maximum storage amounts of all articles corresponding to all boxes in the selectable box type set are perfected according to the maximum storage amount of individual box types can be achieved, and the maximum storage amount multiple is preset, so that the maximum storage amount data system of the articles can be accurately determined; the sub-boxing scheme set of the containers with the optional boxes is used as a boxing scheme for recommendation, so that the boxing strategy of the articles can be flexibly recommended according to the optional box set, and the boxing requirements of different articles can be met.
Fig. 4 is a schematic diagram of main modules of a generating device of a packing scheme according to an embodiment of the present invention.
As shown in fig. 4, a generating device 400 for a boxing scheme according to an embodiment of the present invention mainly includes: an acquisition module 401 and a generation module 402.
Wherein the obtaining module 401 may be configured to obtain optional bin information and item information, where the item information includes a number of items and a maximum storage amount, where the maximum storage amount is a maximum number of one bin of a container that can be filled with an item of a certain bin; the generating module 402 may be configured to generate a boxing scheme for the items using a recommendation algorithm according to the selectable bin information and a relationship between the number of items and a maximum storage amount.
Furthermore, the generating apparatus 400 may further include: an updating module (not shown in the figure) is used for acquiring the actual maximum storage amount after the articles are boxed according to the boxing scheme, and updating the maximum storage amount of the articles by using the actual maximum storage amount.
In the generating device 400, the selectable box information may be sorted according to the number of the grids from small to large, the larger the number is, the smaller the maximum storage amount of the articles is, and the updating module may be further configured to: and determining the box type information corresponding to the actual maximum storage amount of the article, and updating the actual maximum storage amount of the preset times to be the maximum storage amount of a box type before the current box type corresponding to the article.
The generation module 402 may also be configured to: determining an actual boxing box type from the selectable box types according to the size relation between the number of the articles and the maximum storage capacity; generating sub-boxing schemes of the actual boxing boxes by using the maximum storage amount of the articles corresponding to the actual boxing boxes; the set of sub-packing schemes for each actual packing box is referred to as a packing scheme.
In addition, in the above-described boxing scheme, the sub-boxing scheme of actually boxing the container of the box type includes: the total number of the required openings of the box, the maximum filling number of one opening of the box, and the filling number when the last opening of the box does not reach the maximum filling number.
From the above description, the technical means of how to select the specification of the container and the boxing scheme of the filling quantity of each container are provided according to the relation between the quantity of the articles and the maximum storage quantity and the optional box type information, so that the technical problems of large workload and inaccurate calculation of manually maintaining the filling quantity of the container are solved, the technical effects of automatically recommending the boxing scheme, reducing the abnormal kicking rate of the container and improving the efficiency of loading the articles into a vertical warehouse are achieved; the embodiment of the invention can automatically maintain the maximum storage capacity of the articles, so that the work of manually maintaining the maximum storage capacity is reduced, and meanwhile, the maximum storage capacity data of all the articles can be gradually perfected along with the time without manual maintenance; in view of the fact that the selectable box type information is ordered from small to large according to the number of the grid openings, the larger the number is, the smaller the maximum storage amount of the articles is, therefore, the maximum storage amount of containers with other specifications is maintained according to preset multiple, the technical effect that the maximum storage amounts of all articles corresponding to all boxes in the selectable box type set are perfected according to the maximum storage amount of individual box types can be achieved, and the maximum storage amount multiple is preset, so that the maximum storage amount data system of the articles can be accurately determined; the sub-boxing scheme set of the containers with the optional boxes is used as a boxing scheme for recommendation, so that the boxing strategy of the articles can be flexibly recommended according to the optional box set, and the boxing requirements of different articles can be met.
Fig. 5 illustrates an exemplary system architecture 500 of a generation method of a packaging scheme or a generation apparatus of a packaging scheme to which embodiments of the present invention may be applied.
As shown in fig. 5, the system architecture 500 may include terminal devices 501, 502, 503, a network 504, and a server 505. The network 504 is used as a medium to provide communication links between the terminal devices 501, 502, 503 and the server 505. The network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 505 via the network 504 using the terminal devices 501, 502, 503 to receive or send messages or the like. Various communication client applications may be installed on the terminal devices 501, 502, 503, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 501, 502, 503 may be a variety of electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 505 may be a server providing various services, such as a background management server (by way of example only) providing support for shopping-type websites browsed by users using the terminal devices 501, 502, 503. The background management server may analyze and process the received data such as the article information query request, and feedback the processing result (e.g., the target push information, the article information—only an example) to the terminal device.
It should be noted that, the method for generating the boxing scheme provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the device for generating the boxing scheme is generally disposed in the server 505.
It should be understood that the number of terminal devices, networks and servers in fig. 5 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 6, there is illustrated a schematic diagram of a computer system 600 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 6 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU) 601, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other through a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, mouse, etc.; an output portion 607 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The drive 610 is also connected to the I/O interface 605 as needed. Removable media 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed as needed on drive 610 so that a computer program read therefrom is installed as needed into storage section 608.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication portion 609, and/or installed from the removable medium 611. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 601.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules involved in the embodiments of the present invention may be implemented in software or in hardware. The described may also be provided in a processor, for example, as: a processor includes an acquisition module and a generation module. The names of these modules do not constitute limitations on the module itself in some cases, and the acquisition module may also be described as "a module that acquires optional box information and item information", for example.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: acquiring selectable box information and article information, wherein the article information comprises the number of articles and the maximum storage capacity, and the maximum storage capacity refers to the maximum number of one grid mouth of a container of a certain box type; and generating a boxing scheme for the articles by using a recommendation algorithm according to the selectable box type information and the relation between the number of the articles and the maximum storage amount.
According to the technical scheme provided by the embodiment of the invention, the technical means of how to select the container specification and the boxing scheme of the filling quantity of each container are provided according to the relation between the quantity of the articles and the maximum storage quantity and the optional box type information, so that the technical problems of large workload and inaccurate calculation of manually maintaining the filling quantity of the containers are solved, the automatic boxing scheme recommendation is further achieved, the abnormal kicking rate of the containers is reduced, and the efficiency of placing the articles into a vertical warehouse is improved; the embodiment of the invention can automatically maintain the maximum storage capacity of the articles, so that the work of manually maintaining the maximum storage capacity is reduced, and meanwhile, the maximum storage capacity data of all the articles can be gradually perfected along with the time without manual maintenance; in view of the fact that the selectable box type information is ordered from small to large according to the number of the grid openings, the larger the number is, the smaller the maximum storage amount of the articles is, therefore, the maximum storage amount of containers with other specifications is maintained according to preset multiple, the technical effect that the maximum storage amounts of all articles corresponding to all boxes in the selectable box type set are perfected according to the maximum storage amount of individual box types can be achieved, and the maximum storage amount multiple is preset, so that the maximum storage amount data system of the articles can be accurately determined; the sub-boxing scheme set of the containers with the optional boxes is used as a boxing scheme for recommendation, so that the boxing strategy of the articles can be flexibly recommended according to the optional box set, and the boxing requirements of different articles can be met.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (8)
1. A method of generating a boxing scheme, comprising:
Acquiring selectable box information and article information, wherein the article information comprises the number of articles and the maximum storage capacity, and the maximum storage capacity refers to the maximum number of one grid mouth of a container of a certain box type;
Generating a boxing scheme by using a recommendation algorithm according to the selectable box type information and the relation between the number of articles and the maximum storage capacity; the method specifically comprises the following steps: determining an actual boxing box type from the selectable box types according to the size relation between the number of the articles and the maximum storage capacity; generating sub-boxing schemes of the actual boxing boxes by using the maximum storage amount of the articles corresponding to the actual boxing boxes; taking a set of sub-boxing schemes of each actual boxing box type as a boxing scheme; the sub-boxing scheme of the actual boxing box type comprises the following steps: the total number of the required openings of the box, the maximum filling number of one opening of the box, and the filling number when the last opening of the box does not reach the maximum filling number.
2. The generation method according to claim 1, characterized in that the generation method further comprises:
After the articles are boxed according to the boxing scheme, the actual maximum storage amount after boxing is obtained, and the maximum storage amount of the articles is updated by utilizing the actual maximum storage amount.
3. The generating method according to claim 2, wherein in the generating method, the selectable box information is ordered from small to large in number of the slots, the larger the number is, the smaller the maximum storage amount of the article is, and updating the maximum storage amount of the article with the actual maximum storage amount comprises:
And determining the box type information corresponding to the actual maximum storage amount of the article, and updating the actual maximum storage amount of the preset multiple to the maximum storage amount of the article corresponding to the box type before the current box type.
4. A device for generating a boxing scheme, comprising:
The system comprises an acquisition module, a storage module and a storage module, wherein the acquisition module is used for acquiring selectable box information and article information, the article information comprises the number of articles and the maximum storage capacity, and the maximum storage capacity refers to the maximum number of one grid of a container of a certain box type;
The generation module is used for generating a boxing scheme by using a recommendation algorithm according to the selectable box type information and the relation between the number of the articles and the maximum storage capacity; the method is particularly used for determining the actual boxing box type from the selectable box types according to the size relation between the number of the articles and the maximum storage capacity; generating sub-boxing schemes of the actual boxing boxes by using the maximum storage amount of the articles corresponding to the actual boxing boxes; taking a set of sub-boxing schemes of each actual boxing box type as a boxing scheme; the sub-boxing scheme of the actual boxing box type comprises the following steps: the total number of the required openings of the box, the maximum filling number of one opening of the box, and the filling number when the last opening of the box does not reach the maximum filling number.
5. The generating apparatus according to claim 4, wherein the generating apparatus further comprises:
And the updating module is used for acquiring the actual maximum storage amount after the articles are boxed according to the boxing scheme, and updating the maximum storage amount of the articles by utilizing the actual maximum storage amount.
6. The apparatus of claim 5, wherein the selectable bin information is ordered from a smaller number of bins to a larger number, the larger number is, the smaller maximum storage of the item is, and the update module is further configured to:
And determining the box type information corresponding to the actual maximum storage amount of the article, and updating the actual maximum storage amount of the preset multiple to the maximum storage amount of the article corresponding to the box type before the current box type.
7. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs,
When executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-3.
8. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810068705.5A CN110070246B (en) | 2018-01-24 | 2018-01-24 | Method and device for generating boxing scheme |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810068705.5A CN110070246B (en) | 2018-01-24 | 2018-01-24 | Method and device for generating boxing scheme |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110070246A CN110070246A (en) | 2019-07-30 |
| CN110070246B true CN110070246B (en) | 2024-04-19 |
Family
ID=67365505
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810068705.5A Active CN110070246B (en) | 2018-01-24 | 2018-01-24 | Method and device for generating boxing scheme |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110070246B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113762560A (en) * | 2020-06-23 | 2021-12-07 | 北京京东乾石科技有限公司 | Method and device for selecting type of material container |
| CN111861326A (en) * | 2020-07-21 | 2020-10-30 | 日邮物流(中国)有限公司 | Packaging method, device, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104108491A (en) * | 2014-07-09 | 2014-10-22 | 江苏云道信息技术有限公司 | Automatic sorting system and method |
| CN104915817A (en) * | 2015-05-26 | 2015-09-16 | 亿赞普(北京)科技有限公司 | Loading method and apparatus for container |
| CN107103445A (en) * | 2017-05-17 | 2017-08-29 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN107235166A (en) * | 2017-07-25 | 2017-10-10 | 北京京东尚科信息技术有限公司 | Article packing method and device, computer-readable recording medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8849724B2 (en) * | 2011-12-31 | 2014-09-30 | Ebay Inc. | Shipping container reuse recommendation system |
| US20140156553A1 (en) * | 2012-11-30 | 2014-06-05 | Lightspeed Automation Llc | Systems and Methods for Fulfilling Orders |
-
2018
- 2018-01-24 CN CN201810068705.5A patent/CN110070246B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104108491A (en) * | 2014-07-09 | 2014-10-22 | 江苏云道信息技术有限公司 | Automatic sorting system and method |
| CN104915817A (en) * | 2015-05-26 | 2015-09-16 | 亿赞普(北京)科技有限公司 | Loading method and apparatus for container |
| CN107103445A (en) * | 2017-05-17 | 2017-08-29 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN107235166A (en) * | 2017-07-25 | 2017-10-10 | 北京京东尚科信息技术有限公司 | Article packing method and device, computer-readable recording medium |
Non-Patent Citations (2)
| Title |
|---|
| Peng Liu,et al.Assigning skus to multiple automated-picking areas over multiple periods.《2009 IEEE International Conference on Automation and Logistics》.2009,50-55页. * |
| 邮箱分拣码垛系统的优化设计与仿真;施吉帅;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;第2015年卷(第02期);C029-262 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110070246A (en) | 2019-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110363456B (en) | Method and device for putting articles on shelves | |
| CN107103445B (en) | Information processing method and device | |
| CN110348771B (en) | Method and device for order grouping of orders | |
| JP2022547230A (en) | Method, device, electronic device and storage medium for determining storage location | |
| CN110717697A (en) | Warehouse-out positioning method and device | |
| CN110070246B (en) | Method and device for generating boxing scheme | |
| CN113256193B (en) | Warehouse commodity layout method and device | |
| CN110826953B (en) | Warehouse storage equipment planning method and device | |
| CN111260270A (en) | Method and device for improving order processing efficiency of store | |
| US20190042995A1 (en) | Automated Item Assortment System | |
| CN111798167B (en) | Warehouse replenishment method and device | |
| CN113650997B (en) | Article warehouse-out positioning method and device | |
| CN110689291A (en) | Method and device for determining warehousing and boxing amount | |
| CN114897463A (en) | Method and device for determining product packaging scheme | |
| CN110826948A (en) | Warehouse product selection method and device | |
| CN113988467A (en) | Method and device for recommending product packaging size | |
| CN115390958A (en) | Task processing method and device | |
| CN112036781A (en) | Method and device for selecting packaging material | |
| CN111498368B (en) | Method and device for determining storage position | |
| CN113673938A (en) | Article sorting method, apparatus, electronic device and computer readable medium | |
| CN112734317A (en) | Method and device for managing goods | |
| CN113191703A (en) | Method and device for allocating storage positions | |
| CN112825171A (en) | Method and device for delivering articles out of warehouse | |
| CN112926907A (en) | Warehouse inventory layout method and device | |
| CN112053106A (en) | Method and device for managing delivery of articles |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210224 Address after: Room a1905, 19 / F, building 2, No. 18, Kechuang 11th Street, Daxing District, Beijing, 100176 Applicant after: Beijing Jingdong Qianshi Technology Co.,Ltd. Address before: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant before: Beijing Jingbangda Trading Co.,Ltd. Effective date of registration: 20210224 Address after: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant after: Beijing Jingbangda Trading Co.,Ltd. Address before: 100195 Beijing Haidian Xingshikou Road 65 West Cedar Creative Garden 4 District 11 Building East 1-4 Floor West 1-4 Floor Applicant before: BEIJING JINGDONG SHANGKE INFORMATION TECHNOLOGY Co.,Ltd. Applicant before: BEIJING JINGDONG CENTURY TRADING Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |