CN113525980B

CN113525980B - Box-closing and goods-managing method and device, storage system and electronic equipment

Info

Publication number: CN113525980B
Application number: CN202010414447.9A
Authority: CN
Inventors: 韩旭; 傅诚冰
Original assignee: Beijing Kuangshi Robot Technology Co Ltd
Current assignee: Beijing Kuangshi Robot Technology Co Ltd
Priority date: 2020-04-15
Filing date: 2020-05-15
Publication date: 2023-08-18
Anticipated expiration: 2040-05-15
Also published as: CN113525980A

Abstract

The present disclosure provides a box packing method, a box packing apparatus, an electronic device, a computer-readable storage medium, and a warehouse system, wherein the box packing method includes: acquiring the current capacity of N feed boxes for accommodating first cargoes, wherein N is a natural number and N is more than 1; determining M to-be-combined boxes needing to be combined based on the current capacities of the N boxes, wherein the current capacities of the to-be-combined boxes are smaller than a first threshold, M is a natural number, and M is less than or equal to N; grouping the M material boxes to be combined; and conveying K first feed boxes of the same group to a first station for box combination based on the grouping, wherein K is a natural number and K is less than or equal to M. The feed boxes can be guaranteed to be sent to the site in a centralized manner in the grouping, and the feed boxes can be continuously combined with the same SKU manually, so that the link of checking goods is omitted, and unnecessary errors are avoided. Meanwhile, the box closing task of opening at the site can be reduced, and the requirement on the space of the site is reduced. The conveying vehicle resources can be utilized more reasonably.

Description

Box-closing and goods-managing method and device, storage system and electronic equipment

Technical Field

The present disclosure relates generally to the field of warehouse logistics, and more particularly, to a box-in-box ordering method, a box-in-box ordering apparatus, an electronic device, a computer-readable storage medium, and a warehouse system.

Background

The existing bins are sorted by a person, then the bins are sent to a workstation by equipment, the bins are manually sorted, when different commodities are commonly sorted, the commodities are required to be identified by a manual area and distributed and stored, and after the fact that new boxes are fully filled by people is judged, the boxes are put in storage by the equipment. The main problems are: the selection of boxes is performed manually, so that the box combination efficiency is low, for example, a plurality of boxes which are full are selected, more three boxes are combined into two boxes, and four boxes are combined into three boxes.

In the conventional manner, the system only performs the task of discharging the boxes by the person, does not understand how to mix the boxes, only conveys the boxes needing to be mixed to the station, and the system does not understand the sequence and grouping of the bottom mixed boxes, so that the sequence of the boxes reaching the station is not the required sequence, for example, the system is used for discharging the boxes A, B and C, and the system only conveys three boxes to the station, but the system does not know that the boxes A, B and C are combined, or that the boxes B and C are combined, and two boxes which are most suitable for combination cannot be adjacently reached, so that the mixing efficiency is low.

When the goods are commonly ordered for multiple categories, some unfilled boxes exist in each category, more storage space of a site is occupied, meanwhile, the personnel are also complicated to ordered, what goods need to be seen first, and then where the goods are to be placed in the multiple boxes of the site are seen.

The whole existing scheme has low efficiency and is easy to make mistakes.

Disclosure of Invention

In order to solve the above-mentioned problems existing in the prior art, a first aspect of the present disclosure is a box packing method, wherein the method includes: acquiring the current capacity of N feed boxes for accommodating first cargoes, wherein N is a natural number and N is more than 1; determining M to-be-combined boxes needing to be combined based on the current capacities of the N boxes, wherein the current capacities of the to-be-combined boxes are smaller than a first threshold, M is a natural number, and M is less than or equal to N; grouping the M material boxes to be combined; and conveying K first feed boxes of the same group to a first station for box combination based on the grouping, wherein K is a natural number and K is less than or equal to M.

In one example, the grouping the M bins to be combined includes: and grouping the M bins to be combined based on the current capacity of the M bins to be combined, wherein the grouping minimizes the number of bins required to be combined on the premise that the number of bins for accommodating the first goods is minimized after the box combination.

In one example, the grouping the M bins to be combined further includes: and grouping the M material boxes to be combined based on the positions of the M material boxes to be combined so as to minimize the total path for taking the material boxes to be combined.

In one example, the grouping the M bins to be combined based on the positions of the M bins to be combined adopts at least one of the following strategies: dividing the material boxes to be combined in the same column into the same group; dividing the material boxes to be combined in the same tunnel into the same group; the number of times of taking and conveying the path serial main road of the material box to be combined is minimum; or, the number of times that the path for taking the material box to be combined crosses the roadway is minimized.

In one example, the conveying the K first bins of the same group to the first station based on the grouping includes: at least one conveyor car that conveys the K first bins to the first station is determined based on the capacity of the conveyor car to minimize the number of conveyor cars that convey the K first bins of the same group.

In one example, the conveying the K first bins of the same group to the first station based on the grouping includes: determining a target bin and a source bin based on the current capacities of the K first bins, wherein the target bin is a bin receiving the first goods in a box closing task, and the source bin is a bin taking out the first goods in the box closing task; the target bin and the source bin are transported to a first station by a transport cart, wherein any of the source bins is transported to the first station no earlier than the target bin.

In one example, the conveying the K first bins of the same group to the first station based on the grouping includes: one site that can accommodate the K first bins is determined to be the first site based on the current capacity of the site.

In one example, the conveying the K first bins of the same group to the first station based on the grouping further includes: and determining a station for combining the K first bins as the first station based on the positions of the K first bins in the same group, so that the total path from the K first bins to the first station is shortest.

In one example, the method comprises: based on the grouping, different groups of bins to be combined are transported to different stations.

In one example, K first bins of the same group are transported to a first station by a first transport vehicle; the method further comprises the steps of: after the K first bins of the same group are conveyed to a first station, determining the task of the first conveying vehicle so as to reduce the empty rate of the first conveying vehicle.

In one example, the determining the task of the first transporter includes: and if the first station has a to-be-put bin, the first conveying vehicle puts the to-be-put bin into a warehouse.

In one example, the determining the task of the first transporter further includes: if the first station does not have the bin to be put in storage, judging whether the first station has the bin to be put in storage in a time threshold; and if the to-be-put-in feed box exists in the time threshold, the first conveying vehicle waits at the first station, and when the to-be-put-in feed box exists at the first station, the to-be-put-in feed box is put in a warehouse through the first conveying vehicle.

In one example, the determining the task of the first transporter further includes: and if the to-be-put-in-box exists in a second station adjacent to the first station, putting the to-be-put-in-box in the second station into a warehouse through the first conveying vehicle.

A second aspect of the present disclosure provides a group box tallying device, the group box tallying device comprising: the acquisition module is used for acquiring the current capacity of N feed boxes for accommodating the first goods, wherein N is a natural number and is more than 1; the determining module is used for determining M to-be-combined boxes needing to be combined based on the current capacities of the N boxes, wherein the current capacities of the to-be-combined boxes are smaller than a first threshold, M is a natural number, and M is less than or equal to N; the grouping module is used for grouping the M to-be-combined boxes; and the path module is used for conveying K first feed boxes of the same group to the first station for box combination based on the grouping, wherein K is a natural number and K is less than or equal to M.

A third aspect of the present disclosure provides an electronic device, comprising: a memory for storing instructions; and a processor for invoking the instructions stored in the memory to perform the box packing method as in the first aspect.

A fourth aspect of the present disclosure provides a computer readable storage medium having instructions stored therein which, when executed by a processor, perform the box packing method as in the first aspect.

A fifth aspect of the present disclosure provides a warehousing system, comprising: the station is used for carrying out box closing operation on the material box to be combined; the conveying vehicle is used for conveying the feed box; and a box-packing device for executing the box-packing method as described in the first aspect.

The box closing and sorting method, the box closing and sorting device, the electronic equipment, the computer-readable storage medium and the storage system provided by the disclosure ensure that the feed boxes can be intensively sent to the site in groups, and the box closing can be continuously performed on the same SKU (stock keeping unit ) manually, so that the link of checking goods is avoided, and unnecessary errors are avoided. Meanwhile, the box closing task of opening at the site can be reduced, and the requirement on the space of the site is reduced. The resources of the conveying vehicle, such as a light forklift, can be reasonably utilized, and more tasks can be completed by fewer vehicles.

Drawings

The above, as well as additional purposes, features, and advantages of embodiments of the present disclosure will become readily apparent from the following detailed description when read in conjunction with the accompanying drawings. Several embodiments of the present disclosure are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings, in which:

FIG. 1 shows a flow diagram of a box packing method according to an embodiment of the present disclosure;

FIG. 2 shows a flow diagram of a box packing method according to another embodiment of the present disclosure;

fig. 3 shows a schematic diagram of a transport vehicle structure according to an embodiment of the present disclosure.

Fig. 4 shows a schematic diagram of a box-packed shipping apparatus according to an embodiment of the present disclosure.

Fig. 5 is a schematic diagram of an electronic device according to an embodiment of the disclosure.

In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.

Detailed Description

The principles and spirit of the present disclosure will be described below with reference to several exemplary embodiments. It should be understood that these embodiments are presented merely to enable one skilled in the art to better understand and practice the present disclosure and are not intended to limit the scope of the present disclosure in any way.

It should be noted that, although the terms "first", "second", etc. are used herein to describe various modules, steps, data, etc. of the embodiments of the present disclosure, the terms "first", "second", etc. are merely for distinguishing between different modules, steps, data, etc. and not to indicate a particular order or importance. Indeed, the expressions "first", "second", etc. may be used entirely interchangeably.

In order to solve the above-mentioned problem, the embodiment of the present disclosure provides a box-closing and goods-managing method 10, which can reasonably combine goods in a material box through a conveying vehicle, save storage space, improve box-closing efficiency, reduce manpower and avoid errors. As shown in FIG. 1, the group box ordering method 10 may be used for a single SKU, or for the overall planning of multiple SKUs, including: step S11-step S14. The following describes the above steps in detail:

step S11, obtaining the current capacity of N bins for accommodating the first cargoes, wherein N is a natural number and N is more than 1.

In the warehouse, the capacity of the bin is obtained, so that whether the bin needs to be bin-combined or not is judged according to the capacity.

Step S12, determining M to-be-combined boxes needing to be combined based on the current capacities of the N boxes, wherein the current capacities of the to-be-combined boxes are smaller than a first threshold, M is a natural number, and M is less than or equal to N.

And determining which bins need to be combined according to the current capacity of the bins, thereby determining the bins to be combined which need to be combined.

Because the process of placing goods into the bin is realized by people, certain individual differences exist, a data accumulation mode is adopted here, statistics is recent, a certain SKU can be manually placed in a bin of a certain model within a certain time period of 1 month or, the system records the number of goods containing pieces of the full bin, and in order to prevent extreme cases, TP90 can be taken as the maximum bin capacity of the bin.

Selecting all boxes with the current capacity smaller than the maximum box capacity according to the number of SKUs stored in all boxes in the current warehouse area, and grouping boxes according to the current capacity, wherein the grouping consideration factors are as follows: a safe bin closing threshold, which may be manually set or recommended by the system, the first threshold = maximum bin capacity X, where X is a set coefficient; the maximum empty bin saves numbers, and when multiple bin combinations exist, priority is given to how to use the least bin to save the most bin.

In this embodiment, if the current capacity of the bin is less than the first threshold, it is indicated that there is room for bin closing.

And S13, grouping M to-be-combined boxes.

The material boxes to be combined are grouped, so that the combining efficiency is improved, a plurality of material boxes to be combined in the same grouping group are combined, a plurality of material boxes to be combined are subjected to box combining tasks in parallel at a plurality of sites according to the components, and the pressure on the capacity of a single site is reduced while the efficiency is improved.

In an embodiment, step S13 may include: the M bins to be combined are grouped based on the current capacity of the M bins to be combined, the grouping minimizing the number of bins required to be combined on the premise that the number of bins for holding the first cargo after the combining is minimized. According to the current capacity of the to-be-combined box, when various box combination exists, priority is given to how to use the least box to be taken out and save the most library positions. In practical application, the most main purpose of the box closing task is to save the storage positions, so that each time the box closing is performed, the purpose of saving the most storage positions is achieved, and therefore, when the box closing is performed, priority is given to how the number of the boxes for containing the first goods after the box closing can be minimized, and the effectiveness of box closing and tallying each time is maximized. Under the condition that the same number of saving warehouse positions can be achieved by a plurality of grouping schemes, the scheme with the least number of the feed boxes needing to be subjected to box closing can be selected, the box closing is performed by calling fewer feed boxes to be discharged from a warehouse, and the result of saving the warehouse positions to the maximum is achieved, so that the maximum box closing efficiency can be ensured, the conveying resources are saved, and the workload is reduced.

In an embodiment, step S13 may further include: the M bins to be combined are grouped based on the positions of the M bins to be combined so as to minimize the total path for taking and conveying the bins to be combined. According to the position, the grouping can be optimized by a shortest path method and the like, so that the conveying efficiency is improved, and the conveying cost is reduced.

In an embodiment, based on the positions of the M bins to be combined, the grouping of the M bins to be combined may use one of the following policies, or may use multiple policies at the same time: dividing the material boxes to be combined in the same column into the same group; dividing the material boxes to be combined in the same tunnel into the same group; the number of times of taking and conveying the path serial main road of the material box to be combined is minimum; or, the number of times that the path for taking the material box to be combined crosses the roadway is minimized. The overall situation can have N boxes to be tidied, various groups of boxes can be combined under the limit of the box closing safety threshold, and the distribution of the boxes can be comprehensively considered, so that the distribution of the boxes which are combined in the same group needs to be relatively concentrated, and the detouring of a conveying vehicle (such as a multi-layer light fork) is avoided. According to the above strategies, the material boxes to be combined in the same row can be picked up by stopping the conveying vehicle at one position, the conveying vehicle reaches the row position, and the material can be picked up only by the material picking device on the conveying vehicle, so that the moving path of the conveying vehicle is reduced to the maximum extent. The feed boxes to be combined in the same tunnel are divided into the same group, so that the conveying vehicle can pick up as many feed boxes as possible in the same tunnel, the total path is reduced, and the traffic burden on a main road and other tunnels is also reduced. When the same group of feed boxes cannot be guaranteed to be in the same row or the same roadway, the feed boxes can be grouped according to the modes of the minimum number of times of taking paths of the feed boxes to be combined and the minimum number of times of taking paths of the feed boxes to be combined to cross the roadway, and the like, so that the traffic pressure of the conveying vehicle on the main roadway in the process of taking the feed boxes in the same group is reduced as much as possible, the occupation of excessive roadways is reduced, and the influence on the execution of the warehouse-in and warehouse-out tasks on other conveying vehicles is reduced. .

And S14, conveying K first feed boxes of the same group to a first station for box combination based on grouping, wherein K is a natural number and K is less than or equal to M.

The same group of feed boxes are conveyed to one station for box closing, so that box closing work can be performed more efficiently, first cargoes are taken out from the station by the feed boxes needing to be emptied, the taken out cargoes do not need to be transferred to a station, and other feed boxes are only needed to be put into the station.

In one embodiment, different groups of bins to be combined are transported to different stations on a packet basis. If the idle stations are enough, each group can be respectively conveyed to different stations, so that each group can be simultaneously subjected to box packing and shipping at different stations, waiting at a certain station is not needed, and box packing efficiency is improved. If there are few stations or there are few idle stations, queuing can be performed to transport only one set of bins to one station at a time, avoiding congestion and errors.

In an embodiment, step S14 may include: at least one conveyor car that conveys K first bins to the first station is determined based on the capacity of the conveyor car to minimize the number of conveyor cars that convey K first bins of the same group. In this embodiment, the bin is transported by the transport vehicle, and the capacity of the transport vehicle needs to be taken into consideration. All the feed boxes of a group are conveyed by one conveying vehicle as much as possible, so that the conveying cost is reduced, and the problem of conveying sequence caused by taking one group of feed boxes by multiple vehicles is avoided.

The combination of boxes for one task is completed by the same poking vehicle as much as possible, and the boxes with different tasks on one conveying vehicle are reduced, because front-back dependence is avoided. This workstation requires that boxes for tallying arrive together with groups of tasks.

The boxes of the same task group are ensured to be fetched by the least conveying vehicles as much as possible, and the box fetching machine has the advantages that: avoiding multiple vehicles, such as a multi-layer light forklift, taking a part of the feed box of the A task and another part of the feed box of the B task or the C task, the feed boxes of the two shifting tasks may have dependence, for example B, C can be put in only when the box of the A is put in, even if the box of the B task is on the vehicle, the box of the B task cannot be put in to a site, and the vehicles of the feed boxes of the A task are put out of way. Thereby causing the situation that the conveying vehicles repeatedly queue and wait each other, and reducing the efficiency of the vehicles.

In an embodiment, step S14 may further include: determining a target bin and a source bin based on the current capacities of the K first bins, wherein the target bin is a bin for receiving first goods in the box closing task, and the source bin is a bin for taking out the first goods in the box closing task; the target bin and the source bins are transported to the first station by a transport cart, wherein any source bin is transported to the first station no earlier than the target bin.

The strategy ensures that the target bin arrives first, the source bin arrives simultaneously or subsequently, where the target bin refers to the bin of the closed bin, generally refers to the most loaded bin of bins, the source bin refers to the bin from which the goods need to be taken out, and generally the bin with the smaller number of goods is selected as the source bin, with the benefit of at least reducing the number of bulk goods that the worker needs to move. It is therefore necessary to ensure that the conveyor vehicle, when throwing the box, ensures that the target box arrives first at the station, that the source box is either simultaneous or subsequent, and that the box is not inserted by other tasks.

Through the sequencing capability of the conveying vehicle, boxes of the tally tasks sent to the station are guaranteed to be ordered, the boxes among the tasks are not mixed, and the storage capability of the station for the boxes to be combined is not exceeded. The quantity of the box closing tasks of different SKUs processed simultaneously by one workstation ensures that all boxes of one box closing task are sent to the site as much as possible, then the boxes of the next box closing task come into consideration, and meanwhile, the quantity of the boxes to be closed of the site is considered, and the maximum storage quantity of the site is not exceeded.

In an embodiment, step S14 may include: one station that can accommodate K first bins is determined to be a first station based on the current capacity of the station. In this embodiment, a site capable of accommodating K first bins of the group may be selected according to the current capacity of available sites, so as to ensure that bins of the same group can perform a box-closing and shipping operation at one site.

In an embodiment, step S14 may further include: and determining the site for closing the K first bins as a first site based on the positions of the K first bins in the same group so as to minimize the total path from the K first bins to the first site. In this embodiment, when having a plurality of stations that can hold K bins, the station can be selected in consideration of the station position and the position of the bin that needs to be boxed, so as to reduce the conveying cost of the conveying vehicle, and can reach the station more quickly and reduce the pressure of the warehouse path.

In one embodiment, the same group of K first bins are transported to the first station by the first transport cart; as shown in fig. 2, after step S14, the box-in-box method 10 further includes: step S15, determining the task of the first conveying vehicle so as to reduce the empty rate of the first conveying vehicle. In order to improve efficiency, the bin is conveyed by the conveying vehicle, and meanwhile, after the bin requiring bin closing is conveyed to a middle station, the empty driving of the conveying vehicle is avoided, and other tasks can be arranged after the bin requiring bin closing is conveyed.

In an embodiment, step S15 may include: and if the first station has the to-be-put bin, the first conveying vehicle puts the to-be-put bin into a warehouse. The boxes with the boxes completed can be retrieved and put in storage by taking the boxes with priority after the boxes with the boxes closing tasks are sent. After the delivery vehicle (such as a multi-layer light fork) finishes the task of delivering boxes on the body, the station can check whether the boxes with the rational finished boxes need to be put in storage again: if so, the box is taken on the way and returned. In this embodiment, the carrier vehicle avoids no load, and after reaching a predetermined station, the carrier vehicle carries a bin that needs to be put in storage, thereby improving efficiency.

In an embodiment, step S15 may further include: if the first station does not have the bin to be put in storage, judging whether the first station has the bin to be put in storage in a time threshold; if the to-be-put-in-box exists in the time threshold, the first conveying vehicle waits at the first station, and when the to-be-put-in-box exists at the first station, the to-be-put-in-box is put in a warehouse through the first conveying vehicle. If the first station does not have the bin with the finished goods, the first station judges whether the bin with the finished goods is generated in the time threshold, for example, within x minutes, if so, the first conveyor vehicle waits at the first station, and the bin with the finished goods is carried and put in storage after finishing the goods, so that no load is avoided; if the material box for finishing the tally does not exist within the time threshold, the first conveying vehicle does not wait and directly continues to execute the following tasks.

In an embodiment, step S15 may further include: and if the to-be-put-in-box exists in the second station adjacent to the first station, putting the to-be-put-in-box in the second station into a warehouse through the first conveying vehicle. After the delivery is completed, the delivery vehicle can also check whether other nearby stations are completed in order after checking whether the current station has the feed boxes needing to be put in the way, the feed boxes needing to be put in the way are not arranged to be executed by the delivery vehicle, and if so, the feed boxes of the stations are taken down together in the way, so that the warehouse-in task is executed together.

By means of the above strategy, the benefit at least comprises: ensuring that the feed boxes can be sent to a station in a centralized manner in groups, and manually closing the boxes for the same SKU continuously, avoiding the link of checking the goods, avoiding unnecessary errors, and closing the boxes for the similar goods but different goods by people; meanwhile, the box closing task of opening at the site can be reduced, and the requirement on the space of the site is reduced; the conveying vehicle resources can be more reasonably utilized, and more tasks can be completed by fewer conveying vehicles: 1. taking a box link, concentrating and following the way; 2. sending the box to a site nearby; 3. returning the boxes after the goods are tidied back to the warehouse and going forward.

Based on the same inventive concept, as shown in fig. 3, the present disclosure discloses a transporting vehicle 200, where the transporting vehicle 200 may be applied to the box packing method 10 of any of the foregoing embodiments, and the transporting vehicle 200 includes: a pallet 220 comprising a plurality of cargo bays, each cargo bay for carrying one or more bins; a pick-up section 230 for picking up the bin to the cargo space or for delivering the bin from the cargo space; the vehicle body 210 carries the pallet and the pick-up section and is used to drive the conveyor.

In one embodiment, the cargo space of the transfer cart 200 is arranged in multiple layers; the pick head 230 is movable in the height direction.

In one embodiment, the truck 200 may be a forklift, such as a multi-layer light fork in CTU, including a truck body with multiple cargo spaces and a robotic arm capable of moving freely in the height direction. The application does not limit how the plurality of goods spaces on the forklift are distributed, for example, in one implementation mode, the plurality of goods spaces of the forklift can be arranged along the height direction, and the mechanical arm of the forklift can freely move along the height direction, so that the plurality of goods spaces are also arranged along the height direction, on one hand, the mechanical arm is beneficial to quickly taking out or putting in goods, on the other hand, the front and back movement of the forklift is also beneficial to reducing the front and back movement of the forklift, the operation time is saved, and the occupied area of a work station is saved. For example, the transporting carriage 200 in fig. 3 has 5 cargo positions along the height direction, and the pick-up portion 230, i.e. the mechanical arm, can further hold one more cargo, i.e. the bin, i.e. the transporting carriage 200 can process 6 cargoes at most once.

Based on the same inventive concept, the present disclosure further provides a box-in-box tallying device 300, as shown in fig. 4, the box-in-box tallying device 300 includes: an obtaining module 310, configured to obtain current capacities of N bins for accommodating first cargo, where N is a natural number and N is greater than 1; a determining module 320, configured to determine M bins to be combined that need to be combined based on current capacities of the N bins, where the current capacity of the bins to be combined is smaller than a first threshold, M is a natural number, and M is less than or equal to N; a grouping module 330, configured to group M bins to be combined; the path module 340 is configured to convey K first bins of the same group to the first station for grouping, where K is a natural number and K is less than or equal to M.

In one example, the grouping module 330 is further configured to: the M bins to be combined are grouped based on the current capacity of the M bins to be combined, the grouping minimizing the number of bins required to be combined on the premise that the number of bins for holding the first cargo after the combining is minimized.

In one example, the grouping module 330 is further configured to: the M bins to be combined are grouped based on the positions of the M bins to be combined so as to minimize the total path for taking and conveying the bins to be combined.

In one example, the grouping module 330 may employ at least one of the following strategies to implement grouping M bins to be combined based on their locations: dividing the material boxes to be combined in the same column into the same group; dividing the material boxes to be combined in the same tunnel into the same group; the number of times of taking and conveying the path serial main road of the material box to be combined is minimum; or, the number of times that the path for taking the material box to be combined crosses the roadway is minimized.

In one example, the path module 340 may include: and the conveying vehicle determining module is used for determining at least one conveying vehicle for conveying the K first bins to the first station based on the capacity of the conveying vehicle so as to minimize the number of conveying vehicles for conveying the K first bins of the same group.

In one example, the path module 340 may include: the bin determination module is used for determining a target bin and a source bin based on the current capacity of the K first bins, wherein the target bin is a bin for receiving first cargoes in a bin closing task, and the source bin is a bin for taking out the first cargoes in the bin closing task; and the conveying sequence determining module is used for conveying the target bin and the source bin to the first station through the conveying vehicle, wherein any source bin is conveyed to the first station no earlier than the target bin.

In one example, the path module 340 may include: and the station determining module is used for determining one station which can accommodate the K first bins as the first station based on the current capacity of the station.

In one example, the station determination module is further to: and determining the site for closing the K first bins as a first site based on the positions of the K first bins in the same group so as to minimize the total path from the K first bins to the first site.

In one example, the station determination module is further to: based on the grouping, different groups of bins to be combined are transported to different stations.

In one example, K first bins of the same group are transported to a first station by a first transport vehicle; the box packing apparatus 300 further includes: and the task determining module is used for determining the task of the first conveying vehicle after the K first feed boxes in the same group are conveyed to the first station so as to reduce the empty rate of the first conveying vehicle.

In one example, the task determination module is further to: and if the first station has the to-be-put bin, the first conveying vehicle puts the to-be-put bin into a warehouse.

In one example, the task determination module is further to: if the first station does not have the bin to be put in storage, judging whether the first station has the bin to be put in storage in a time threshold; if the to-be-put-in-box exists in the time threshold, the first conveying vehicle waits at the first station, and when the to-be-put-in-box exists at the first station, the to-be-put-in-box is put in a warehouse through the first conveying vehicle.

In one example, the task determination module is further to: and if the to-be-put-in-box exists in the second station adjacent to the first station, putting the to-be-put-in-box in the second station into a warehouse through the first conveying vehicle.

With respect to the box assembling and shipping apparatus 300 of the above embodiment, the specific manner in which the respective modules perform the operations has been described in detail in the embodiment regarding the method, and will not be described in detail herein.

Based on the same inventive concept, the present disclosure also provides a warehousing system, including: the station is used for carrying out box closing operation on the material box to be combined; the conveying vehicle is used for conveying the feed box; and, a box-packing apparatus for performing the box-packing method 10 of any of the foregoing embodiments.

The specific manner in which the various modules perform operations in the warehousing system of the above embodiments has been described in detail in connection with the embodiments of the method and will not be described in detail herein.

As shown in fig. 5, one embodiment of the present disclosure provides an electronic device 400. The electronic device 400 comprises, among other things, a memory 401, a processor 402, an Input/Output (I/O) interface 403. Wherein the memory 401 is used for storing instructions. And a processor 402 for calling the instructions stored in the memory 401 to execute the box packing method according to the embodiment of the present disclosure. The processor 402 is connected to the memory 401, the I/O interface 403, respectively, which may be connected, for example, by a bus system and/or other form of connection mechanism (not shown). The memory 401 may be used to store programs and data, including programs of the box packing method involved in the embodiments of the present disclosure, and the processor 402 performs various functional applications of the electronic device 400 and data processing by running the programs stored in the memory 401.

The processor 402 in embodiments of the present disclosure may be implemented in hardware in at least one of a digital signal processor (Digital Signal Processing, DSP), field-programmable gate array (Field-Programmable Gate Array, FPGA), programmable logic array (Programmable Logic Array, PLA), the processor 402 may be one or a combination of several of a central processing unit (Central Processing Unit, CPU) or other form of processing unit having data processing and/or instruction execution capabilities.

Memory 401 in embodiments of the present disclosure may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, random access memory (Random Access Memory, RAM) and/or cache memory (cache), etc. The nonvolatile Memory may include, for example, a Read-Only Memory (ROM), a Flash Memory (Flash Memory), a Hard Disk (HDD), a Solid State Drive (SSD), or the like.

In the embodiment of the present disclosure, the I/O interface 403 may be used to receive an input instruction (e.g., numeric or character information, and generate key signal input related to user setting and function control of the electronic device 400, etc.), and may also output various information (e.g., image or sound, etc.) to the outside. The I/O interface 403 in embodiments of the present disclosure may include one or more of a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a mouse, joystick, trackball, microphone, speaker, touch panel, etc.

It will be appreciated that although operations are described in a particular order in the figures, this should not be construed as requiring that these operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous.

Methods and apparatus related to embodiments of the present disclosure can be accomplished using standard programming techniques with rule-based logic or other logic to accomplish the various method steps. It should also be noted that the words "apparatus" and "module" as used herein and in the claims are intended to include implementations using one or more lines of software code and/or hardware implementations and/or equipment for receiving inputs.

Any of the steps, operations, or procedures described herein may be performed or implemented using one or more hardware or software modules alone or in combination with other devices. In one embodiment, the software modules are implemented using a computer program product comprising a computer readable medium containing computer program code capable of being executed by a computer processor for performing any or all of the described steps, operations, or programs.

The foregoing description of implementations of the present disclosure has been presented for purposes of illustration and description. The foregoing description is not intended to be exhaustive or to limit the disclosure to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the disclosure. The embodiments were chosen and described in order to explain the principles of the present disclosure and its practical application to enable one skilled in the art to utilize the present disclosure in various embodiments and with various modifications as are suited to the particular use contemplated.

Claims

1. A method of box-packing, wherein the method comprises:

acquiring the current capacity of N feed boxes for accommodating first cargoes, wherein N is a natural number and N is more than 1;

determining M to-be-combined boxes needing to be combined based on the current capacities of the N boxes, wherein the current capacities of the to-be-combined boxes are smaller than a first threshold, M is a natural number, and M is less than or equal to N;

grouping the M material boxes to be combined;

based on the grouping, conveying K first feed boxes of the same group to a first station for box combination, wherein K is a natural number and is less than or equal to M;

wherein, grouping the M bins to be combined includes:

and grouping the M bins to be combined based on the current capacity of the M bins to be combined, wherein the grouping minimizes the number of bins required to be combined on the premise that the number of bins for accommodating the first goods is minimized after the box combination.

2. The method of claim 1, wherein the grouping the M bins to be combined further comprises:

and grouping the M material boxes to be combined based on the positions of the M material boxes to be combined so as to minimize the total path for taking the material boxes to be combined.

3. The method of claim 2, wherein the grouping of the M bins based on the locations of the M bins employs at least one of the following policies:

dividing the material boxes to be combined in the same column into the same group;

dividing the material boxes to be combined in the same tunnel into the same group;

the number of times of taking and conveying the path serial main road of the material box to be combined is minimum; or alternatively, the first and second heat exchangers may be,

the number of times that the path for taking the material box to be combined crosses the roadway is minimized.

4. A method according to any one of claims 1 to 3, wherein said conveying K first bins of the same group to a first station based on said grouping comprises:

at least one conveyor car that conveys the K first bins to the first station is determined based on the capacity of the conveyor car to minimize the number of conveyor cars that convey the K first bins of the same group.

5. A method according to any one of claims 1 to 3, wherein said conveying K first bins of the same group to a first station based on said grouping comprises:

determining a target bin and a source bin based on the current capacities of the K first bins, wherein the target bin is a bin receiving the first goods in a box closing task, and the source bin is a bin taking out the first goods in the box closing task;

the target bin and the source bin are transported to a first station by a transport cart, wherein any of the source bins is transported to the first station no earlier than the target bin.

6. The method of claim 1, wherein the conveying the same set of K first bins to a first station based on the grouping comprises:

one site that can accommodate the K first bins is determined to be the first site based on the current capacity of the site.

7. The method of claim 6, wherein the transporting K first bins of the same group to a first station based on the grouping further comprises:

and determining a station for combining the K first bins as the first station based on the positions of the K first bins in the same group, so that the total path from the K first bins to the first station is shortest.

8. The method according to claim 1, wherein the method comprises: based on the grouping, different groups of bins to be combined are transported to different stations.

9. The method of claim 1, wherein the same set of K first bins are transported to the first station by the first conveyor car;

the method further comprises the steps of:

after the K first bins of the same group are conveyed to a first station, determining the task of the first conveying vehicle so as to reduce the empty rate of the first conveying vehicle.

10. The method of claim 9, wherein the determining the task of the first transporter comprises:

and if the first station has a to-be-put bin, the first conveying vehicle puts the to-be-put bin into a warehouse.

11. The method of claim 9 or 10, wherein the determining the task of the first transporter further comprises:

if the first station does not have the bin to be put in storage, judging whether the first station has the bin to be put in storage in a time threshold;

and if the to-be-put-in feed box exists in the time threshold, the first conveying vehicle waits at the first station, and when the to-be-put-in feed box exists at the first station, the to-be-put-in feed box is put in a warehouse through the first conveying vehicle.

12. The method of claim 9, wherein the determining the task of the first conveyor car further comprises:

and if the to-be-put-in-box exists in a second station adjacent to the first station, putting the to-be-put-in-box in the second station into a warehouse through the first conveying vehicle.

13. A box-in-box ordering apparatus, wherein the apparatus comprises:

the acquisition module is used for acquiring the current capacity of N feed boxes for accommodating the first goods, wherein N is a natural number and is more than 1;

the determining module is used for determining M to-be-combined boxes needing to be combined based on the current capacities of the N boxes, wherein the current capacities of the to-be-combined boxes are smaller than a first threshold, M is a natural number, and M is less than or equal to N;

the grouping module is used for grouping the M to-be-combined boxes;

the path module is used for conveying K first feed boxes of the same group to a first station for box combination based on the grouping, wherein K is a natural number and K is less than or equal to M;

the path module groups the M bins to be combined in the following manner:

14. An electronic device, wherein the electronic device comprises:

a memory for storing instructions; and

a processor for invoking instructions stored in said memory to perform a box packing method as claimed in any one of claims 1-12.

15. A computer readable storage medium having instructions stored therein, which when executed by a processor, perform the box packing method of any of claims 1-12.

16. A warehousing system, wherein the warehousing system comprises:

the station is used for carrying out box closing operation on the material box to be combined;

the conveying vehicle is used for conveying the feed box; the method comprises the steps of,

a box-in-box handling apparatus for performing the box-in-box handling method of any of claims 1-12.