CN113844815B

CN113844815B - Cargo storage space adjusting method, device, equipment and storage medium

Info

Publication number: CN113844815B
Application number: CN202111188952.7A
Authority: CN
Inventors: 艾鑫
Original assignee: Hai Robotics Co Ltd
Current assignee: Hai Robotics Co Ltd
Priority date: 2021-05-20
Filing date: 2021-05-20
Publication date: 2023-03-14
Anticipated expiration: 2041-05-20
Also published as: CN113044465A; CN113844815A; CN113044465B

Abstract

The embodiment of the application provides a cargo storage space adjusting method, a cargo storage space adjusting device, cargo storage space adjusting equipment and a storage medium. According to the method, container resource pool to be analyzed and container storage information of a warehouse are obtained, wherein the container resource pool to be analyzed comprises a plurality of containers, the container resource pool to be analyzed comprises the number of containers in the initial type of each container, and the container storage information represents storage space arrangement of shelves corresponding to each roadway in the warehouse; and carrying out position matching on the containers in the initial types of the containers in the container resource pool to be analyzed according to the storage space arrangement of the goods shelves corresponding to all the roadways in the warehouse, and obtaining multiple matching results. And then according to the multiple matching results, determining that a container which cannot be matched with the free position space exists in the container resource pool to be analyzed, determining that the storage space in the warehouse is unreasonable, and determining that the position space of the roadway needs to be adjusted. And then accurately determining whether the position space adjustment of the roadway is needed.

Description

Cargo storage space adjusting method, device, equipment and storage medium

The invention relates to a divisional application of an invention patent application with the name of 'cargo storage space adjusting method, device, equipment and storage medium', which is filed by the Chinese patent office and has the application number of 202110553432.5 and the application date of 2021, 05 and 20.

Technical Field

The embodiment of the application relates to the technical field of warehouse logistics, in particular to a method, a device, equipment and a storage medium for adjusting a cargo storage space.

Background

With the increasing development of artificial intelligence and online shopping, huge development opportunities are brought to the intellectualization of storage, sorting and logistics of goods. In a warehousing environment, a large number of shelves may be provided.

In the prior art, one roadway corresponds to two goods shelves, and a plurality of containers are placed on each goods shelf. The sizes of different types of containers are different, and the containers of various types can be mixed and placed on the goods shelf.

However, with a series of warehousing operations, for a rack without a fixed storage location (i.e., a dynamic continuous location on the rack), a lot of empty space may exist on the rack corresponding to the lane, that is, a lot of pores may exist on containers on the rack; therefore, the position space on the goods shelf corresponding to the laneway is idle, and the utilization rate of the goods shelf becomes low. At this time, the racks corresponding to the lanes need to be adjusted to leave more space, but how to determine which rack corresponding to a lane is to be adjusted preferentially is a problem that needs to be solved urgently.

Disclosure of Invention

The embodiment of the invention provides a method, a device, equipment and a storage medium for adjusting a goods storage space, which are used for solving the problems that for a goods shelf without a fixed storage position (namely, a dynamic continuous position on the goods shelf), the position space on the goods shelf corresponding to a roadway is idle, and the utilization rate of the goods shelf is lowered.

In a first aspect, an embodiment of the present invention provides a cargo storage space adjusting method, where the method includes:

obtaining container resource information to be stored, wherein the container resource information comprises the number of containers under each container type; acquiring container arrangement information of each roadway, wherein a goods shelf corresponding to each roadway is provided with a dynamic storage space, the container arrangement information represents that the roadway is respectively arranged in a container storage space in a real state and in a container storage space in an assumed state, and the assumed state represents that containers on the goods shelf corresponding to the roadway are continuously arranged;

determining a distribution difference value of each roadway according to the container resource information and the container arrangement information of each roadway, wherein the distribution difference value represents a difference value between a first distribution quantity and a second distribution quantity; wherein the first distribution quantity represents the number of containers which can be stored in the lane in the container resource information in the real state, the second distribution quantity represents the number of containers which can be stored in the lane in the container resource information in the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the lane;

and determining the roadway with the largest distribution difference value, wherein the roadway is the roadway to be subjected to storage space adjustment, and sending an adjustment instruction to the warehousing robot, wherein the adjustment instruction is used for instructing the warehousing robot to adjust the arrangement of the container storage spaces of the roadway to be subjected to storage space adjustment.

In a second aspect, an embodiment of the present invention provides a cargo storage space adjusting apparatus, where the apparatus includes:

the container resource information comprises the number of containers in each container type;

the second obtaining unit is used for obtaining container arrangement information of each roadway, wherein a storage space is dynamic on a goods shelf corresponding to each roadway, the container arrangement information represents that the roadway is respectively arranged in the container storage space in a real state and in the container storage space in an assumed state, and the assumed state represents that the containers on the goods shelf corresponding to the roadway are continuously arranged;

a first determining unit, configured to determine, according to the container resource information and the container arrangement information of each lane, an allocation difference value of each lane, where the allocation difference value represents a difference between a first allocation quantity and a second allocation quantity; wherein the first distribution quantity represents the number of containers which can be stored in the lane in the container resource information in the real state, the second distribution quantity represents the number of containers which can be stored in the lane in the container resource information in the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the lane;

the second determining unit is used for determining the roadway with the largest distribution difference value as the roadway to be subjected to storage space adjustment;

and the sending unit is used for sending an adjusting instruction to the warehousing robot, wherein the adjusting instruction is used for indicating the warehousing robot to adjust the arrangement of the container storage space of the roadway to be subjected to storage space adjustment.

In a third aspect, an embodiment of the present invention provides a cargo storage space adjusting method, where the method includes:

the method comprises the steps of obtaining a container resource pool to be analyzed and container storage information of a warehouse, wherein the container resource pool to be analyzed comprises a plurality of containers, the container resource pool to be analyzed comprises the number of containers under the initial type of each container, and the container storage information represents storage space arrangement of shelves corresponding to each roadway in the warehouse;

according to the container storage information, carrying out position matching on containers in the container resource pool to be analyzed under the initial types of the containers to obtain multiple matching results;

and if at least one matching result in the multiple matching results represents that a container which is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained, determining that the storage space of the container needs to be adjusted according to the goods shelf corresponding to the roadway.

In a fourth aspect, an embodiment of the present invention provides a cargo storage space adjusting apparatus, where the apparatus includes:

the system comprises a first obtaining unit, a second obtaining unit and a third obtaining unit, wherein the first obtaining unit is used for obtaining a container resource pool to be analyzed, and the container resource pool to be analyzed comprises a plurality of containers;

the second obtaining unit is used for obtaining container storage information, wherein the container resource pool to be analyzed comprises the number of containers in the initial type of each container, and the container storage information represents storage space arrangement of shelves corresponding to each roadway;

the matching unit is used for carrying out position matching on containers in the container resource pool to be analyzed under the initial type of each container according to the container storage information to obtain a plurality of matching results;

and the determining unit is used for determining that the storage space of the container needs to be adjusted according to the goods shelf corresponding to the roadway if at least one matching result in the multiple matching results represents that the container which is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained.

In a fifth aspect, an embodiment of the present invention provides a scheduling server, including:

a processor, a memory, and a computer program stored on the memory and executable on the processor; wherein the processor, when executing the computer program, implements the method of the first or third aspect.

In a sixth aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored, and the computer program, when executed by a processor, implements the method of the first aspect or the third aspect.

In a seventh aspect, an embodiment of the present invention provides a computer program product, where the computer program product includes: a computer program stored in a readable storage medium, from which the computer program can be read by at least one processor of a dispatch server, execution of the computer program by the at least one processor causing the dispatch server to perform the method of the first or third aspect.

According to the goods storage space adjusting method, the goods storage space adjusting device, the goods storage space adjusting equipment and the storage medium, aiming at a storage environment with a dynamic storage space on a shelf corresponding to each lane, the number of goods containers which can be stored into the lane when the lane is in a real state, the number of goods containers which can be stored into the lane when the lane is in an assumed state and the difference between the goods containers are determined according to goods container resource information to be stored and goods container arrangement information of each lane aiming at each lane, and the distribution difference of each lane is obtained; wherein, the assumed state means that containers on the goods shelves corresponding to the lanes are continuously arranged. The larger the distribution difference value of the roadway is, the larger the number of containers which can be stored is after the storage space on the goods shelf corresponding to the characterization adjustment roadway is. Therefore, the roadway with the largest distribution difference value can be used as the roadway to be subjected to storage space adjustment; and sending an adjusting instruction to the warehousing robot to instruct the warehousing robot to adjust the storage space of the roadway to be subjected to storage space adjustment, and releasing more storage spaces of the warehouse after the storage space of the roadway with the largest distribution difference value is adjusted. Determining a roadway to be subjected to storage space adjustment, namely determining a roadway to be adjusted preferentially (determining a shelf to be adjusted preferentially) according to the container resource information and the container arrangement information of each roadway; after the adjusting of the storage space of the roadway to be subjected to storage space adjustment, more storage spaces of the roadway and the warehouse can be released, the position space on the goods shelf corresponding to the roadway is prevented from being left unused, and the utilization rate of the goods shelf and the warehouse is improved.

Drawings

Fig. 1 is a schematic diagram of a roadway provided in an embodiment of the present invention;

FIG. 2 is a first schematic view of a shelf according to an embodiment of the present invention;

FIG. 3 is a second schematic view of a shelf according to an embodiment of the present invention;

FIG. 4 is a third schematic view of a shelf according to an embodiment of the present invention;

fig. 5 is a flowchart of a cargo storage space adjustment method according to an embodiment of the present invention;

fig. 6 is a first schematic view of a container storage arrangement according to an embodiment of the present invention;

figure 7 is a second schematic view of a container storage arrangement according to an embodiment of the present invention;

fig. 8 is a flowchart of a cargo storage space adjustment method according to a second embodiment of the present invention;

fig. 9 is a flowchart of a cargo storage space adjustment method according to a third embodiment of the present invention;

fig. 10 is a flowchart of a cargo storage space adjustment method according to a fourth embodiment of the present invention;

fig. 11 is a flowchart of a cargo storage space adjustment method according to a fifth embodiment of the present invention;

fig. 12 is a flowchart of a cargo storage space adjustment method according to a sixth embodiment of the present invention;

fig. 13 is a flowchart of a cargo storage space adjustment method according to a seventh embodiment of the present invention;

fig. 14 is a schematic structural view of a cargo storage space adjustment apparatus according to an eighth embodiment of the present invention;

fig. 15 is a schematic structural view of a cargo storage space adjustment apparatus according to a ninth embodiment of the present invention;

fig. 16 is a schematic structural view of a cargo storage space adjustment apparatus according to a tenth embodiment of the present invention;

fig. 17 is a schematic structural view of a cargo storage space adjustment apparatus according to an eleventh embodiment of the present invention;

fig. 18 is a schematic structural diagram of a scheduling server according to a twelfth embodiment of the present invention.

With the above figures, certain embodiments of the invention have been illustrated and described in more detail below. The drawings and written description are not intended to limit the scope of the inventive concepts in any manner, but rather to illustrate the inventive concepts to those skilled in the art by reference to specific embodiments.

Detailed Description

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the invention, as detailed in the appended claims.

First, terms related to embodiments of the present invention are explained:

warehouse: a warehouse is an area for storing containers (also referred to as bins). In order to facilitate management, a plurality of shelves may be provided in the warehouse, and a plurality of identical or different containers may be placed on each shelf according to a specific placement rule.

Laneway: the storage robot can walk on the roadway, so that containers are placed on the goods shelves on two sides of the roadway or the containers on the goods shelves on two sides of the roadway are taken out. Fig. 1 is a schematic diagram of a roadway provided in an embodiment of the present invention, as shown in fig. 1, a plurality of roadways are provided in a warehouse, and a main road and a common area are provided in the warehouse; the storage robot can walk on a trunk road, a public area and a roadway. Wherein the common area is used for placing the operation table. Two rows of goods shelves are arranged on two sides of each roadway, the goods shelves are not provided with the goods shelves with fixed storage positions, and the goods shelves are in dynamic and continuous positions. Specifically, in the invention, the rack corresponding to the roadway is not provided with a storage position with a fixed size, that is, each row of racks of each rack is not provided with a storage position with a fixed size; instead, each row of shelves of each shelf is opened, and each row of shelves is a dynamic storage space. Fig. 2 is a first schematic view of a shelf according to an embodiment of the present invention, as shown in fig. 2, each shelf is not provided with a fixed-size storage space, and each shelf is provided with a dynamic storage space. Thus, containers with different sizes can be placed on the goods shelf.

In other storage environments, containers are used as basic units, and each goods shelf is provided with a storage position with a fixed size; one container can be placed on each storage position. Namely, the size of the container is fixed, and the size of the storage position is also fixed; and according to the size, carrying out one-to-one correspondence on the containers and the storage positions to place the containers. In an example, fig. 3 is a schematic view of a second shelf provided in an embodiment of the present invention, and as shown in fig. 3, a plurality of storage positions are provided on the same shelf, and each storage position has the same fixed size. For example, the positions on one shelf are all of the same fixed size A, and the positions on the other shelf are all of the same fixed size B. In another example, fig. 4 is a schematic diagram three of shelves according to an embodiment of the present invention, and as shown in fig. 4, each shelf is provided with a different fixed-size storage space. Therefore, in the storage environment, the containers can be neatly placed on the positions of the goods shelves.

However, in other storage environments, the racks corresponding to the lanes are not provided with storage positions with fixed sizes, that is, each row of racks of each rack is not provided with storage positions with fixed sizes; each bent frame of each goods shelf is opened, and each bent frame is a dynamic storage space; for example, as shown in fig. 2.

A storage robot: the storage robot is an Automated device having a traveling mechanism and capable of moving in a warehouse and carrying a bin, a rack, and the like, for example, a bin transfer robot, a rack transfer robot, an Automated Guided Vehicle (AGV), and the like.

Furthermore, the terms "first", "second", etc. are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. In the description of the following examples, "plurality" means two or more unless specifically limited otherwise.

The embodiment of the invention is particularly applied to the intelligent warehousing system, and the intelligent warehousing system comprises a warehousing robot, a scheduling server (namely the server of the scheduling system), a warehouse and the like. Wherein the warehouse may contain shelves for storing containers.

With the increasing development of artificial intelligence and online shopping, huge development opportunities are brought to the intellectualization of storage, sorting and logistics of goods. In a warehousing environment, a large number of shelves may be provided. Aiming at the storage environment that the storage shelves corresponding to the laneways are dynamic storage spaces, one laneway corresponds to two storage shelves, and each storage shelf is a dynamic storage space (namely, a storage position with a fixed size is not arranged); therefore, various containers can be placed on the goods shelf; wherein the dimensions of the containers of different kinds are different.

However, with a series of warehousing operations, for a rack without a fixed storage location (i.e., a dynamic continuous position on the rack), a lot of empty space may exist on the rack corresponding to the lane, i.e., a lot of holes may exist on the containers on the rack; therefore, the position space on the goods shelf corresponding to the laneway is idle, and the utilization rate of the goods shelf is lowered; it can also result in no new containers being placed in position or no new containers being mismatched into position. At this time, the racks corresponding to the lanes need to be adjusted to make more space, but how to determine which rack corresponding to a lane needs to be adjusted preferentially is a problem that needs to be solved urgently.

The embodiment of the invention provides a cargo storage space adjusting method, a cargo storage space adjusting device, cargo storage space adjusting equipment and a storage medium, and aims to solve the technical problems.

The following describes the technical solution of the present invention and how to solve the above technical problems with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present invention will be described below with reference to the accompanying drawings.

Example one

Fig. 5 is a flowchart of a cargo storage space adjustment method according to an embodiment of the present invention. As shown in fig. 5, the method comprises the following specific steps:

s101, container resource information to be stored is obtained, wherein the container resource information comprises the number of containers in each container type; and acquiring container arrangement information of each lane, wherein the goods shelves corresponding to each lane are dynamic storage spaces, the container arrangement information represents that the lanes are respectively arranged in the container storage spaces in the real state and in the container storage spaces in the assumed state, and the containers on the goods shelves corresponding to the assumed state representation lanes are continuously arranged.

For example, the execution subject of this embodiment may be a scheduling server, an electronic device, a cargo storage space adjusting device or apparatus, or other devices or apparatuses that can execute the method of this embodiment, without limitation. The present embodiment is described with an execution subject as a scheduling server.

In the warehouse, a plurality of tunnels are arranged, each tunnel corresponds to two shelves, and each shelf is provided with a dynamic storage space, namely, each shelf is not provided with a storage position with a fixed size.

The method comprises the steps of obtaining container resource information to be stored, wherein the container resource information to be stored comprises containers of various container types, the sizes of the different container types are different, and each container type has the corresponding container number. The containers in the container resource information to be stored can be containers to be stored on a goods shelf corresponding to the roadway; or the container in the container resource information to be stored is a container for determining a roadway to be subjected to storage space adjustment, and is not necessarily a container to be stored on the rack.

For example, the container in the container resource information to be stored may be obtained by using the multiple matching results in step S402 in fig. 10.

Because the container resource information to be stored is adopted to analyze each lane of the warehouse, the container arrangement information of each lane in the warehouse needs to be acquired. In order to accurately determine the lanes to be subjected to the storage space adjustment (i.e., the lanes in which the storage space needs to be adjusted), the arrangement of the storage spaces of the containers in each lane in the real state and the arrangement of the storage spaces of the containers in each lane in the assumed state need to be obtained.

The arrangement of the container storage spaces of each lane in the real state means that at least one container is placed on the goods shelf corresponding to each lane along with a series of storage operations, and in this case, each lane is in the real state, and the arrangement of the container storage spaces of each lane in the real state can be obtained. For example, fig. 6 is a schematic diagram of a container storage arrangement according to an embodiment of the present invention, as shown in fig. 6, a plurality of containers are placed on the shelves corresponding to each lane, and the containers are scattered on the shelves along with a series of warehousing operations.

The arrangement of the container storage spaces of each lane in the assumed state means that, as the containers on the shelves corresponding to each lane are scattered on the shelves along with a series of warehousing operations, the containers on each row of shelves of the shelves can be assumed to be pushed to one side (for example, all the containers are pushed to the left side or all the containers are pushed to the right side), so that the containers on each row of shelves are continuously arranged, a continuous position space is left on each row of shelves of the shelves, and the lane is in the assumed state at the moment, so that the arrangement of the container storage spaces of each lane in the assumed state is obtained. For example, fig. 7 is a schematic view of a container storage arrangement according to an embodiment of the present invention, as shown in fig. 7, assuming that containers on each row of shelves corresponding to the lane are pushed to one side, a continuous position space is left on each row of shelves of the shelf; and then the arrangement of the container storage space of the laneway in an assumed state is obtained.

Through the above method, the arrangement of the container storage space of each roadway in the real state and the arrangement of the container storage space of each roadway in the assumed state are obtained, and then the arrangement information of the containers of each roadway is obtained.

S102, determining a distribution difference value of each roadway according to the container resource information and the container arrangement information of each roadway, wherein the distribution difference value represents a difference value between a first distribution quantity and a second distribution quantity; the first distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the real state, the second distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

Illustratively, each roadway is analyzed according to container resource information to be stored, and then which roadway is the roadway needing to be subjected to space adjustment is determined. In this embodiment, for each lane, container resource information and container arrangement information in the lane are subjected to matching analysis, and then the number of containers that can be stored in the lane in a real state of container resource information, the number of containers that can be stored in the lane in an assumed state of container resource information in the lane, and a difference between them are obtained, thereby obtaining a distribution difference in each lane.

In one example, the container resource information to be stored includes a plurality of types of containers, sizes of different types of containers are different, and each type of container has a corresponding number of containers. The packing box storage space arrangement of each roadway under the real state comprises the types of packing boxes, the number of the packing boxes, the sizes of the packing boxes and the positions of the packing boxes on the goods shelves corresponding to each roadway. For each lane, it is assumed that containers in container resource information to be stored are placed in the lane in a real state, the storage space of each container is determined according to the size information of the container and the dynamic storage space of the lane (at this time, the lane is in a real state, and the shelves corresponding to the lane have other containers scattered), and at this time, how many containers can be placed in the lane, so as to obtain a first distribution quantity.

The container resource information to be stored comprises containers of various types, the sizes of different container types are different, and each container type has the corresponding container number. The container storage space arrangement of each roadway under the assumed state comprises the container types, the container quantity, the container size, the container positions and the remaining continuous space of each shelf on the corresponding goods shelf of each roadway. For each lane, it is assumed that containers in the container resource information to be stored are placed into the lane in the assumed state, the storage space of each container is determined according to the size information of the container and the dynamic storage space of the lane (at this time, the lane is in the assumed state, and other containers continuously arranged on the shelves corresponding to the lane are located in the lane), and at this time, how many containers can be placed into the lane, so as to obtain a second distribution number.

And for each tunnel, subtracting the first distribution quantity from the second distribution quantity to obtain a distribution difference value of each tunnel. Or, regarding each lane, taking an absolute value of a difference obtained by subtracting the second allocation quantity from the first allocation quantity as an allocation difference of each lane.

S103, determining the roadway with the largest distribution difference value, and sending an adjusting instruction to the storage robot, wherein the adjusting instruction is used for instructing the storage robot to adjust the arrangement of the container storage space of the roadway with the adjusted storage space.

Illustratively, the warehouse is provided with a plurality of tunnels, the distribution difference value of each tunnel is obtained through the steps, and the tunnel with the largest distribution difference value is determined according to the distribution difference value of each tunnel. The larger the distribution difference value of the roadway is, the larger the number of containers which can be stored in the roadway is after the storage space on the goods shelf corresponding to the roadway is adjusted according to the representation. Therefore, the roadway with the largest distribution difference value can be used as the roadway to be subjected to storage space adjustment.

And then, sending an adjusting instruction to the warehousing robot to instruct the warehousing robot to adjust the storage space of the roadway to be subjected to storage space adjustment. After adjusting the storage space of the lane with the largest allocation difference, more storage space of the warehouse can be released.

In one example, after the lane with the largest distribution difference is determined, an adjustment instruction may be directly sent to the warehousing robot, where the adjustment instruction specifically instructs the warehousing robot to continuously push the containers of each rack on the shelf corresponding to the lane with the largest distribution difference to one side (for example, the left side of the rack or the right side of the rack), so as to release more storage space.

In another example, after the lane with the largest distribution difference is determined, an adjustment instruction may be directly sent to the warehousing robot, where the adjustment instruction specifically instructs the warehousing robot to collect the containers on the shelves corresponding to the lane with the largest distribution difference onto several shelves (each shelf includes multiple rows of shelves), for example, to continuously arrange the containers on the lower shelf or the upper shelf of the shelf in a concentrated manner.

In another example, after the lane with the largest distribution difference is determined, an adjustment instruction may be sent to the storage robot in combination with indication information, where the indication information is used to indicate a type of a container that needs to be adjusted, and the adjustment instruction specifically indicates that the storage robot performs centralized arrangement on containers of the type of the container indicated by the indication information on the pallet corresponding to the lane with the largest distribution difference.

In addition, after the steps S101 to S103 are executed once, a lane a to be subjected to storage space adjustment is obtained, and then the storage space on the rack corresponding to the lane a can be directly adjusted. And then, based on the roadway A with the adjusted storage space and the roadway without the adjusted storage space, after the steps S101-S103 are executed once again, a roadway B to be subjected to storage space adjustment is obtained, and further, the storage space on the shelf corresponding to the roadway B can be directly adjusted. And then, based on the laneway A with the adjusted storage space, the laneway B with the adjusted storage space and the laneway without the adjusted storage space, executing the steps S101-S103 once again to obtain a laneway C with the storage space to be adjusted, and further directly adjusting the storage space on the shelf corresponding to the laneway C. And analogizing in turn until the laneway is not required to be adjusted any more. Thereby freeing up storage space in the warehouse to the maximum amount.

In the embodiment of the invention, aiming at the storage environment with a dynamic storage space on a goods shelf corresponding to each roadway, according to the container resource information to be stored and the container arrangement information of each roadway, aiming at each roadway, the number of containers which can be stored into the roadway when the roadway is in a real state and the number of containers which can be stored into the roadway when the roadway is in an assumed state are determined, and the distribution difference value of each roadway is obtained by the difference value of the container resource information and the roadway; wherein, the assumed state means that the containers on the goods shelf corresponding to the lane are continuously arranged. The larger the distribution difference value of the roadway is, the larger the number of containers which can be stored is after the storage space on the goods shelf corresponding to the characterization adjustment roadway is. Therefore, the roadway with the largest distribution difference value can be used as the roadway to be subjected to storage space adjustment; and sending an adjusting instruction to the warehousing robot to instruct the warehousing robot to adjust the storage space of the roadway to be subjected to storage space adjustment, and releasing more storage spaces of the warehouse after the storage space of the roadway with the largest distribution difference value is adjusted. Determining a roadway to be subjected to storage space adjustment, namely determining a roadway to be adjusted preferentially (determining a shelf to be adjusted preferentially) according to the container resource information and the container arrangement information of each roadway; after the storage space of the roadway to be subjected to storage space adjustment is adjusted, more storage spaces of the roadway and the warehouse can be released, the position space on the goods shelf corresponding to the roadway is prevented from being left unused, and the utilization rate of the goods shelf and the warehouse is improved.

Example two

Fig. 8 is a flowchart of a cargo storage space adjustment method according to a second embodiment of the present invention. As shown in fig. 8, the method comprises the following specific steps:

s201, container resource information to be stored is obtained, wherein the container resource information comprises the number of containers in each container type.

For example, the execution subject of this embodiment may be a scheduling server, an electronic device, a cargo storage space adjusting device or apparatus, or other devices or apparatuses that may execute the method of this embodiment, without limitation. The present embodiment is described with an execution subject as a scheduling server.

In this embodiment, reference may be made to step S101 in the above embodiment, which is not described again.

S202, container arrangement information of each roadway is obtained, wherein dynamic storage space is formed in the goods shelves corresponding to each roadway, container arrangement information represents that the roadway is respectively arranged in the container storage space in the real state and in the container storage space in the assumed state, and containers on the goods shelves corresponding to the assumed state representation roadway are continuously arranged.

In one example, the container arrangement information includes first storage space information and second storage space information, the first storage space information represents the container storage space arrangement of the roadway in the real state, and the second storage space information represents the container storage space arrangement of the roadway in the assumed state.

For example, since each lane of the warehouse is analyzed by using the container resource information to be stored, the container arrangement information of each lane in the warehouse needs to be acquired.

The arrangement of the container storage spaces of each roadway in the real state means that at least one container is placed on the goods shelf corresponding to each roadway along with a series of storage operations, in this case, each roadway is in the real state, and the arrangement of the container storage spaces of each roadway in the real state can be obtained. And then the first storage space information of each roadway is obtained.

The arrangement of the container storage spaces of each lane in the assumed state means that, as the containers on the shelves corresponding to each lane are scattered on the shelves along with a series of warehousing operations, the containers on each row of shelves of the shelves can be assumed to be pushed to one side (for example, all the containers are pushed to the left side or all the containers are pushed to the right side), so that the containers on each row of shelves are continuously arranged, a continuous position space is left on each row of shelves of the shelves, and the lane is in the assumed state at the moment, so that the arrangement of the container storage spaces of each lane in the assumed state is obtained. And then the second storage space information of each roadway is obtained.

S203, determining the first distribution quantity of each roadway according to the container resource information and the first storage space information of each roadway. The first distribution quantity represents the quantity of containers which can be stored in the lane in the container resource information in the real state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the lane.

Illustratively, to determine the allocation difference value of each lane in step S205. Aiming at each roadway, if containers in the container resource information to be stored are placed into the roadway in a real state, at the moment, the first storage space information of the roadway is analyzed according to the container resource information to be stored, so that the number of containers which can be placed into the roadway is determined, and a first distribution quantity is obtained. The storage space of each container is determined according to the size information of the container and the dynamic storage space of the roadway (at the moment, the roadway is in a real state, and the goods shelves corresponding to the roadway have other containers scattered).

And S204, determining a second distribution quantity of each roadway according to the container resource information and the second storage space information of each roadway. The second distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information under the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

For example, for each lane, assuming that containers in the container resource information to be stored are placed in the lane in the assumed state, at this time, the second storage space information of the lane is analyzed according to the container resource information to be stored, and how many containers can be placed in the lane is determined, so as to obtain a second distribution quantity. The storage space of each container is determined according to the size information of the container and the dynamic storage space of the roadway (at this time, the roadway is in an assumed state, and other containers are continuously arranged on the shelves corresponding to the roadway).

And S205, determining the distribution difference value of each lane according to the difference value between the first distribution quantity and the second distribution quantity of each lane.

Illustratively, for each lane, the second allocation number is subtracted by the first allocation number to obtain an allocation difference value for each lane.

Or, regarding each lane, taking an absolute value of a difference obtained by subtracting the second allocation quantity from the first allocation quantity as an allocation difference of each lane.

And S206, determining the roadway with the maximum distribution difference value, and sending an adjusting instruction to the storage robot, wherein the adjusting instruction is used for instructing the storage robot to adjust the storage space arrangement of the containers of the roadway to be subjected to storage space adjustment.

For example, this step may refer to step S103 of the above embodiment, and is not described again.

In this embodiment, on the basis of the above embodiment, a first allocation quantity of each lane is determined according to container resource information and first storage space information of each lane, where the first allocation quantity represents the quantity of containers that can be stored in the lane in the container resource information in a real state; and determining a second distribution quantity of each lane according to the container resource information and the second storage space information of each lane, wherein the second distribution quantity represents the quantity of containers which can be stored in the lane in the container resource information under the assumed state. Obtaining the distribution difference value of each roadway according to the first distribution quantity and the second distribution quantity of each roadway; the larger the distribution difference value of the roadway is, the larger the number of containers which can be stored is after the storage space on the goods shelf corresponding to the characterization adjustment roadway is. Thereby obtaining a tunnel which is adjusted preferentially (determining the shelf which is adjusted preferentially). After the adjusting of the storage space of the roadway to be subjected to storage space adjustment, more storage spaces of the roadway and the warehouse can be released, the position space on the goods shelf corresponding to the roadway is prevented from being left unused, and the utilization rate of the goods shelf and the warehouse is improved.

EXAMPLE III

Fig. 9 is a flowchart of a cargo storage space adjustment method according to a third embodiment of the present invention. As shown in fig. 9, the method comprises the following specific steps:

s301, container resource information to be stored is obtained, wherein the container resource information comprises the number of containers in each container type.

S302, container arrangement information of each roadway is obtained, wherein dynamic storage space is formed in a goods shelf corresponding to each roadway, container arrangement information represents that the roadway is respectively arranged in the container storage space in a real state and in the container storage space in an assumed state, and containers on the goods shelf corresponding to the assumed state representation roadway are continuously arranged.

For example, in this embodiment, refer to step S202 in the above embodiment, which is not described again.

And S303, repeating the following steps S304-S306 for each lane until a first preset condition is reached, wherein the initial first container information is container resource information.

When a first preset condition is reached, the first distribution quantity comprises the quantity of containers with free position spaces distributed to each container type in the container resource information. The first distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in a real state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

In one example, the first preset condition includes any one of: each container in the container resource information is allocated with a free position space, containers in at least one container type cannot be matched with the free position space, and no free position space exists in the first storage space information.

Illustratively, after step S302, a first allocation quantity of each lane needs to be generated, where the first allocation quantity represents the quantity of containers that can be stored in the lane when the lane is in a real state in the container resource information to be stored. Steps S303-S306 may be performed in order to obtain a first allocated number for each lane.

Taking the container resource information to be stored in the step S301 as initial first container information; the steps S304-S306 are repeatedly executed until the first preset condition is reached. Wherein, each time the steps S304-S306 are executed once, the first container information and the first storage space information of the laneway are updated. The first container information includes at least one type of container, each type of container has the number of containers, and the sizes of the containers of different types are different.

And S304, determining first proportion information according to the first container information, wherein the first proportion information comprises a proportion value of each container type, and the proportion value of each container type represents a ratio between the number of containers of each container type and the total number of containers of all container types.

Illustratively, the first container information includes at least one type of container, each type of container has a number of containers, and the containers of different types are different in size. The container type in the first container information is N, and N is a positive integer greater than or equal to 1; that is, the first container information includes N container types.

Firstly, calculating the number of containers under each container type in first container information according to the first container information; and summing the number of containers under each container type to obtain the total number of containers of all container types. For each container type in the first container information, the number of containers of each container type is divided by the total number of containers of all container types to obtain a proportional value of each container type. The scale value of each container type constitutes first scale information.

The first container information comprises N container types; for the 1 st container type a in the first container information, obtaining the container number Request (1) of the container type a; for the 2 nd container type b in the first container information, the container number Request (2) of the container type b can be obtained; for the 3 rd container type c in the first container information, the container number Request (3) of the container type c can be obtained; the number of containers Request (i) of the container type i can be obtained for the ith container type i in the first container information, and by analogy, the number of containers Request (N) of the nth container type in the first container information can be obtained, and further, the number of containers of each container type in the first container information can be obtained. And adding the number of containers of each container type in the first container information to obtain the total number R of the containers of all the container types in the first container information. For the 1 st container type a in the first container information, the ratio value P1= (Request (1)/R) × 100% for the 1 st container type a can be obtained; for the 2 nd container type b in the first container information, the ratio P2= (Request (2)/R) × 100% of the container type b can be obtained; for the 3 rd container type c in the first container information, the ratio P3= (Request (3)/R) × 100% of the container type c can be obtained; for the ith container type i in the first container information, the proportion value Pi = (Request (i)/R) × 100% of the container type i can be obtained; by analogy, the ratio Pn = (Request (N)/R) × 100% of the nth container type in the first container information is obtained, and the ratio of each container type in the first container information is obtained. Wherein i is a positive integer of 1 or more and N or less.

When step S304 is executed for the first time, the initial first container information is the container resource information to be stored in step S301.

And S305, determining the container type to be analyzed of the first container information according to the random number generated at random and the first proportion information.

In one example, step S305 specifically includes the following steps:

the container type in the first container information is N, and N is a positive integer greater than or equal to 1; repeating the following steps until the type of the container to be analyzed is obtained, wherein the initial value of the first preset value is a random number generated randomly:

the method comprises the following steps that firstly, a proportion value of the ith container type in first container information is subtracted from a first preset value, and a calculation difference value of the ith container type is obtained; wherein i is a positive integer of 1 or more and N or less.

And secondly, if the calculation difference value of the ith container type meets the preset requirement, determining the ith container type as the container type to be analyzed of the first container information.

And step three, if the calculated difference value of the ith container type does not meet the preset requirement, determining the difference value between the first preset value and the proportional value of the ith container type, taking the difference value as the updated first preset value, and accumulating the value i by 1.

Illustratively, a random number is randomly generated, for example, a uniformly distributed random number (which may also be referred to as a uniformly distributed random number) in the range of [0,1] is generated; the first scale information includes a scale value for each container type in the first container information. It is necessary to determine a container type to be analyzed (the container type to be analyzed is the container type in the first container information) based on the random number and the first scale information, so as to determine whether a free space can be allocated to the container under the container type to be analyzed.

In determining the type of container to be analyzed, the following procedure may be employed.

The first container information includes N container types, each container type has the number of containers, and the sizes of the different container types are different. The proportional value of each container type in the first container information has been obtained using step S304.

And taking the random number A generated randomly as an initial value of a first preset value, and executing the following process until the type of the container to be analyzed is obtained. Subtracting the proportional value P1 of the 1 st container type in the first container information from the first preset value A to obtain a calculation difference value A-P1 of the 1 st container type; if the calculation difference value a-P1 of the 1 st container type meets a preset requirement, determining that the 1 st container type is a container type to be analyzed, for example, if the calculation difference value a-P1 is less than or equal to a preset threshold (e.g., a preset threshold is 0), determining that the 1 st container type is a container type to be analyzed; if the calculated difference a-P1 of the 1 st container type does not satisfy the preset requirement, the difference a-P1 between the first preset value a and the proportional value P1 of the 1 st container type is used as the updated first preset value, for example, if a-P1 is greater than a preset threshold (e.g., a preset threshold is 0), the difference a-P1 between the first preset value a and the proportional value P1 of the 1 st container type is used as the updated first preset value. Then, subtracting the proportional value P2 of the 2 nd container type in the first container information from the updated first preset value A-P1 to obtain a calculation difference value A-P1-P2 of the 2 nd container type; if the calculation difference A-P1-P2 of the 2 nd container type meets the preset requirement, determining the 2 nd container type as the container type to be analyzed; and if the calculated difference A-P1-P2 of the 2 nd container type does not meet the preset requirement, taking the difference A-P1-P2 of the updated first preset value A-P1 and the proportional value P2 of the 2 nd container type as the updated first preset value. Then, subtracting the proportion value P3 of the 3 rd container type in the first container information from the updated first preset value A-P1-P2 to obtain a calculation difference value A-P1-P2-P3 of the 3 rd container type; if the calculation difference A-P1-P2-P3 of the 3 rd container type meets the preset requirement, determining the 3 rd container type as the container type to be analyzed; and if the calculated difference A-P1-P2-P3 of the 3 rd container type does not meet the preset requirement, taking the difference A-P1-P2-P3 of the updated first preset value A-P1-P2 and the proportion value P3 of the 3 rd container type as the updated first preset value. By analogy, subtracting the proportional value Pi of the ith container type in the first container information from the updated first preset value to obtain a calculation difference value of the ith container type; if the calculation difference value of the ith container type meets the preset requirement, determining that the ith container type is the container type to be analyzed of the first container information; and if the calculated difference value of the ith container type does not meet the preset requirement, determining the difference value between the updated first preset value and the proportional value of the ith container type, and taking the difference value as the updated first preset value again. And repeating the steps until the type of the container to be analyzed of the first container information is determined, so that the type of the container to be analyzed of the first container information in the execution process is obtained each time the steps S304-S306 are executed.

S306, if the first storage space information is determined to have continuous free positions with the length being larger than or equal to the length of the current container type to be analyzed, determining that the container under the current container type to be analyzed is allocated with a free position space, wherein the length of the free position space is the minimum length in the continuous free positions with the length being larger than or equal to the length of the current container type to be analyzed. And removing the free position space from the first storage space information, and subtracting one from the number of containers corresponding to the type of the containers to be analyzed in the first container information to update the first container information.

Illustratively, the arrangement condition of the container storage space of each lane in the real state is first storage space information of each lane. In this case, each lane is true, each lane has a discrete number of other containers on its corresponding shelf, and each lane has at least one continuous empty position on its corresponding shelf, as shown in fig. 6.

For each lane, each lane has first parking space information. For each lane, it is determined whether there are consecutive free positions in the first storage space information of the lane, the length of which is equal to or greater than the length of the container type to be analyzed determined in step S305, that is, whether there are consecutive free positions satisfying the length requirement (the length requirement is that the length of the consecutive free positions is equal to or greater than the length of the container type to be analyzed determined in step S305).

If a plurality of continuous free positions meeting the length requirement exist in each roadway, taking the continuous free position with the minimum length as a free position space matched with the type of the container to be analyzed determined in the step S305, and allocating a container under the type of the container to be analyzed determined in the step S305 to the free position space, wherein at this time, a container under the type of the container to be analyzed determined in the step S305 occupies a free position space; and, the free position space is removed from the first storage space information, thereby updating the first storage space information; meanwhile, the number of containers corresponding to the type of container to be analyzed determined in step S305 in the first container information is subtracted by one, and the first container information is updated, and steps S304-S306 are performed again.

If there are no continuous free positions meeting the length requirement for each lane, the first storage space information and the first container information do not need to be updated, and steps S304-S306 are performed again.

When the steps S304-S306 are repeatedly executed, if it is determined that the first preset condition is reached, the repeated execution of the steps S304-S306 is stopped. For each lane, the number of containers to which the free position space is allocated for each container type in the container resource information to be stored, that is, the first allocation number (the first allocation number, which includes the number of containers to which the free position space is allocated for each container type in the container resource information to be stored) for each lane can be obtained; at this time, the first allocation amount obtained in the real state of each lane is based on.

The first preset condition may be that each container in the container resource information to be stored is allocated with a free position space. That is, when it is determined that each container in the container resource information to be stored is assigned with the free position space, the repeated execution of steps S304 to S306 is stopped.

Alternatively, the first predetermined condition may be that the container of at least one container type cannot be matched with the empty space. That is, when it is determined that none of the container types in the container resource information to be stored can be allocated to an appropriate free space, the repeated execution of steps S304 to S306 is stopped. Or when one or more container types in the container resource information to be stored are determined not to be allocated to the appropriate free position space, stopping repeatedly executing the steps S304-S306.

Alternatively, the first preset condition may be that there is no free space in the first storage space information. That is, when the processes of steps S304 to S306 are repeatedly executed, appropriate free space is allocated to each container type in the container resource information to be stored, and other containers are placed in the racks corresponding to the lane in a dispersed manner, if there is no free space in the lane or if there is no appropriate free space in the lane as steps S304 to S306 are repeatedly executed, the repeated execution of steps S304 to S306 is stopped.

For example, after step S302, a processing is performed on one lane H1 to obtain a first allocated number of lanes H1. The roadway H1 has first storage space information, where the first storage space information represents arrangement of container storage spaces of the roadway in a real state, and at this time, the racks corresponding to the roadway H1 have other containers arranged dispersedly, for example, as shown in fig. 6.

Firstly, the container resource information to be stored in the step S301 is used as initial first container information; the initial first container information comprises at least one container type, and each container type has the number of containers; calculating the total number of containers of all container types in the initial first container information; and for each container type in the initial first container information, dividing the number of containers of each container type by the total number of the current containers to obtain a proportional value of each container type in the initial first container information.

Then, a random number a is randomly generated, and the random number a is used as an initial first preset value. Subtracting the proportion value P1 of the 1 st container type in the initial first container information from the first preset value A to obtain a calculation difference value A-P1 of the 1 st container type; if the calculation difference A-P1 of the 1 st container type meets the preset requirement, determining the 1 st container type as the container type to be analyzed; and if the calculated difference A-P1 of the 1 st container type does not meet the preset requirement, taking the difference A-P1 of the first preset value A and the proportional value P1 of the 1 st container type as the updated first preset value. Subtracting the proportion value P2 of the 2 nd container type in the initial first container information from the updated first preset value A-P1 to obtain a calculation difference value A-P1-P2 of the 2 nd container type; if the calculation difference A-P1-P2 of the 2 nd container type meets the preset requirement, determining the 2 nd container type as the container type to be analyzed; and if the calculated difference A-P1-P2 of the 2 nd container type does not meet the preset requirement, taking the difference A-P1-P2 of the updated first preset value A-P1 and the proportional value P2 of the 2 nd container type as the updated first preset value. And analogizing until a container type to be analyzed is determined.

Then, in the first storage space information of the lane H1, it is determined whether there is a continuous free position having a length equal to or greater than the length of the current container type to be analyzed, that is, it is determined whether there is a continuous free position that meets the length requirement (the length requirement is that the length of the continuous free position is equal to or greater than the length of the current container type to be analyzed).

If a plurality of continuous idle positions meeting the length requirement exist, taking the continuous idle position with the minimum length as an idle position space matched with the type of the current container to be analyzed, and allocating a container under the type of the current container to be analyzed to the idle position space; the free position space is removed from the first storage space information of the tunnel H1, and the first storage space information of the tunnel H1 is updated; meanwhile, the number of containers corresponding to the type of the container to be analyzed in the initial first container information is subtracted by one, and then the first container information is updated.

At this time, a free space is allocated for one container type. The treatment may be performed again.

The first container information is updated; the updated first container information comprises at least one container type, and each container type has the number of containers; calculating the total number of containers of all container types in the updated first container information; and for each container type in the updated first container information, dividing the number of containers of each container type by the total number of the current containers to obtain a proportional value of each container type in the updated first container information.

Then, a random number B is randomly generated, and the random number B is used as an initial first preset value. Subtracting the proportion value PP1 of the 1 st container type in the updated first container information from the first preset value B to obtain a calculation difference value B-PP1 of the 1 st container type; if the calculation difference B-PP1 of the 1 st container type meets the preset requirement, determining the 1 st container type as the container type to be analyzed; and if the calculation difference B-PP1 of the 1 st container type does not meet the preset requirement, taking the difference B-PP1 between the first preset value B and the proportional value PP1 of the 1 st container type as the updated first preset value. Subtracting the ratio value PP2 of the 2 nd container type in the updated first container information from the updated first preset value B-PP1 to obtain a calculation difference value B-PP1-PP2 of the 2 nd container type; if the calculation difference B-PP1-PP2 of the 2 nd container type meets the preset requirement, determining the 2 nd container type as the container type to be analyzed; and if the calculated difference B-PP1-PP2 of the 2 nd container type does not meet the preset requirement, taking the difference B-PP1-PP2 of the updated first preset value B-PP1 and the proportional value PP2 of the 2 nd container type as the updated first preset value. And analogizing until a container type to be analyzed is determined.

Then, the first storage space information of the known lane H1 is updated, and in the updated first storage space information of the lane H1, it is determined whether there is a continuous free position having a length equal to or greater than the length of the current container type to be analyzed, that is, it is determined whether there is a continuous free position satisfying a length requirement (the length requirement is that the length of the continuous free position is equal to or greater than the length of the current container type to be analyzed).

If a plurality of continuous idle positions meeting the length requirement exist, taking the continuous idle position with the minimum length as an idle position space matched with the type of the current container to be analyzed, and allocating a container under the type of the current container to be analyzed to the idle position space; the idle position space is removed from the updated first storage space information of the tunnel H1, and the first storage space information of the tunnel H1 is updated again; and simultaneously, subtracting one from the number of the containers corresponding to the type of the container to be analyzed in the updated first container information, and updating the first container information again.

At this time, a free space is allocated for one container type.

And analogizing in sequence, repeating the process, determining a container type based on the first container information updated again and the first storage space information updated again of the roadway H1, and distributing the free position space for the container type. And the rest is repeated until the first preset condition is reached. Thus, a first distribution quantity of the lane H1 is obtained for the lane H1; the first allocated number of the lane H1 is the number of containers to which the free space (the space position in the lane H1) is allocated for each container type in the container resource information to be stored, based on the real state of the lane H1.

In the same manner as described above, the first allocated number of each lane is obtained for each lane.

And S307, repeating the following steps S308-S310 for each roadway until a second preset condition is reached, wherein the initial second container information is container resource information.

When a second preset condition is reached, the second distribution quantity comprises the quantity of containers with free position space distributed to each container type in the container resource information. The second distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information under the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

In one example, the second preset condition is any one of the following: each container in the container resource information is allocated with a free position space, containers in at least one container type cannot be matched with the free position space, and no free position space exists in the second storage space information.

Illustratively, after step S302, a second allocation quantity for each lane needs to be generated, where the second allocation quantity represents the quantity of containers that can be stored in the lane when the lane is in the assumed state in the container resource information to be stored. Steps S307-S310 may be performed in order to obtain a second allocation quantity for each lane.

Taking the container resource information to be stored in the step S301 as initial second container information; the steps S308 to S310 are repeatedly executed until the second set condition is reached. Wherein, each time the steps S308-S310 are executed once, the second container information and the second storage space information of the roadway are updated. The second container information includes at least one type of container, each type of container has the number of containers, and the sizes of the containers of different types are different.

And S308, determining second proportion information according to the second container information, wherein the second proportion information comprises a proportion value of each container type, and the proportion value of each container type represents a ratio between the number of containers of each container type and the total number of containers of all container types.

Illustratively, the second container information includes at least one type of container, each type of container has a number of containers, and the containers of different types are different in size. The container type in the second container information is N, and N is a positive integer greater than or equal to 1; that is, the second container information includes N container types.

Firstly, calculating the number of containers under each container type in the second container information according to the second container information; and summing the number of containers under each container type to obtain the total number of containers of all container types. For each container type in the second container information, the number of containers of each container type is divided by the total number of containers of all container types to obtain a proportional value of each container type. The scale value of each container type constitutes second scale information.

The second container information comprises N container types; the number Count (1) of containers of the container type a can be obtained for the 1 st container type a in the second container information; for the 2 nd container type b in the second container information, the container number Count (2) of the container type b can be obtained; the number Count (3) of containers of the container type c can be obtained for the 3 rd container type c in the second container information; the number Count (i) of containers of the container type i can be obtained for the ith container type i in the second container information, and the analogy is repeated to obtain the number Count (N) of containers of the nth container type in the second container information, so that the number of containers of each container type in the second container information is obtained. And adding the number of containers of each container type in the second container information to obtain the total number S of the containers of all the container types in the second container information. For the 1 st container type a in the second container information, the ratio value C1= (Count (1)/S) × 100% of the 1 st container type a can be obtained; for the 2 nd container type b in the first container information, the ratio C2= (Count (2)/S) × 100% of the container type b can be obtained; for the 3 rd container type C in the first container information, the ratio value C3= (Count (3)/S) × 100% of the container type C can be obtained; for the ith container type i in the first container information, the proportion value Ci = (Count (i)/S) × 100% of the container type i can be obtained; by analogy, the proportional value Cn = (Count (N)/S) × 100% for the nth container type in the first container information is obtained, and then the proportional value for each container type in the first container information is obtained. Wherein i is a positive integer of 1 to N

When step S308 is executed for the first time, the initial second container information is the container resource information to be stored in step S301.

And S309, determining the type of the container to be analyzed of the second container information according to the random number generated at random and the second proportion information.

In one example, step S309 specifically includes the following steps:

the container type in the second container information is N, and N is a positive integer greater than or equal to 1. Repeating the following steps until the type of the container to be analyzed is obtained, wherein the initial value of the second preset value is a random number generated randomly:

the method comprises the following steps of firstly, determining a second preset value to subtract a proportional value of the jth container type in the second container information to obtain a calculation difference value of the jth container type; wherein j is a positive integer of 1 or more and N or less.

And secondly, if the calculated difference value of the jth container type meets the preset requirement, determining the jth container type as the container type to be analyzed of the second container information.

And step three, if the calculated difference value of the jth container type does not meet the preset requirement, determining the difference value between the second preset value and the proportional value of the jth container type, wherein the difference value is the updated second preset value, and accumulating j by 1.

Illustratively, a random number is randomly generated, for example, a uniformly distributed random number (which may also be referred to as a uniformly distributed random number) in the range of [0,1] is generated; the second scale information includes a scale value for each container type in the second container information. According to the random number and the second proportion information, a container type to be analyzed (the container type to be analyzed is the container type in the second container information) is determined first, so as to determine whether a free position space can be allocated to the container under the container type to be analyzed.

The second container information includes N container types, each container type has the number of containers, and the sizes of the different container types are different. The proportional value of each container type in the second container information has been obtained using step S308.

And taking the randomly generated random number D as an initial value of a second preset value, and executing the following process until the type of the container to be analyzed is obtained. Subtracting the proportion value C1 of the 1 st container type in the second container information from the second preset value D to obtain a calculation difference value D-C1 of the 1 st container type; if the calculation difference value D-C1 of the 1 st container type meets a preset requirement, determining that the 1 st container type is the container type to be analyzed, for example, if the D-C1 is less than or equal to a preset threshold (e.g., a preset threshold is 0), determining that the 1 st container type is the container type to be analyzed; if the calculated difference D-C1 of the 1 st container type does not meet the preset requirement, the difference D-C1 between the second preset value D and the proportional value C1 of the 1 st container type is used as the updated second preset value, for example, if D-C1 is greater than a preset threshold (e.g., a preset threshold is 0), the difference D-C1 between the second preset value D and the proportional value C1 of the 1 st container type is used as the updated first preset value. Then, subtracting the proportional value C2 of the 2 nd container type in the first container information from the updated second preset value D-C1 to obtain a calculation difference value D-C1-C2 of the 2 nd container type; if the calculation difference D-C1-C2 of the 2 nd container type meets the preset requirement, determining the 2 nd container type as the container type to be analyzed; and if the calculated difference D-C1-C2 of the 2 nd container type does not meet the preset requirement, taking the difference D-C1-C2 of the updated second preset value D-C1 and the proportional value C2 of the 2 nd container type as the updated second preset value. Then, subtracting the ratio value C3 of the 3 rd container type in the first container information from the updated second preset value D-C1-C2 to obtain a calculation difference value D-C1-C2-C3 of the 3 rd container type; if the calculation difference D-C1-C2-C3 of the 3 rd container type meets the preset requirement, determining the 3 rd container type as the container type to be analyzed; and if the calculated difference D-C1-C2-C3 of the 3 rd container type does not meet the preset requirement, taking the difference D-C1-C2-C3 of the updated second preset value D-C1-C2 and the proportion value C3 of the 3 rd container type as the updated second preset value. By analogy, subtracting the proportional value Cj of the jth container type in the first container information from the updated second preset value to obtain a calculation difference value of the jth container type; if the calculation difference value of the jth container type meets the preset requirement, determining the jth container type as the container type to be analyzed of the second container information; and if the calculated difference value of the jth container type does not meet the preset requirement, determining the difference value between the updated second preset value and the proportional value of the jth container type, and taking the difference value as the updated second preset value. And the like, until the type of the container to be analyzed of the second container information is determined, so that the type of the container to be analyzed of the second container information in the execution process is obtained each time steps S308 to S310 are executed.

And S310, if the second storage space information is determined to have continuous free positions with the length being more than or equal to the length of the current container type to be analyzed, determining that the container under the current container type to be analyzed is allocated with a free position space, wherein the length of the free position space is the minimum length in the continuous free positions with the length being more than or equal to the length of the current container type to be analyzed. And removing the free position space from the second storage space information, and updating the second container information by subtracting one from the number of containers corresponding to the type of the container to be analyzed in the second container information.

Illustratively, the arrangement of the container storage space of each lane in the assumed state is the second storage space information of each lane. In this case, each lane is a hypothetical state, the other containers on the shelves corresponding to each lane are collectively placed (for example, the containers on each row of shelves of a rack are collectively pushed to the left or right of the shelf, or the containers on each row of shelves of a rack are collectively pushed to several shelves), and each lane has a continuous free position on the shelf corresponding to each lane. For example, as shown in fig. 7, discrete empty spaces on shelves corresponding to lanes are merged into one continuous empty space.

For each lane, each lane has second storage space information. For each lane, it is determined whether there are consecutive free positions in the second storage space information of the lane, the length of which is equal to or greater than the length of the container type to be analyzed determined in step S309, that is, whether there are consecutive free positions meeting the length requirement (the length requirement is that the length of the consecutive free positions is equal to or greater than the length of the container type to be analyzed determined in step S309). In the assumed state of the roadway, the continuous free positions allocated to the types of containers to be analyzed are partial free spaces on a row of shelves of the rack.

For each roadway, if a plurality of continuous free positions meeting the length requirement exist, taking the continuous free position with the minimum length as a free position space matched with the type of the container to be analyzed determined in the step S309, and allocating a container under the type of the container to be analyzed determined in the step S309 to the free position space, wherein at this time, a container under the type of the container to be analyzed determined in the step S309 occupies a free position space; and, the free position space is removed from the second storage space information; meanwhile, the number of containers corresponding to the type of container to be analyzed determined in step S309 in the second container information is subtracted by one, and the second container information is updated, and steps S308 to S310 are performed again.

If there are no continuous free positions meeting the length requirement for each lane, the second container information does not need to be updated, and steps S308-S310 are performed again.

When the steps S308 to S310 are repeatedly executed, if it is determined that the second preset condition is reached, the repeated execution of the steps S308 to S310 is stopped. For each lane, the number of containers to which the free position space is allocated for each container type in the container resource information to be stored, that is, the second allocation number (the second allocation number, which includes the number of containers to which the free position space is allocated for each container type in the container resource information to be stored) for each lane can be obtained; at this time, the second allocation amount obtained in the assumed state is based on each lane.

The second preset condition may be that each container in the container resource information to be stored is allocated with a free position space. That is, when it is determined that each container in the container resource information to be stored is assigned with the free position space, the repeated execution of steps S308 to S310 is stopped.

Alternatively, the second predetermined condition may be that the container of at least one container type cannot be matched with the empty space. That is, when it is determined that none of the container types in the container resource information to be stored can be allocated to an appropriate free space, the repetition of steps S308 to S310 is stopped. Or, when determining that one or more container types in the container resource information to be stored cannot be allocated to the appropriate free position space, stopping repeatedly executing the steps S308-S310.

Alternatively, the second preset condition may be that there is no free space in the second storage space information. That is, in the process of repeatedly executing steps S308 to S310, appropriate free position spaces are allocated to the types of containers in the container resource information to be stored, and other containers have been placed in the racks corresponding to the lanes, and as steps S308 to S310 are repeatedly executed, if there is no free position in the lanes, or if there is no appropriate free position space in the lanes, the repeated execution of steps S308 to S310 is stopped.

For example, after step S302, a processing is performed on one lane H1 to obtain a second allocation number of the lane H1. The lane H1 has second storage space information, where the second storage space information represents arrangement of container storage spaces of the lane in an assumed state, and at this time, the rack corresponding to the lane H1 has other containers, and discrete free position spaces on the rack corresponding to the lane H1 are merged into a continuous free position space, for example, as shown in fig. 7.

Firstly, the container resource information to be stored in the step S301 is used as initial second container information; the initial second container information comprises at least one container type, and each container type has the number of containers; calculating the total number of containers of all container types in the initial second container information; and for each container type in the initial second container information, dividing the number of the containers of each container type by the total number of the current containers to obtain a proportional value of each container type in the initial second container information.

Then, a random number D is randomly generated, and the random number D is used as an initial second preset value. Subtracting the proportion value C1 of the 1 st container type in the initial second container information from the second preset value D to obtain a calculation difference value D-C1 of the 1 st container type; if the calculation difference D-C1 of the 1 st container type meets the preset requirement, determining the 1 st container type as the container type to be analyzed; and if the calculated difference D-C1 of the 1 st container type does not meet the preset requirement, taking the difference D-C1 between the second preset value D and the proportional value C1 of the 1 st container type as the updated second preset value. Subtracting the proportion value C2 of the 2 nd container type in the initial second container information from the updated second preset value D-C1 to obtain a calculation difference value D-C1-C2 of the 2 nd container type; if the calculation difference D-C1-C2 of the 2 nd container type meets the preset requirement, determining the 2 nd container type as the container type to be analyzed; and if the calculated difference D-C1-C2 of the 2 nd container type does not meet the preset requirement, taking the difference D-C1-C2 of the updated second preset value D-C1 and the proportional value C2 of the 2 nd container type as the updated second preset value. And analogizing until a container type to be analyzed is determined.

Then, in the second storage space information of the lane H1, it is determined whether there are consecutive free positions having a length equal to or greater than the length of the current kind of container to be analyzed, that is, it is determined whether there are consecutive free positions that meet the length requirement (the length requirement is that the length of the consecutive free positions is equal to or greater than the length of the current kind of container to be analyzed).

If a plurality of continuous idle positions meeting the length requirement exist, taking the continuous idle position with the minimum length as an idle position space matched with the type of the current container to be analyzed, and allocating a container under the type of the current container to be analyzed to the idle position space; in addition, the free position space is removed from the second storage space information of the tunnel H1, and the second storage space information of the tunnel H1 is updated; meanwhile, the number of containers corresponding to the type of the container to be analyzed in the initial second container information is subtracted by one, and then the second container information is updated.

At this time, a free position space is allocated for one container type. The treatment can be performed again.

The second container information is updated; the updated second container information comprises at least one container type, and each container type has the number of containers; calculating the total number of containers of all container types in the updated second container information; and for each container type in the updated second container information, dividing the number of containers of each container type by the total number of the current containers to obtain a proportional value of each container type in the updated second container information.

Then, a random number E is randomly generated, and the random number E is used as an initial second preset value. Subtracting the proportion value CC1 of the 1 st container type in the updated second container information from the second preset value E to obtain a calculation difference value E-CC1 of the 1 st container type; if the calculation difference E-CC1 of the 1 st container type meets the preset requirement, determining the 1 st container type as the container type to be analyzed; and if the calculated difference E-CC1 of the 1 st container type does not meet the preset requirement, taking the difference E-CC1 between the second preset value E and the proportional value CC1 of the 1 st container type as the updated second preset value. Subtracting the proportion value CC2 of the 2 nd container type in the updated second container information from the updated second preset value E-CC1 to obtain a calculation difference value E-CC1-CC2 of the 2 nd container type; if the calculation difference E-CC1-CC2 of the 2 nd container type meets the preset requirement, determining the 2 nd container type as the container type to be analyzed; and if the calculated difference E-CC1-CC2 of the 2 nd container type does not meet the preset requirement, taking the difference E-CC1-CC2 of the updated second preset value E-CC1 and the proportional value CC2 of the 2 nd container type as the second updated preset value. And analogizing until a container type to be analyzed is determined.

Then, the second storage space information of the known lane H1 is updated, and in the updated second storage space information of the lane H1, it is determined whether there is a continuous free position having a length equal to or greater than the length of the current container type to be analyzed, that is, it is determined whether there is a continuous free position meeting the length requirement (the length requirement is that the length of the continuous free position is equal to or greater than the length of the current container type to be analyzed).

If a plurality of continuous idle positions meeting the length requirement exist, taking the continuous idle position with the minimum length as an idle position space matched with the type of the current container to be analyzed, and allocating a container under the type of the current container to be analyzed to the idle position space; the idle position space is removed from the updated second storage space information of the tunnel H1, and then the second storage space information of the tunnel H1 is updated again; and simultaneously, subtracting one from the number of the containers corresponding to the type of the container to be analyzed in the updated second container information, and updating the second container information again.

At this time, a free space is allocated for one container type.

And analogizing in sequence, repeating the process, determining a container type based on the second container information updated again and the second storage space information updated again of the roadway H1, and distributing the free position space for the container type. And the rest is done in turn until the second preset condition is reached. Thus, for the lane H1, a second allocation number of the lane H1 is obtained; the second allocation amount of the lane H1 is the number of containers to which the free position space (the space position in the lane H1) is allocated for each container type in the container resource information to be stored, based on the assumed state of the lane H1.

In the same manner as described above, for each lane, the second allocation number of each lane is obtained.

After step S302, steps S303-S306, S307-S310 may be performed simultaneously; or after step S302, executing steps S303-S306, and then executing steps S307-S310; alternatively, after step S302, steps S307-S310 are performed, and then steps S303-S306 are performed.

And S311, determining the distribution difference value of each roadway according to the difference value between the first distribution quantity and the second distribution quantity of each roadway.

For example, this step may refer to step S205 of the above embodiment, and is not described again.

And S312, determining the roadway with the maximum distribution difference value, sending an adjusting instruction to the warehousing robot, wherein the adjusting instruction is used for instructing the warehousing robot to adjust the arrangement of the container storage space of the roadway with the adjusted storage space.

In this embodiment, on the basis of the above embodiment, the first allocation quantity of each lane can be obtained by adopting the processes of steps S303 to S306; the first distribution quantity refers to the quantity of containers, each container type in the container resource information to be stored is distributed with free position space (space position in the roadway) based on the real state of the roadway; in addition, in the process, each time the steps S304 to S306 are repeatedly performed, the type of the container to be analyzed is determined based on the random number and the ratio of each type of the container, whether a suitable free position space can be allocated to the type of the container to be analyzed is determined, and then the first allocation amount of each lane is accurately obtained. By adopting the processes of the steps S307-S310, the second distribution quantity of each roadway can be obtained; the second allocation number of the lane refers to the number of containers to which the free position space (the space position in the lane) is allocated for each container type in the container resource information to be stored, based on the assumed state of the lane; in the process, each time steps S308 to S310 are repeatedly performed, the type of container to be analyzed is determined based on the random number and the ratio of each type of container, whether an appropriate free position space can be allocated to the type of container to be analyzed is determined, and the second allocation number of each lane is accurately obtained. Obtaining a distribution difference value of each roadway according to the first distribution quantity and the second distribution quantity of each roadway; the larger the distribution difference value of the roadway is, the larger the number of containers which can be stored is after the storage space on the goods shelf corresponding to the characterization adjustment roadway is. Thereby obtaining a tunnel which is adjusted preferentially (determining the shelf which is adjusted preferentially). After the adjusting of the storage space of the roadway to be subjected to storage space adjustment, more storage spaces of the roadway and the warehouse can be released, the position space on the goods shelf corresponding to the roadway is prevented from being left unused, and the utilization rate of the goods shelf and the warehouse is improved.

Example four

Fig. 10 is a flowchart of a cargo storage space adjustment method according to a fourth embodiment of the present invention. As shown in fig. 10, the method comprises the following specific steps:

s401, container storage information of a container resource pool to be analyzed and a warehouse is obtained, wherein the container resource pool to be analyzed comprises a plurality of containers, the container resource pool to be analyzed comprises the number of containers under the initial type of each container, and the container storage information represents storage space arrangement of shelves corresponding to each roadway in the warehouse.

Before step S405, it is first known whether the storage space of the roadway needs to be adjusted, and when it is determined that the storage space of the roadway needs to be adjusted, container resource information to be stored is obtained.

Firstly, a container resource pool to be analyzed is obtained, the container resource pool to be analyzed includes a plurality of container initial types (container types in the container resource pool to be analyzed are referred to as container initial types), each container initial type includes the number of containers under the container initial type, and the container sizes of different container initial types are different. Each container in the container resource pool to be analyzed needs to be put into a warehouse, namely, each container in the container resource pool to be analyzed is a container to be put into the warehouse; or, each container in the container resource pool to be analyzed is a container expected to be put in storage.

Analyzing all the lanes in the warehouse to determine whether to adjust the storage space of the lanes of the warehouse, and further acquiring the storage space arrangement of the shelves corresponding to each lane in the warehouse; the storage space arrangement of the shelves corresponding to each lane refers to the number of containers already placed on the shelves corresponding to the lane, the positions of the containers already placed, and the occupied position space of the containers already placed. The storage spaces of the goods shelves corresponding to the roadways are arranged to form storage information of the container; the container storage information is the storage space arrangement condition of each roadway in a real state.

S402, according to the container storage information, carrying out position matching on containers in the initial types of the containers in the container resource pool to be analyzed to obtain multiple matching results.

In one example, each matching result includes a first number of each container initial category, a second number of each container initial category, and category information; the type information is the initial types of containers corresponding to containers which are not matched with the free position space, the first number of the initial types of each container is the number of containers which are matched with the free position space under the initial type of each container, and the second number of the initial types of each container is the number of containers which are not matched with the free position space under the initial type of each container.

In one example, in step S402, when each matching result is obtained, the processing procedure is as follows:

the method comprises a first step of repeating the following steps (a second step to a fourth step) until a third preset condition is reached, wherein initial third container information is a container resource pool to be analyzed. The third preset condition includes any one of: each container in the container resource pool to be analyzed is allocated with a free position space, containers in at least one container initial type cannot be matched with the free position space, and no free position space exists in container storage information.

And a second step of determining third proportion information according to the third container information, wherein the third proportion information comprises a proportion value of each initial type of the containers in the third container information, and the proportion value of each initial type of the containers represents a ratio between the number of the containers of each initial type of the containers and the total number of the containers of all the initial types of the containers.

And a third step of determining the initial type of the container to be processed of the third container information according to the random number generated at random and the third proportion information.

A fourth step of determining that the container under the current initial type of the container to be processed is allocated with a free position space if the container storage information is determined to have continuous free positions with the lengths larger than or equal to the length of the current initial type of the container to be processed, wherein the length of the free position space is the minimum length in the continuous free positions with the lengths larger than or equal to the length of the current initial type of the container to be processed; and removing the free position space from the container storage information, and updating the third container information by subtracting one from the number of containers corresponding to the current type of containers to be processed in the third container information.

Exemplarily, after the step S401, the containers in the container resource pool to be analyzed are matched with the free position space according to the arrangement of the storage spaces of the lanes in the container storage information, so as to match the result at one time. And the storage space arrangement condition of each roadway in the container storage information matches the container in the container resource pool to be analyzed with the free position space again, and then a matching result is obtained again. By analogy, obtaining multiple matching results; and in each matching, the storage information of the containers is the same, and the resource pools of the containers to be analyzed are the same.

After each matching, the obtained matching result comprises a first number of each container initial type, a second number of each container initial type and type information. The first number of the initial types of each container refers to the number of containers matched with the free position space under each initial type of container; for example, when Box1 containers under the initial kind of container Box1 are matched with the free position space, the first number of the initial kind of container Box1 is Box1. The second number of the initial types of each container refers to the number of containers which are not matched with the free position space under the initial types of each container; for example, boxn1 containers under the initial category Box1 of containers are not matched with the free position space, and the second number of the initial category Box1 of containers is boxn1. The type information refers to the initial type of the container corresponding to the container which is not matched with the free position space; that is, if there is a container that is not matched with the empty position space, the initial type of the container corresponding to the container is put in the type information.

And matching the containers in the container resource pool to be analyzed with the free position space according to the storage space arrangement condition of each roadway in the container storage information to obtain a primary matching result. For each matching, the following procedure (first to fourth steps) may be employed.

A first step. Taking the container resource pool to be analyzed in the step S401 as initial third container information; and repeating the second step to the fourth step until a third preset condition is reached. And updating the information of the third container and the information of the container storage every time the second step to the fourth step are executed. The third container information includes at least one type of container, each type of container has the number of containers, and the sizes of the different types of containers are different.

And a second step. The third container information includes at least one type of container, each type of container has the number of containers, and the sizes of the different types of containers are different. The container type in the third container information is M, and M is a positive integer greater than or equal to 1; that is, the third container information includes M container initial categories.

In the second step, firstly, the number of containers in the initial type of each container in the third container information is calculated according to the third container information; and summing the number of containers under the initial types of the containers to obtain the total number of the containers of all the initial types of the containers. And dividing the number of the containers of each initial type of the containers by the total number of the containers of all the types of the containers to obtain a proportional value of each initial type of the containers. The scale value of the initial type of each container constitutes third scale information.

The third container information comprises M container initial types; for the 1 st container initial type a in the third container information, the number X (1) of containers of the container initial type a can be obtained; for the 2 nd container initial type b in the third container information, the container number X (2) of the container initial type b can be obtained; for the 3 rd container initial type c in the third container information, the container number X (3) of the container initial type c can be obtained; the number X (k) of containers of the initial type k of the container can be obtained for the initial type k of the kth container in the information of the third container, and so on, the number X (n) of containers of the initial type of the mth container in the information of the third container is obtained, and further, the number of containers of each initial type of the container in the information of the third container is obtained. And adding the number of the containers of the initial types of the containers in the third container information to obtain the total number Y of the containers of the initial types of all the containers in the third container information. For the 1 st container initial type a in the third container information, the ratio value K1= (X (1)/Y) × 100% of the 1 st container initial type a can be obtained; for the 2 nd container initial type b in the third container information, the ratio value K2= (X (2)/Y) × 100% of the container initial type b can be obtained; for the 3 rd container initial type c in the third container information, the ratio value K3= (X (3)/Y) × 100% of the container initial type c can be obtained; for the kth container initial type k in the third container information, a ratio value Kk = (X (k)/Y) × 100% of the container initial type k can be obtained; by analogy, the ratio KM = (X (M)/Y) × 100% of the mth container initial type in the third container information is obtained, and then the ratio of each container initial type in the third container information is obtained. Wherein k is a positive integer of 1 or more and M or less.

When the second step is executed for the first time, the initial third container information is the container resource pool to be analyzed in step S401.

And a third step. Randomly generating a random number, for example, generating a uniformly distributed random number (which may also be referred to as a uniformly distributed random number) in the range of [0,1 ]; the third proportion information includes a proportion value of each container initial category in the third container information. According to the random number and the third proportion information, an initial type of a container to be processed (the initial type of the container to be processed is the type of the container in the third container information) is determined first, so as to determine whether a free position space can be allocated to the container under the initial type of the container to be processed.

In an example, the third step in the step S402 specifically includes the following steps:

the type of the container in the third container information is M, and M is a positive integer greater than or equal to 1; repeating the following steps until the initial type of the container to be processed is obtained, wherein the initial value of the third preset value is a random number generated randomly: subtracting the proportional value of the kth packing box initial type in the third packing box information from the third preset value to obtain a calculation difference value of the kth packing box initial type; wherein k is a positive integer greater than or equal to 1 and less than or equal to M; if the calculation difference value of the kth container initial type meets the preset requirement, determining that the kth container initial type is the container initial type to be processed of the third container information; and if the calculated difference value of the initial category of the kth container does not meet the preset requirement, determining the difference value between the third set value and the proportional value of the initial category of the kth container, wherein the difference value is the updated third set value, and accumulating k by 1.

For example, in determining the initial type of container to be processed, the following process may be employed.

The third container information comprises M initial types of containers, the containers of the initial types of each container have the number of containers, and the containers of the initial types of different containers have different sizes. The second step has been used to obtain a proportional value of the initial category of each container in the third container information.

And taking the randomly generated random number F as an initial value of a third preset value, and executing the following process until the initial type of the container to be processed is obtained. Subtracting the proportional value K1 of the 1 st container initial type in the third container information from the third preset value F to obtain a calculation difference F-K1 of the 1 st container initial type; if the calculation difference value F-K1 of the 1 st container initial type meets a preset requirement, determining that the 1 st container initial type is the container initial type to be processed, for example, if the calculation difference value F-K1 is less than or equal to a preset threshold (e.g., is 0), determining that the 1 st container initial type is the container initial type to be processed; if the calculated difference F-K1 of the initial category of the 1 st container does not satisfy the preset requirement, the difference F-K1 between the third preset value F and the proportional value K1 of the initial category of the 1 st container is used as the updated third preset value, for example, if F-K1 is greater than a preset threshold (e.g., a preset threshold is 0), the difference F-K1 between the third preset value F and the proportional value K1 of the initial category of the 1 st container is used as the updated third preset value. Then, subtracting a proportional value K2 of the 2 nd container initial type in the third container information from the updated third preset value F-K1 to obtain a calculation difference value F-K1-K2 of the 2 nd container initial type; if the calculation difference F-K1-K2 of the 2 nd container initial type meets the preset requirement, determining the 2 nd container initial type as the container initial type to be processed; and if the calculated difference F-K1-K2 of the initial type of the 2 nd container does not meet the preset requirement, taking the difference F-K1-K2 of the updated third preset value F-K1 and the proportional value K2 of the initial type of the 2 nd container as the updated third preset value. Then, subtracting a proportional value K3 of the 3 rd container initial type in the third container information from the updated third preset value F-K1-K2 to obtain a calculation difference F-K1-K2-K3 of the 3 rd container initial type; if the calculation difference F-K1-K2-K3 of the 3 rd initial container type meets the preset requirement, determining the 3 rd initial container type as the initial container type to be processed; and if the calculated difference F-K1-K2-K3 of the initial category of the 3 rd container does not meet the preset requirement, taking the difference F-K1-K2-K3 of the updated third preset value F-K1-K2 and the proportional value K3 of the initial category of the 3 rd container as the updated third preset value. By analogy, subtracting the proportional value Kk of the kth container initial type in the third container information from the updated third preset value to obtain a calculation difference value of the kth container initial type; if the calculation difference value of the kth container initial type meets the preset requirement, determining that the kth container initial type is the container initial type to be processed of the third container information; and if the calculated difference value of the initial category of the kth container does not meet the preset requirement, determining the difference value between the updated third preset value and the proportional value of the initial category of the kth container, and taking the difference value as the updated third preset value. And analogizing until the initial type of the container to be processed of the third container information is determined, thereby obtaining the initial type of the container to be processed of the third container information in the executing process each time the second step to the fourth step are executed.

And a fourth step. The arrangement condition of the container storage space of each roadway in the real state forms container storage information. In this case, each lane is in a real state, each lane has discrete other containers on its corresponding shelf, and each lane has at least one continuous free position on its corresponding shelf. Note that the container storage information includes arrangement of container storage spaces of all the lanes in the warehouse in a real state.

Whether continuous idle positions with the length being larger than or equal to the length of the initial type of the containers to be processed determined in the third step exist in the container storage information is judged, namely whether continuous idle positions with the length requirement (the length requirement is that the length of the continuous idle positions is larger than or equal to the length of the initial type of the containers to be processed determined in the third step) exist is judged.

If a plurality of continuous free positions meeting the length requirement exist, taking the continuous free position with the minimum length as a free position space matched with the initial type of the container to be processed determined in the third step, and allocating a container under the initial type of the container to be processed determined in the third step to the free position space, wherein the container under the initial type of the container to be processed determined in the third step occupies a free position space; in addition, the free position space is removed from the packing box storage information, so that the packing box storage information is updated; and simultaneously, subtracting one from the number of containers corresponding to the initial type of the container to be processed determined in the third step in the third container information, updating the third container information, and executing the second step to the fourth step again.

If the container does not have continuous free positions meeting the length requirement, the container storage information and the third container information do not need to be updated, and the second step to the fourth step are executed again.

And when the second step to the fourth step are repeatedly executed, if the third preset condition is determined to be reached, stopping repeatedly executing the second step to the fourth step. A matching result of a matching process can be obtained, and the matching result includes a first number of the initial types of each container, a second number of the initial types of each container, and type information.

The third preset condition may be that each container in the container resource pool to be analyzed is allocated with a free position space. That is, when it is determined that containers in the container resource pool to be analyzed are each allocated with a free space, the second to fourth steps are stopped from being repeatedly executed.

Alternatively, the third predetermined condition may be that the container in the original category of the at least one container cannot be matched with the empty space. That is, when it is determined that none of the container types in the container resource pool to be analyzed can be allocated to an appropriate free space, the second to fourth steps are stopped from being repeatedly executed. Or when determining that one or more container initial types in the container resource pool to be analyzed cannot be allocated to the proper free position space, stopping repeatedly executing the second step to the fourth step.

Or, the third preset condition may be that no free space exists in the container storage information. That is, in the process of repeatedly executing the second step to the fourth step, an appropriate free position space is allocated to each container type in the container resource pool to be analyzed, and other containers are already placed in the shelves corresponding to each lane in a dispersed manner.

For example, the container storage information is adopted to perform position matching on the containers in the container resource pool to be analyzed, and a primary matching result is obtained. For one matching procedure, an example is as follows. The warehouse has container storage information.

Firstly, taking a container resource pool to be analyzed as initial third container information; the initial third container information comprises at least one container initial type, and each container initial type has the number of containers; calculating the total number of containers of all initial types of the containers in the initial third container information; and for each initial type of the containers in the initial third container information, dividing the number of the containers in each initial type of the containers by the total number of the current containers to obtain a proportional value of each initial type of the containers in the initial third container information.

Then, a random number F is randomly generated, and the random number F is used as an initial third preset value. Subtracting the proportional value K1 of the 1 st container initial type in the initial third container information from the third preset value F to obtain a calculation difference F-K1 of the 1 st container initial type; if the calculation difference F-K1 of the 1 st container initial type meets the preset requirement, determining the 1 st container initial type as the container initial type to be processed; and if the calculation difference F-K1 of the 1 st container initial type does not meet the preset requirement, taking the difference F-K1 of the third preset value F and the proportional value K1 of the 1 st container initial type as the updated third preset value. Subtracting the proportion value K2 of the 2 nd container initial type in the initial third container information from the updated third preset value F-K1 to obtain a calculation difference value F-K1-K2 of the 2 nd container initial type; if the calculation difference F-K1-K2 of the 2 nd container initial type meets the preset requirement, determining the 2 nd container initial type as the container initial type to be processed; and if the calculated difference F-K1-K2 of the 2 nd container initial type does not meet the preset requirement, taking the difference F-K1-K2 of the updated third preset value F-K1 and the proportional value K2 of the 2 nd container initial type as the updated third preset value. And repeating the steps until an initial type of the container to be processed is determined.

Then, in the container storage information, it is determined whether there are continuous free positions having a length equal to or greater than the length of the current initial kind of container to be processed, that is, it is determined whether there are continuous free positions meeting the length requirement (the length requirement is that the length of the continuous free positions is equal to or greater than the length of the current initial kind of container to be processed).

If a plurality of continuous idle positions meeting the length requirement exist, taking the continuous idle position with the minimum length as an idle position space matched with the current initial type of the container to be processed, and allocating a container under the current initial type of the container to be processed to the idle position space; in addition, the free position space is removed from the packing box storage information, and the packing box storage information is updated; meanwhile, the number of containers corresponding to the current initial type of the container to be processed in the initial third container information is subtracted by one, and then the third container information is updated.

At this time, a free space is allocated for an initial sort of container. The treatment may be performed again.

The third container information is updated; the updated information of the third container comprises at least one initial type of container, and each initial type of container has the number of containers; calculating the total number of containers of all initial types of the containers in the updated third container information; and for each initial type of the containers in the updated third container information, dividing the number of the containers in each initial type of the containers by the total number of the current containers to obtain a proportional value of each initial type of the containers in the updated third container information.

Then, a random number G is randomly generated, and the random number G is used as an initial third preset value. Subtracting the proportional value KK1 of the 1 st container initial type in the updated third container information from the third preset value G to obtain a calculation difference value G-KK1 of the 1 st container initial type; if the calculation difference value G-KK1 of the 1 st container initial type meets the preset requirement, determining the 1 st container initial type as the container initial type to be processed; and if the calculation difference G-KK1 of the 1 st container initial type does not meet the preset requirement, taking the difference G-KK1 of the third preset value G and the proportional value KK1 of the 1 st container initial type as the updated third preset value. Subtracting the updated third preset value G-KK1 from the proportional value KK2 of the 2 nd container initial type in the updated third container information to obtain a calculation difference G-KK1-KK2 of the 2 nd container initial type; if the calculation difference G-KK1-KK2 of the 2 nd container initial type meets the preset requirement, determining that the 2 nd container initial type is the container initial type to be processed; and if the calculated difference G-KK1-KK2 of the 2 nd initial container type does not meet the preset requirement, taking the difference G-KK1-KK2 of the updated third preset value G-KK1 and the proportional value KK2 of the 2 nd initial container type as the updated third preset value again. And repeating the steps until an initial type of the container to be processed is determined.

Then, the known container storage information is updated, and in the container storage information, it is determined whether or not there are consecutive free positions having a length equal to or greater than the length of the current initial kind of container to be processed, that is, it is determined whether or not there are consecutive free positions satisfying the length requirement (the length requirement is that the length of the consecutive free positions is equal to or greater than the length of the current initial kind of container to be processed).

If a plurality of continuous idle positions meeting the length requirement exist, taking the continuous idle position with the minimum length as an idle position space matched with the current initial type of the container to be processed, and allocating a container under the current initial type of the container to be processed to the idle position space; the empty position space is removed from the updated container storage information, and the container storage information is updated again; and simultaneously, subtracting one from the number of the containers corresponding to the current initial type of the container to be processed in the updated third container information, and updating the third container information again.

At this time, a free position space is allocated for an initial kind of container.

And analogizing in sequence, repeating the process, determining an initial type of the container based on the updated information of the third container and the updated information of the container storage, and allocating a free position space for the initial type of the container. And the rest is repeated until the third preset condition is reached. Therefore, a matching result corresponding to the matching process is obtained for the warehouse, and the matching result comprises a first number of the initial types of each container, a second number of the initial types of each container and type information.

In the same way, position matching is carried out on the containers in the container resource pool to be analyzed by adopting the container storage information, and a primary matching result is obtained; and repeating the steps to obtain multiple matching results. And when the container storage information is matched with the container storage information, the container storage information is the same, and the container resource pools to be analyzed are the same.

And S403, if at least one matching result in the multiple matching results represents that a container which is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained, determining that the container storage space needs to be adjusted according to the goods shelf corresponding to the roadway.

For example, based on the multiple matching results in step S402, when a matching result indicates that there is a container that is not matched with the free position space in the container resource pool to be analyzed (i.e., there is still a container that cannot be matched into the warehouse), it is determined that the storage space in the warehouse is unreasonable, and the layout of each container in the warehouse may cause that the container in the container resource pool to be analyzed cannot be put into the warehouse. Thus, it is determined that position space adjustment of the roadway is required. Then, step S404 is executed.

S404, if the situation that the container storage space needs to be adjusted according to the goods shelf corresponding to the roadway is determined, container resource information to be stored is obtained. The container resource information includes the number of containers in each container type.

In one example, step S404 specifically includes: if the goods shelf corresponding to the roadway needs to be adjusted in the goods shelf storage space, determining the initial kinds of the goods shelves in the kind information in the multiple matching results, and determining the initial kinds of the goods shelves as the kinds of the goods shelves in the goods shelf resource information to be stored; and determining the average value of the second number of the initial types of each container in the multiple matching results, wherein the average value is the number of containers under each container type in the container resource information to be stored.

For example, after step S403, container resource information to be stored needs to be obtained, and then the container resource information to be stored is used to perform steps S405 to 407, so as to determine a lane that needs to be spatially sorted (i.e., determine a lane that needs to be spatially adjusted).

The "container resource information to be stored" in this embodiment is obtained according to the multiple matching results in step S402.

Each matching result comprises a first number of each container initial type, a second number of each container initial type and type information. The first number of the initial category of each container refers to the number of containers matched with the free position space under each initial category of the container. The second number of containers of the initial category of each container refers to the number of containers of the initial category of each container that are not matched with the empty space. The type information refers to the initial type of the container corresponding to the container which is not matched with the free position space; that is, if there is a container that is not matched with the empty position space, the initial type of the container corresponding to the container is put in the type information.

The type information in each matching result is the initial type of the container corresponding to the container which is not matched with the free position space, and the initial types of the containers of the type information in the multiple matching results are all put into the container resource information to be stored and are used as the types of the containers in the container resource information to be stored. For example, the first matching result represents that part of containers still cannot be matched with the free position space, so that the initial types of the containers corresponding to the containers are put into the type information of the matching result; the obtained type information in the primary matching result is respectively a container initial type a, a container initial type b and a container initial type c; similarly, the type information in the obtained another matching result is respectively a container initial type a, a container initial type d and a container initial type e; thus, the container initial type a, the container initial type b, the container initial type c, the container initial type d, and the container initial type e are used as container types of container resource information to be stored.

Each matching result comprises a second number of the initial types of each container; the second number of containers of the initial category of each container refers to the number of containers of the initial category of each container that are not matched with the empty space. And taking the average value of the second quantity of the initial types of each container in the multiple matching results as the quantity of the containers under each container type in the container resource information to be stored.

For example, the first matching result represents that the number of containers not matched with the empty position space under the container initial type a is a1 (the second number of the container initial type a is a 1), the number of containers not matched with the empty position space under the container initial type b is b1 (the second number of the container initial type b is b 1), and the number of containers not matched with the empty position space under the container initial type c is c1 (the second number of the container initial type c is c 1).

The other matching result represents that the number of containers which are not matched with the free position space under the container initial type a is a2 (the second number of the container initial type a is a 2), the number of containers which are not matched with the free position space under the container initial type b is b2 (the second number of the container initial type b is b 2), and the number of containers which are not matched with the free position space under the container initial type d is d1 (the second number of the container initial type d is d).

Taking the average (a 1+ a 2)/2 of the second number of the initial types a of the containers as the number of the containers of the type a of the containers in the container resource information to be stored; taking the average (b 1+ b 2)/2 of the second number of the container initial types b as the number of the containers of the container types b in the container resource information to be stored; taking the average number c1 of the second number of the initial types c of the containers as the number of the containers of the type c of the containers in the container resource information to be stored; and taking the average d1 of the second number of the initial types d of the containers as the number of the containers of the type d of the containers in the container resource information to be stored.

S405, container arrangement information of each roadway is obtained, wherein dynamic storage space is arranged on the goods shelves corresponding to each roadway, container arrangement information represents that the containers are respectively arranged in the storage space of the containers in the real state and in the storage space of the containers in the assumed state, and the containers on the goods shelves corresponding to the assumed state representation roadway are continuously arranged.

For example, this step may refer to any of the above embodiments, and is not described again.

S406, determining a distribution difference value of each roadway according to the container resource information and the container arrangement information of each roadway, wherein the distribution difference value represents a difference value between the first distribution quantity and the second distribution quantity; the first distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the real state, the second distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

However, the difference from the above embodiment is that the container resource information used in the present embodiment is determined in the manner of step S404. That is, the container resource information used in the present embodiment is obtained based on the multiple matching result in step S402.

And S407, determining the roadway with the maximum distribution difference value as the roadway to be subjected to storage space adjustment.

And S408, sending an adjusting instruction to the warehousing robot, wherein the adjusting instruction is used for instructing the warehousing robot to adjust the arrangement of the container storage space of the roadway to be subjected to storage space adjustment.

In the embodiment, the position of the container resource pool to be analyzed is matched according to the container storage information, and a matching result is obtained once matching; the container storage information represents storage space arrangement of storage racks corresponding to all roadways in the warehouse. Determining the initial type of the containers to be processed according to the proportion value of the initial type of each container during each matching; and if the container storage information is determined to have continuous free positions with the length being more than or equal to the length of the current initial type of the container to be processed, allocating a free position space for the container under the initial type of the container to be processed. Furthermore, multiple matching results are obtained, and when one matching result represents that a container still has a container which is not matched with the free position space in the container resource pool to be analyzed (that is, a container still exists and cannot be matched into the warehouse), it is determined that the storage space in the warehouse is unreasonable, and the layout of each container in the warehouse can cause that the container in the container resource pool to be analyzed cannot be put into the warehouse. Therefore, the position space adjustment of the roadway is determined; therefore, whether the adjustment of the position space of the roadway is carried out or not is accurately determined. And then, determining a tunnel which is adjusted preferentially (determining a shelf which is adjusted preferentially) according to the container resource information to be stored which is obtained according to the multiple matching results. After the adjusting of the storage space of the roadway to be subjected to storage space adjustment, more storage spaces of the roadway and the warehouse can be released, the position space on the goods shelf corresponding to the roadway is prevented from being left unused, and the utilization rate of the goods shelf and the warehouse is improved.

EXAMPLE five

Fig. 11 is a flowchart of a cargo storage space adjustment method according to a fifth embodiment of the present invention. As shown in fig. 11, the method comprises the following specific steps:

s501, repeatedly executing the following steps S502-S509 until no container which is not matched with the free position space exists in the container resource pool to be analyzed.

And analyzing the container resource pool to be analyzed, and repeatedly executing the steps S502-S509 once to obtain a roadway to be subjected to storage space adjustment. Steps S502-S509 are repeatedly performed until it is determined that there are no containers in the container resource pool to be analyzed that have an unmatched free slot space, i.e., until containers in the container resource pool to be analyzed can all be assigned a matched free slot space.

S502, acquiring a container resource pool to be analyzed and container storage information, wherein containers in the container resource pool to be analyzed comprise a plurality of containers, the container resource pool to be analyzed comprises the number of containers under each container initial type, and the container storage information represents storage space arrangement of shelves corresponding to each roadway.

Illustratively, a container resource pool to be analyzed is obtained, the container resource pool to be analyzed includes a plurality of container types (the container types in the container resource pool to be analyzed are referred to as container initial types), each container initial type includes the number of containers under the container initial type, and the container sizes of different container initial types are different. Each container in the container resource pool to be analyzed needs to be put into a warehouse, namely, each container in the container resource pool to be analyzed is a container to be put into the warehouse; or each container in the container resource pool to be analyzed is a container expected to be put in storage.

And, every time steps S502-S509 are repeatedly executed, the adopted "container resource pool to be analyzed" is the same, i.e., the "container resource pool to be analyzed" is not updated.

And when the step S502 is executed for the first time, the acquired container storage information is the storage space arrangement condition of the shelves corresponding to each lane in the warehouse, and when the step S502 is executed for the first time, each lane in the warehouse is in a real state.

S503, according to the container storage information, carrying out position matching on containers in the initial types of the containers in the container resource pool to be analyzed to obtain multiple matching results.

For example, this step may refer to step S402 of the above embodiment, and is not described again.

S504, if at least one matching result in the multiple matching results represents that a container which is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained, determining that the storage space of the container needs to be adjusted according to the goods shelf corresponding to the roadway.

For example, this step may refer to step S403 in the above embodiment, and is not described again.

And S505, if the container storage space needs to be adjusted according to the goods shelf corresponding to the roadway, acquiring the container resource information to be stored. The container resource information includes the number of containers in each container type.

For example, this step may refer to step S404 in the above embodiment, and is not described again.

S506, container arrangement information of each roadway is obtained, wherein dynamic storage space is formed in the goods shelf corresponding to each roadway, container arrangement information represents that the roadway is respectively arranged in the container storage space in the real state and in the container storage space in the assumed state, and containers on the goods shelf corresponding to the assumed state representation roadway are continuously arranged.

For example, this step may refer to step S405 in the above embodiment, and is not described again.

S507, determining a distribution difference value of each roadway according to the container resource information and the container arrangement information of each roadway, wherein the distribution difference value represents a difference value between the first distribution quantity and the second distribution quantity; the first distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the real state, the second distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

For example, this step may refer to step S406 in the above embodiment, and is not described again.

And S508, determining the roadway with the maximum distribution difference value as the roadway to be subjected to storage space adjustment.

For example, this step may refer to step S407 of the above embodiment, and is not described again.

S509, generating adjustment information of the roadway to be subjected to storage space adjustment according to the roadway to be subjected to storage space adjustment, wherein the adjustment information represents that containers on the goods shelves corresponding to the adjusted roadway to be subjected to storage space adjustment are all continuously arranged; and generating new container storage information according to the adjustment information of the roadway to be subjected to storage space adjustment and the arrangement of container storage spaces of other roadways.

For example, after a roadway to be subjected to storage space adjustment is obtained, the storage space of the roadway to be subjected to storage space adjustment can be directly adjusted, that is, an adjustment instruction is sent to the warehousing robot to adjust the storage space of the roadway to be subjected to storage space adjustment. Further, the containers on the racks corresponding to the lanes to be subjected to the storage space adjustment are all arranged continuously as shown in fig. 7, thereby finishing the arrangement of the storage space of one lane. At the moment, obtaining an adjustment information which represents that the containers on the goods shelf corresponding to the adjusted roadway to be subjected to storage space adjustment are all continuously arranged.

Or after a roadway to be subjected to storage space adjustment is obtained, assuming that the storage space of the roadway to be subjected to storage space adjustment is adjusted, assuming that containers on the goods shelf corresponding to the roadway to be subjected to storage space adjustment are all continuously arranged, and thus, assuming that the storage space of the roadway is arranged. At this time, adjustment information can be obtained, and the containers on the goods shelves corresponding to the laneway to be subjected to storage space adjustment after the adjustment of the representation of the adjustment information are all continuously arranged.

Then, the storage space is not arranged except for the other roadways except the 'roadway to be subjected to storage space adjustment', and the other roadways are still the arrangement condition of the storage space of the container in the real state. Generating new container storage information according to the adjustment information of the roadway with the storage space to be adjusted and the arrangement of container storage spaces of other roadways; therefore, after the storage space of the roadway to be subjected to storage space adjustment is adjusted, the arrangement condition of the storage spaces of the containers of all the roadways is obtained; namely, the new container storage information represents the arrangement condition of the container storage spaces of all the roadways after the storage space of the roadway to be subjected to storage space adjustment is adjusted.

Then, based on the new container storage information, the steps S502 to S509 are executed again; it should be noted that the "container resource pool to be analyzed" is not changed; and then, obtaining a tunnel to be subjected to storage space adjustment. Further, the storage space of the tunnel to be subjected to the storage space adjustment obtained again may be directly adjusted, or it is assumed that the storage space of the tunnel to be subjected to the storage space adjustment obtained again is adjusted; generating new container storage information according to the obtained adjustment information of the roadway to be subjected to storage space adjustment and the arrangement of container storage spaces of other roadways; at this time, one lane of the other lanes has the storage space adjusted, and the rest lanes have no storage space adjusted.

Then, based on the container storage information updated again, the steps S502 to S509 are executed again; it should be noted that the "container resource pool to be analyzed" is constant; and then, obtaining a tunnel to be subjected to storage space adjustment. Further, the storage space of the tunnel to be subjected to the storage space adjustment obtained again may be directly adjusted, or it is assumed that the storage space of the tunnel to be subjected to the storage space adjustment obtained again is adjusted; generating new container storage information according to the obtained adjustment information of the roadway to be subjected to storage space adjustment and the arrangement of container storage spaces of other roadways; at this time, two lanes in the other lanes have the storage space adjusted, and the rest lanes have no storage space adjusted.

And in the same way, based on the container storage information updated last time, the steps S502 to S509 are executed again until it is determined that no container in the container resource pool to be analyzed has an unmatched free position space, that is, until all containers in the container resource pool to be analyzed can be allocated with a matched free position space.

For example, initial container storage information is obtained, and the initial container storage information represents storage space arrangement conditions of shelves corresponding to each roadway in a warehouse; executing steps S502-S509 according to the initial container storage information and the container resource pool to be analyzed, determining that the roadway Ha is a roadway to be subjected to storage space adjustment, and further directly adjusting the storage space of the roadway Ha, or supposing that the storage space of the roadway Ha is adjusted; according to adjustment information of the laneway Ha and arrangement of container storage spaces of other laneways, new container storage information is generated.

Then, according to the updated container storage information and a container resource pool to be analyzed (the container resource pool to be analyzed is not changed), executing steps S502-S509, determining that the lane Hb is a lane to be subjected to storage space adjustment, and further directly adjusting the storage space of the lane Hb, or assuming that the storage space of the lane Hb is adjusted; and generating new container storage information according to the adjustment information of the lane Hb and the arrangement of the container storage spaces of other lanes (at this time, the adjustment information of the lane Ha and the arrangement of the container storage spaces of the lanes with other spaces not adjusted).

Then, according to the updated container storage information and the container resource pool to be analyzed (the container resource pool to be analyzed is not changed), executing the steps S502 to S509, determining that the roadway Hc is a roadway to be subjected to storage space adjustment, and further directly adjusting the storage space of the roadway Hc, or assuming that the storage space of the roadway Hc is adjusted; and according to the adjustment information of the lane Hc and the arrangement of the container storage spaces of other lanes (at this time, the adjustment information of the lane Ha, the adjustment information of the lane Hb and the arrangement of the container storage spaces of other lanes with non-adjusted spaces are included), new container storage information is regenerated.

And the like until the container to be analyzed does not have the container which is not matched with the free position space in the container resource pool is determined.

The steps may also be performed: and sending an adjusting instruction to the warehousing robot, wherein the adjusting instruction is used for indicating the warehousing robot to adjust the arrangement of the container storage space of the roadway to be subjected to storage space adjustment.

For example, after each step S502-S509 is executed to obtain a roadway to be subjected to storage space adjustment, an adjustment instruction may be sent to the warehousing robot; and then, controlling the storage robot to adjust the arrangement of the container storage space of the roadway to be subjected to storage space adjustment. For example, the containers of each shelf on the shelf corresponding to the lane are pushed to one side (e.g., left side of shelf or right side of shelf) in succession. For another example, containers on the racks corresponding to the lanes are collectively and continuously arranged on a plurality of racks of the racks.

Or, after the steps S502 to S509 are executed for a plurality of times, obtaining each roadway to be subjected to storage space adjustment; then, sending an adjusting instruction to the warehousing robot; and then, controlling the storage robot to adjust the storage space arrangement of the containers of all the roadways to be subjected to storage space adjustment.

In this embodiment, all the tunnels to be subjected to the storage space adjustment are obtained by repeatedly executing steps S502 to S509. After a roadway to be subjected to storage space adjustment is obtained, an adjustment instruction can be sent to the warehousing robot every time steps S502-S509 are executed; and then, controlling the storage robot to adjust the arrangement of the container storage space of the roadway to be subjected to storage space adjustment. Or, after the steps S502 to S509 are executed for a plurality of times, obtaining each roadway to be subjected to storage space adjustment; then, sending an adjusting instruction to the warehousing robot; and then, controlling the storage robot, and adjusting the storage space arrangement of all the containers of the roadway to be subjected to storage space adjustment. According to the embodiment, all the roadways to be subjected to storage space adjustment can be obtained, so that the warehouse releases the maximum storage space; prevent that the position space on the goods shelves that the tunnel corresponds from being idle, promote the utilization ratio of goods shelves and warehouse.

Example six

Fig. 12 is a flowchart of a cargo storage space adjustment method according to a sixth embodiment of the present invention. As shown in fig. 12, the method comprises the following specific steps:

s601, obtaining container storage information of a container resource pool to be analyzed and a warehouse, wherein containers in the container resource pool to be analyzed comprise a plurality of containers, the container resource pool to be analyzed comprises the number of containers under the initial type of each container, and the container storage information represents storage space arrangement of shelves corresponding to each roadway in the warehouse.

The method comprises the steps of obtaining a container resource pool to be analyzed, wherein the container resource pool to be analyzed comprises a plurality of container types (the container types in the container resource pool to be analyzed are called as container initial types), each container initial type comprises the number of containers under the container initial types, and the container sizes of different container initial types are different. Each container in the container resource pool to be analyzed needs to be put into a warehouse, namely, each container in the container resource pool to be analyzed is a container to be put into the warehouse; or, each container in the container resource pool to be analyzed is a container expected to be put in storage.

Analyzing all the lanes in the warehouse to determine whether the space of the lanes in the warehouse needs to be adjusted or not, and further acquiring the storage space arrangement of the shelves corresponding to each lane in the warehouse; the storage space arrangement of the shelves corresponding to each lane refers to the number of containers already placed on the shelves corresponding to the lane, the positions of the containers already placed, and the occupied position space of the containers already placed. The storage spaces of the goods shelves corresponding to the roadways are arranged to form storage information of the container; the container storage information is the storage space arrangement condition of each roadway in a real state.

S602, according to the container storage information, carrying out position matching on containers under the initial types of the containers in the container resource pool to be analyzed to obtain multiple matching results.

Illustratively, containers in the container resource pool to be analyzed are matched with the free position space according to the storage space arrangement condition of each roadway in the container storage information, and then the result is matched at one time. And the storage space arrangement condition of each roadway in the container storage information matches the container in the container resource pool to be analyzed with the free position space again, and then a matching result is obtained again. By analogy, obtaining multiple matching results; and in each matching, the storage information of the containers is the same, and the resource pools of the containers to be analyzed are the same.

After each matching, the obtained matching result comprises a first number of each container initial type, a second number of each container initial type and type information. The first number of the initial types of each container refers to the number of containers matched with the free position space under each initial type of the container; for example, when Box1 containers under the initial kind of container Box1 are matched with the free position space, the first number of the initial kind of container Box1 is Box1. The second number of the initial types of each container refers to the number of containers which are not matched with the free position space under the initial types of each container; for example, boxn1 containers under the initial category Box1 of containers are not matched with the free position space, and the second number of the initial category Box1 of containers is boxn1. The type information refers to the initial type of the container corresponding to the container which is not matched with the free position space; that is, if there is a container that is not matched with the empty position space, the initial type of the container corresponding to the container is put in the type information.

S603, if at least one matching result in the multiple matching results represents that a container which is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained, determining that the storage space of the container needs to be adjusted according to the goods shelf corresponding to the roadway.

Illustratively, based on multiple matching results, when one matching result represents that a container still has a container that is not matched with the free position space in the container resource pool to be analyzed (i.e., a container still cannot be matched into the warehouse), it is determined that the storage space in the warehouse is unreasonable, and the layout of each container in the warehouse may cause that the containers in the container resource pool to be analyzed cannot be put into the warehouse. Thus, it is determined that position space adjustment of the roadway is required.

In this embodiment, the containers in the initial types of the containers in the container resource pool to be analyzed are subjected to position matching according to the storage space arrangement of the shelves corresponding to all the lanes in the warehouse, so that multiple matching results are obtained. And then according to the multiple matching results, determining that a container which cannot be matched with the free position space exists in the container resource pool to be analyzed, and determining that the storage space in the warehouse is unreasonable and the position space of the roadway needs to be adjusted. And then accurately determining whether the position space adjustment of the roadway is needed.

EXAMPLE seven

Fig. 13 is a flowchart of a cargo storage space adjustment method according to a seventh embodiment of the present invention. As shown in fig. 13, the method comprises the following specific steps:

s701, obtaining container storage information of a container resource pool to be analyzed and a warehouse, wherein the container resource pool to be analyzed comprises a plurality of containers, the container resource pool to be analyzed comprises the number of containers under the initial type of each container, and the container storage information represents storage space arrangement of shelves corresponding to each roadway in the warehouse.

The method comprises the steps of obtaining a container resource pool to be analyzed, wherein the container resource pool to be analyzed comprises a plurality of container types (the container types in the container resource pool to be analyzed are called as container initial types), each container initial type comprises the number of containers under the container initial types, and the container sizes of different container initial types are different. Each container in the container resource pool to be analyzed needs to be put into a warehouse, namely, each container in the container resource pool to be analyzed is a container to be put into the warehouse; or each container in the container resource pool to be analyzed is a container expected to be put in storage.

S702, repeating the following processes to obtain a plurality of matching results: and according to the container storage information, carrying out position matching on containers of the initial types of the containers in the container resource pool to be analyzed to obtain a matching result.

In one example, each time "position matching is performed on containers under the initial types of the containers in the container resource pool to be analyzed according to the container storage information to obtain a matching result", the method includes the following steps:

and S7021, repeating the following steps until a fourth preset condition is reached, wherein the initial fourth container information is a container resource pool to be analyzed. The fourth preset condition includes any one of: each container in the container resource pool to be analyzed is allocated with a free position space, containers in at least one container initial type cannot be matched with the free position space, and no free position space exists in container storage information.

S7022, determining fourth proportion information according to the fourth container information, where the fourth proportion information includes a proportion value of each initial type of container in the fourth container information, and the proportion value of each initial type of container represents a ratio between the number of containers of each initial type of container and the total number of containers of all the initial types of containers.

S7023, determining the initial type of the container to be processed of the fourth container information according to the randomly generated random number and the fourth proportion information.

S7024, if the container storage information is determined to have continuous free positions with the length being more than or equal to the length of the current initial type of the container to be processed, determining that the container under the current initial type of the container to be processed is allocated with a free position space, wherein the length of the free position space is the minimum length of the continuous free positions with the length being more than or equal to the length of the current initial type of the container to be processed; and removing the free position space from the container storage information, and updating the fourth container information by subtracting one from the number of containers corresponding to the current type of the container to be processed in the fourth container information.

Illustratively, the containers in the container resource pool to be analyzed are matched with the free position space according to the storage space arrangement condition of each roadway in the container storage information, and a primary matching result is obtained. For each matching, the process of steps S7021-S7024 can be adopted.

The specific procedure of step S7021. Taking the container resource pool to be analyzed as initial fourth container information; and repeatedly executing the steps S7021-S7024 until a fourth preset condition is reached. Wherein, the fourth container information and the container storage information are updated each time the steps S7021 to S7024 are performed once. The fourth container information includes at least one type of container, each type of container has the number of containers, and the sizes of the different types of containers are different.

The specific procedure of step S7022. The fourth container information includes at least one type of container, each type of container has the number of containers, and the sizes of the different types of containers are different. The container type in the fourth container information is Q, and is a positive integer greater than or equal to 1; that is, the third container information includes Q container initial categories.

In step S7022, first, the number of containers in the initial category of each container in the fourth container information is calculated according to the fourth container information; and summing the number of containers under the initial types of the containers to obtain the total number of the containers of all the initial types of the containers. And dividing the number of the containers of each initial type of the containers by the total number of the containers of all the types of the containers to obtain a proportional value of each initial type of the containers. The scale value of the initial type of each container constitutes fourth scale information.

The fourth container information comprises Q container initial types; for the 1 st container initial type a in the fourth container information, the number L (1) of containers of the container initial type a can be obtained; for the 2 nd container initial type b in the fourth container information, the number L (2) of containers of the container initial type b can be obtained; for the 3 rd container initial type c in the fourth container information, the container number L (3) of the container initial type c can be obtained; the number L (k) of containers of the initial type u of containers can be obtained for the initial type u of the u-th container in the fourth container information, and so on, the number L (Q) of containers of the initial type of the Q-th container in the fourth container information can be obtained, and further, the number of containers of each initial type of containers in the fourth container information can be obtained. And adding the number of containers of each initial container type in the fourth container information to obtain the total number W of containers of all the initial container types in the fourth container information. For the 1 st container initial type a in the fourth container information, the ratio value s1= (L (1)/W) × 100% of the 1 st container initial type a can be obtained; for the 2 nd container initial type b in the fourth container information, the ratio value S2= (L (2)/W) × 100% of the container initial type b can be obtained; for the 3 rd container initial type c in the fourth container information, a ratio value S3= (L (3)/W) × 100% of the container initial type c can be obtained; for the u-th container initial type u in the fourth container information, a ratio value Su = (L (u)/W) × 100% of the container initial type u can be obtained; by analogy, the proportional value SQ = (L (Q)/W) × 100% of the W-th container initial type in the fourth container information is obtained, and the proportional value of each container initial type in the fourth container information is obtained. Wherein u is a positive integer of not less than 1 and not more than Q.

When the step S7022 is executed for the first time, the initial fourth container information is a container resource pool to be analyzed.

The specific procedure of step S7023. Randomly generating a random number, for example, generating a uniformly distributed random number (which may also be referred to as a uniformly distributed random number) in the range of [0,1 ]; the fourth scale information includes a scale value of each container initial category in the fourth container information. According to the random number and the fourth proportion information, an initial type of a container to be processed (the initial type of the container to be processed is the type of the container in the fourth container information) is determined first, so as to determine whether a free position space can be allocated to the container under the initial type of the container to be processed.

In one example, step S7023 includes the following process: the container type in the fourth container information is Q, and Q is a positive integer greater than or equal to 1; repeating the following steps until the initial type of the container to be processed is obtained, wherein the initial value of the fourth preset value is a random number generated randomly: subtracting the proportional value of the kth container initial type in the fourth container information from the fourth preset value to obtain a calculation difference value of the kth container initial type; wherein u is a positive integer greater than or equal to 1 and less than or equal to Q; if the calculation difference value of the u-th container initial type meets the preset requirement, determining that the u-th container initial type is the container initial type to be processed of the fourth container information; and if the calculation difference value of the u-th container initial type does not meet the preset requirement, determining the difference value between the fourth set value and the proportional value of the u-th container initial type, and accumulating u by 1 to obtain the updated fourth preset value.

For example, in determining the initial type of container to be processed, the following procedure may be employed.

The fourth container information includes Q container initial types, each container initial type has the number of containers, and the containers of different container initial types have different sizes. The proportional value of the initial category of each container in the fourth container information has been obtained using step S7022.

And taking the randomly generated random number T as an initial value of a fourth preset value, and executing the following process until the initial type of the container to be processed is obtained. Subtracting the proportional value S1 of the 1 st container initial type in the fourth container information from the fourth preset value T to obtain a calculation difference value T-S1 of the 1 st container initial type; if the calculation difference value T-S1 of the 1 st container initial type meets the preset requirement, determining that the 1 st container initial type is the container initial type to be processed, for example, if the T-S1 is less than or equal to a preset threshold (a preset threshold, for example, is 0), determining that the 1 st container initial type is the container initial type to be processed; if the calculated difference T-S1 of the initial category of the 1 st container does not satisfy the preset requirement, the difference T-S1 between the fourth preset value T and the proportional value S1 of the initial category of the 1 st container is used as the updated fourth preset value, for example, if T-S1 is greater than a preset threshold (e.g., a preset threshold is 0), the difference T-S1 between the fourth preset value T and the proportional value S1 of the initial category of the 1 st container is used as the updated fourth preset value. Then, subtracting the proportional value S2 of the 2 nd container initial type in the fourth container information from the updated fourth preset value T-S1 to obtain a calculation difference value T-S1-S2 of the 2 nd container initial type; if the calculation difference T-S1-S2 of the 2 nd container initial type meets the preset requirement, determining the 2 nd container initial type as the container initial type to be processed; and if the calculated difference T-S1-S2 of the 2 nd container initial type does not meet the preset requirement, taking the difference T-S1-S2 of the updated fourth preset value T-S1 and the proportional value S2 of the 2 nd container initial type as the updated fourth preset value. Then, subtracting the proportion value S3 of the 3 rd container initial type in the fourth container information from the updated fourth preset value T-S1-S2 to obtain a calculation difference value T-S1-S2-S3 of the 3 rd container initial type; if the calculation difference T-S1-S2-S3 of the 3 rd initial container type meets the preset requirement, determining the 3 rd initial container type as the initial container type to be processed; and if the calculated difference T-S1-S2-S3 of the initial category of the 3 rd container does not meet the preset requirement, taking the difference T-S1-S2-S3 of the updated fourth preset value T-S1-S2 and the proportion value S3 of the initial category of the 3 rd container as the updated fourth preset value. By analogy, subtracting the ratio Su of the u th container initial type in the fourth container information from the updated fourth preset value to obtain a calculation difference value of the u th container initial type; if the calculation difference value of the u-th container initial type meets the preset requirement, determining that the u-th container initial type is the container initial type to be processed of the fourth container information; and if the calculated difference value of the initial category of the u-th container does not meet the preset requirement, determining the difference value between the updated fourth preset value and the proportional value of the initial category of the u-th container, and taking the difference value as the updated fourth preset value. And analogizing until the initial type of the container to be processed of the fourth container information is determined, so that the initial type of the container to be processed of the fourth container information in the current execution process is obtained each time the steps S7022-S7024 are executed.

The specific procedure of step S7024. The arrangement condition of the container storage space of each roadway in the real state forms container storage information. In this case, each lane is in a true state, each lane has discrete other containers on its corresponding pallet, and each lane has at least one continuous free position on its corresponding pallet. Note that the container storage information includes arrangement of container storage spaces of all the lanes in the warehouse in a real state.

It is determined whether there are consecutive free positions in the container storage information having a length equal to or greater than the length of the initial category of containers to be processed determined in step S7023, that is, whether there are consecutive free positions meeting the length requirement (the length requirement is that the length of the consecutive free positions is equal to or greater than the length of the initial category of containers to be processed determined in step S7023).

If a plurality of continuous free positions meeting the length requirement exist, taking the continuous free position with the minimum length as a free position space matched with the initial type of the container to be processed determined in the step S7023, and allocating a container under the initial type of the container to be processed determined in the step S7023 to the free position space, wherein at this time, a container under the initial type of the container to be processed determined in the step S7023 occupies a free position space; the free position space is removed from the container storage information, so that the container storage information is updated; meanwhile, the number of containers corresponding to the initial type of the container to be processed determined in the step S7023 in the fourth container information is subtracted by one, so that the fourth container information is updated, and the steps S7022 to S7024 are executed again.

If there are no consecutive free positions meeting the length requirement, the container storage information and the fourth container information do not need to be updated, and the steps S7022 to S7024 are executed again.

When the steps S7022 to S7024 are repeatedly performed, if it is determined that the fourth preset condition is reached, the repeated execution of the steps S7022 to S7024 is stopped. A matching result of a matching process can be obtained, and the matching result includes a first number of the initial types of each container, a second number of the initial types of each container, and type information.

The fourth preset condition may be that each container in the container resource pool to be analyzed is allocated with a free position space. That is, when it is determined that each container in the container resource pool to be analyzed is assigned a free space, the repeated execution of steps S7022 to S7024 is stopped.

Or, the fourth preset condition may be that the container in the initial category of the at least one container cannot be matched with the empty space. That is, when it is determined that none of the container types in the container resource pool to be analyzed can be allocated to a suitable free space, the repeated execution of steps S7022 to S7024 is stopped. Alternatively, when it is determined that none of the one or more initial categories of containers in the container resource pool to be analyzed can be allocated to the appropriate free space, the repeated execution of steps S7022-S7024 is stopped.

Or, the fourth preset condition may be that no free space exists in the container storage information. That is, in the process of repeatedly executing steps S7022 to S7024, an appropriate free position space is allocated to each container type in the container resource pool to be analyzed, and other containers are already placed in the racks corresponding to the respective lanes in a dispersed manner, and as steps S7022 to S7024 are repeatedly executed, if there is no free position in the lane, or if there is no appropriate free position space in the lane, the repeated execution of steps S7022 to S7024 is stopped.

S703, if at least one matching result in the multiple matching results represents that a container which is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained, determining that the container storage space needs to be adjusted according to the goods shelf corresponding to the roadway.

In the embodiment, on the basis of the sixth embodiment, position matching is performed on containers of the initial types of the containers in the container resource pool to be analyzed according to the container storage information, so that a matching result is obtained; repeating for multiple times to obtain multiple matching results. In the process of obtaining each matching result: determining the initial type of the container to be processed based on the proportional value of the initial type of each container; allocating a free position space for one container under the initial type of the container to be processed, executing the steps S7021-S7024 once to obtain a container matched with the free position space, and executing the steps S7021-S7024 for multiple times to obtain a plurality of containers matched with the free position space; furthermore, each matching result comprises a plurality of containers matched with the free position space. Based on multiple matching results, when one matching result represents that a container which is not matched with the free position space still exists in the container resource pool to be analyzed (namely, the container still exists and cannot be matched into the warehouse), the storage space in the warehouse is determined to be unreasonable, and then the position space of the roadway needs to be adjusted accurately, so that whether the storage space of the warehouse exists or not is determined.

Example eight

Fig. 14 is a schematic structural diagram of a cargo storage space adjustment device according to an eighth embodiment of the present invention. The cargo storage space adjusting device provided by the embodiment of the invention can execute the processing flow provided by the above embodiment. As shown in fig. 14, the cargo storage space adjusting apparatus 130 includes:

the first obtaining unit 131 is configured to obtain container resource information to be stored, where the container resource information includes the number of containers for each container type.

The second obtaining unit 132 is configured to obtain container arrangement information of each lane, where a shelf corresponding to each lane is a dynamic storage space, the container arrangement information indicates that the lanes are respectively configured in the container storage space in the real state and in the container storage space in the assumed state, and containers on the shelves corresponding to the assumed state indication lanes are continuously configured.

A first determining unit 133, configured to determine, according to the container resource information and the container arrangement information of each lane, an allocation difference value of each lane, where the allocation difference value represents a difference value between the first allocation quantity and the second allocation quantity; the first distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the real state, the second distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

The second determining unit 134 is configured to determine the lane with the largest allocation difference, which is the lane to be adjusted in the storage space.

And a sending unit 135, configured to send an adjustment instruction to the warehousing robot, where the adjustment instruction is used to instruct the warehousing robot to adjust the arrangement of the container storage spaces of the roadway to be subjected to storage space adjustment.

The apparatus provided in the embodiment of the present invention may be specifically configured to execute the method flow of any one of the above method embodiments, and specific functions are not described herein again.

Example nine

Fig. 15 is a schematic structural view of a cargo storage space adjustment device according to a ninth embodiment of the present invention. The cargo storage space adjusting device provided by the embodiment of the invention can execute the processing flow provided by the above embodiment. As shown in fig. 15, the cargo storage space adjusting apparatus 140 includes:

the first obtaining unit 141 is configured to obtain container resource information to be stored, where the container resource information includes the number of containers for each container type.

The second obtaining unit 142 is configured to obtain container arrangement information of each lane, where a shelf corresponding to each lane is a dynamic storage space, the container arrangement information indicates that the lanes are respectively configured in the container storage space in the real state and in the container storage space in the assumed state, and containers on the shelves corresponding to the assumed state indication lanes are continuously configured.

A first determining unit 143, configured to determine a distribution difference value of each lane according to the container resource information and the container arrangement information of each lane, where the distribution difference value represents a difference value between the first distribution amount and the second distribution amount; the first distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the real state, the second distribution quantity represents the quantity of containers which can be stored in the roadway in the container resource information in the assumed state, and the storage space of each container is determined according to the size information of the container and the dynamic storage space corresponding to the roadway.

The second determining unit 144 is configured to determine the lane with the largest allocation difference, which is the lane to be adjusted in the storage space.

And the sending unit 145 is configured to send an adjustment instruction to the warehousing robot, where the adjustment instruction is used to instruct the warehousing robot to adjust the arrangement of the container storage spaces of the roadway to be subjected to storage space adjustment.

In one example, the first determining unit 143 includes:

the first determining module 1431 is configured to determine the first allocation amount of each lane according to the container resource information and the first storage space information of each lane.

A second determining module 1432, configured to determine the second allocated amount for each lane according to the container resource information and the second storage space information of each lane.

A third determining module 1433 is configured to determine an allocation difference value of each lane according to a difference value between the first allocation number and the second allocation number of each lane.

In one example, the first determining module 1431 includes:

the first execution sub-module 14311 is configured to repeat the following sub-modules for each lane until a first preset condition is reached, where the initial first container information is container resource information.

The first determining sub-module 14312 is configured to determine first proportion information according to the first container information, where the first proportion information includes a proportion value of each container type, and the proportion value of each container type represents a ratio between the number of containers of each container type and the total number of containers of all container types.

The second determining submodule 14313 is used for determining the type of the container to be analyzed of the first container information according to the random number generated at random and the first proportion information.

A third determining sub-module 14314, configured to determine that a container in the current container type to be analyzed is allocated with a free position space if it is determined that the first storage space information has consecutive free positions with a length greater than or equal to the length of the current container type to be analyzed, where the length of the free position space is the minimum length among the consecutive free positions with a length greater than or equal to the length of the current container type to be analyzed; and removing the free position space from the first storage space information, and updating the first container information by subtracting one from the number of containers corresponding to the type of the container to be analyzed in the first container information.

When a first preset condition is reached, the first distribution quantity comprises the quantity of containers with free position spaces distributed to each container type in the container resource information.

In one example, the container type in the first container information is N, where N is a positive integer greater than or equal to 1; a second determination submodule 14313, configured to:

repeating the following steps until the type of the container to be analyzed is obtained, wherein the initial value of the first preset value is a random number generated randomly: subtracting the proportional value of the ith container type in the first container information from the first preset value to obtain a calculation difference value of the ith container type; wherein i is a positive integer greater than or equal to 1 and less than or equal to N; if the calculation difference value of the ith container type meets the preset requirement, determining the ith container type as the container type to be analyzed of the first container information; and if the calculated difference value of the ith container type does not meet the preset requirement, determining the difference value between the first preset value and the proportional value of the ith container type, taking the difference value as the updated first preset value, and accumulating the value i by 1.

In one example, the first preset condition is any one of the following: each container in the container resource information is allocated with a free position space, containers in at least one container type cannot be matched with the free position space, and no free position space exists in the first storage space information.

In one example, the second determining module 1432 includes:

a second execution sub-module 14321, configured to repeat the following sub-modules for each lane until a second preset condition is reached, where the initial second container information is container resource information.

The fourth determining submodule 14322 is configured to determine second proportion information according to the second container information, where the second proportion information includes a proportion value of each container type, and the proportion value of each container type represents a ratio between the number of containers of each container type and the total number of containers of all container types.

The fifth determining sub-module 14323 is configured to determine the container type to be analyzed of the second container information according to the randomly generated random number and the second proportion information.

A sixth determining submodule 14324, configured to determine that a container under the current container type to be analyzed is allocated with a free position space if it is determined that the second storage space information has consecutive free positions with lengths greater than or equal to the length of the current container type to be analyzed, where the length of the free position space is the minimum length among the consecutive free positions with lengths greater than or equal to the length of the current container type to be analyzed; and removing the free position space from the second storage space information, and updating the second container information by subtracting one from the number of containers corresponding to the type of the container to be analyzed in the second container information.

When a second preset condition is reached, the second distribution quantity comprises the quantity of containers with free position space distributed to each container type in the container resource information.

In one example, the container type in the second container information is N, where N is a positive integer greater than or equal to 1; the fifth determination sub-module 14323 is specifically configured to: repeating the following steps until the type of the container to be analyzed is obtained, wherein the initial value of the second preset value is a random number generated randomly: determining a second preset value to subtract a proportional value of the jth container type in the second container information to obtain a calculation difference value of the jth container type; wherein j is a positive integer greater than or equal to 1 and less than or equal to N; if the calculation difference value of the jth container type meets the preset requirement, determining the jth container type as the container type to be analyzed of the second container information; and if the calculated difference value of the jth container type does not meet the preset requirement, determining the difference value between the second preset value and the proportional value of the jth container type, taking the difference value as the updated second preset value, and accumulating j by 1.

In an example, the first obtaining unit 131 is specifically configured to: and if the situation that the storage space of the container needs to be adjusted according to the goods shelf corresponding to the roadway is determined, acquiring the resource information of the container to be stored.

In an example, the apparatus provided in this embodiment further includes:

a third obtaining unit 146, configured to obtain a container resource pool to be analyzed, where the container resource pool to be analyzed includes a plurality of containers, and the container resource pool to be analyzed includes the number of containers in each container initial type.

And the fourth obtaining unit 147 is configured to obtain storage information of the containers in the warehouse, where the storage information of the containers represents storage space arrangement of the shelves corresponding to each lane in the warehouse.

And the matching unit 148 is used for performing position matching on containers of the initial types of the containers in the container resource pool to be analyzed according to the container storage information to obtain multiple matching results.

The third determining unit 149 is configured to determine that the container storage space needs to be adjusted for the rack corresponding to the lane if at least one of the matching results represents that a container that is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained.

In one example, each matching result includes a first number of each container initial category, a second number of each container initial category, and category information; the type information is the initial type of containers corresponding to containers which are not matched with the free position space, the first quantity of the initial types of each container is the quantity of the containers which are matched with the free position space under the initial type of each container, and the second quantity of the initial types of each container is the quantity of the containers which are not matched with the free position space under the initial type of each container.

In an example, the first obtaining unit 141 is specifically configured to: if the goods shelf corresponding to the roadway needs to be adjusted in the storage space of the goods shelf, determining the initial kinds of the goods shelves of the kind information in the multiple matching results, and determining the kinds of the goods shelves in the resource information of the goods shelves to be stored; and determining the average value of the second number of the initial types of each container in the multiple matching results, wherein the average value is the number of containers under each container type in the container resource information to be stored.

In an example, the apparatus provided in this embodiment further includes:

and the third execution unit is used for repeatedly executing the following steps until no container which is not matched with the free position space exists in the container resource pool to be analyzed before the sending unit sends the adjusting instruction to the warehousing robot.

The updating unit is used for generating adjustment information of the roadway to be subjected to storage space adjustment according to the roadway to be subjected to storage space adjustment, wherein the adjustment information represents that containers on the goods shelf corresponding to the adjusted roadway to be subjected to storage space adjustment are all continuously arranged; generating new container storage information according to the adjustment information of the roadway to be subjected to storage space adjustment and the arrangement of container storage spaces of other roadways; and the third acquisition unit 146 is executed again.

In one example, the matching unit 148 is specifically configured to, when performing position matching on containers in the initial category of each container in the container resource pool to be analyzed according to the container storage information to obtain each matching result:

repeating the following steps until a third preset condition is reached, wherein the initial third container information is a container resource pool to be analyzed: determining third proportion information according to the third container information, wherein the third proportion information comprises a proportion value of each initial container type in the third container information, and the proportion value of each initial container type represents a ratio of the number of containers of each initial container type to the total number of containers of all initial container types; determining the initial type of the container to be processed of the third container information according to the random number generated randomly and the third proportion information; if the container storage information is determined to have continuous free positions with the length being more than or equal to the length of the current initial type of the container to be processed, determining that the container under the current initial type of the container to be processed is allocated with a free position space, wherein the length of the free position space is the minimum length of the continuous free positions with the length being more than or equal to the length of the current initial type of the container to be processed; and removing the free position space from the container storage information, and updating the third container information by subtracting one from the number of containers corresponding to the current type of containers to be processed in the third container information.

In one example, the initial category of the container in the third container information is M, where M is a positive integer greater than or equal to 1; according to the randomly generated random number and the third ratio information, when determining the initial category of the container to be processed of the third container information, the matching unit 148 is specifically configured to: repeating the following steps until the initial type of the container to be processed is obtained, wherein the initial value of the third preset value is a random number generated randomly: subtracting the proportional value of the kth container initial type in the third container information from the third preset value to obtain a calculation difference value of the kth container initial type; wherein k is a positive integer greater than or equal to 1 and less than or equal to M; if the calculation difference value of the kth container initial type meets the preset requirement, determining that the kth container initial type is the container initial type to be processed of the third container information; and if the calculated difference value of the initial category of the kth container does not meet the preset requirement, determining the difference value between the third set value and the proportional value of the initial category of the kth container, wherein the difference value is the updated third set value, and accumulating k by 1.

In one example, the third preset condition is any one of the following: each container in the container resource pool to be analyzed is allocated with a free position space, containers in at least one container initial type cannot be matched with the free position space, and no free position space exists in container storage information.

The apparatus provided in the embodiment of the present invention may be specifically configured to execute the method flow of any one of the method embodiments, and specific functions are not described herein again.

EXAMPLE ten

Fig. 16 is a schematic structural diagram of a cargo storage space adjustment device according to a tenth embodiment of the present invention. The cargo storage space adjusting device provided by the embodiment of the invention can execute the processing flow provided by the above embodiment. As shown in fig. 16, the cargo storage space adjusting apparatus 150 includes:

the first obtaining unit 151 is configured to obtain a container resource pool to be analyzed, where the container resource pool to be analyzed includes a plurality of containers.

The second obtaining unit 152 is configured to obtain container storage information of the warehouse, where the container resource pool to be analyzed includes the number of containers in the initial category of each container, and the container storage information represents storage space arrangement of shelves corresponding to each lane in the warehouse.

And the matching unit 153 is configured to perform position matching on containers of the initial types of the containers in the container resource pool to be analyzed according to the container storage information, so as to obtain multiple matching results.

The determining unit 154 is configured to determine that the container storage space needs to be adjusted for the rack corresponding to the lane if at least one of the multiple matching results indicates that a container that is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained.

EXAMPLE eleven

Fig. 17 is a schematic structural view of a cargo storage space adjustment apparatus according to an eleventh embodiment of the present invention. The cargo storage space adjusting device provided by the embodiment of the invention can execute the processing flow provided by the above embodiment. As shown in fig. 17, the cargo storage space adjusting apparatus 160 includes:

the first obtaining unit 161 is configured to obtain a container resource pool to be analyzed, where the container resource pool to be analyzed includes a plurality of containers.

The second obtaining unit 162 is configured to obtain container storage information of the warehouse, where the container resource pool to be analyzed includes the number of containers in the initial type of each container, and the container storage information represents storage space arrangement of shelves corresponding to each lane in the warehouse.

And the matching unit 163 is configured to perform position matching on containers of the initial types of the containers in the container resource pool to be analyzed according to the container storage information, so as to obtain multiple matching results.

The determining unit 164 is configured to determine that the container storage space needs to be adjusted for the shelf corresponding to the lane if at least one of the matching results represents that a container that is not matched with the free position space still exists in the container resource pool to be analyzed when the matching result is obtained.

In an example, the matching unit 163 is specifically configured to: repeating the following process to obtain multiple matching results: and according to the container storage information, carrying out position matching on containers of the initial types of the containers in the container resource pool to be analyzed to obtain a matching result.

In one example, the matching unit 163, when configured to obtain a matching result, includes:

an executing module 1631, configured to repeatedly execute the following modules until a fourth preset condition is reached, where the initial fourth container information is a container resource pool to be analyzed.

A first determining module 1632, configured to determine fourth proportion information according to the fourth container information, where the fourth proportion information includes a proportion value of each initial category of containers in the fourth container information, and the proportion value of each initial category of containers represents a ratio between the number of containers of each initial category of containers and the total number of containers of all the initial categories of containers.

A second determining module 1633, configured to determine the initial category of the container to be processed of the fourth container information according to the randomly generated random number and the fourth ratio information.

A third determining module 1634, configured to determine that the container in the current initial category of containers to be processed is allocated with a free position space if it is determined that the container storage information has consecutive free positions with a length greater than or equal to the length of the current initial category of containers to be processed, where the length of the free position space is the minimum length of the consecutive free positions with a length greater than or equal to the length of the current initial category of containers to be processed; and removing the free position space from the container storage information, and updating the fourth container information by subtracting one from the number of containers corresponding to the current type of the container to be processed in the fourth container information.

In one example, the fourth preset condition includes any one of: each container in the container resource pool to be analyzed is allocated with a free position space, containers in at least one container initial type cannot be matched with the free position space, and no free position space exists in container storage information.

In one example, the container type in the fourth container information is Q, where Q is a positive integer greater than or equal to 1; the second determining module 1633 is specifically configured to: repeating the following steps until the initial type of the container to be processed is obtained, wherein the initial value of the fourth preset value is a random number generated randomly: subtracting the proportional value of the kth container initial type in the fourth container information from the fourth preset value to obtain a calculation difference value of the kth container initial type; wherein u is a positive integer of 1 or more and Q or less; if the calculation difference value of the u-th container initial type meets the preset requirement, determining that the u-th container initial type is the container initial type to be processed of the fourth container information; and if the calculated difference value of the u-th container initial type does not meet the preset requirement, determining the difference value between the fourth set value and the proportional value of the u-th container initial type, and accumulating u by 1 to obtain the updated fourth set value.

Example twelve

Fig. 18 is a schematic structural diagram of a scheduling server according to a twelfth embodiment of the present invention. The scheduling server is applied to the intelligent warehousing system. As shown in fig. 18, the scheduling server 100 includes: a processor 1001, a memory 1002, and computer programs stored on the memory 1002 and executable on the processor 1001.

When the processor 1001 runs the computer program, the processing flow executed by the scheduling server in any of the method embodiments described above is implemented.

The scheduling server provided in the embodiment of the present invention may be specifically configured to execute the method flow of any one of the above method embodiments, and specific functions are not described herein again.

The embodiment of the invention also provides a computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when being executed by a processor, the computer program realizes the method provided by any one of the method embodiments.

An embodiment of the present invention further provides a computer program product, where the computer program product includes: a computer program, the computer program being stored in a readable storage medium, from which the computer program can be read by at least one processor of the scheduling server, execution of the computer program by the at least one processor causing the scheduling server to carry out the solution provided by any of the embodiments described above.

It is obvious to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be performed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to perform all or part of the above described functions. For the specific working process of the device described above, reference may be made to the corresponding process in the foregoing method embodiment, which is not described herein again.

Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

It will be understood that the invention is not limited to the precise arrangements that have been described above and shown in the drawings, and that various modifications and changes can be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.

Claims

1. A cargo storage space adjustment method, comprising:

the method comprises the steps of obtaining a container resource pool to be analyzed and container storage information of a warehouse, wherein the container resource pool to be analyzed comprises a plurality of containers, the container resource pool to be analyzed comprises the number of containers under the initial type of each container, and the container storage information represents storage space arrangement of a storage rack corresponding to each roadway in the warehouse;

2. The method of claim 1, wherein the matching positions of the containers in the container resource pool to be analyzed under the initial types of containers according to the container storage information to obtain multiple matching results comprises:

repeating the following process to obtain multiple matching results: and according to the container storage information, carrying out position matching on containers in the container resource pool to be analyzed under the initial types of containers to obtain a matching result.

3. The method of claim 2, wherein the matching positions of the containers in the container resource pool to be analyzed under the initial types of containers according to the container storage information to obtain the matching result comprises:

repeating the following steps until a fourth preset condition is reached, wherein the initial fourth container information is a container resource pool to be analyzed:

determining fourth proportion information according to fourth container information, wherein the fourth proportion information comprises a proportion value of each initial container type in the fourth container information, and the proportion value of each initial container type represents a ratio of the number of containers of each initial container type to the total number of containers of all initial container types;

determining the initial type of the container to be processed of the fourth container information according to the random number generated randomly and the fourth proportion information;

if the container storage information is determined to have continuous idle positions with the length larger than or equal to the length of the current initial type of containers to be processed, determining that the containers under the current initial type of containers to be processed are allocated with an idle position space, wherein the length of the idle position space is the minimum length of the continuous idle positions with the length larger than or equal to the length of the current initial type of containers to be processed; removing the free position space from the container storage information, and updating the fourth container information by subtracting one from the number of containers corresponding to the current type of containers to be processed in the fourth container information;

the fourth preset condition is any one of the following conditions: each container in the container resource pool to be analyzed is allocated with a free position space, containers in at least one container initial type cannot be matched with the free position space, and no free position space exists in container storage information.

4. The method according to claim 3, wherein the container type in the fourth container information is Q, and Q is a positive integer greater than or equal to 1; determining the initial type of the container to be processed of the fourth container information according to the randomly generated random number and the fourth proportion information, wherein the determining comprises the following steps:

repeating the following steps until obtaining the initial type of the container to be processed, wherein the initial value of the fourth preset value is a random number generated randomly:

subtracting the proportional value of the kth container initial type in the fourth container information from the fourth preset value to obtain a calculation difference value of the kth container initial type; wherein u is a positive integer greater than or equal to 1 and less than or equal to Q;

if the calculation difference value of the u-th container initial type meets the preset requirement, determining that the u-th container initial type is the container initial type to be processed of the fourth container information;

and if the calculated difference value of the u-th container initial type does not meet the preset requirement, determining the difference value between a fourth set value and the proportional value of the u-th container initial type, wherein the difference value is the updated fourth set value, and accumulating u by 1.

5. The method of any one of claims 1 to 4, wherein each matching result comprises a first number of initial categories of each container, a second number of initial categories of each container, and category information; the type information is the initial type of containers corresponding to containers which are not matched with the free position space, the first number of the initial types of each container is the number of containers which are matched with the free position space under each initial type of container, and the second number of the initial types of each container is the number of containers which are not matched with the free position space under each initial type of container.

6. A cargo storage space adjustment apparatus, comprising:

the system comprises a first acquisition unit, a second acquisition unit and a third acquisition unit, wherein the first acquisition unit is used for acquiring a container resource pool to be analyzed, and the container resource pool to be analyzed comprises a plurality of containers;

the second acquisition unit is used for acquiring the container storage information of the warehouse, wherein the container resource pool to be analyzed comprises the number of containers in the initial type of each container, and the container storage information represents the storage space arrangement of the goods shelves corresponding to each roadway in the warehouse;

and the determining unit is used for determining that the storage space of the container needs to be adjusted according to the goods shelf corresponding to the roadway if at least one matching result in the multiple matching results represents that the container still has an unmatched free position space in the container resource pool to be analyzed when the matching result is obtained.

7. The apparatus according to claim 6, wherein the matching unit is specifically configured to:

8. The apparatus of claim 7, wherein the matching unit, when configured to obtain a matching result, comprises:

the execution module is used for repeating the following steps until a fourth preset condition is reached, wherein the initial fourth container information is a container resource pool to be analyzed:

the first determining module is used for determining fourth proportion information according to fourth container information, wherein the fourth proportion information comprises a proportion value of each initial container type in the fourth container information, and the proportion value of each initial container type represents a ratio of the number of containers of each initial container type to the total number of containers of all the initial container types;

the second determining module is used for determining the initial type of the container to be processed of the fourth container information according to the random number generated at random and the fourth proportion information;

a third determining module, configured to determine that a container under the current initial category of containers to be processed is allocated with a free position space if it is determined that the container storage information has consecutive free positions with lengths greater than or equal to the length of the current initial category of containers to be processed, where the length of the free position space is a minimum length of the consecutive free positions with lengths greater than or equal to the length of the current initial category of containers to be processed; removing the free position space from the container storage information, and updating the fourth container information by subtracting one from the number of containers corresponding to the current type of containers to be processed in the fourth container information;

9. The apparatus according to claim 8, wherein the container type in the fourth container information is Q, Q being a positive integer of 1 or more; a second determining module, specifically configured to:

repeating the following steps until the initial type of the container to be processed is obtained, wherein the initial value of the fourth preset value is a random number generated randomly:

10. The apparatus of any one of claims 6-9, wherein each matching result includes a first number of initial categories for each container, a second number of initial categories for each container, and category information; the type information is the initial type of containers corresponding to containers which are not matched with the free position space, the first number of the initial types of each container is the number of containers which are matched with the free position space under each initial type of container, and the second number of the initial types of each container is the number of containers which are not matched with the free position space under each initial type of container.

11. A dispatch server, comprising:

a processor, a memory, and a computer program stored on the memory and executable on the processor;

wherein the processor implements the method of any one of claims 1 to 5 when running the computer program.

12. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 5.

13. A computer product, characterized in that it comprises a computer program which, when being executed by a processor, implements the method according to any one of claims 1 to 5.