CN113034082A - Storage optimization method, storage control equipment and system - Google Patents

Storage optimization method, storage control equipment and system Download PDF

Info

Publication number
CN113034082A
CN113034082A CN202110377661.6A CN202110377661A CN113034082A CN 113034082 A CN113034082 A CN 113034082A CN 202110377661 A CN202110377661 A CN 202110377661A CN 113034082 A CN113034082 A CN 113034082A
Authority
CN
China
Prior art keywords
roadway
goods
warehouse
roadways
lane
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.)
Withdrawn
Application number
CN202110377661.6A
Other languages
Chinese (zh)
Inventor
陈小二
王营
韩曰乾
薄帅
马海龙
杨晓菡
王正
盛杨
杨峰
卞志阳
段志超
高君凯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qingdao Yingzhi Technology Co ltd
Original Assignee
Qingdao Yingzhi Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Qingdao Yingzhi Technology Co ltd filed Critical Qingdao Yingzhi Technology Co ltd
Priority to CN202110377661.6A priority Critical patent/CN113034082A/en
Publication of CN113034082A publication Critical patent/CN113034082A/en
Withdrawn legal-status Critical Current

Links

Images

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
    • 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)

Abstract

The application discloses a storage optimization method, storage control equipment and a storage optimization system. The method comprises the steps of receiving a tunnel merging triggering indication, and checking the type of goods in a not-full tunnel and the position condition of the goods; judging whether the combination of the roadways can be carried out or not according to the type of the goods and the position condition of the goods; and if the merging of the roadways can be carried out, generating a plurality of tasks according to the roadways needing to be merged, combining the task groups, determining the sequence of the task groups according to the merging effect of the roadways, and executing the merging tasks of the roadways according to the sequence of the task groups. By adopting the technical scheme, the warehouse positions in the underfilled roadway of the same kind of goods can be automatically combined, the complete roadway is vacated, the space resources are saved, and the storage utilization rate is improved.

Description

Storage optimization method, storage control equipment and system
Technical Field
The application relates to the technical field of warehousing management, in particular to a warehousing optimization method, warehousing control equipment and a warehousing control system.
Background
Logistics management has been moving towards automation, high efficiency and low cost. In order to save storage space, many logistics enterprises mostly adopt stereoscopic warehouses to store goods. The stereoscopic warehouse is an important logistics node in a modern logistics system, and is increasingly commonly applied in logistics centers.
However, although the high-rise shelf can fully utilize the warehouse space and improve the space utilization rate, the problems caused by warehousing of goods are solved, for example, the goods are randomly placed in the warehouse to cause difficulty in getting out of the warehouse, the goods are not planned to be placed to cause time waste in finding the goods out of the warehouse, and the like. The application numbers 202010656488.9 and 202010656053.4 disclose an intelligent stereoscopic warehouse, and the warehouse entry and exit of the intelligent stereoscopic warehouse also suggest that the same type of goods need to be stored in the roadway in order to enable the shuttle vehicle to more quickly access the goods when entering and exiting the warehouse.
However, after a goods is put into a tunnel, the tunnel cannot be occupied by other goods, so that the storage space is wasted to a certain extent.
Disclosure of Invention
The application provides a storage optimization method, which comprises the following steps:
receiving a tunnel merging triggering indication, and checking the type of goods in the unfilled tunnel and the position condition of the goods;
judging whether the combination of the roadways can be carried out or not according to the type of the goods and the position condition of the goods;
and if the merging of the roadways can be carried out, generating a plurality of tasks according to the roadways needing to be merged, combining the task groups, determining the sequence of the task groups according to the merging effect of the roadways, and executing the merging tasks of the roadways according to the sequence of the task groups.
The warehouse optimization method, wherein receiving a tunnel merge trigger indication specifically includes: and when the warehouse is detected to be idle, automatically entering a warehouse distribution optimization method, or manually triggering a roadway merging mechanism to enter the warehouse optimization method when the warehouse is idle.
The warehousing optimization method as described above, wherein the checking of the type of the goods in the unfilled roadway and the warehouse location condition includes: acquiring unfilled roadways with empty goods positions, classifying and sorting all unfilled roadways according to types of goods stored in the unfilled roadways, setting a set of all unfilled roadways of a certain kind of goods, then respectively acquiring the number of empty goods positions and the number of goods positions in the unfilled roadways of different goods types, and acquiring the number of empty goods positions of a certain unfilled roadway of a certain kind of goods and the number of goods positions of a certain unfilled roadway of a certain kind of goods; and calculating the sum of the empty positions of all the unfilled roadways under different cargo types.
The warehouse optimization method comprises the step of judging whether the combination of the roadways can be carried out, specifically, calling a roadway combination judging function, and when the difference between the empty position and the empty position of the roadway is judged to be larger than or equal to the number of the positions of the warehouses in the roadway for any one of the underfilled roadways in the same cargo type, indicating that the roadway can be emptied, namely judging that the cargo can be carried out the combination of the roadways.
The warehousing optimization method described above, wherein the merging of the lanes as required generates a plurality of tasks, and combines the task groups, specifically includes the following substeps:
calculating a first tunnel needing to be removed from goods in the combined tunnel task, and recording the first tunnel as a first source tunnel;
calculating 1 st to a th tunnels for storing the goods removed from the source tunnel in the merged tunnel task, and recording as 1 st to a th target tunnel set;
calculating the 2 nd to b th tunnels needing to be moved away from the goods in the merged tunnel task, and recording as the 2 nd to b th source tunnels;
calculating the (a +1) -c tunnels for storing goods removed from the source tunnel in the merged tunnel task, and recording as the (a +1) -c target tunnels;
calculating the (b +1) -d lanes needing to be moved away from goods in the merged tunnel task, and recording as the (b +1) -d source tunnels;
and arranging to obtain a source roadway set comprising c roadways and a target roadway set comprising d roadways, and jointly forming a task group.
The warehouse optimization method specifically includes the following substeps of calculating the first source roadway:
in the task of combining the roadways, sequentially sequencing all the underfilled roadways of a certain cargo according to the positions of the available warehouses to obtain the roadway with the least position of the available warehouses as a roadway set 1;
if the lane set 1 has more than one lane, the lane set 1 is sequentially ordered according to the empty warehouse bit number, and the lane with the largest goods empty warehouse bit number is used as the lane set 2;
and if the lane set 2 has more than one lane, performing lane weight calculation on the lane set 2 to obtain a least weight lane, and taking the final lane as a first source lane.
The warehousing optimization method described above, wherein the step of calculating the 1 st to a th target roadways specifically includes the substeps of:
in other underfilled roadways of which the first source roadway is removed from a certain cargo, inquiring the roadway with the empty roadway position number equal to the stock position number of the first source roadway to serve as a roadway set 3, and if a plurality of roadway sets 3 exist, calculating according to a roadway weight algorithm to obtain the roadway with the maximum weight;
if no laneway with the laneway empty warehouse bit number equal to the first source laneway cargo warehouse bit number exists, searching the situation that the sum of the laneway empty warehouse bit numbers is equal to the first source laneway cargo warehouse bit number, if the situation cannot be searched, updating the first source laneway cargo warehouse bit number, and then repeatedly executing the steps until a plurality of laneways with the excess empty warehouse bit number equal to 0 are searched;
and the final result of the calculation of the target roadway is that the types distinguished according to the number of empty warehouse bits owned by the roadway determine the required roadways, each type of roadway is firstly sorted from small → large according to the number of empty warehouse bits, if the result is not unique, the roadways are sorted from small → large according to the maximum value of the weight through the weight calculation of the roadway, and the roadways are sorted to be used as the 1 st to a th target roadway.
The warehousing optimization method comprises the steps of combining all goods types to form a task group queue, sequencing the task group queue from high to low according to the combination effect parameters, namely sequencing according to the efficiency marks, issuing the tasks with high efficiency, executing several combinations with the highest combination effect parameters according to the requirements of a site, and executing the tasks according to the sequence of the task groups.
The warehousing optimization method as described above, wherein the merging effect parameter satisfies the following condition:
M＝Eroadway/NTask
Wherein E isRoadwayNumber of lanes vacated for task group, NTaskAnd sorting the number of the tasks executed for the task group from large to small according to the value of the merging effect parameter M.
The present application further provides a storage control device, including: the control device executes the warehousing optimization method of any one of the above.
The application also provides a warehousing control system which is characterized by comprising the warehousing control equipment, an intelligent stereoscopic warehouse and a shuttle car, wherein the control equipment controls the shuttle car to store and take goods in a roadway of the intelligent stereoscopic warehouse and executes a warehousing optimization method.
The beneficial effect that this application realized is as follows: by adopting the technical scheme, the warehouse control system can automatically combine the positions in the underfilled roadway of the same kind of goods, so that the complete roadway is vacated, the space resources are saved, and the warehouse utilization rate is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present invention, and other drawings can be obtained by those skilled in the art according to the drawings.
Fig. 1 is a flowchart of a storage optimization method according to an embodiment of the present disclosure;
fig. 2 is a flowchart of a specific method for generating multiple tasks for a roadway to be merged as needed;
FIG. 3 is a flow chart of a particular method of computing a first source roadway;
fig. 4 is a flowchart of a specific method for calculating the 1 st to a th target lanes.
Detailed Description
The technical solutions in the embodiments of the present invention are clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
The embodiment of the application provides a warehousing optimization method, which is used for controlling merging of roadways to which the same type of goods belong in an intelligent stereoscopic warehouse in a warehousing system, wherein the warehousing system comprises the intelligent stereoscopic warehouse, a shuttle car and warehousing control equipment, and the warehousing control equipment controls the shuttle car to store and take the goods in the intelligent stereoscopic warehouse, so that the warehousing optimization effect is realized.
The intelligent stereoscopic warehouse is divided into a left warehouse and a right warehouse, each warehouse is provided with three cabins, the total six cabins are respectively a left cabin 1 floor, a left cabin 2 floor, a left cabin 3 floor, a right cabin 1 floor, a right cabin 2 floor and a right cabin 3 floor, two shuttle cars are arranged in each cabin, and a channel between the left warehouse and the right warehouse can not be used for placing goods and can only be used for the movement of the shuttle cars; each cabin comprises a plurality of tunnels with at least one outlet, and each tunnel comprises a plurality of goods positions with continuous positions;
in the intelligent stereoscopic warehouse, each lane is preset to store only one type of goods, so that after one lane is put in one goods, the lane cannot be occupied by other types of goods, so that the same type of goods in a plurality of lanes need to be put in fewer lanes, the lanes are left to store other types of goods, and the waste of storage space is reduced;
the areas of the merged tunnels can be distributed according to floors or reservoir areas, and when the reservoir areas or floors are not divided, the tunnels of the same floor or reservoir area are preferentially merged.
Referring to fig. 1, fig. 1 is a flowchart of a warehousing optimization method applied to a warehousing control device, including the following steps:
110, receiving a tunnel merging triggering indication, and checking the type of goods in the unfilled tunnel and the position condition of the goods;
in the embodiment of the application, when the control equipment detects that the warehouse is idle, the warehouse allocation optimization method is automatically entered, or when the warehouse is idle, a roadway merging mechanism is manually triggered, and the warehouse optimization method is entered;
it should be noted that, in order not to affect the normal warehousing and ex-warehousing of the warehouse, the warehouse allocation optimization method provided by the present application is preferably set to an interrupted form, and in the process of executing the warehouse allocation optimization method, if a warehouse warehousing and ex-warehousing instruction is received, the warehouse allocation optimization method is exited, and a warehouse warehousing and ex-warehousing instruction is executed;
after receiving a tunnel merging triggering instruction, acquiring an unfilled tunnel with empty goods positions in an intelligent stereoscopic warehouse, classifying and arranging all unfilled tunnels according to the types of goods stored in the unfilled tunnels, setting the set of all unfilled tunnels of a certain kind of goods as notfullalys, then respectively acquiring the number of empty goods positions and the number of goods-in-stock positions in the unfilled tunnels of different goods types, setting the number of empty goods positions of a certain unfilled tunnel of a certain kind of goods as EmptyNumber, and the number of goods-in-stock positions of a certain unfilled tunnel of a certain kind of goods as goodsNumber; and calculating the sum of the empty positions of all the underfilled roadways under different cargo types, and setting the sum of the empty positions of all the underfilled roadways of a certain cargo to be emptyNumSum.
Step 120, judging whether the roadway combination can be carried out or not according to the type of the goods and the position condition of the goods, if so, executing step 130, otherwise, quitting the roadway combination operation;
in the embodiment of the application, by calling a roadway merging judgment function, for any one of the underfilled roadways under the same cargo type, when the difference between the empty position and the empty position of the roadway is judged to be greater than or equal to the number of the available positions of the roadway, the roadway can be empty, that is, the cargo can be merged;
specifically, the tunnel merge decision function is as follows:
NotFullAlleys.forEach(alley->{
if only one lane meets the condition, merging lanes
EmptyNumSum-alley.EmptyNumber>＝alley.goodsNumber
})
The empty warehouse positions of all the unfilled roadways of a certain cargo are the sum of the empty warehouse positions of all the unfilled roadways of the certain cargo, the empty warehouse position of any one of the unfilled roadways of the certain cargo is the empty warehouse position of any one of the unfilled roadways of the certain cargo, and the freight warehouse position of any one of the unfilled roadways of the certain cargo is the empty warehouse position of any one of the unfilled roadways of the certain cargo.
Step 130, generating a plurality of tasks according to the roadway needing to be merged, combining the task groups, determining the sequence of the task groups according to the merging effect of the roadway, and executing the merging tasks of the roadway according to the sequence of the task groups;
referring to fig. 2, generating a plurality of tasks according to the lanes to be merged, and combining the task groups specifically includes the following sub-steps:
131, calculating a first roadway needing to be moved away from goods in the combined roadway task, and recording the first roadway as a first source roadway;
the computing source roadway specifically comprises a 1 st source roadway, 2 nd to b th source roadways and (b +1) -d th source roadways in the computing source roadway set;
referring to fig. 3, specifically, the step of calculating the first source lane specifically includes the following sub-steps:
firstly, in a roadway merging task, sequentially sequencing all the underfilled roadways of a certain cargo according to the position number of the cargo stores to obtain a roadway with the least position number of the cargo stores as a roadway set 1;
since the fewer the number of the positions of the stock in a certain tunnel, the lower the cost for emptying the tunnel, the tunnel with the smallest stock position is preferentially selected as the < tunnel set 1> according to the ranking of the positions of the stock from small to large.
If the < lane set 1> has more than one lane, sequencing the < lane set 1> in sequence according to the empty warehouse bits, and taking the lane with the largest goods empty warehouse bit as a < lane set 2 >;
the larger the number of empty warehouse bits of a certain roadway is, the more serious the warehouse bit waste of the roadway is, the more the roadway needs to be merged, and therefore the number of the empty warehouse bits is sorted from large to small.
If the < lane set 2> has more than one lane, performing lane weight calculation on the < lane set 2> to obtain a lane with the minimum weight, and taking a final lane as a first source lane, wherein the number of the stock positions of the first source lane is goodsNum 1;
the calculation of the roadway weight specifically includes four dimensions of the storage weight calculation: and setting corresponding weight coefficients for different dimensions by using the position weight, the cold and hot area weight, the floor weight and the left and right warehouse weights, and calculating the total weight of the four dimensions.
Step 132, calculating 1 st to a th lanes for storing goods removed from the source lane in the merged lane task, and recording as 1 st to a th target lane sets;
referring to fig. 4, specifically, the step of calculating the 1 st to a th target lanes specifically includes the following sub-steps:
inquiring a roadway with the empty number of positions equal to the stock position number goodsNum1 of a first source roadway as a < roadway set 3> in other unfilled roadways of which the first source roadway is removed from a certain cargo, and if the < roadway set 3> has a plurality of empty positions, calculating according to a roadway weight algorithm to obtain a roadway with the maximum weight;
if no laneway with the empty laneway number equal to the stock number of the first source laneway exists, searching the condition that the sum of the empty laneway numbers is equal to the stock number of the first source laneway, goodsNum1, if the condition is not found, updating the stock number of the first source laneway with the goodsNum1 to goodsNum1+1, and then repeatedly executing the operation of the second step until a plurality of laneways with the excess empty laneway number emptyNum1 equal to 0 are searched;
finding the condition that the sum of the empty positions of the plurality of roadways is equal to the number of the stocked positions goodsNum1 of the first source roadway specifically comprises the following steps: knowing the total number SUM of the required empty warehouse bits and the empty warehouse bits of all the roadways, combining an optimal solution to ensure that the SUM of the empty warehouse bits of all the result roadways is equal to the total number of the required empty warehouse bits;
specifically, an array result [ ] is initialized to [0,0], the array records the number required by each type of lane, the length of the array is the number of types of lanes, and the array corresponds to the types of lanes from small to large, wherein the types of lanes refer to the number of empty storage bits, for example, the number of empty storage bits is 2, and the type of lanes is 2; in the tunnel merging task, for example, 8 tunnel types 2 and ten tunnel types 3 exist, if the number of required empty warehouse bits is 4, the result of the array result int [ ] is [2,0 ];
then maintains a pointer PPointer with a movable finger,PPointer with a movable fingerFirstly, pointing to the first value of an array result int, and adding the first value to +1, if the result of the result int is equal to SUM, indicating that the result is found, and returning the result; if the number of the pointer is less than the SUM, setting the number of the type as 0, and if the number exceeds the existing value, moving the pointer forward by one bit to indicate the number of the type of the new pointer as + 1; if the SUM is greater than the SUM, the upper bit of the highest bit which is not 0 needs to be cleared by +1 and other bits need to be cleared; if the pointer crosses the last bit of the resultInt, thenNo results were considered.
And thirdly, calculating the final result of the target roadway to determine the types of the roadways which need to be distinguished according to the number of empty warehouse bits owned by the roadway, firstly, sorting the roadways of each type from small to large according to the number of the empty warehouse bits, if the result is not unique, calculating the weight of the roadway, sorting the roadway into 1 st to a th target roadways according to the maximum weight value from small to large, and taking a as the number of the target roadway.
Step 133, calculating the 2 nd to b th lanes needing to be removed from the goods in the merged tunnel task, and recording the lanes as the 2 nd to b th source lanes;
in the embodiment of the application, the method for calculating the 2 nd to b th source roadways is the same as the substep (first) and (second) of the step 132, roadways with the specified number of stock positions are obtained according to emptyNum1 after the substep (second), if the result cannot be obtained, the emptyNum1+1 is recalculated, the number of the stock positions which are added is goodsNum2, when the goodsNum2 is equal to 0, the calculation is finished to obtain the 2 nd to b th source roadways, and at this time, the number of the source roadways which are found in a source roadway set is b;
if the number of calculated lanes exceeds a certain number, the (b +1) -d source lanes are directly calculated.
134, calculating the (a +1) -c lanes for storing the goods removed from the source lane in the merged tunnel task and recording as the (a +1) -c target lanes;
the method for calculating the (a +1) -c target roadways is the same as the substeps (i) and (ii) of the step 132, and the number of the calculated redundant empty positions is recorded as emptyNum 2.
135, calculating the (b +1) -d lanes needing to be moved away from goods in the merged tunnel task, and recording as the (b +1) -d source lanes;
in the embodiment of the present application, the method for calculating the (b +1) -th to d-th source tunnels is the same as that in step 133, but when an appropriate result cannot be found, the emptyNum2-1 is recalculated until emptyNum2 is 0; preferably, to limit the number of one task group, the calculation is up to this point.
Step 136, arranging to obtain a source roadway set comprising c roadways and a target roadway set comprising d roadways, and forming a task group together;
any one of the source roadway set and the target roadway set obtained through sorting can not be used by other task groups any more, all cargo types are combined to form a task group queue, the task group queues are sorted from high to low according to a combination effect parameter M, namely, the task groups are sorted according to an efficiency mark, a task with high efficiency is issued, several combinations with the highest combination effect parameter M and the task are executed according to site requirements, the task is executed according to the sequence of the task groups, and the correctness of the task is ensured;
wherein, the merging effect parameter satisfies the following conditions:
M＝Eroadway/NTask
Wherein E isRoadwayNumber of lanes vacated for task group, NTaskAnd sorting the number of the tasks executed for the task group from large to small according to the value of the merging effect parameter M.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application. Although the identification method and system of the order are disclosed in the present application, other logistics documents with different formats can be identified by the identification method of the present application, and it is obvious that various changes and modifications can be made to the present application by those skilled in the art without departing from the spirit and scope of the present application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims (10)

1. A storage optimization method is characterized by comprising the following steps:
receiving a tunnel merging triggering indication, and checking the type of goods in the unfilled tunnel and the position condition of the goods;
judging whether the combination of the roadways can be carried out or not according to the type of the goods and the position condition of the goods;
and if the merging of the roadways can be carried out, generating a plurality of tasks according to the roadways needing to be merged, combining the task groups, determining the sequence of the task groups according to the merging effect of the roadways, and executing the merging tasks of the roadways according to the sequence of the task groups.
2. The warehouse optimization method according to claim 1, wherein receiving a tunnel merge trigger indication specifically comprises: and when the warehouse is detected to be idle, automatically entering a warehouse distribution optimization method, or manually triggering a roadway merging mechanism to enter the warehouse optimization method when the warehouse is idle.
3. The warehouse optimization method according to claim 1, wherein the types of the goods in the unfilled roadway and the warehouse location conditions thereof are checked, and the method specifically comprises the following steps: acquiring unfilled roadways with empty goods positions, classifying and sorting all unfilled roadways according to types of goods stored in the unfilled roadways, setting a set of all unfilled roadways of a certain kind of goods, then respectively acquiring the number of empty goods positions and the number of goods positions in the unfilled roadways of different goods types, and acquiring the number of empty goods positions of a certain unfilled roadway of a certain kind of goods and the number of goods positions of a certain unfilled roadway of a certain kind of goods; and calculating the sum of the empty positions of all the unfilled roadways under different cargo types.
4. The warehouse optimization method according to claim 3, wherein the judgment of whether the lane combination is possible is carried out, specifically, by calling a lane combination judgment function, for any one of the unfilled lanes under the same cargo type, when the judgment result shows that the lane can be emptied of the empty slots and the empty slot number of the lane is greater than or equal to the available slot number of the lane, that is, the judgment result shows that the type of cargo can be combined with the lane.
5. The warehouse optimization method according to claim 1, wherein a plurality of tasks are generated from lanes combined as required, and the task group is combined, specifically comprising the following substeps:
calculating a first tunnel needing to be removed from goods in the combined tunnel task, and recording the first tunnel as a first source tunnel;
calculating 1 st to a th tunnels for storing the goods removed from the source tunnel in the merged tunnel task, and recording as 1 st to a th target tunnel set;
calculating the 2 nd to b th tunnels needing to be moved away from the goods in the merged tunnel task, and recording as the 2 nd to b th source tunnels;
calculating the (a +1) -c tunnels for storing goods removed from the source tunnel in the merged tunnel task, and recording as the (a +1) -c target tunnels;
calculating the (b +1) -d lanes needing to be moved away from goods in the merged tunnel task, and recording as the (b +1) -d source tunnels;
and arranging to obtain a source roadway set comprising c roadways and a target roadway set comprising d roadways, and jointly forming a task group.
6. The warehouse optimization method according to claim 5, wherein calculating the first source roadway specifically comprises the substeps of:
in the task of combining the roadways, sequentially sequencing all the underfilled roadways of a certain cargo according to the positions of the available warehouses to obtain the roadway with the least position of the available warehouses as a roadway set 1;
if the lane set 1 has more than one lane, the lane set 1 is sequentially ordered according to the empty warehouse bit number, and the lane with the largest goods empty warehouse bit number is used as the lane set 2;
and if the lane set 2 has more than one lane, performing lane weight calculation on the lane set 2 to obtain a least weight lane, and taking the final lane as a first source lane.
7. The warehouse optimization method according to claim 5, wherein the step of calculating the 1 st to a th target lanes specifically comprises the substeps of:
in other underfilled roadways of which the first source roadway is removed from a certain cargo, inquiring the roadway with the empty roadway position number equal to the stock position number of the first source roadway to serve as a roadway set 3, and if a plurality of roadway sets 3 exist, calculating according to a roadway weight algorithm to obtain the roadway with the maximum weight;
if no laneway with the laneway empty warehouse bit number equal to the first source laneway cargo warehouse bit number exists, searching the situation that the sum of the laneway empty warehouse bit numbers is equal to the first source laneway cargo warehouse bit number, if the situation cannot be searched, updating the first source laneway cargo warehouse bit number, and then repeatedly executing the steps until a plurality of laneways with the excess empty warehouse bit number equal to 0 are searched;
and the final result of the calculation of the target roadway is that the types distinguished according to the number of empty warehouse bits owned by the roadway determine the required roadways, each type of roadway is firstly sorted from small → large according to the number of empty warehouse bits, if the result is not unique, the roadways are sorted from small → large according to the maximum value of the weight through the weight calculation of the roadway, and the roadways are sorted to be used as the 1 st to a th target roadway.
8. The warehousing optimization method of claim 1, wherein all cargo types are combined to form a task group queue, the task group queue is sorted from high to low according to the combination effect parameters, namely, sorted according to the efficiency marks, high-efficiency tasks are issued, the combination tasks with the highest combination effect parameters are executed according to site requirements, and the tasks are executed according to the task group sequence.
9. A storage control apparatus, characterized by comprising: the control device executes a warehouse optimization method according to any one of claims 1-8.
10. A warehousing control system comprising the warehousing control equipment as claimed in claim 9, and further comprising an intelligent stereoscopic warehouse and a shuttle car, wherein the control equipment controls the shuttle car to access goods in a roadway of the intelligent stereoscopic warehouse and execute a warehousing optimization method.
CN202110377661.6A 2021-04-08 2021-04-08 Storage optimization method, storage control equipment and system Withdrawn CN113034082A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110377661.6A CN113034082A (en) 2021-04-08 2021-04-08 Storage optimization method, storage control equipment and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110377661.6A CN113034082A (en) 2021-04-08 2021-04-08 Storage optimization method, storage control equipment and system

Publications (1)

Publication Number Publication Date
CN113034082A true CN113034082A (en) 2021-06-25

Family

ID=76454317

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110377661.6A Withdrawn CN113034082A (en) 2021-04-08 2021-04-08 Storage optimization method, storage control equipment and system

Country Status (1)

Country Link
CN (1) CN113034082A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115193753A (en) * 2022-07-26 2022-10-18 南京维拓科技股份有限公司 Intelligent matching goods picking method in vertical warehouse

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103193054A (en) * 2013-04-27 2013-07-10 龙岩烟草工业有限责任公司 Warehouse management method and warehouse management system
CN106966100A (en) * 2017-05-15 2017-07-21 北京京东尚科信息技术有限公司 Goods warehousing method and system
CN109255569A (en) * 2018-08-24 2019-01-22 北京极智嘉科技有限公司 Tally method, apparatus, server and storage medium in library
CN109533759A (en) * 2018-12-27 2019-03-29 广东赛斐迩物流科技有限公司 A kind of automatic shifting library method and automatic shifting library system
CN109775219A (en) * 2019-03-11 2019-05-21 广东赛斐迩物流科技有限公司 A kind of tunnel blocking is automatic to move library method and the shifting library system using this method
CN110084545A (en) * 2019-03-05 2019-08-02 浙江工业大学 The integrated scheduling method of more tunnel automatic stereowarehouses based on mixed-integer programming model
WO2019154445A2 (en) * 2019-04-11 2019-08-15 上海快仓智能科技有限公司 Warehouse entry/exit control method for shelf array, and transportation system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103193054A (en) * 2013-04-27 2013-07-10 龙岩烟草工业有限责任公司 Warehouse management method and warehouse management system
CN106966100A (en) * 2017-05-15 2017-07-21 北京京东尚科信息技术有限公司 Goods warehousing method and system
CN109255569A (en) * 2018-08-24 2019-01-22 北京极智嘉科技有限公司 Tally method, apparatus, server and storage medium in library
CN109533759A (en) * 2018-12-27 2019-03-29 广东赛斐迩物流科技有限公司 A kind of automatic shifting library method and automatic shifting library system
CN110084545A (en) * 2019-03-05 2019-08-02 浙江工业大学 The integrated scheduling method of more tunnel automatic stereowarehouses based on mixed-integer programming model
CN109775219A (en) * 2019-03-11 2019-05-21 广东赛斐迩物流科技有限公司 A kind of tunnel blocking is automatic to move library method and the shifting library system using this method
WO2019154445A2 (en) * 2019-04-11 2019-08-15 上海快仓智能科技有限公司 Warehouse entry/exit control method for shelf array, and transportation system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115193753A (en) * 2022-07-26 2022-10-18 南京维拓科技股份有限公司 Intelligent matching goods picking method in vertical warehouse
CN115193753B (en) * 2022-07-26 2023-11-10 南京维拓科技股份有限公司 Method for picking up goods by intelligent matching in vertical warehouse

Similar Documents

Publication Publication Date Title
CN110322172B (en) Inventory scheduling method, inventory scheduling device and computer-readable storage medium
CN106934580B (en) Inventory control method and device
CN108469786B (en) Large-scale intelligent storage distributed sorting system
CN109544054B (en) Inventory scheduling method, inventory scheduling device and computer-readable storage medium
Sarker et al. Travel time models in automated storage/retrieval systems: A critical review
Bozer et al. Tandem AGV systems: a partitioning algorithm and performance comparison with conventional AGV systems
Malmborg Storage assignment policy tradeoffs
CN109598459B (en) Logistics distribution method and device and computer readable storage medium
CN112875112B (en) Digital twin-based high-density stereoscopic warehouse storage position allocation and scheduling method
CN113200275B (en) Packing box arranging method, device, equipment, storage system and storage medium
CN112198880B (en) AGV task allocation method, logistics sorting method and system
WO2023040659A1 (en) Task assignment method, apparatus, and device, warehousing system, and storage medium
CN114881564A (en) Multi-deep goods location allocation method and device, computer equipment and storage medium
CN115744014A (en) Roadway storage management method, system and equipment
CN113493081B (en) Goods sorting method, device, system, storage medium and electronic equipment
CN113673887A (en) Task allocation method, device, server and storage medium
CN113034082A (en) Storage optimization method, storage control equipment and system
CN115310690A (en) Digital twin four-way shuttle vehicle optimal scheduling method and device and storage medium
CN112978166B (en) Intelligent stereoscopic warehouse and warehouse entry control method, device and system thereof
CN110400111A (en) Article based on automatic driving vehicle sends method, apparatus and system with charge free
CN110615226A (en) Storage bit allocation method, device and computer readable storage medium
CN112093359A (en) Method for improving full-automatic retrieval efficiency of high-density three-dimensional library
CN111768133A (en) Method and device for warehousing articles
CN113034083A (en) Storage support combination optimization method, device and system
CN111861112A (en) Method and device for estimating transport buffer capacity of multi-layer shuttle system

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
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20210625