CN110120133B - Space allocation method based on size sorting search for space variable cabinet - Google Patents
Space allocation method based on size sorting search for space variable cabinet Download PDFInfo
- Publication number
- CN110120133B CN110120133B CN201810120906.5A CN201810120906A CN110120133B CN 110120133 B CN110120133 B CN 110120133B CN 201810120906 A CN201810120906 A CN 201810120906A CN 110120133 B CN110120133 B CN 110120133B
- Authority
- CN
- China
- Prior art keywords
- cabinet
- size
- space
- grid
- search
- 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
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65D—CONTAINERS FOR STORAGE OR TRANSPORT OF ARTICLES OR MATERIALS, e.g. BAGS, BARRELS, BOTTLES, BOXES, CANS, CARTONS, CRATES, DRUMS, JARS, TANKS, HOPPERS, FORWARDING CONTAINERS; ACCESSORIES, CLOSURES, OR FITTINGS THEREFOR; PACKAGING ELEMENTS; PACKAGES
- B65D21/00—Nestable, stackable or joinable containers; Containers of variable capacity
- B65D21/08—Containers of variable capacity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
- G07F17/10—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for means for safe-keeping of property, left temporarily, e.g. by fastening the property
- G07F17/12—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for means for safe-keeping of property, left temporarily, e.g. by fastening the property comprising lockable containers, e.g. for accepting clothes to be cleaned
Abstract
The invention discloses a space allocation method based on size sorting search for a space variable cabinet, which comprises the following steps: step S1: defining each accommodating cavity on a cabinet body of the grid cabinet as a virtual unit grid, and inputting the size T of the required virtual unit grid; step S2: setting a target grid cabinet as an initial search grid cabinet in a control program; step S3: acquiring a real-time idle state of a target grid cabinet; step S4: sorting the sizes of the continuous free areas on the target grid cabinet to form a sorting table; step S5: searching the spaces meeting the conditions in sequence from the sequencing list; step S6: if a continuous space with the size of T is found in the sorting table, acquiring the positions of the actual cells corresponding to the virtual cells, and opening the actual cells; finishing; if not, judging that the article can not be stored, and stopping searching. The invention has the advantages of simple principle, easy realization, realization of space variable optimal configuration and the like.
Description
Technical Field
The invention mainly relates to the field of logistics, express delivery and storage, in particular to a space allocation method based on size sorting search for a space variable cabinet.
Background
With the rapid development of logistics and express delivery industries, how to improve the speed and the safety of delivering articles becomes a problem which needs to be solved urgently. The express delivery cabinet (also can be a logistics cabinet or a storage cabinet) is a key place facing to an end user or serving as a transit node.
The mode that current cabinet body all adopted ground fixed mounting to the express delivery cabinet that generally sees in the district is for the example, and most all directly set up a plurality of storage chamber not of uniform size on the cabinet body, and every storage chamber all is provided with a chamber door that is used for the confined. The delivery personnel can select a proper storage cavity according to the size of the goods, open the corresponding box door by using APP or other modes and put the goods in; and the person who gets the goods then can open the chamber door of saving the goods according to the goods sign indicating number of getting that corresponds or APP, takes away the goods.
Although the above-mentioned conventional cabinet structure is relatively convenient to operate, there still exist some problems: although the storage chambers on the cabinet body have different specifications, each specification is fixed, namely the space size of the cabinet grid is fixed, and the size of the cabinet grid cannot be adjusted. That is, for some goods with specific specifications, the number of the storage cavities on the cabinet body is limited and cannot be found at any time, which causes great difficulty for distribution personnel and causes that the distribution work cannot be completed. Furthermore, it is extremely difficult for the intelligent distribution equipment.
Therefore, a space-variable cabinet body is proposed by practitioners, that is, a plurality of accommodating spaces for accommodating articles are formed in the cabinet body, each accommodating space is provided with an independent cabinet door, and adjacent cabinet doors can be selectively opened or more than two cabinet doors can be opened as required to enlarge the accommodating spaces. However, such variable-space cabinets still have some disadvantages: because the quantity of independent accommodation space is limited on the cabinet body, after opening two or more than two independent cabinet doors, can influence the ductility of peripheral accommodation space to influence the holistic availability factor of the cabinet body, and influence other not open (be in unused state) accommodation space's ductility on the cabinet body. Even in some extreme use states, the cabinet body often has the situation that the available space cannot be reserved.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: aiming at the technical problems in the prior art, the invention provides the space allocation method based on the size sorting search for the space variable cabinet, which has the advantages of simple principle, easy realization and capability of realizing space variable optimal configuration.
In order to solve the technical problems, the invention adopts the following technical scheme:
a space allocation method based on size sorting search for a space variable cabinet comprises the following steps:
step S1: defining each accommodating cavity on a cabinet body of the grid cabinet as a virtual unit grid, and inputting the size T of the required virtual unit grid;
step S2: setting a target grid cabinet as an initial search grid cabinet in a control program;
step S3: acquiring a real-time idle state of a target grid cabinet;
step S4: sorting the sizes of the continuous free areas on the target grid cabinet to form a sorting table;
step S5: searching the spaces meeting the conditions in sequence from the sequencing list;
step S6: if a continuous space with the size of T is found in the sorting table, acquiring the positions of the actual cells corresponding to the virtual cells, and opening the actual cells; finishing; if not, judging that the article can not be stored, and stopping searching.
As a further improvement of the process of the invention: arranging a plurality of grid cabinets together to form a cooperative control, wherein the step S6 further comprises:
if no continuous space of size T is found in the current cell, the process returns to step S2 to set one of the remaining cells as the initially searched cell. If all the grid cabinets are searched, the continuous space with the size of T still cannot be obtained, and if the articles cannot be stored, the search is stopped.
As a further improvement of the process of the invention: and sequentially searching the plurality of grid cabinets according to a preset searching sequence.
As a further improvement of the process of the invention: and selecting any cabinet body at the front, the back, the top or the bottom as a grid cabinet for the first initial search.
As a further improvement of the process of the invention: the order of searching in step S4 is the horizontal direction or the vertical direction, or searching is performed in units of groups each including two or more virtual unit cells.
As a further improvement of the process of the invention: in step S1, the volume size of the virtual unit cell is preset.
As a further improvement of the process of the invention: the sizes of the virtual unit grids on the cabinet body of the same grid cabinet are the same or different.
As a further improvement of the process of the invention: in step S1, the volume size of the virtual unit cell is preset, and the virtual unit cell sizes between the plurality of cell cabinets are the same or different.
As a further improvement of the process of the invention: the continuous idle area refers to the total size of continuous idle actual cells in the same grid cabinet.
As a further improvement of the process of the invention: the step S6 further includes: and sequencing the continuous idle spaces which meet the conditions in the sequencing table, wherein the continuous idle spaces are sequenced from small to large or from large to small according to the actual situation.
As a further improvement of the process of the invention: in step S1, the required virtual cell size T is input in the following manner: a bar code is arranged on an article to be placed, the size or the volume of the article is arranged in the bar code, and the bar code is directly scanned by a scanning component on a grid cabinet to obtain the required virtual cell size T.
As a further improvement of the process of the invention: in step S1, the required virtual cell size T is input in the following manner: packaging the article to be placed by using an adhesive tape with scale marks, and directly scanning the adhesive tape by using a scanning component on a grid cabinet to obtain the required virtual cell size T; alternatively, the operator directly reads the scale markings on the tape to obtain the desired virtual cell size T.
Compared with the prior art, the invention has the advantages that: the space allocation method based on the size sorting search for the space variable cabinet is simple in principle and easy to implement, and the most optimal configuration and allocation of the accommodating space on a single or a plurality of grid cabinets can be realized through the optimal design, so that the ductility of the accommodating space and the use efficiency of the whole cabinet are improved to the greatest extent.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention.
Fig. 2 is a schematic diagram of the principle of the present invention in a specific application example.
Fig. 3 is a schematic diagram of a standard express packaging box with length, width, height and size two-dimensional code information in a specific application example of the present invention.
Fig. 4 is a schematic view of an express packaging adhesive tape with a measuring tape two-dimensional code scale reading in a specific application example of the present invention.
Detailed Description
The invention will be described in further detail below with reference to the drawings and specific examples.
The method is mainly suitable for a logistics cabinet (grid cabinet) with variable space, the logistics cabinet comprises a cabinet body and a control part, more than two containing cavities for placing articles are arranged on the cabinet body, each containing cavity is provided with at least one independent door, a door locking part is arranged on each door, a partition plate is arranged between every two adjacent containing cavities, each partition plate divides the adjacent containing cavities into independent spaces, and a partition plate locking part for fixing and locking the partition plate is arranged in each containing cavity; under the control of the control component, the box door locking components of more than two adjacent containing cavities are opened simultaneously, and the more than two adjacent containing cavities are in a communicated state after the partition locking components are released and the partitions are operated. The method is mainly used for realizing the optimized distribution of the accommodating cavities on the logistics cabinet.
As shown in FIG. 1, the space allocation method based on size-sorting search for space-variable cabinets of the present invention comprises the following steps:
step S1: defining each accommodating cavity as a virtual unit cell in a control program, and inputting the size T of the required virtual unit cell;
step S2: setting a target grid cabinet as an initial search grid cabinet in a control program;
step S3: acquiring a real-time idle state of a target grid cabinet;
step S4: sorting the sizes of the continuous free areas on the target grid cabinet to form a sorting table;
step S5: searching the spaces meeting the conditions in sequence from the sequencing list;
step S6: if a continuous space with the size of T is found in the sorting table, acquiring the positions of the actual cells corresponding to the virtual cells, and opening the actual cells; finishing; if not, judging that the article can not be stored, and stopping searching.
In the above method of the present invention, a plurality of grid cabinets may be further arranged in a row to form a cooperative control, and if no continuous space with a size T is searched in the current grid cabinet in step S6, the method returns to step S2 to further set one of the remaining grid cabinets as the initially searched grid cabinet. If all the grid cabinets are searched, the continuous space with the size of T still cannot be obtained, and if the articles cannot be stored, the search is stopped.
In the method of the present invention, the plurality of grid cabinets may be arranged in the order of search according to actual needs, for example, any one of the front, rear, top, or bottom cabinet may be preset as the first initially searched grid cabinet according to actual needs. The order of searching may also be selected according to actual needs, such as the order of searching in step S4 is horizontal or vertical, or searching in units of groups, each of which includes more than two virtual unit cells.
In the above method of the present invention, the volume size of the virtual unit cell may be preset in step S1. The sizes of the virtual cells on the cabinet body of the same grid cabinet can be the same or different. The virtual unit grid sizes among the grid cabinets can be the same or different. In a preferred embodiment, virtual unit grids with different preset volumes can be arranged on different grid cabinets, so that the virtual unit grids can be optimally combined according to actual needs, and the overall use efficiency of the grid cabinet is improved.
In the above method of the present invention, the continuous empty space refers to the total size of continuous empty actual cells in the same grid cabinet.
In the method of the present invention, in step S6, the eligible continuous empty spaces in the sorting table may be further sorted, and the continuous empty spaces may be sorted from small to large or from large to small according to actual situations.
Referring to fig. 3, in the specific application example, in step S1, the required virtual cell size T is input by: a bar code is arranged on an article to be placed, the size or the volume of the article is arranged in the bar code, and the bar code is directly scanned by a scanning component on a grid cabinet to obtain the required virtual cell size T.
Still alternatively, referring to fig. 4, in the specific application example, in step S1, the manner of inputting the required virtual cell size T is as follows: packaging the article to be placed by using an adhesive tape with scale marks, and directly scanning the adhesive tape by using a scanning component on a grid cabinet to obtain the required virtual cell size T; alternatively, the operator directly reads the scale markings on the tape to obtain the desired virtual cell size T. Of course, it is understood that the scale markings may be provided directly in the two-dimensional code (with the scale two-dimensional code markings reading).
In a specific embodiment, as shown in fig. 2, a storage system is composed of 5 groups of cabinets, each cabinet has 10 equal-sized actual cells, and the actual cells are vertically stacked. From left to right, be first to fifth check cabinet in proper order, every check cabinet is from last to down, is actual unit check No. 1 to 10 in proper order. The length, width and height of each actual cell are respectively as follows: 500 mm. times.500 mm. times.200 mm. The number 4 and the number 5 of the second, the third and the fourth lattice cabinets, and the total 6 cell positions are man-machine interaction devices such as displays and the like, and can not be used for storing articles, the total number of the actual cells of the whole storage system is 44, the current storage state in the current storage system is represented by gray, which represents that the actual cells are filled with articles, and white which represents that the actual cells are empty. The size of the article to be stored is 450mm × 450mm × 700mm, and the corresponding required virtual cell size is 500mm × 500mm × 800.
Step S101: the virtual cells are 4 times the size of 1 actual cell, and assuming that the size of 1 actual cell is taken as 1 standard unit, 1 continuous space of 4 times the standard unit;
step S102: the size of the continuous free space is represented by a three-dimensional array in the format of space size, cell cabinet number, starting actual cell number. Thus, the free space of the first cubicle is represented as
The free space of the second cubicle is represented as
The free space of the third cubicle is represented as
The free space of the fourth cubicle is denoted as
The free space of the fifth cubicle is denoted as
Step S103: arranging all the free spaces in the order from big to small, the following arrays can be obtained:
during sorting, the sorts with the same size can be arranged from small to large according to the number of the grid cabinet and the number of the unit grid, and also can be arranged by other algorithms, such as Gaussian weighting is carried out on the positions and the sorts are arranged according to the weight.
Step S104: in the three-dimensional data set, a space with the size of 4 times of a standard unit is searched, and in actual operation, only an array with the size of more than or equal to 4 needs to be searched in the first column of the three-dimensional array. It can be seen that in the third grid cabinet, there is a space 4 times the standard unit from the No. 6 actual cell; in the fifth cubicle cabinet, there is a space of 5 standard units starting from the actual cell number 4.
Step S105: according to the sequence, the spaces of 4 standard units in the third grid cabinet are searched first, and then the doors of No. 6, No. 7, No. 8 and No. 9 actual cells of the third grid cabinet are opened simultaneously, so that the required articles can be stored.
Step S106: and (6) ending.
In the above application example, if a space 7 times the standard unit is required to be found, and the three-dimensional array generated in step S103 can find that there is no suitable position, an error needs to be prompted, and the article cannot be stored.
After storing 4 times of standard unit of articles this time, the three-dimensional array of the free space of the storage system becomes:
at this point, if there is still a 4 standard unit of items to be stored, there is only a 5 times standard unit of continuous free space in the fifth compartment.
At this time, the items are selected to be stored in 4 actual cells from the No. 4 of the fifth cubicle cabinet. In practice, it is also possible to choose to store the items in 4 actual cells starting from the fifth cubicle No. 5, or to choose the optimal position by other algorithmic calculations.
The above is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above-mentioned embodiments, and all technical solutions belonging to the idea of the present invention belong to the protection scope of the present invention. It should be noted that modifications and embellishments within the scope of the invention may be made by those skilled in the art without departing from the principle of the invention.
Claims (12)
1. A space allocation method based on size sorting search for a space variable cabinet is characterized by comprising the following steps:
step S1: defining each accommodating cavity on a cabinet body of the grid cabinet as a virtual unit grid, and inputting the size T of the required virtual unit grid;
step S2: setting a target grid cabinet as an initial search grid cabinet in a control program;
step S3: acquiring a real-time idle state of a target grid cabinet;
step S4: sorting the sizes of the continuous free areas on the target grid cabinet to form a sorting table;
step S5: searching the spaces meeting the conditions in sequence from the sequencing list;
step S6: if a continuous space with the size of T is found in the sorting table, acquiring the positions of the actual cells corresponding to the virtual cells, and opening the actual cells; finishing; if not, judging that the article can not be stored, and stopping searching.
2. The method for allocating space based on size-ordered search for spatially variable cabinets according to claim 1, wherein a plurality of grid cabinets are arranged in a row to form a cooperative control, and the step S6 further comprises:
if the continuous space with the size of T is not searched in the current grid cabinet, the process returns to step S2 to further set one of the other grid cabinets as the initially searched grid cabinet, and if all the grid cabinets are searched, the continuous space with the size of T cannot be obtained, and it is determined that the article cannot be stored, the search is stopped.
3. The space allocation method based on size-ordered search for space-variable cabinets according to claim 2, wherein the plurality of grid cabinets are sequentially searched in sequence according to a preset search order.
4. The space allocation method for a size-ordered search based on spatially variable cabinets of claim 3, wherein any one of the front-most, rear-most, top-most or bottom-most cabinet is selected to be preset as the first initially searched grid cabinet.
5. The space allocation method for a size-ordered search of a space-variant cabinet according to claim 3, wherein the order of searching in step S4 is horizontal or vertical, or searching is performed in units of groups, each of said groups including two or more virtual unit cells.
6. The space allocation method for a space-variant cabinet based on size-ordered search according to any of claims 1-5, wherein the volume size of the virtual unit cell is preset in step S1.
7. The space allocation method based on size-sorting search for space-variant cabinets according to claim 6, wherein the sizes of the virtual cells on the cabinets of the same grid cabinet are the same or different.
8. The space allocation method for a space-variable cabinet based on size-sorting search according to any one of claims 2 to 5, wherein the volume size of the virtual unit cell is preset in step S1, and the virtual unit cell sizes between the plurality of grid cabinets are the same or different.
9. Space allocation method for a space-variant cabinet based on a rank-order search according to any of claims 1-5, characterized in that said consecutive free areas refer to the total size of consecutive free real cells in the same grid cabinet.
10. The method for allocating space based on size-ordered search for space-variant cabinets according to any of claims 1 to 5, wherein said step S6 further comprises: and sequencing the continuous idle spaces which meet the conditions in the sequencing table, wherein the continuous idle spaces are sequenced from small to large or from large to small according to the actual situation.
11. A space allocation method for a space-variable cabinet based on size-sorting search according to any one of claims 1-5, wherein in step S1, the required virtual cell size T is input by: a bar code is arranged on an article to be placed, the size or the volume of the article is arranged in the bar code, and the bar code is directly scanned by a scanning component on a grid cabinet to obtain the required virtual cell size T.
12. A space allocation method for a space-variable cabinet based on size-sorting search according to any one of claims 1-5, wherein in step S1, the required virtual cell size T is input by: packaging the article to be placed by using an adhesive tape with scale marks, and directly scanning the adhesive tape by using a scanning component on a grid cabinet to obtain the required virtual cell size T; alternatively, the operator directly reads the scale markings on the tape to obtain the desired virtual cell size T.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810120906.5A CN110120133B (en) | 2018-02-07 | 2018-02-07 | Space allocation method based on size sorting search for space variable cabinet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810120906.5A CN110120133B (en) | 2018-02-07 | 2018-02-07 | Space allocation method based on size sorting search for space variable cabinet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110120133A CN110120133A (en) | 2019-08-13 |
| CN110120133B true CN110120133B (en) | 2021-08-27 |
Family
ID=67519483
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810120906.5A Active CN110120133B (en) | 2018-02-07 | 2018-02-07 | Space allocation method based on size sorting search for space variable cabinet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110120133B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111627167A (en) * | 2020-05-18 | 2020-09-04 | 深圳市丰巢科技有限公司 | Storage method and device based on storage cabinet, storage cabinet and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103559607A (en) * | 2013-11-02 | 2014-02-05 | 宋白桦 | Self-service type intelligent logistics terminal system |
| CN103738773A (en) * | 2013-12-20 | 2014-04-23 | 吴江邻苏精密机械有限公司 | Tape device |
| CN104183060A (en) * | 2013-10-31 | 2014-12-03 | 杭州快柜网络科技有限公司 | Intelligent express parcel access method |
| CN106652241A (en) * | 2016-12-29 | 2017-05-10 | 苏州亮磊知识产权运营有限公司 | Self-adaption multi-size smart fetching express cabinet |
| CN107235166A (en) * | 2017-07-25 | 2017-10-10 | 北京京东尚科信息技术有限公司 | Article packing method and device, computer-readable recording medium |
| CN107536303A (en) * | 2017-09-08 | 2018-01-05 | 湖南湘邮科技股份有限公司 | The collapsible package cabinet of dividing plate |
| CN107622321A (en) * | 2017-07-27 | 2018-01-23 | 山东储备物资管理局八三二处 | A kind of algorithm that casing loading pattern is intelligently generated based on multi-constraint condition |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09118391A (en) * | 1995-10-26 | 1997-05-06 | Terano Seiko:Kk | Receiving box for delivered article |
| KR101878760B1 (en) * | 2012-04-09 | 2018-08-17 | 한국전자통신연구원 | Apparatus for dynamic allocation unmanned postal delivery machine and method for allocation thereof |
| CN204680109U (en) * | 2015-06-14 | 2015-09-30 | 兰兴欣 | A kind of intelligent express delivery cabinet |
| CN206726360U (en) * | 2016-11-29 | 2017-12-08 | 武汉科技大学 | A kind of intelligent express delivery cabinet |
-
2018
- 2018-02-07 CN CN201810120906.5A patent/CN110120133B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104183060A (en) * | 2013-10-31 | 2014-12-03 | 杭州快柜网络科技有限公司 | Intelligent express parcel access method |
| CN103559607A (en) * | 2013-11-02 | 2014-02-05 | 宋白桦 | Self-service type intelligent logistics terminal system |
| CN103738773A (en) * | 2013-12-20 | 2014-04-23 | 吴江邻苏精密机械有限公司 | Tape device |
| CN106652241A (en) * | 2016-12-29 | 2017-05-10 | 苏州亮磊知识产权运营有限公司 | Self-adaption multi-size smart fetching express cabinet |
| CN107235166A (en) * | 2017-07-25 | 2017-10-10 | 北京京东尚科信息技术有限公司 | Article packing method and device, computer-readable recording medium |
| CN107622321A (en) * | 2017-07-27 | 2018-01-23 | 山东储备物资管理局八三二处 | A kind of algorithm that casing loading pattern is intelligently generated based on multi-constraint condition |
| CN107536303A (en) * | 2017-09-08 | 2018-01-05 | 湖南湘邮科技股份有限公司 | The collapsible package cabinet of dividing plate |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110120133A (en) | 2019-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110120121B (en) | Space allocation method based on maximum article scheme for space variable cabinet | |
| CN112001535B (en) | Logistics boxing method, device, equipment and storage medium | |
| EP3920116A1 (en) | Order picking method and device, and storage medium | |
| AU2016331066B2 (en) | Warehouse rack space optimization | |
| CN112036667B (en) | Warehouse goods position optimization method, equipment, storage medium and device | |
| Wei et al. | An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints | |
| CN104915817A (en) | Loading method and apparatus for container | |
| US11136149B2 (en) | Container packing system | |
| CN109597304A (en) | Die storehouse Intelligent partition storage method based on artificial bee colony algorithm | |
| JP7251112B2 (en) | Stowage planning device | |
| CN110120133B (en) | Space allocation method based on size sorting search for space variable cabinet | |
| CN108861619A (en) | A kind of half mixes palletizing method, system and robot offline | |
| CN107748975A (en) | Warehouse storage area computation method, acquisition methods and Warehouse Establishing method | |
| Bahrami et al. | Using simulation to analyze picker blocking in manual order picking systems | |
| CN110077772A (en) | Group tray method and its application | |
| CN113361985A (en) | Dynamic allocation method and device for goods space and electronic equipment | |
| CN110119830B (en) | Space distribution method for space variable cabinet based on average time prediction maximum continuous space | |
| Park et al. | Performance of miniload systems with two-class storage | |
| CN110119829B (en) | Method for distributing volume identification space of articles based on binocular measurement for space variable cabinet | |
| CN110119917B (en) | Space distribution method based on optimal goods taking position for space variable cabinet | |
| CN113947317A (en) | Material warehousing method, material ex-warehouse method, device, scheduling equipment and system | |
| CN110294251B (en) | Box-in-box type three-dimensional warehouse position design method for multiple varieties of small-batch articles | |
| CN110120131B (en) | Space distribution method based on density priority for space variable cabinet | |
| JP3207774B2 (en) | Entry and exit instruction device | |
| CN111382969B (en) | Order processing method, device, equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |