Goods distribution method, device and equipment and storage medium

Abstract

The embodiment of the invention discloses a cargo distribution method and device, equipment and a storage medium. The method comprises the steps of performing cargo distribution optimization on each first object during first distribution based on a plurality of cargoes to be distributed, and determining remaining cargoes corresponding to each first object; based on the remaining goods corresponding to each first object, carrying out goods distribution optimization on each second object during secondary distribution, and determining the remaining goods corresponding to each current object combination; determining and removing useless object combinations based on the current distribution cargo quantity and the current object use cost corresponding to each current object combination; next distribution and useless object combination removal are carried out based on the remaining goods corresponding to each current object combination after removal; and the target object combination is determined based on each current object combination after distribution is finished, and cargo distribution loading is performed based on the target object combination, so that reasonable cargo distribution is performed for various objects, the distribution calculation amount is reduced, and the cargo distribution efficiency is improved.

Description

Technical Field

[0001] The embodiments of the present invention relate to logistics technology, and more particularly to a cargo distribution method, device, equipment and storage medium. Background Art

[0002] With the rapid development of logistics technology, it is often necessary to reasonably distribute multiple goods to vehicles, ships and other objects for loading and transportation.

[0003] At present, the goods allocation optimization is usually performed for a single object to obtain the optimal goods allocation strategy for the object. However, in the process of implementing the present invention, the inventors found that there are at least the following problems in the prior art:

[0004] Since different types of objects can be used for loading and transportation in logistics scenarios, and the object usage cost of each object is different, it is also necessary to select appropriate objects for cargo allocation optimization to minimize the object usage cost after all cargoes are allocated. It can be seen that there is an urgent need for a method to allocate cargo for multiple objects. Summary of the invention

[0005] The embodiments of the present invention provide a cargo distribution method, device, equipment and storage medium to reasonably distribute cargo to multiple objects, reduce the amount of distribution calculation, and improve the cargo distribution efficiency.

[0006] In a first aspect, an embodiment of the present invention provides a cargo distribution method, comprising:

[0007] Acquire multiple goods to be allocated and multiple objects for loading the goods, wherein the multiple objects are traversed and allocated each time;

[0008] Based on the multiple goods to be allocated, optimizing the allocation of goods for each first object during the initial allocation, and determining the remaining goods corresponding to each first object after the initial allocation;

[0009] Based on the remaining goods corresponding to each first object, optimizing the goods allocation for each second object during the secondary allocation, and determining the remaining goods corresponding to each current object combination after the secondary allocation;

[0010] Determine useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination, and remove the useless object combinations;

[0011] The next allocation is performed based on the remaining goods corresponding to each current object combination after the removal and the removal of useless object combinations after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination;

[0012] Based on the current object usage cost corresponding to each current object combination after the allocation is completed, a target object combination is determined, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, the cargo to be allocated is allocated to the target object for loading.

[0013] In a second aspect, an embodiment of the present invention further provides a cargo distribution device, comprising:

[0014] An information acquisition module, used for acquiring a plurality of goods to be allocated and a plurality of objects for loading the goods, wherein the plurality of objects are traversed and allocated each time;

[0015] A first allocation module, used to optimize the allocation of goods to each first object during the first allocation based on multiple goods to be allocated, and determine the remaining goods corresponding to each first object after the first allocation;

[0016] A secondary distribution module, configured to optimize the distribution of goods for each second object during secondary distribution based on the remaining goods corresponding to each first object, and determine the remaining goods corresponding to each current object combination after secondary distribution;

[0017] A useless combination removal module is used to determine useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination, and remove the useless object combinations;

[0018] The next allocation module is used to perform the next allocation based on the remaining goods corresponding to each current object combination after the removal and remove the useless object combination after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination;

[0019] The cargo allocation module is used to determine the target object combination based on the current object usage cost corresponding to each current object combination after the allocation is completed, and allocate the cargo to be allocated to the target object for loading based on the target cargo allocation strategy corresponding to each target object in the target object combination.

[0020] In a third aspect, an embodiment of the present invention further provides an electronic device, the electronic device comprising:

[0021] one or more processors;

[0022] A memory for storing one or more programs;

[0023] When the one or more programs are executed by the one or more processors, the one or more processors implement the cargo distribution method provided by any embodiment of the present invention.

[0024] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the cargo distribution method provided by any embodiment of the present invention.

[0025] One embodiment of the above invention has the following advantages or beneficial effects:

[0026] By traversing and allocating multiple objects each time the goods are allocated, specifically: based on multiple goods to be allocated, optimize the goods allocation for each first object in the first allocation, and determine the remaining goods corresponding to each first object after the first allocation; based on the remaining goods corresponding to each first object, optimize the goods allocation for each second object in the second allocation, and determine the remaining goods corresponding to each current object combination after the second allocation; based on the current allocated goods volume and the current object usage cost corresponding to each current object combination, determine the useless object combination in all current object combinations, and remove the useless object combination; based on the remaining goods corresponding to each current object combination after removal, perform the next allocation and remove the useless object combination after the next allocation, until there is no remaining goods for each current object combination. Based on the current object usage cost corresponding to each current object combination after the allocation is completed, determine the target object combination, and based on the target goods allocation strategy corresponding to each target object in the target object combination, allocate all the goods to be allocated to the corresponding target object for loading, thereby realizing the reasonable allocation of goods for multiple objects, and by removing the useless object combination, it is possible to continue to allocate only on the basis of the useful current object combination, without traversing all object combinations, thereby greatly reducing the allocation calculation amount and improving the efficiency of goods allocation. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0028] Figure 1 is a flow chart of a cargo distribution method provided by an embodiment of the present invention;

[0029] Figure 2 is an example diagram of cargo allocation optimization for a single object involved in one embodiment of the present invention;

[0030] Figure 3 is a flow chart of another cargo distribution method provided by one embodiment of the present invention;

[0031] Figure 4 is a structural schematic diagram of a cargo distribution device provided by an embodiment of the present invention;

[0032] Figure 5 It is a structural schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0033] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

[0034] Figure 1 This is a flow chart of a cargo distribution method provided by an embodiment of the present invention. This embodiment is applicable to the case where all cargoes are reasonably distributed to multiple objects for loading. The method can be executed by a cargo distribution device, which can be implemented by software and / or hardware and integrated into an electronic device. Figure 1 As shown, the method specifically comprises the following steps:

[0035] S110, obtaining a plurality of goods to be distributed and a plurality of objects for loading the goods, wherein the plurality of objects are traversed and distributed each time.

[0036] Among them, the cargo can be any object that needs to be loaded and transported. The cargo to be distributed may include different types of cargo. The quantity of each type of cargo may be one or more. Different types of cargo have different sizes. The object can be any equipment used to load and transport cargo. For example, the object may include but is not limited to: vehicles, ships, airplanes or containers, etc. Among them, the vehicle may also include vehicles of different models. Each model of vehicle can also be regarded as an object. The container sizes used to load cargo in different types of objects are different, and the object usage costs are also different. For example, the compartment sizes of different models of vehicles are different, and the vehicle usage costs are also different. For example, multiple objects may include multiple models of vans.

[0037] Specifically, in the logistics transportation scenario, all goods that need to be allocated and loaded and all types of objects that can be used to load goods are obtained. Minimizing the object usage cost can be used as the optimization goal, and the best object combination can be selected from all objects to allocate and load all goods. In view of this, goods can be allocated by selecting an object each time through traversal until all goods are allocated, thereby obtaining the best object combination.

[0038] S120: Based on the multiple goods to be allocated, optimize the goods allocation for each first object during the initial allocation, and determine the remaining goods corresponding to each first object after the initial allocation.

[0039] The first object may refer to an object selected for the first allocation. Each object may be used as the first object for the first allocation so as to perform traversal allocation on multiple objects. The remaining goods corresponding to the first object may refer to the remaining unallocated goods after the goods are allocated to the first object for the first time.

[0040] Specifically, during the first allocation, each object can be used as the first object to optimize the allocation of goods, and the goods allocated to the first object for the first time can be determined based on the optimal allocation strategy, and the remaining goods after the first allocation of the first object can be determined based on the goods allocated for the first time.

[0041] Exemplarily, S120 may include: for each first object during the first allocation, based on multiple goods to be allocated, maximizing the cargo allocation and loading rate of the first object to obtain a target cargo allocation strategy corresponding to the first object; based on the target cargo allocation strategy corresponding to the first object, determining the remaining cargo corresponding to the first object after the first allocation.

[0042] The target cargo allocation strategy may refer to the cargo allocation strategy when the loading rate of the first object is the largest. The target cargo allocation strategy may include: the target cargo that needs to be allocated and loaded in the first object and the loading position and posture of each target cargo, so as to maximize the loading rate of the first object (i.e., the maximum number of loaded cargoes).

[0043] Specifically, for each first object in the initial allocation, integer programming algorithms, genetic algorithms, or reinforcement learning can be used to allocate goods and maximize the loading rate of the first object to obtain a target goods allocation strategy when the loading rate is maximized. The target goods that need to be allocated and loaded in the first object can be obtained based on the target goods allocation strategy, and after removing these target goods from all goods to be allocated, the remaining goods corresponding to the first object can be obtained.

[0044] Exemplarily, if there are 100 goods to be allocated and 4 objects for loading the goods, namely object A, object B, object C and object D, the 4 objects are traversed, allocated and optimized respectively during the first allocation. For example, the first object A can load 10 pieces of goods when the loading rate is maximum, and the remaining goods are 90 pieces; the first object B can load 15 pieces of goods when the loading rate is maximum, and the remaining goods are 85 pieces; the first object C can load 18 pieces of goods when the loading rate is maximum, and the remaining goods are 82 pieces; the first object D can load 20 pieces of goods when the loading rate is maximum, and the remaining goods are 80 pieces.

[0045] S130. Based on the remaining goods corresponding to each first object, optimize the goods allocation for each second object during the secondary allocation, and determine the remaining goods corresponding to each current object combination after the secondary allocation.

[0046] Among them, the second object may refer to an object selected for the second distribution. Each object may be used as the second object in the second distribution so as to traverse and distribute multiple objects. The secondary distribution needs to be distributed on the basis of the remaining goods corresponding to the first object after the first distribution, so that each distribution situation in the secondary distribution corresponds to an object combination, which includes a first object and a second object. The current object combination may change dynamically as the number of distributions increases. With each distribution, an object is added to the current object combination. The remaining goods corresponding to the current object combination may refer to the remaining undistributed goods after the goods are distributed to all objects in the object combination. It should be noted that the current object combination may include objects of different types or objects of the same type.

[0047] Specifically, during the second allocation, each object can be used as the second object, and based on the remaining goods after each first object is allocated, the goods allocation of each second object is optimized, and the goods allocated to the second object are determined based on the optimal allocation strategy. Based on the remaining goods after the first object is allocated and the goods allocated to the second object, the remaining goods after the goods are secondary allocated to the current object combination are determined.

[0048] Exemplarily, S130 may include: for each first object during the first allocation and each second object during the second allocation, based on the remaining goods corresponding to the first object, maximizing the cargo allocation and loading rate for the second object to obtain the target cargo allocation strategy corresponding to the second object; based on the remaining goods corresponding to the first object and the target cargo allocation strategy corresponding to the second object, determining the remaining goods corresponding to the current object combination after the second allocation, wherein the current object combination includes the first object and the second object.

[0049] Specifically, the secondary allocation can be performed in the same way as the primary allocation to maximize the cargo allocation of the loading rate. For each first object in the primary allocation and each second object in the secondary allocation, integer programming algorithms, genetic algorithms, or reinforcement learning can be used to allocate as much of the remaining cargo corresponding to the first object as possible to the second object, and obtain the target cargo allocation strategy when the loading rate is maximized. The target cargo that needs to be allocated and loaded in the second object can be obtained based on the target cargo allocation strategy, and the remaining cargo corresponding to the first object can be removed after removing these target cargoes, to obtain the remaining cargo corresponding to the second object, that is, the remaining cargo corresponding to the current object combination composed of the first object and the second object.

[0050] For example, following the above example, after the first allocation, the remaining goods corresponding to the first object A are 90 pieces; the remaining goods corresponding to the first object B are 85 pieces; the remaining goods corresponding to the first object C are 82 pieces; and the remaining goods corresponding to the first object D are 80 pieces. During the secondary allocation, objects A, B, C, and D are respectively used as the second objects for traversal allocation and optimization. For example, for the remaining 90 pieces of goods corresponding to the first object A, the second object A can load 5 of them when the loading rate is the maximum, and the remaining goods corresponding to the current object combination (A, A) are 85 pieces; the second object B can load 10 of them when the loading rate is the maximum, and the remaining goods corresponding to the current object combination (A, B) are 80 pieces; the second object C can load 12 of them when the loading rate is the maximum, and the remaining goods corresponding to the current object combination (A, C) are 78 pieces; the second object D can load 15 of them when the loading rate is the maximum, and the remaining goods corresponding to the current object combination (A, D) are 75 pieces. The process of secondary distribution for the first object B, the first object C and the first object D is similar and will not be repeated here. The current object combination after secondary distribution may include: (A, A), (A, B), (A, C), (A, D), (B, A), (B, B), (B, C), (B, D), (C, A), (C, B), (C, C), (C, D), (D, A), (D, B), (D, C) and (D, D). It should be noted that due to the limited number of goods and the order of goods distribution, different object arrangement orders in the object combination represent different goods distribution strategies. For example, the goods distribution strategies corresponding to (A, B) and (B, A) are completely different.

[0051] S140: Determine useless object combinations based on the current allocated quantity and the current object usage cost corresponding to each current object combination, and remove the useless object combinations.

[0052] The current allocated cargo volume may refer to the total amount of cargo that can be allocated by all objects in the current object combination. The current object usage cost may refer to the total usage cost of all objects in the current object combination. The useless object combination may refer to a useless current object combination, that is, a current object combination that ultimately cannot become an optimal object combination.

[0053] Specifically, the number of current object combinations obtained after the secondary distribution is large. If all current object combinations are traversed for the next distribution, the amount of calculation and the cost of calculation will be very high. In view of this, the current distribution volume and the current object usage cost corresponding to each two current object combinations can be compared to determine the useless object combinations that meet the preset useless conditions, and the useless object combinations are removed from all current traversal combinations, and only the useful object combinations that may eventually become the optimal object combinations are retained, so that the number of object combinations in the next distribution can be reduced, thereby greatly reducing the amount of distribution calculation and improving the efficiency of cargo distribution.

[0054] S150, performing next allocation based on the remaining goods corresponding to each current object combination after the removal and removing useless object combinations after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination.

[0055] Specifically, the third distribution can be performed based on the remaining goods corresponding to each current object combination after removal and the removal of useless object combinations after the third distribution according to the second distribution method described in steps S130-S140. For example, each object can be used as the third object, and based on the remaining goods corresponding to each current object combination, the goods distribution optimization is performed for each third object during the three distributions, and the remaining goods corresponding to each current object combination after the three distributions are determined. Based on the current distribution quantity and the current object usage cost corresponding to each current object combination, the useless object combination is determined and removed, and the fourth distribution is performed based on the remaining goods corresponding to each current object combination after removal and the removal of useless object combinations after the fourth distribution, until the remaining goods corresponding to each current object combination is 0, that is, the distribution ends when all goods are distributed. Since useless object combinations will be removed after each distribution starting from the second distribution, the number of object combinations traversed during each distribution can be reduced, and invalid calculations can be avoided, thereby greatly reducing the amount of distribution calculations and improving the efficiency of goods distribution.

[0056] For example, when traversing and allocating multiple objects each time, the maximum loading rate is used as the optimization goal, and as many goods as possible are allocated to a single object for loading, thereby achieving the optimal allocation and loading of a single object. The goods allocation process of each object at each allocation is independent of each other, so that multiple threads can be started for parallel execution, further improving the efficiency of goods allocation.

[0057] It should be noted that, since each object may appear in the optimal allocation combination during the first allocation, and different objects have different usage costs, it is impossible to determine the useless object combination after the first allocation, and it is necessary to start removing useless object combinations after the second allocation. The global optimum is obtained by using the local optimum method, thereby realizing dynamic programming solution.

[0058] S160: Determine a target object combination based on the current object usage cost corresponding to each current object combination after the allocation is completed, and allocate the goods to be allocated to the target objects for loading based on the target goods allocation strategy corresponding to each target object in the target object combination.

[0059] Among them, each current object combination after the allocation is completed can load all goods. For example, each object in each current object combination after the allocation is completed can be loaded with goods according to the cargo allocation strategy corresponding to the maximum loading rate. The target object combination can refer to the optimal object combination, such as the object combination with the lowest object use cost. The target object combination may include at least two objects. The target cargo allocation strategy corresponding to each target object in the target object combination is determined during each allocation process. It should be noted that this embodiment only limits the type of objects, and does not limit the number of each object, that is, the number of objects of the same type in each object combination can be one or more.

[0060] Specifically, the current object usage costs corresponding to each current object combination after the allocation are completed can be compared, the optimal target object combination can be determined from all current object combinations, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, all cargo to be allocated can be allocated to the corresponding target objects for loading, thereby achieving reasonable allocation and loading of cargo for multiple objects.

[0061] Exemplarily, "determining the target object combination based on the current object usage cost corresponding to each current object combination after the allocation is completed" in S160 may include: comparing the current object usage cost corresponding to each current object combination after the allocation is completed, and determining the current object combination corresponding to the smallest current object usage cost as the target object combination.

[0062] Specifically, when minimizing the object usage cost is the optimization goal, the current object combination corresponding to the minimum current object usage cost can be determined as the target object combination, so that according to the target cargo allocation strategy corresponding to each target object in the target object combination, all cargoes can be allocated to all target objects for loading at the minimum object usage cost, and the loading rate of each target object can also be guaranteed to be the largest.

[0063] The technical solution of this embodiment is to traverse and allocate multiple objects each time the goods are allocated, specifically: based on multiple goods to be allocated, optimize the goods allocation for each first object in the first allocation, and determine the remaining goods corresponding to each first object after the first allocation; based on the remaining goods corresponding to each first object, optimize the goods allocation for each second object in the second allocation, and determine the remaining goods corresponding to each current object combination after the second allocation; based on the current allocated goods volume and the current object usage cost corresponding to each current object combination, determine the useless object combination in all current object combinations, and remove the useless object combination; based on the remaining goods corresponding to each current object combination after the removal, perform the next allocation and remove the useless object combination after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination. Based on the current object usage cost corresponding to each current object combination after the allocation is completed, the target object combination is determined, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, all cargo to be allocated is allocated to the corresponding target object for loading, thereby achieving reasonable allocation of cargo for multiple objects, and by removing useless object combinations, continued allocation can be performed only on the basis of useful current object combinations without traversing all object combinations, thereby greatly reducing the amount of allocation calculation and improving cargo allocation efficiency.

[0064] On the basis of the above technical solution, for each first object during the first allocation, based on multiple goods to be allocated, the first object is allocated goods and the loading rate is maximized to obtain the target cargo allocation strategy corresponding to the first object, which may include: based on a tree search method, size information of each cargo to be allocated and size information of a container for loading the cargo of the first object, the first object is allocated goods and the loading rate is maximized to obtain the target cargo allocation strategy corresponding to the first object.

[0065] Specifically, Figure 2As shown in the figure, the object is a vehicle, and the container for loading goods is a carriage. The tree search method is to use the goods to pile up into columns that can verify the horizontal and vertical directions of the carriage, and then fill them into the carriage. The tree search uses the structure of a binary tree, uses the left subtree to store the result of filling a horizontal column based on the current node, and uses the right subtree to store the result of filling a vertical column based on the current node, and returns the one with the largest loading rate among these two results. Using the structure of the binary tree, you can compare from bottom to top, and finally reach the root node, and the output is the allocation and packing strategy with the largest loading rate. Each horizontal and vertical column is formed by the accumulation of goods one by one, that is, each column is formed by the stacking of a single cargo from bottom to top. When generating each column, you can use the solution method of the knapsack problem to select the best way to form the column. By filling the remaining space in the carriage with a horizontal column or a vertical column, find the one with a higher loading rate from these two options, so that using the tree search method, under the constraints of the size information of each cargo to be allocated and the carriage size information of the first object, you can accurately obtain the target cargo allocation strategy when the loading rate of the first object is the highest.

[0066] For example, a tree search method can be used to maximize the loading rate at each allocation, and a target cargo allocation strategy with the highest loading rate at each allocation can be obtained, thereby ensuring the cargo allocation effect.

[0067] Figure 3 This is a flow chart of another cargo allocation method provided by an embodiment of the present invention. Based on the above embodiments, this embodiment further optimizes the step of "determining useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination". The explanations of the terms that are the same or corresponding to the above embodiments are not repeated here.

[0068] See also Figure 3 Another cargo distribution method provided in this embodiment specifically includes the following steps:

[0069] S310: Acquire multiple goods to be allocated and multiple objects for loading the goods, wherein the multiple objects are traversed and allocated each time.

[0070] S320: Based on the multiple goods to be allocated, optimize the goods allocation for each first object during the initial allocation, and determine the remaining goods corresponding to each first object after the initial allocation.

[0071] S330: Based on the remaining goods corresponding to each first object, optimize the goods allocation for each second object during the secondary allocation, and determine the remaining goods corresponding to each current object combination after the secondary allocation.

[0072] S340: Determine the current allocated quantity corresponding to each current object combination based on the allocated quantity corresponding to each object in each current object combination.

[0073] Specifically, for each current object combination, after the second allocation, the target cargo quantity that needs to be allocated and loaded for each object in the current object combination can be obtained based on the target cargo allocation strategy corresponding to each object in the current object combination, that is, the allocated cargo quantity, and the allocated cargo quantities corresponding to all objects are added together to obtain the current allocated cargo quantity corresponding to the current object combination.

[0074] S350: Determine the current object usage cost corresponding to each current object combination based on the usage cost corresponding to each object in each current object combination.

[0075] Specifically, for each current object combination, after the second allocation, the usage cost corresponding to each object in the current object combination may be added together to obtain the current object usage cost corresponding to the current object combination.

[0076] S360: Compare the current allocated quantities and the current object usage costs corresponding to every two current object combinations, and determine useless object combinations based on the comparison results.

[0077] Specifically, the current allocated quantities corresponding to each two current object combinations may be compared, and the current object usage costs corresponding to each two current object combinations may be compared, and a useless object combination that meets a preset useless condition may be determined based on the two comparison results.

[0078] Exemplarily, S360 may include: comparing a first currently allocated quantity corresponding to the first current object combination with a second currently allocated quantity corresponding to the second current object combination, and comparing a first current object usage cost corresponding to the first current object combination with a second current object usage cost corresponding to the second current object combination; if the first currently allocated quantity is less than or equal to the second currently allocated quantity, and the first current object usage cost is greater than or equal to the second current object usage cost, then determining that the first current object combination is a useless object combination.

[0079] Specifically, every two current object combinations are taken as the first current object combination and the second current object combination. If the first current allocated quantity of the first current object combination is less than or equal to the second current allocated quantity of the second current object combination, but the first current object use cost of the first current object combination is greater than or equal to the second current object use cost of the second current object combination, it indicates that the object use cost of the first current object combination is large but the allocated quantity is small. When minimizing the object use cost is the optimization goal, due to the existence of the second current object combination, the first current object combination cannot be the object combination with the minimum final object use cost, and thus the first current object combination can be determined as a useless object combination.

[0080] Exemplarily, each current object combination can be taken as the first current object combination, and each remaining current object combination can be taken as the second current object combination. As long as there is a second current object combination such that the first current allocated quantity of the first current object combination is less than or equal to the second current allocated quantity of the second current object combination, and the first current object usage cost of the first current object combination is greater than or equal to the second current object usage cost of the second current object combination, then the first current object combination can be determined to be a useless object combination.

[0081] S370: Remove useless object combinations, and perform next allocation based on the remaining goods corresponding to each current object combination after the removal and remove useless object combinations after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination.

[0082] S380: Determine a target object combination based on the current object usage cost corresponding to each current object combination after the allocation is completed, and allocate the goods to be allocated to the target objects for loading based on the target goods allocation strategy corresponding to each target object in the target object combination.

[0083] The technical solution of this embodiment compares the current allocated cargo volume and the current object usage cost corresponding to every two current object combinations after the secondary allocation, and can accurately determine the useless object combinations in all current object combinations based on the comparison results, and remove the useless object combinations, so that there is no need to traverse all object combinations each time allocation is performed, which greatly reduces the allocation calculation amount and improves the efficiency of cargo allocation.

[0084] The following is an embodiment of a cargo distribution device provided by an embodiment of the present invention. The device and the cargo distribution methods of the above embodiments belong to the same inventive concept. For details not described in detail in the embodiment of the cargo distribution device, reference can be made to the above embodiments of the cargo distribution method.

[0085] Figure 4This is a schematic diagram of the structure of a cargo distribution device provided by an embodiment of the present invention. This embodiment is applicable to the situation where all cargoes are reasonably distributed to multiple objects for loading. Figure 4 As shown, the device specifically includes: an information acquisition module 410, a first allocation module 420, a second allocation module 430, a useless combination removal module 440, a next allocation module 450 and a goods allocation module 460.

[0086] The information acquisition module 410 is used to acquire multiple goods to be allocated and multiple objects for loading goods, wherein the multiple objects are traversed and allocated each time; the first allocation module 420 is used to optimize the goods allocation for each first object in the first allocation based on the multiple goods to be allocated, and determine the remaining goods corresponding to each first object after the first allocation; the second allocation module 430 is used to optimize the goods allocation for each second object in the second allocation based on the remaining goods corresponding to each first object, and determine the remaining goods corresponding to each current object combination after the second allocation; the useless combination removal module 440 is used to optimize the goods allocation for each second object in the second allocation based on the remaining goods corresponding to each first object, and determine the remaining goods corresponding to each current object combination after the second allocation. The useless object combination is determined based on the current allocated cargo volume and the current object usage cost, and the useless object combination is removed; the next allocation module 450 is used to perform the next allocation based on the remaining cargo corresponding to each current object combination after the removal and remove the useless object combination after the next allocation, until the allocation is completed when there is no remaining cargo for each current object combination; the cargo allocation module 460 is used to determine the target object combination based on the current object usage cost corresponding to each current object combination after the allocation is completed, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, allocate the cargo to be allocated to the target object for loading.

[0087] The technical solution of this embodiment is to traverse and allocate multiple objects each time the goods are allocated, specifically: based on multiple goods to be allocated, optimize the goods allocation for each first object in the first allocation, and determine the remaining goods corresponding to each first object after the first allocation; based on the remaining goods corresponding to each first object, optimize the goods allocation for each second object in the second allocation, and determine the remaining goods corresponding to each current object combination after the second allocation; based on the current allocated goods volume and the current object usage cost corresponding to each current object combination, determine the useless object combination in all current object combinations, and remove the useless object combination; based on the remaining goods corresponding to each current object combination after the removal, perform the next allocation and remove the useless object combination after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination. Based on the current object usage cost corresponding to each current object combination after the allocation is completed, the target object combination is determined, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, all cargo to be allocated is allocated to the corresponding target object for loading, thereby achieving reasonable allocation of cargo for multiple objects, and by removing useless object combinations, continued allocation can be performed only on the basis of useful current object combinations without traversing all object combinations, thereby greatly reducing the amount of allocation calculation and improving cargo allocation efficiency.

[0088] Optionally, the first allocation module 420 includes:

[0089] An allocation strategy determination unit, for each first object in the first allocation, based on a plurality of goods to be allocated, performs cargo allocation and maximizes the loading rate on the first object, and obtains a target cargo allocation strategy corresponding to the first object;

[0090] The remaining goods determining unit is used to determine the remaining goods corresponding to the first object after the first allocation based on the target goods allocation strategy corresponding to the first object.

[0091] Optionally, the allocation strategy determination unit is specifically configured to:

[0092] Based on the tree search method, the size information of each cargo to be allocated and the size information of the container for loading the cargo of the first object, the cargo allocation and loading rate of the first object are maximized to obtain the target cargo allocation strategy corresponding to the first object.

[0093] Optionally, the secondary distribution module 430 is specifically configured to:

[0094] For each first object during the initial allocation and each second object during the secondary allocation, based on the remaining goods corresponding to the first object, the goods allocation and loading rate of the second object are maximized to obtain the target goods allocation strategy corresponding to the second object; based on the remaining goods corresponding to the first object and the target goods allocation strategy corresponding to the second object, the remaining goods corresponding to the current object combination after the secondary allocation are determined, wherein the current object combination includes the first object and the second object.

[0095] Optionally, the useless combination removal module 440 includes:

[0096] A current allocated quantity determination unit, configured to determine a current allocated quantity corresponding to each current object combination based on the allocated quantity corresponding to each object in each current object combination;

[0097] A current object usage cost determining unit, configured to determine a current object usage cost corresponding to each current object combination based on a usage cost corresponding to each object in each current object combination;

[0098] The useless object combination determining unit is used to compare the current allocated cargo volume and the current object use cost corresponding to each two current object combinations, and determine the useless object combination based on the comparison result.

[0099] Optionally, the useless object combination determining unit is specifically used to:

[0100] Compare the first currently allocated quantity corresponding to the first current object combination with the second currently allocated quantity corresponding to the second current object combination, and compare the first current object usage cost corresponding to the first current object combination with the second current object usage cost corresponding to the second current object combination; if the first currently allocated quantity is less than or equal to the second currently allocated quantity, and the first current object usage cost is greater than or equal to the second current object usage cost, then determine that the first current object combination is a useless object combination.

[0101] Optionally, the goods allocation module 460 is specifically configured to compare the current object usage costs corresponding to each current object combination after the allocation is completed, and determine the current object combination corresponding to the minimum current object usage cost as the target object combination.

[0102] The cargo distribution device provided in the embodiment of the present invention can execute the cargo distribution method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects for executing the cargo distribution method.

[0103] It is worth noting that in the embodiment of the above-mentioned cargo distribution device, the various units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the present invention.

[0104] Figure 5 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. Figure 5 A block diagram of an exemplary electronic device 12 suitable for use in implementing embodiments of the present invention is shown. Figure 5 The electronic device 12 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0105] like Figure 5 As shown, the electronic device 12 is in the form of a general purpose computing device. The components of the electronic device 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 that connects various system components (including the system memory 28 and the processing unit 16).

[0106] Bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor or a local bus using any of a variety of bus architectures. By way of example, these architectures include, but are not limited to, an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MAC) bus, an Enhanced ISA bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnect (PCI) bus.

[0107] The electronic device 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the electronic device 12, including volatile and non-volatile media, removable and non-removable media.

[0108] The system memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The electronic device 12 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media ( Figure 5 not shown, usually called a "hard drive"). Although Figure 5Not shown in the figure, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, a DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 18 via one or more data medium interfaces. The system memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present invention.

[0109] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in system memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. Program modules 42 generally perform the functions and / or methods of the embodiments described herein.

[0110] The electronic device 12 may also communicate with one or more external devices 14 (e.g., keyboards, pointing devices, displays 24, etc.), may communicate with one or more devices that enable a user to interact with the electronic device 12, and / or may communicate with any device that enables the electronic device 12 to communicate with one or more other computing devices (e.g., network cards, modems, etc.). Such communication may be performed via an input / output (I / O) interface 22. Furthermore, the electronic device 12 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 20. As shown, the network adapter 20 communicates with other modules of the electronic device 12 via a bus 18. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0111] The processing unit 16 executes various functional applications and data processing by running the program stored in the system memory 28, for example, implementing a cargo distribution method provided by the embodiment of the present invention, the method comprising:

[0112] Acquire multiple goods to be allocated and multiple objects for loading the goods, wherein the multiple objects are traversed and allocated each time;

[0113] Based on the multiple goods to be allocated, optimizing the allocation of goods for each first object during the initial allocation, and determining the remaining goods corresponding to each first object after the initial allocation;

[0114] Based on the remaining goods corresponding to each first object, optimizing the goods allocation for each second object during the secondary allocation, and determining the remaining goods corresponding to each current object combination after the secondary allocation;

[0115] Determine useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination, and remove the useless object combinations;

[0116] The next allocation is performed based on the remaining goods corresponding to each current object combination after the removal and the removal of useless object combinations after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination;

[0117] Based on the current object usage cost corresponding to each current object combination after the allocation is completed, a target object combination is determined, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, the cargo to be allocated is allocated to the target object for loading.

[0118] Of course, those skilled in the art can understand that the processor can also implement the technical solution of the cargo distribution method provided by any embodiment of the present invention.

[0119] This embodiment provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the steps of the cargo distribution method provided in any embodiment of the present invention are implemented. The method includes:

[0120] Acquire multiple goods to be allocated and multiple objects for loading the goods, wherein the multiple objects are traversed and allocated each time;

[0121] Based on the multiple goods to be allocated, optimizing the allocation of goods for each first object during the initial allocation, and determining the remaining goods corresponding to each first object after the initial allocation;

[0122] Based on the remaining goods corresponding to each first object, optimizing the goods allocation for each second object during the secondary allocation, and determining the remaining goods corresponding to each current object combination after the secondary allocation;

[0123] Determine useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination, and remove the useless object combinations;

[0124] The next allocation is performed based on the remaining goods corresponding to each current object combination after the removal and the removal of useless object combinations after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination;

[0125] Based on the current object usage cost corresponding to each current object combination after the allocation is completed, a target object combination is determined, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, the cargo to be allocated is allocated to the target object for loading.

[0126] The computer storage medium of the embodiment of the present invention can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this document, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0127] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0128] The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0129] Computer program code for performing the operations of the present invention may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0130] It should be understood by those skilled in the art that the modules or steps of the present invention described above can be implemented by a general-purpose computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, optionally, they can be implemented by a program code executable by a computer device, so that they can be stored in a storage device and executed by the computing device, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0131] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments described herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A cargo distribution method, characterized in that: include: Acquire multiple goods to be allocated and multiple objects for loading the goods, wherein the multiple objects are traversed and allocated each time; Based on the multiple goods to be allocated, optimizing the allocation of goods for each first object during the initial allocation, and determining the remaining goods corresponding to each first object after the initial allocation; Based on the remaining goods corresponding to each first object, optimizing the goods allocation for each second object during the secondary allocation, and determining the remaining goods corresponding to each current object combination after the secondary allocation; Determine useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination, and remove the useless object combinations; The next allocation is performed based on the remaining goods corresponding to each current object combination after the removal and the removal of useless object combinations after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination; Based on the current object usage cost corresponding to each current object combination after the allocation is completed, a target object combination is determined, and based on the target cargo allocation strategy corresponding to each target object in the target object combination, the cargo to be allocated is allocated to the target object for loading.

2. The method according to claim 1, characterized in that The step of optimizing the allocation of goods to each first object during the initial allocation based on the plurality of goods to be allocated, and determining the remaining goods corresponding to each first object after the initial allocation, includes: For each first object during the initial allocation, based on multiple goods to be allocated, the first object is allocated goods and the loading rate is maximized to obtain a target goods allocation strategy corresponding to the first object; Based on the target goods allocation strategy corresponding to the first object, remaining goods corresponding to the first object after the first allocation are determined.

3. The method according to claim 2, characterized in that The method of allocating goods and maximizing the loading rate of the first object based on the multiple goods to be allocated to obtain a target goods allocation strategy corresponding to the first object includes: Based on the tree search method, the size information of each cargo to be allocated and the size information of the container for loading the cargo of the first object, the cargo allocation and loading rate of the first object are maximized to obtain the target cargo allocation strategy corresponding to the first object.

4. The method according to claim 1, characterized in that: The step of optimizing the goods allocation for each second object during secondary allocation based on the remaining goods corresponding to each first object, and determining the remaining goods corresponding to each current object combination after secondary allocation, includes: For each first object in the first allocation and each second object in the second allocation, based on the remaining goods corresponding to the first object, the goods allocation and loading rate maximization are performed on the second object to obtain the target goods allocation strategy corresponding to the second object; Based on the remaining goods corresponding to the first object and the target goods corresponding to the second object allocation strategy, the remaining goods corresponding to the current object combination after secondary allocation are determined, wherein the current object combination includes the first object and the second object.

5. The method according to claim 1, characterized in that The determining of useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination includes: Determine the current allocated quantity corresponding to each current object combination based on the allocated quantity corresponding to each object in each current object combination; Determine the current object usage cost corresponding to each current object combination based on the usage cost corresponding to each object in each current object combination; The current allocated quantities and the current object usage costs corresponding to every two current object combinations are compared, and useless object combinations are determined based on the comparison results.

6. The method according to claim 5, characterized in that The step of comparing the current allocated cargo volume and the current object usage cost corresponding to each combination of two current objects, and determining the useless object combination based on the comparison result, includes: Compare a first current allocated quantity corresponding to the first current object combination with a second current allocated quantity corresponding to the second current object combination, and compare a first current object usage cost corresponding to the first current object combination with a second current object usage cost corresponding to the second current object combination; If the first current allocated quantity is less than or equal to the second current allocated quantity, and the first current object usage cost is greater than or equal to the second current object usage cost, the first current object combination is determined to be a useless object combination.

7. The method according to claim 1, characterized in that The determining of the target object combination based on the current object usage cost corresponding to each current object combination after the allocation is completed includes: The current object usage costs corresponding to each current object combination after the allocation are completed are compared, and the current object combination corresponding to the minimum current object usage cost is determined as the target object combination.

8. A cargo distribution device, characterized in that: include: An information acquisition module, used for acquiring a plurality of goods to be allocated and a plurality of objects for loading the goods, wherein the plurality of objects are traversed and allocated each time; A first allocation module, used to optimize the allocation of goods to each first object during the first allocation based on multiple goods to be allocated, and determine the remaining goods corresponding to each first object after the first allocation; A secondary distribution module, configured to optimize the distribution of goods for each second object during secondary distribution based on the remaining goods corresponding to each first object, and determine the remaining goods corresponding to each current object combination after secondary distribution; A useless combination removal module, used to determine useless object combinations based on the current allocated cargo volume and the current object usage cost corresponding to each current object combination, and remove the useless object combinations; The next allocation module is used to perform the next allocation based on the remaining goods corresponding to each current object combination after the removal and remove the useless object combination after the next allocation, until the allocation is completed when there is no remaining goods for each current object combination; The cargo allocation module is used to determine the target object combination based on the current object usage cost corresponding to each current object combination after the allocation is completed, and allocate the cargo to be allocated to the target object for loading based on the target cargo allocation strategy corresponding to each target object in the target object combination.

9. An electronic device, characterized in that: The electronic device comprises: one or more processors; A memory for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the cargo distribution method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the cargo distribution method according to any one of claims 1 to 7 is implemented.

Images