CN112700194B - Library position distribution system and method based on feature priority principle and split combination - Google Patents
Library position distribution system and method based on feature priority principle and split combination Download PDFInfo
- Publication number
- CN112700194B CN112700194B CN202011625762.2A CN202011625762A CN112700194B CN 112700194 B CN112700194 B CN 112700194B CN 202011625762 A CN202011625762 A CN 202011625762A CN 112700194 B CN112700194 B CN 112700194B
- Authority
- CN
- China
- Prior art keywords
- group
- goods
- idle
- supporting
- continuous adjacent
- 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
- 238000009826 distribution Methods 0.000 title claims abstract description 32
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000003860 storage Methods 0.000 claims abstract description 50
- 239000000463 material Substances 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 14
- 241000531116 Blitum bonus-henricus Species 0.000 claims description 5
- 235000008645 Chenopodium bonus henricus Nutrition 0.000 claims description 5
- 238000012545 processing Methods 0.000 claims description 4
- 238000004220 aggregation Methods 0.000 abstract description 3
- 230000002776 aggregation Effects 0.000 abstract description 3
- 238000000926 separation method Methods 0.000 abstract description 2
- 238000005457 optimization Methods 0.000 description 5
- 238000012856 packing Methods 0.000 description 4
- 238000013528 artificial neural network Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012549 training Methods 0.000 description 2
- 241000196324 Embryophyta Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000009545 invasion Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 239000002699 waste material Substances 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/21—Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
- G06F18/211—Selection of the most significant subset of features
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
- G06K17/0022—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Life Sciences & Earth Sciences (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Artificial Intelligence (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Development Economics (AREA)
- Evolutionary Computation (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Warehouses Or Storage Devices (AREA)
Abstract
The invention discloses a library position distribution system and method based on a feature priority principle and split combination. The invention uses the characteristic priority principle and the split combination as the core idea to gather goods according to a certain appointed characteristic, thereby improving the utilization rate of the storage space. The method can solve the problem that the whole goods group to be distributed cannot be distributed at one time due to insufficient number of idle supporting bits in the continuous adjacent idle supporting groups in the warehouse, and can ensure that the distributed goods reach an optimal state with more aggregation and less separation, thereby greatly reducing the workload and the working difficulty of warehouse management personnel when in warehouse-in and warehouse-out, accurately and quickly searching the goods storage address, ensuring that the latest warehouse bit state can be correctly updated after each operation, and ensuring that the subsequent operation has no errors such as repeated address distribution and the like.
Description
Technical Field
The invention belongs to the field of logistics distribution, in particular to an automatic warehouse position distribution method, and more particularly relates to a warehouse position distribution method which uses a characteristic priority principle and split combination as a core idea, and can gather cargoes as much as possible according to a certain designated characteristic, so that the efficiency of operations such as warehouse-in and warehouse-out and the like is improved.
Background
The warehouse is used as a middle node of logistics, and the warehouse position distribution of cargoes can meet the requirements of high efficiency and convenience in warehouse entry and warehouse exit. In a practical situation, different cargoes have different characteristics (such as material numbers, storage tank sizes and the like), when the cargoes with the same characteristics are subjected to operations such as warehouse-in and warehouse-out, inventory and the like, the cargoes with the same characteristics are generally subjected to intensive frequent operations, and at the moment, if the cargoes are placed in a clustered manner according to the characteristics, the corresponding operations are more efficient. For example: the same batch of delivery cargoes possibly have the same material numbers, and the delivery forklift back and forth goods preparation area and the same storage position area can obviously reduce the working difficulty of forklift drivers and improve the working efficiency. Therefore, how to automatically allocate the stock of the goods under consideration of the feature constraint becomes a challenge to be solved.
In recent years, some simple and direct methods of allocation of the stock positions have been developed, including positioning storage, random storage, sorting storage, etc. They all have their own advantages and disadvantages. The fixed storage position for each item of goods is positioned and stored, so that the distribution personnel can be familiar with the fixed storage position; however, the storage bits must be set to a maximum amount in advance, which reduces the utilization rate of the effective space, and thus causes waste. The random storage is just opposite, and the storage positions can be shared to greatly improve the space utilization rate, but the efficiency of the forklift and the checking management difficulty are affected when cargoes are put in and put out. The classified storage has the advantage of positioning storage, and can allocate a designated storage area to each type of goods, but the same disadvantage of positioning storage is the defect of storage space utilization.
In the whole logistics transportation system, the warehousing system is an important link capable of affecting the performance and energy consumption of the whole system, and the expense of the warehousing system can occupy about 7% of the expense of the whole system, so that the optimization problem is more and more paid attention to all parties of the society. How to reduce the time of warehouse entry and exit, how to reduce the workload of inventory adjustment personnel and how to increase the effective storage capacity of the whole warehouse is the important research. It has been found by research that the existing bin allocation optimization algorithm comprises: algorithms based on neural networks, based on K-means, and based on selection optimization. The method for distributing the library positions by utilizing the neural network requires a great deal of training in the early stage of training the network, consumes more time and cannot well cope with the situation of characteristic change. There are methods for distributing goods according to the weight-size priority principle, firstly placing goods with large weight and large size, then placing goods with small weight and small size, and then placing the goods in a stacking or stacking mode. According to the library bit allocation algorithm of K-means, a sample set is divided into K clusters according to the distance between samples, so that points in the clusters are tightly connected together as much as possible, and the distance between the clusters is as large as possible. The other distribution methods are used for carrying out a large amount of calculation optimization selection, such as genetic algorithm, weed invasion algorithm and the like, by setting an optimization function, but the distribution method is complex, large in calculation amount, low in algorithm searching speed, and has certain dependence on the selection of an initial population, so that the effect is poor in practical application.
Disclosure of Invention
Aiming at the defects existing in the prior art, the invention provides a library position distribution system and method based on a feature priority principle and split combination.
The invention uses the characteristic priority principle (the characteristics can be the type of goods, the material number and the packing type, the specific characteristic selection can be changed according to the characteristic selection module according to the different goods stored in different warehouse centers) and the split combination as the core idea, and the goods are gathered together according to a certain appointed characteristic, thereby improving the utilization rate of the storage space and reducing the workload of the warehouse-in and warehouse-out staff.
The library position distribution system based on the characteristic priority principle and the splitting combination comprises an idle support group calculation module, a characteristic selection module, a characteristic duplication removal module and a library position distribution module.
And the idle support group calculation module calculates all continuous adjacent idle support groups according to the features selected by the feature selection module.
The feature selection module: the features most distinguished between the goods (i.e. the features used in the steps in the whole system) are selected according to the goods required to be stored in the current warehouse, and the selection rules are as follows:
Case I: if the goods to be stored have different material numbers, the material numbers are selected as the selection features.
Case II: if the goods to be stored are not differentiated in the material numbers, but have various goods types, the goods types are selected as the selection characteristics.
Case III: and if the cargoes to be stored have the same material number and the same cargo type, selecting the packing size of the cargoes as the selection characteristic.
And the characteristic duplicate removal module: and carrying out characteristic de-duplication according to the non-idle support position information in the continuous adjacent idle support group and the cargo characteristics on the support position, so that the same characteristics in the continuous adjacent idle support group are recorded for one part, and the de-duplication rule is as follows:
case I: if there is only one copy of the feature in consecutive adjacent free pallet groups, no deduplication is required.
Case II: if there are multiple sets of features in consecutive adjacent free pallet groups and there is only one set of features closest to the left or right boundary bank bits of the pallet group, then the feature is selected to be left (features on non-free pallet bits are bound to the location information of non-free pallet bits).
Goods are distributed on the boundaries of the continuous adjacent idle pallet groups, so that the occurrence of the condition of dividing the pallet groups is reduced.
Case III: if there are multiple sets of features in the consecutive adjacent free pallet and one set of the same pallet is located at each of the left and right boundary pallet distances, then either the left-most feature is randomly selected to remain or the right-most feature is randomly selected to remain, both of which have the same probability of 50%.
The goods are uniformly distributed on the boundaries of two sides of the continuous adjacent idle supporting groups, so that the situation that all the goods are placed on one side is prevented.
The warehouse position distribution module splits all cargoes to be warehoused according to the characteristic priority principle and the current continuous adjacent idle pallet group of the warehouse until all cargoes can be put into the continuous adjacent idle pallet group in a clustered manner according to the characteristic, and the belonging pallet position is found for each cargo.
The library bit allocation method based on the feature priority principle and the splitting combination comprises the following steps:
step 1, acquiring all current continuous adjacent idle pallet groups of a warehouse.
All the existing library position data in the warehouse are input into the idle support group calculation module, and the idle support group calculation module calculates all the continuous adjacent idle support groups according to the characteristics selected by the characteristic selection module (the characteristics can be the types of goods, material numbers and packing types, and specific characteristic selection can be changed according to the characteristics selection module according to different goods stored in different warehouse centers). Considering that each storage location is a vertical column of shelves, each storage location comprises a plurality of supporting locations, and each supporting location can be used for placing one unit of goods, namely one box of goods. As long as the library bits are adjacent, the free bits are adjacent, for example, the library bit 1 and the library bit 2 are adjacent, so that the free bit A on the library bit 1 and the free bit B on the library bit 2 are adjacent free bits; a row of single shelves is an independent storage place, wherein different layers are different support places.
Each continuous adjacent idle pallet group contains accurate position information of idle pallet positions in the pallet group, so that the pallet positions can be conveniently distributed for goods to be distributed later, and the total number of the idle pallet positions in the pallet group. Each continuous adjacent idle supporting group also comprises accurate position information of non-idle supporting positions in the supporting group, and the characteristics of the cargoes stored on the supporting positions are convenient for searching the most suitable supporting positions for the cargoes to be distributed by using the characteristic priority principle.
Step 2, distributing goods: all goods to be put in the warehouse are split through the warehouse position distribution module according to the characteristic priority principle and the current continuous adjacent idle pallet group of the warehouse until all goods can be put in the continuous adjacent idle pallet group in a clustered manner according to the characteristics, and the belonging pallet position is found for each goods.
All cargoes to be distributed and all existing continuous adjacent idle support group data are input, all cargoes are divided into a plurality of different characteristic cargo groups to be distributed according to the characteristics selected in the step 1, then each cargo group to be distributed containing cargoes with the same characteristic can be disassembled and combined into a plurality of small cargo groups to be distributed with the same characteristic according to the characteristic priority principle and placed into different continuous adjacent idle support groups, the disassembly and combination considers the condition that the continuous adjacent idle support groups are insufficient to load the whole cargo group to be distributed at one time, and only the cargo groups to be distributed can be disassembled and then respectively loaded into different continuous adjacent idle support groups, so that cargoes with the same characteristic can be placed together in an aggregation mode, and the quantity of outlier cargoes is reduced.
Step 3, updating the library bits: and (3) distributing the cargoes to the corresponding supporting positions according to the distribution result of the step (2), namely, carrying out the cargoes warehousing operation according to the positions where the cargoes are to be placed, and updating the information of the warehouse positions after the warehousing operation is completed.
The invention has the following beneficial effects:
The method can solve the problem that the whole goods group to be distributed cannot be distributed at one time due to insufficient number of idle supporting positions in the continuous adjacent idle supporting groups in the warehouse, and can ensure that the distributed goods reach an optimal state with more aggregation and less separation, thereby greatly reducing the workload and the working difficulty of warehouse management personnel during warehouse-in and warehouse-out.
The method can accurately and rapidly find the address where the goods should be stored, and ensure that the latest library state can be correctly updated after each operation, so that errors such as repeated address allocation and the like do not occur in the subsequent operation.
Drawings
FIG. 1 is a flow chart of a method of the present invention for obtaining vacancies;
FIG. 2 is a flow chart of the method of the present invention for distributing cargo;
FIG. 3 is a flowchart of a method of updating a library bitstream according to the present invention;
FIG. 4 is a conceptual diagram of the method of the present invention for acquiring successive adjacent free pallet groups in a null;
FIG. 5 is a process of splitting a group of goods to be distributed in the method of the present invention for distributing the goods;
FIG. 6 is a process of the present invention for assigning the same characteristic cargo group in the updated pool bits.
Detailed Description
The invention is further described below with reference to the drawings and examples.
The library position distribution system based on the characteristic priority principle and the splitting combination comprises an idle support group calculation module, a characteristic selection module, a characteristic duplication removal module and a library position distribution module.
And the idle support group calculation module calculates all continuous adjacent idle support groups according to the features selected by the feature selection module.
The feature selection module: the features most distinguished between the goods (i.e. the features used in the steps in the whole system) are selected according to the goods required to be stored in the current warehouse, and the selection rules are as follows:
Case I: if the goods to be stored have different material numbers, the material numbers are selected as the selection features.
Case II: if the goods to be stored are not differentiated in the material numbers, but have various goods types, the goods types are selected as the selection characteristics.
Case III: and if the cargoes to be stored have the same material number and the same cargo type, selecting the packing size of the cargoes as the selection characteristic.
And the characteristic duplicate removal module: and carrying out characteristic de-duplication according to the non-idle support position information in the continuous adjacent idle support group and the cargo characteristics on the support position, so that the same characteristics in the continuous adjacent idle support group are recorded for one part, and the de-duplication rule is as follows:
case I: if there is only one copy of the feature in consecutive adjacent free pallet groups, no deduplication is required.
Case II: if there are multiple sets of features in consecutive adjacent free pallet groups and there is only one set of features closest to the left or right boundary bank bits of the pallet group, then the feature is selected to be left (features on non-free pallet bits are bound to the location information of non-free pallet bits).
Goods are distributed on the boundaries of the continuous adjacent idle pallet groups, so that the occurrence of the condition of dividing the pallet groups is reduced.
Case III: if there are multiple sets of features in the consecutive adjacent free pallet and one set of the same pallet is located at each of the left and right boundary pallet distances, then either the left-most feature is randomly selected to remain or the right-most feature is randomly selected to remain, both of which have the same probability of 50%.
The goods are uniformly distributed on the boundaries of two sides of the continuous adjacent idle supporting groups, so that the situation that all the goods are placed on one side is prevented.
The warehouse position distribution module splits all cargoes to be warehoused according to the characteristic priority principle and the current continuous adjacent idle pallet group of the warehouse until all cargoes can be put into the continuous adjacent idle pallet group in a clustered manner according to the characteristic, and the belonging pallet position is found for each cargo.
As shown in fig. 1, step 1, obtaining all current continuous adjacent idle pallet groups of a warehouse, and specifically implementing the following steps:
Step 1.1, the required characteristics of the current warehouse center for distinguishing goods are obtained according to the characteristic selection module, then the idle support group calculation module is initialized to set a result array vacancies for storing all continuous adjacent idle support groups and a temporary storage array currentVacancy for temporarily storing single continuous adjacent idle support groups, then the support positions of all warehouse positions in the warehouse are traversed in sequence, when idle support positions are detected, the warehouse position number and the support position number of the support position are recorded in the temporary storage array currentVacancy, and when the support positions stored with goods are detected, the characteristics of the goods stored in the support positions are additionally recorded in the temporary storage array currentVacancy besides the warehouse position number and the support position number of the support positions.
Step 1.2, respectively considering whether the traversed library bits have idle held bits or not:
case I: if the free supporting bits exist in the library bits, the fact that the searching of the current continuous adjacent free supporting groups is not finished is proved, the position information of the free supporting bits in the step 1.1 and the characteristic information of goods stored on the non-free supporting bits are temporarily added into a temporary storage array currentVacancy, then the following library bits are continuously traversed, and the position information of the free supporting bits is recorded in the temporary storage array and used for quickly placing the goods subsequently; the feature information of the goods on the non-idle carrier is recorded for subsequent goods distribution according to the feature priority principle.
Case II: if the library bit has no free supporting bit, the end of the search of the current continuous adjacent free supporting group is proved, and the content in the temporary storage array currentVacancy is used as a continuous adjacent free supporting group individual to be put into the result array vacancies. The specific operation is as follows: the method comprises the steps of adding the position information of the non-idle support bits in the library bits and the characteristics of goods placed on the support bits into a temporary storage array currentVacancy, performing characteristic deduplication processing through a characteristic deduplication module, calculating and recording the number of idle support bits, then placing the data in the temporary storage array currentVacancy as a continuous adjacent idle support group individual into a result array vacancies, and then emptying the temporary storage array so as to temporarily store the next continuous adjacent idle support group.
Step 1.3: and when traversing to the last library bit, performing special processing according to whether the last library bit has an idle supporting bit, if so, finishing searching of the current continuous adjacent idle supporting group because the last library bit is traversed, and performing the processing of the condition II in the step 1.2 once.
After the traversal of all the library bits is completed, a plurality of continuous adjacent idle support groups are stored in the result array, and each continuous adjacent idle support group contains the following information: the number of idle supporting bits in the supporting group, the number of the base bit and the number of the supporting bit to which each idle supporting bit belongs, the number of the base bit and the number of the supporting bit to which the non-idle supporting bit adjacent to the idle supporting bit belongs, and the characteristics of goods stored on the non-idle supporting bit, namely the characteristics of adjacent goods.
As shown in fig. 2 and fig. 5, step 2, the warehouse location allocation module splits the goods to be warehoused according to the feature priority principle and the current continuous adjacent idle pallet group of the warehouse until all the goods can be put into the continuous adjacent idle pallet group in a clustered manner, and finds the belonging pallet for each of the goods, which is specifically implemented as follows:
Step 2.1: dividing all goods to be put in storage into a plurality of goods groups to be distributed according to different characteristics (namely, the specific characteristics selected by the characteristic selection module), and distributing the different goods groups to be distributed in batches.
Step 2.2: and distributing the goods to be distributed, which have the same characteristics, to store the goods to be distributed in the continuous adjacent idle pallet groups, and if the condition that the characteristics of the existing goods on the pallet are the same as those of the goods to be distributed exists, placing the goods to be distributed at the adjacent positions of the existing goods with the same characteristics. Firstly, traversing each continuous adjacent idle support group in a result array, and carrying out different operations according to the traversing result, wherein the situation I is as follows: if the number of idle supporting bits in a certain continuous adjacent idle supporting group is greater than or equal to the number of cargoes in a cargo group to be distributed, and the characteristics of the cargoes to be distributed are consistent with the characteristics of the adjacent cargoes recorded in the continuous adjacent idle supporting group, the continuous adjacent idle supporting group is directly used; case II: if the number of the idle supporting bits of a continuous adjacent idle supporting group is found to be larger than or equal to the number of cargoes in the cargo group to be distributed, but the characteristics of the cargoes to be distributed are not consistent with the characteristics of the adjacent cargoes recorded in the continuous adjacent idle supporting group, the continuous adjacent idle supporting group is recorded, and the result array is continuously traversed until the result array is traversed or the continuous adjacent idle supporting group which accords with the condition I is found; case III: and traversing all the continuous adjacent idle support groups, and returning the information which is not established if the continuous adjacent idle support groups which meet the number requirements cannot be found.
Step 2.3: if the continuous adjacent idle supporting group in the case I or the case II exists, the condition that the goods group to be distributed has the continuous adjacent idle supporting group for placement is indicated, and if the condition III exists, the condition that the continuous adjacent idle supporting group which is large enough does not exist at present is proved to exist, and the goods group to be distributed is placed in the continuous adjacent idle supporting group at one time, so that the goods group to be distributed is split in a splitting and combining mode, and the split goods group to be distributed returns to the step 2.2 for distribution again.
The splitting rule is as follows: if a to-be-allocated goods group A with the storage quantity of X of a continuous idle support group cannot be found, taking out a unit (namely the number of goods which can be placed in one support position, namely a box of goods) of the to-be-allocated goods group A, and optionally placing the goods a into other to-be-allocated goods groups.
The placement rule of a unit cargo a is: if a certain to-be-allocated cargo group B exists, the quantity of the to-be-allocated cargo group B is smaller than X-1, a unit cargo a taken out can be placed into the to-be-allocated cargo group B, and if the to-be-allocated cargo group meeting the requirement does not exist, the unit cargo a is independently formed into a new to-be-allocated cargo group C.
As shown in fig. 3 and fig. 6, step 3, distributing the goods to the corresponding supporting positions according to the distribution result of step 2 and updating the information of the library positions, and specifically realizes the following steps:
And 2, obtaining a plurality of split goods groups to be distributed and a continuous adjacent idle pallet group which corresponds to each goods group to be distributed and can accommodate the goods groups to be distributed. For a certain to-be-allocated cargo group, if the corresponding continuous adjacent idle supporting group is found in the condition I in the step 2.2, a storage position with the adjacent cargo characteristics consistent with the to-be-allocated cargo group characteristics is found from the continuous adjacent idle supporting group, and cargoes in the to-be-allocated cargo group are placed into idle supporting positions on two sides in a diffusing manner by taking the storage position as the center; if the consecutive adjacent free pallet group corresponding to the to-be-allocated cargo group is found in the case II in step 2.2, the cargo is directly placed from the first bin of the consecutive adjacent free pallet group.
As shown in FIG. 4, since the first and second banks are adjacent, the free held-bit 3 of the first bank and the free held-bit 2 of the second bank belong to one adjacent free held-bit group; because a full-support library position III exists between the library position II and the library position IV, the idle support position 2 of the library position II and the idle support position 3 of the library position IV belong to an adjacent idle support position group (a single row of shelves is set as an independent library position in the library position distribution system, wherein different layers are different supports).
Claims (3)
1. The library position distribution method based on the characteristic priority principle and the splitting combination is characterized in that the method is based on a library position distribution system, and the library position distribution system comprises an idle support group calculation module, a characteristic selection module, a characteristic duplication removal module and a library position distribution module;
The idle support group calculation module calculates all continuous adjacent idle support groups according to the features selected by the feature selection module;
the feature selection module: selecting the characteristic with the most distinction between cargoes according to cargoes required to be stored in the current warehouse, wherein the selection rule is as follows:
Case I: if the goods to be stored have different material numbers, selecting the material numbers as selection characteristics;
case II: if the goods to be stored have no degree of distinction in the material numbers, but have various goods types, selecting the goods types as selection characteristics;
case III: if the goods to be stored have the same material number and the same goods type, selecting the container size of the goods as the selection characteristic;
And the characteristic duplicate removal module: and carrying out characteristic de-duplication according to the non-idle support position information in the continuous adjacent idle support group and the cargo characteristics on the support position, so that the same characteristics in the continuous adjacent idle support group are recorded for one part, and the de-duplication rule is as follows:
case I: if the features in the continuous adjacent idle bracket groups are only one, no duplication removal is needed;
case II: if a plurality of features exist in the continuous adjacent idle supporting groups and only one feature is closest to the left or right boundary library position of the supporting groups, selecting to leave the feature, wherein the feature on the non-idle supporting position is bound with the position information of the non-idle supporting position;
Goods are distributed on the boundaries of the continuous adjacent idle supporting groups, so that the situation of dividing the supporting groups is reduced;
Case III: if multiple features exist in the continuous adjacent idle bracket groups and the same distance from the left and right boundary library positions of the bracket groups are one for each library position, randomly selecting to reserve the leftmost feature or reserve the rightmost feature, wherein the probability of both features is 50 percent and the probability of both features is the same;
the goods are uniformly distributed on the boundaries of two sides of the continuous adjacent idle support groups, so that the situation that all goods are placed on one side is prevented;
The warehouse position distribution module splits all cargoes to be warehoused according to the characteristic priority principle and the current continuous adjacent idle pallet group of the warehouse until all cargoes can be put into the continuous adjacent idle pallet group in a clustered manner according to the characteristic, and the belonging pallet position is found for each cargo;
The library bit allocation method based on the feature priority principle and the splitting combination comprises the following steps:
Step 1, acquiring all current continuous adjacent idle pallet groups of a warehouse;
Inputting all the existing library position data in a warehouse into an idle support group calculation module, and calculating all continuous adjacent idle support groups by the idle support group calculation module according to the characteristics selected by the characteristic selection module; considering that each storage position is a vertical column of shelves, each storage position comprises a plurality of supporting positions, each supporting position can be used for placing a unit of goods, and the unit of goods refers to a box of goods; as long as the library positions are adjacent, the idle support positions are adjacent, and a row of single shelves are independent library positions, wherein different layers are different support positions;
Each continuous adjacent idle supporting group comprises accurate position information of idle supporting positions in the supporting group, so that the supporting positions are conveniently distributed for goods to be distributed subsequently, and the total number of the idle supporting positions in the supporting group; each continuous adjacent idle supporting group also comprises accurate position information of non-idle supporting positions in the supporting group, and the characteristics of the cargoes stored on the supporting positions are convenient for searching the most suitable supporting positions for the cargoes to be distributed by using the characteristic priority principle;
Step 2, distributing goods: splitting all cargoes to be put in the warehouse according to the characteristic priority principle and the current continuous adjacent idle pallet group of the warehouse through the warehouse position distribution module until all cargoes can be put in the continuous adjacent idle pallet group in a clustered manner according to the characteristic, and finding the belonging pallet position for each cargo;
The method comprises the steps of inputting all cargoes to be distributed and all existing continuous adjacent idle support group data, firstly dividing all cargoes into a plurality of cargo groups to be distributed with different characteristics according to the characteristics selected in the step 1, then respectively disassembling each cargo group to be distributed containing cargoes with the same characteristics into a plurality of small cargo groups to be distributed with the same characteristics according to the characteristic priority principle, and putting the small cargo groups to be distributed into different continuous adjacent idle support groups, wherein the disassembling combination considers that the condition that the continuous adjacent idle support groups are insufficient to load the whole cargo group to be distributed at one time is considered, and only the cargo groups to be distributed can be disassembled and then respectively loaded into different continuous adjacent idle support groups;
Step 3, updating the library bits: distributing the cargoes to the corresponding supporting positions according to the distribution result of the step 2, namely carrying out the cargoes warehousing operation according to the positions where the cargoes are to be placed, and updating the information of the warehouse positions after the warehousing operation is completed;
The step 1 is specifically realized as follows:
Step 1.1, according to a feature selection module, obtaining the features required by a current warehouse center when distinguishing goods, then an idle pallet calculation module is initialized to set a result array vacancies for storing all continuous adjacent idle pallets and a temporary storage array currentVacancy for temporarily storing a single continuous adjacent idle pallet, traversing all pallet positions in a warehouse in sequence, recording the pallet position number and the pallet position number of the pallet position in the temporary storage array currentVacancy when the idle pallet positions are detected, and additionally recording the features of the goods stored in the pallet positions in the temporary storage array currentVacancy besides the pallet position number and the pallet position number when the pallet positions are detected;
Step 1.2, respectively considering whether the traversed library bits have idle held bits or not:
Case I: if the free supporting bits exist in the library bits, the fact that the searching of the current continuous adjacent free supporting groups is not finished is proved, the position information of the free supporting bits in the step 1.1 and the characteristic information of goods stored on the non-free supporting bits are temporarily added into a temporary storage array currentVacancy, then the following library bits are continuously traversed, and the position information of the free supporting bits is recorded in the temporary storage array and used for quickly placing the goods subsequently; the cargo characteristic information recorded on the non-idle carrier bit is used for distributing cargoes according to the characteristic priority principle in the follow-up;
Case II: if the library bit has no free supporting bit, proving that the searching of the current continuous adjacent free supporting group is finished, and taking the content in the temporary storage array currentVacancy as a continuous adjacent free supporting group individual to be put into the result array vacancies; the specific operation is as follows: the method comprises the steps of adding position information of non-idle support bits in the library bits and characteristics of goods placed on the support bits into a temporary storage array currentVacancy, performing characteristic deduplication processing through a characteristic deduplication module, calculating and recording the number of idle support bits, then placing data in a temporary storage array currentVacancy as a continuous adjacent idle support group individual into a result array vacancies, and then emptying the temporary storage array so as to temporarily store the next continuous adjacent idle support group;
Step 1.3: when traversing to the last library bit, performing special treatment according to whether the last library bit has an idle supporting bit, if so, but the searching of the current continuous adjacent idle supporting group must be finished because the last library bit is traversed, and performing the treatment process of the condition II in the step 1.2 once;
After the traversal of all the library bits is completed, a plurality of continuous adjacent idle support groups are stored in the result array, and each continuous adjacent idle support group contains the following information: the number of idle supporting bits in the supporting group, the number of the base bit and the number of the supporting bit to which each idle supporting bit belongs, the number of the base bit and the number of the supporting bit to which the non-idle supporting bit adjacent to the idle supporting bit belongs, and the characteristics of goods stored on the non-idle supporting bit, namely the characteristics of adjacent goods;
The step 2 is specifically realized as follows:
Step 2.1: dividing all goods to be put in storage into a plurality of goods groups to be distributed according to different characteristics, and distributing the different goods groups to be distributed in batches, wherein the goods all have the same characteristics by taking the goods group to be distributed as an example;
Step 2.2: distributing the goods groups to be distributed, which have the same characteristics, storing the goods groups to be distributed in the continuous adjacent idle bracket groups, and if the condition that the characteristics of the existing goods on the bracket are the same as those of the goods to be distributed exists, placing the goods to be distributed at the adjacent positions of the existing goods with the same characteristics; firstly, traversing each continuous adjacent idle support group in a result array, and carrying out different operations according to the traversing result, wherein the situation I is as follows: if the number of idle supporting bits in a certain continuous adjacent idle supporting group is greater than or equal to the number of cargoes in a cargo group to be distributed, and the characteristics of the cargoes to be distributed are consistent with the characteristics of the adjacent cargoes recorded in the continuous adjacent idle supporting group, the continuous adjacent idle supporting group is directly used; case II: if the number of the idle supporting bits of a continuous adjacent idle supporting group is found to be larger than or equal to the number of cargoes in the cargo group to be distributed, but the characteristics of the cargoes to be distributed are not consistent with the characteristics of the adjacent cargoes recorded in the continuous adjacent idle supporting group, the continuous adjacent idle supporting group is recorded, and the result array is continuously traversed until the result array is traversed or the continuous adjacent idle supporting group which accords with the condition I is found; case III: traversing all the continuous adjacent idle support groups, and returning the information which is not established if the continuous adjacent idle support groups which meet the number requirements cannot be found;
step 2.3: if the continuous adjacent idle supporting group in the case I or the case II exists, the condition that the goods group to be distributed has the continuous adjacent idle supporting group for placement is indicated, if the condition III exists, the condition that the continuous adjacent idle supporting group which is large enough does not exist at present is proved to exist at present, the goods group to be distributed is placed in the condition that the goods group to be distributed is once, so the goods group to be distributed is split in a splitting and combining mode, and the split goods group to be distributed returns to the step 2.2 for distribution again;
The splitting rule is as follows: if the to-be-allocated goods group A with the storage quantity of X of a continuous idle support group cannot be found, taking out a unit of goods a from the to-be-allocated goods group A and placing the unit of goods a into other to-be-allocated goods groups;
The placement rule of a unit cargo a is: if a certain to-be-allocated cargo group B exists, the quantity of the to-be-allocated cargo group B is smaller than X-1, a unit cargo a taken out can be placed into the to-be-allocated cargo group B, and if the to-be-allocated cargo group meeting the requirement does not exist, the unit cargo a is independently formed into a new to-be-allocated cargo group C.
2. The method for allocating base bits based on feature priority principle and split combination according to claim 1, wherein step3 is specifically implemented as follows:
step 2, a plurality of split goods groups to be distributed and a continuous adjacent idle support group which corresponds to each goods group to be distributed and can accommodate the goods groups to be distributed can be obtained; for a certain to-be-allocated cargo group, if the corresponding continuous adjacent idle supporting group is found in the condition I in the step 2.2, a storage position with the adjacent cargo characteristics consistent with the to-be-allocated cargo group characteristics is found from the continuous adjacent idle supporting group, and cargoes in the to-be-allocated cargo group are placed into idle supporting positions on two sides in a diffusing manner by taking the storage position as the center; if the consecutive adjacent free pallet group corresponding to the to-be-allocated cargo group is found in the case II in step 2.2, the cargo is directly placed from the first bin of the consecutive adjacent free pallet group.
3. The method for allocating the stock positions based on the characteristic priority principle and the split combination according to claim 1 or 2, wherein the characteristics are the types of goods, the numbers of materials and the types of containers, and the specific characteristic selection can be changed according to different goods stored in different warehouse centers through a characteristic selection module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011625762.2A CN112700194B (en) | 2020-12-31 | 2020-12-31 | Library position distribution system and method based on feature priority principle and split combination |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011625762.2A CN112700194B (en) | 2020-12-31 | 2020-12-31 | Library position distribution system and method based on feature priority principle and split combination |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112700194A CN112700194A (en) | 2021-04-23 |
| CN112700194B true CN112700194B (en) | 2024-05-07 |
Family
ID=75513192
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011625762.2A Active CN112700194B (en) | 2020-12-31 | 2020-12-31 | Library position distribution system and method based on feature priority principle and split combination |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112700194B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI783758B (en) * | 2021-10-27 | 2022-11-11 | 環球晶圓股份有限公司 | Method for calculating object pick-and-place sequence and electronic apparatus for automatic storage pick-and-place |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103473616A (en) * | 2013-09-17 | 2013-12-25 | 四川航天系统工程研究所 | Dynamic goods allocation planning method and system for processing multi-variety goods and material storage |
| CN104574019A (en) * | 2014-12-26 | 2015-04-29 | 北京首钢自动化信息技术有限公司 | Discrete warehouse area-oriented accurate storage method |
| CN106960300A (en) * | 2017-03-22 | 2017-07-18 | 湖北九州通达科技开发有限公司 | Implementation method and device are filled at the beginning of a kind of stock of Medical Logistics industry |
| CN107341629A (en) * | 2017-05-24 | 2017-11-10 | 国网北京市电力公司 | Bay assignment method and device |
| CN109409554A (en) * | 2018-10-30 | 2019-03-01 | 东莞市大易产业链服务有限公司 | One kind being based on the visual management-control method in warehouse |
| CN110675025A (en) * | 2019-08-26 | 2020-01-10 | 珠海格力电器股份有限公司 | Dynamic warehousing method and system and computer readable storage medium |
| CN111126918A (en) * | 2019-12-25 | 2020-05-08 | 湖北普罗劳格科技股份有限公司 | Goods position distribution method and system for commodity warehousing |
-
2020
- 2020-12-31 CN CN202011625762.2A patent/CN112700194B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103473616A (en) * | 2013-09-17 | 2013-12-25 | 四川航天系统工程研究所 | Dynamic goods allocation planning method and system for processing multi-variety goods and material storage |
| CN104574019A (en) * | 2014-12-26 | 2015-04-29 | 北京首钢自动化信息技术有限公司 | Discrete warehouse area-oriented accurate storage method |
| CN106960300A (en) * | 2017-03-22 | 2017-07-18 | 湖北九州通达科技开发有限公司 | Implementation method and device are filled at the beginning of a kind of stock of Medical Logistics industry |
| CN107341629A (en) * | 2017-05-24 | 2017-11-10 | 国网北京市电力公司 | Bay assignment method and device |
| CN109409554A (en) * | 2018-10-30 | 2019-03-01 | 东莞市大易产业链服务有限公司 | One kind being based on the visual management-control method in warehouse |
| CN110675025A (en) * | 2019-08-26 | 2020-01-10 | 珠海格力电器股份有限公司 | Dynamic warehousing method and system and computer readable storage medium |
| CN111126918A (en) * | 2019-12-25 | 2020-05-08 | 湖北普罗劳格科技股份有限公司 | Goods position distribution method and system for commodity warehousing |
Non-Patent Citations (1)
| Title |
|---|
| 基于嵌套分区算法的立体仓库货位分配优化;李小笠;刘桂芝;杨文亮;;计算机工程与应用(第02期);第246-250页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112700194A (en) | 2021-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108550007B (en) | Goods space optimization method and system for automatic stereoscopic warehouse of pharmaceutical enterprise | |
| CN111476413A (en) | Warehouse storage position distribution method and system based on big data | |
| CN111091328B (en) | Warehouse entry management method and management device | |
| CN111178606A (en) | Automatic warehouse storage position allocation optimization method based on NSGA-II | |
| US8799293B2 (en) | System and method for efficient storage destination determination in a storage facility | |
| CN103723422B (en) | A kind of many degree of depth bidirectional flow type shelf and layout access method (AM) thereof | |
| CN110084471A (en) | Sort dispatching method, device, warehousing system and readable storage medium storing program for executing | |
| CN111027902B (en) | Unmanned warehouse goods transportation matching method and device | |
| CN116402445B (en) | Goods delivery scheduling method, device and computer equipment | |
| CN114841642B (en) | Auxiliary material warehouse entry cargo space distribution method based on eagle perch optimization | |
| CN105096174A (en) | Transaction matching method and transaction matching system | |
| CN111126857B (en) | Intensive storage task management method and device and electronic equipment | |
| CN112700194B (en) | Library position distribution system and method based on feature priority principle and split combination | |
| CN112132520B (en) | Material warehousing method and device and management equipment | |
| US20220414594A1 (en) | Optimizing truck loading of pallets | |
| CN112132522A (en) | Material warehousing method and device and management equipment | |
| CN109388636A (en) | Business datum is inserted into database method, apparatus, computer equipment and storage medium | |
| CN110619493B (en) | AGV layout method and system, electronic device and storage medium | |
| Lanza et al. | Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches | |
| CN113663931B (en) | Article sorting method and device | |
| CN116050671B (en) | Automatic stereoscopic warehouse shelf information automatic maintenance method | |
| CN113650997B (en) | Article warehouse-out positioning method and device | |
| CN111105193B (en) | Article transfer method and device, electronic equipment and storage medium | |
| Oxenstierna et al. | Analysis of Computational Efficiency in Iterative Order Batching Optimization. | |
| CN110297836A (en) | User tag storage method and search method based on compress bitmap mode |
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 |