Cage resource allocation method, device and storage medium

Abstract

The present application provides a cage resource allocation method, device and storage medium, the method comprising: receiving a cage resource allocation request sent by a business processing system; establishing an allocation path pool based on cage resource allocation information; deciding a target allocation strategy from the allocation path pool according to the cage resource allocation information, the allocation constraint conditions and the preset objective function, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and the allocation value of the vehicle adding task corresponding to each target allocation path, and the preset objective function is the objective function of the difference between the demand and the allocation amount; and performing cage resource allocation according to at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path. The embodiment of the present application can make cage resources between various business points mutually allocated, and effectively prevent the cage resource imbalance phenomenon between various business points.

Description

Technical Field

[0001] The present application relates to the field of logistics technology, and in particular to a cage resource allocation method, device and storage medium. Background Art

[0002] In the logistics industry, limited resources need to be allocated between business points. For example, trucks are used for land transportation. The container for express delivery loaded in the truck is a cage, which is a loading container with GPS positioning function and can ensure the safety of express delivery. The cages are circulated between various business points, and the daily departure and arrival of the business point will carry a certain number of cages. For large business points, the number of cages sent out is much greater than the number of cages arriving, and vice versa for small business points. The business point flow of cage resources determines the imbalance of cage resources between various business points at the business level.

[0003] Therefore, how to effectively prevent the occurrence of cage resource imbalance among various business points is an urgent problem to be solved in the current field of logistics technology. Summary of the invention

[0004] The present application provides a cage resource allocation method, device and storage medium, aiming to solve the problem of how to effectively prevent the occurrence of cage resource imbalance between business points.

[0005] In one aspect, the present application provides a cage resource allocation method, the method comprising:

[0006] receiving a cage resource allocation request sent by a business processing system, wherein the cage resource allocation request includes cage resource allocation information of a business processed by the business processing system;

[0007] Based on the cage resource allocation information, an allocation path pool is established, wherein the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, each of which corresponds to at least one allocation constraint condition;

[0008] According to the cage resource allocation information, the allocation constraint conditions and the preset objective function, a target allocation strategy is determined from the allocation path pool, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between a demand and an allocation amount;

[0009] Cage resources are allocated according to the at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0010] In a possible implementation of the present application, the cage resource allocation information includes inventory information of cage resources at each business point, output information of empty cabins corresponding to each business point after allocation, and configuration information of transport vehicles at each business point, wherein the empty cabin allocation is to allocate cage resources using empty cabins with existing transport capacity tasks; the target allocation strategy is decided from the allocation path pool according to the cage resource allocation information, the allocation constraint conditions and the preset objective function, including:

[0011] Determine the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool based on the inventory information of the cage resources and the configuration information of the transport vehicle;

[0012] Determine the allocation parameter values ​​of the preset objective function and the allocation constraint condition based on the inventory information of the cage resources, the output information and the number of vehicle adding tasks;

[0013] At least one target allocation path and an allocation value of the vehicle adding task corresponding to each target allocation path are determined from the allocation path pool based on the allocation parameter value, the allocation constraint condition and the preset objective function.

[0014] In a possible implementation of the present application, the at least one target allocation path determined from the allocation path pool based on the allocation parameter value, the allocation constraint condition and the preset objective function and the allocation value of the vehicle adding task corresponding to each target allocation path include:

[0015] Determine a first allocation parameter value of a business parameter corresponding to the allocatable constraint condition and a second allocation parameter value of a business parameter corresponding to the preset objective function;

[0016] Determining whether the allocation parameter value corresponding to the allocation constraint condition of each of the service points satisfies the allocation constraint condition;

[0017] If yes, determining a target transfer path from the transfer path pool;

[0018] The second allocation parameter value is input into the preset objective function to generate an allocation value of the vehicle adding task corresponding to each target allocation path.

[0019] In a possible implementation of the present application, the inventory information includes demand information of each business point for cage resources, and the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool is determined based on the inventory information of the cage resources and the configuration information of the transport vehicle, including:

[0020] Obtain demand information for cage resources;

[0021] Extracting the demand parameter value in the demand information;

[0022] Based on the configuration information of the transport vehicle, determining a minimum cage parameter value in the configuration information;

[0023] The demand parameter value is compared with the minimum cage loading parameter value to obtain the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool.

[0024] In a possible implementation of the present application, the method further includes:

[0025] Obtain the coding information of each business point;

[0026] Determine the target business point to be allocated based on the demand information and inventory information of the cage resources;

[0027] The demand information and the target service point are combined according to the coding information to obtain target service point statistical information.

[0028] In a possible implementation of the present application, the inventory information further includes safety inventory information and initial inventory information of cage resources at each business point, and the method further includes:

[0029] Read the output information to obtain the in and out information of cage resources of each service point within a preset period;

[0030] Based on the initial inventory information, the safety inventory information, and the in-and-out information, an allocatable business point and allocatable inventory information corresponding to the allocatable business point are determined.

[0031] In a possible implementation of the present application, establishing an allocation path pool based on the cage resource allocation information includes:

[0032] Obtain the geographic location information of each business point;

[0033] Based on the geographical location information, generating transfer route information between any two business points in each business point;

[0034] Cartesian product processing is performed on the allocation route information to obtain an allocation path pool.

[0035] On the other hand, the present application provides a cage resource allocation device, the device comprising:

[0036] A first receiving unit, configured to receive a cage resource allocation request sent by a service processing system, wherein the cage resource allocation request includes cage resource allocation information of a service processed by the service processing system;

[0037] A first establishing unit is configured to establish an allocation path pool based on the cage resource allocation information, wherein the allocation path pool is composed of at least one allocation path corresponding to different service information, and the allocation path includes a plurality of service points, and the service points correspond to at least one allocation constraint condition;

[0038] A first decision unit is used to decide a target allocation strategy from the allocation path pool according to the cage resource allocation information, the allocation constraint condition and a preset objective function; wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between a demand and an allocation amount;

[0039] A first execution unit, configured to allocate cage resources according to the at least one target allocation path and an allocation value of a vehicle adding task corresponding to each target allocation path;

[0040] The cage resource allocation information includes inventory information of cage resources at each business point, output information of empty cabins corresponding to each business point after allocation, and configuration information of transport vehicles at each business point, wherein the empty cabin allocation is to allocate cage resources using empty cabins with existing transport capacity tasks; the first decision unit specifically includes:

[0041] A first determining unit, configured to determine the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool based on the inventory information of the cage resources and the configuration information of the transport vehicle;

[0042] A second determining unit, configured to determine the allocation parameter values ​​of the preset objective function and the allocation constraint condition based on the inventory information of the cage resources, the output information, and the number of vehicle adding tasks;

[0043] The third determining unit is configured to determine at least one target allocation path and an allocation value of the vehicle adding task corresponding to each target allocation path from the allocation path pool based on the allocation parameter value, the allocation constraint condition and the preset objective function.

[0044] In a possible implementation of the present application, the third determining unit is specifically configured to:

[0045] Determine a first allocation parameter value of a business parameter corresponding to the allocatable constraint condition and a second allocation parameter value of a business parameter corresponding to the preset objective function;

[0046] Determining whether the allocation parameter value corresponding to the allocation constraint condition of each of the service points satisfies the allocation constraint condition;

[0047] If yes, determining a target transfer path from the transfer path pool;

[0048] The second allocation parameter value is input into the preset objective function to generate an allocation value of the vehicle adding task corresponding to each target allocation path.

[0049] In a possible implementation of the present application, the inventory information includes demand information of each business point for cage resources, and the first determining unit is specifically used to:

[0050] Obtain demand information for cage resources;

[0051] Extracting the demand parameter value in the demand information;

[0052] Based on the configuration information of the transport vehicle, determining a minimum cage parameter value in the configuration information;

[0053] The demand parameter value is compared with the minimum cage loading parameter value to obtain the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool.

[0054] In a possible implementation of the present application, the device further includes:

[0055] Obtain the coding information of each business point;

[0056] Determine the target business point to be allocated based on the demand information and inventory information of the cage resources;

[0057] The demand information and the target service point are combined according to the coding information to obtain target service point statistical information.

[0058] In a possible implementation of the present application, the inventory information further includes safety inventory information and initial inventory information of cage resources at each business point, and the device further includes:

[0059] Read the output information to obtain the in and out information of cage resources of each service point within a preset period;

[0060] Based on the initial inventory information, the safety inventory information, and the in-and-out information, an allocatable business point and allocatable inventory information corresponding to the allocatable business point are determined.

[0061] In a possible implementation of the present application, the first establishing unit is specifically configured to:

[0062] Obtain the geographic location information of each business point;

[0063] Based on the geographical location information, generating transfer route information between any two business points in each business point;

[0064] Cartesian product processing is performed on the allocation route information to obtain an allocation path pool.

[0065] On the other hand, the present application also provides a computer device, the computer device comprising:

[0066] one or more processors;

[0067] Memory; and

[0068] One or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the processor to implement the cage resource allocation method.

[0069] On the other hand, the present application further provides a computer-readable storage medium on which a computer program is stored. The computer program is loaded by a processor to execute the steps in the cage resource allocation method.

[0070] In the present application, a cage resource allocation request sent by a business processing system is received, and the cage resource allocation request includes cage resource allocation information of the business processed by the business processing system; based on the cage resource allocation information, an allocation path pool is established, and the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, and each business point corresponds to at least one allocatable constraint condition; according to the cage resource allocation information, the allocatable constraint condition and the preset objective function, a target allocation strategy is determined from the allocation path pool, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of the difference between demand and allocation amount; cage resource allocation is performed according to at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path, so that cage resources between various business points can be allocated to each other, and the cage resource imbalance between various business points can be effectively prevented. BRIEF DESCRIPTION OF THE DRAWINGS

[0071] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0072] Figure 1 is a scenario diagram of a cage resource allocation system provided in an embodiment of the present application;

[0073] Figure 2 It is a schematic diagram of an embodiment of the cage resource allocation method provided in the embodiments of the present application;

[0074] Figure 3 This is a flowchart of an embodiment of step 203 in the embodiment of the present application;

[0075] Figure 4 This is a flowchart of an embodiment of step 303 in the embodiment of the present application;

[0076] Figure 5 This is another example flow chart of the cage resource allocation method in the embodiment of the present application;

[0077] Figure 6 This is another example flow chart of the cage resource allocation method in the embodiment of the present application;

[0078] Figure 7 This is a flowchart of an embodiment of step 202 in the embodiment of the present application;

[0079] Figure 8 It is a schematic diagram of the structure of an embodiment of a cage resource allocation device provided in an embodiment of the present application;

[0080] Fig. 9 It is a schematic diagram of the structure of an embodiment of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0081] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of this application.

[0082] In the description of the present application, it should be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the accompanying drawings, which are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present application. In addition, the terms "first" and "second" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the said features. In the description of the present application, the meaning of "multiple" is two or more, unless otherwise clearly and specifically defined.

[0083] In this application, the word "exemplary" is used to mean "used as an example, illustration, or description." Any embodiment described in this application as "exemplary" is not necessarily to be construed as being preferred or advantageous over other embodiments. The following description is given to enable any technician in the field to implement and use the present application. In the following description, details are listed for the purpose of explanation. It should be understood that a person of ordinary skill in the art can recognize that the present application can be implemented without using these specific details. In other instances, well-known structures and processes will not be elaborated in detail to avoid obscuring the description of the present application with unnecessary details. Therefore, the present application is not intended to be limited to the embodiments shown, but is consistent with the widest scope consistent with the principles and features disclosed in the present application.

[0084] The embodiments of the present application provide a cage resource allocation method, device, and storage medium, which are described in detail below.

[0085] like Figure 1 As shown, Figure 1 Schematic diagram of a cage resource allocation system provided in an embodiment of the present application. The cage resource allocation system may include multiple terminals 100 and servers 200. The terminals 100 and the servers 200 are connected via a network. The server 200 is integrated with a cage resource allocation device. Figure 1 The terminal 100 can access the server 200.

[0086] In the embodiment of the present application, the server 200 is mainly used to receive a cage resource allocation request sent by a business processing system, the cage resource allocation request including cage resource allocation information of the business processed by the business processing system; based on the cage resource allocation information, an allocation path pool is established, the allocation path pool is composed of at least one allocation path corresponding to different business information, the allocation path includes multiple business points, and each business point corresponds to at least one allocatable constraint condition; according to the cage resource allocation information, the allocatable constraint condition and the preset objective function, a target allocation strategy is determined from the allocation path pool, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of the difference between demand and allocation amount; cage resource allocation is performed according to at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0087] In the embodiment of the present application, the server 200 can be an independent server, or a server network or server cluster composed of servers, such as the server 200 described in the embodiment of the present application, which includes but is not limited to a computer, a network terminal, a single network server, a plurality of network server sets or a cloud server composed of a plurality of servers. Wherein, the cloud server is composed of a large number of computers or network servers based on cloud computing (Cloud Computing). In the embodiment of the present application, communication between the server and the terminal can be achieved by any communication method, including but not limited to, mobile communications based on the third generation partnership project (3rd Generation Partnership Project, 3GPP), long term evolution (Long Term Evolution, LTE), Worldwide Interoperability for Microwave Access (Worldwide Interoperability for Microwave Access, WiMAX), or computer network communications based on TCP / IP protocol suite (TCP / IP Protocol Suite, TCP / IP), user datagram protocol (User Datagram Protocol, UDP), etc.

[0088] It is to be understood that the terminal 100 used in the embodiments of the present application may be a device including both receiving and transmitting hardware, that is, a device having receiving and transmitting hardware capable of performing two-way communication on a two-way communication link. Such a terminal may include: a cellular or other communication device having a single-line display or a multi-line display or a cellular or other communication device without a multi-line display. The specific terminal 100 may be a desktop terminal or a mobile terminal, and the terminal 100 may also be one of a mobile phone, a tablet computer, a laptop computer, etc.

[0089] Those skilled in the art will understand that Figure 1 The application environment shown in the figure is only one application scenario of the present application solution and does not constitute a limitation on the application scenario of the present application solution. Other application environments may also include Figure 1 More or fewer terminals, or server network connection relationships shown in, for example Figure 1 Only one server and two terminals are shown in the figure. It is understandable that the cage resource allocation system may also include one or more other servers, and / or one or more terminals connected to the server network, which is not specifically limited here.

[0090] In addition, if Figure 1 As shown, the cage resource allocation system may further include a memory 300 for storing data, such as user cage resource data and cage resource allocation data, for example, cage resource allocation data when the cage resource allocation system is running.

[0091] It should be noted that Figure 1 The scenario diagram of the cage resource allocation system shown is only an example. The cage resource allocation system and scenario described in the embodiment of the present application are intended to more clearly illustrate the technical solution of the embodiment of the present application, and do not constitute a limitation on the technical solution provided by the embodiment of the present application. Ordinary technicians in this field can know that with the evolution of the cage resource allocation system and the emergence of new business scenarios, the technical solution provided by the embodiment of the present application is also applicable to similar technical problems.

[0092] Next, a cage resource allocation method provided in an embodiment of the present application is introduced.

[0093] In the embodiment of the cage resource allocation method of the present application embodiment, a cage resource allocation device is used as an execution subject. For the sake of simplicity and convenience of description, the execution subject will be omitted in the subsequent method embodiments. The cage resource allocation device is applied to a computer device. The method includes: receiving a cage resource allocation request sent by a business processing system, the cage resource allocation request includes cage resource allocation information of a business processed by the business processing system; based on the cage resource allocation information, establishing an allocation path pool, the allocation path pool is composed of at least one allocation path corresponding to different business information, the allocation path includes multiple business points, and each business point corresponds to at least one allocatable constraint condition; according to the cage resource allocation information, the allocatable constraint condition and the preset objective function, deciding a target allocation strategy from the allocation path pool, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of the difference between demand and allocation amount; and performing cage resource allocation according to at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0094] See also Figures 2 to 9 , Figure 2 201 to 204. FIG. 202 is a flow chart of an embodiment of a cage resource allocation method provided in an embodiment of the present application. The cage resource allocation method specifically includes steps 201 to 204.

[0095] 201. Receive a cage resource allocation request sent by a business processing system.

[0096] The cage resource allocation request includes cage resource allocation information of the service processed by the service processing system. The cage resource allocation request is request information sent by a service point that has a demand for cage resources.

[0097] The cage resource allocation information may include the inventory information of cage resources at each business point, the output information of the empty cabins corresponding to each business point after allocation, and the configuration information of the transport vehicles at each business point. The inventory information of cage resources includes the demand information of each business point for cage resources, the safety inventory information of each business point for cage resources, and the initial inventory information. The safety inventory information is set by each business point based on its own use of cage resources to ensure that the business point has enough cage resources to use within a preset period, and its safety inventory information can be replaced manually. The initial inventory information corresponds to the current actual inventory information.

[0098] It should be noted that, since this application is based on the fact that the traditional allocation scheme still cannot meet the demand of each business point for cage resources, the empty cabin allocation refers to the traditional allocation method adopted. Specifically, the empty cabin allocation refers to the allocation of cage resources by the empty cabin of the existing transportation task. The output information after the empty cabin allocation includes the cage resource allocation data of the cage resource allocation by the empty cabin of the existing transportation task, as shown in Table 1:

[0099] Table 1:

[0100]

[0101] Among them, the output data may include cage resource call-out information and call-in information. Specifically, the call-out information may be defined as including call-out empty cage information and call-out full cage information based on the usage of cage resources, such as unloaded goods and loaded goods. Similarly, the call-in information may include call-in empty cage information and call-in full cage information.

[0102] 202. Based on the cage resource allocation information, establish an allocation path pool.

[0103] The allocation path pool is composed of at least one allocation path corresponding to different service information, and the allocation path includes a plurality of service points, each of which corresponds to at least one allocation constraint condition.

[0104] The transfer path pool refers to the sum of all paths generated by each business point to non-business points.

[0105] How to establish the allocation path pool has been described in detail in the following embodiments and will not be repeated here.

[0106] 203. According to the cage resource allocation information, the allocation constraints and the preset objective function, a target allocation strategy is determined from the allocation path pool.

[0107] The target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between demand and allocation amount.

[0108] The target transfer path is a target transfer path confirmed from the transfer path pool after screening, and the transfer path includes an outgoing business point and an incoming business point corresponding to the outgoing business point.

[0109] 204. Allocate cage resources according to at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0110] In the present application, a cage resource allocation request sent by a business processing system is received, and the cage resource allocation request includes business information of the business processed by the business processing system; based on the business information, an allocation path pool is established, and the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, and the business point corresponds to at least one constraint condition; according to the business information, the constraint condition and the preset objective function, a target allocation strategy is determined from the allocation path pool; according to the target allocation strategy, corresponding cage resource allocation processing is performed, so that cage resources between various business points can be allocated to each other, and the cage resource imbalance between various business points can be effectively prevented.

[0111] In some embodiments of the present application, Figure 3 As shown, Figure 3 It is a flow chart of an embodiment of step 203 in the embodiment of the present application, wherein the cage resource allocation information includes the inventory information of each business point for cage resources, the output information of the empty cabins corresponding to each business point after allocation, and the configuration information of the transport vehicles of each business point, wherein the empty cabin allocation is to allocate cage resources using empty cabins with existing transportation tasks; the target allocation strategy is decided from the allocation path pool based on the resource allocation information, the allocation constraints and the preset objective function, specifically including steps 301, 302 and 303.

[0112] 301. Based on the inventory information of cage resources and the configuration information of transport vehicles, determine the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool.

[0113] The inventory information includes the demand information of each business point for cage resources. The configuration information of the transport vehicle may include different models, the loading capacity information of cage resources corresponding to different models, and the per-kilometer transportation cost information corresponding to different models, as shown in Table 2:

[0114] Table 2:

[0115] Model Minimum number of cages Maximum number of cages cost 7 20 42 5 14 43 54 6 30 67 84 7

[0116] Specifically, how to determine the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool based on the inventory information of the cage resources and the configuration information of the transport vehicle may include the following method.

[0117] First, obtain the demand information for cage resources. It should be noted that the demand information needs to be determined based on the gap information of each business point. The gap information is calculated based on other data in the table. Gap information = demand + safety stock inventory - (inventory + full cages transferred in + empty cages transferred in - empty cages transferred out). When the gap information is a positive number, it can be determined that the corresponding business point has a positive demand for cage resources, that is, the gap information corresponds to the demand information for cage resources. Then extract the demand parameter value in the demand information. Then, based on the configuration information of the transport vehicle, determine the minimum cage loading parameter value in the configuration information. Finally, compare the demand parameter value with the minimum number of cages to obtain the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool. As shown in Table 3:

[0118] Table 3:

[0119] issue arrive distance Line restrictions Minimum cage Maximum cage Model Task No. 010W 010X 9.35951 30 20 42 7 010R_010X_7_0 010W 010X 9.26739 30 20 42 7 010R_010X_7_1 010W 010X 9.26739 30 20 42 7 010R_010X_7_2

[0120] It should be noted that, in order to improve the accuracy of allocation, the cage resource allocation data may also include restrictions on vehicle types between business points. For example, the unloading requirement of business point A only allows medium-sized vehicles and below to be unloaded, as shown in Table 4:

[0121] Table 4:

[0122] Issue business point Arrival at business point Spherical distance Loading restrictions Unloading restrictions 010W 010X 9.35951 30 30 010WE 010X 9.26739 30 30 010WB 010X 43.98413 30 30 010W 010WB 53.32068 30 30 010WE 010WB 53.22979 30 30

[0123] Among them, according to the path between the business points (the most complete path for mutual transportation between the business points is obtained by the spherical distance table), the loading and unloading restrictions of the business points are matched, and the paths that meet the loading and unloading restrictions are screened out, that is, the departure point must be less than the maximum loading vehicle model restriction, and the arrival point must meet the maximum unloading vehicle model restriction.

[0124] 302. Based on the inventory information, output information and the number of vehicle adding tasks of the cage resources, determine the allocation parameter values ​​of the preset objective function and the allocation constraint conditions.

[0125] Among them, the preset objective function and the allocable constraint conditions include at least one allocation parameter value, and the inventory information of the corresponding cage resources in each business point, the output information and the allocation parameter value corresponding to the number of vehicle adding tasks are read.

[0126] 303. Based on the allocation parameter value, the allocation constraint condition and the preset objective function, determine at least one target allocation path from the allocation path pool and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0127] The transferable constraint conditions include at least one of the following:

[0128] The first constraint is:

[0129]

[0130] Second constraint:

[0131]

[0132] The third constraint is:

[0133]

[0134] The fourth constraint is:

[0135]

[0136] The fifth constraint is:

[0137]

[0138] Preset objective function:

[0139] Minimize the difference between demand and allocation and keep costs low.

[0140]

[0141] in:

[0142] Decision variables

[0143] e i : The number of empty cages allocated by path task i, 0≤e i ≤Z, where Z can be adjusted according to actual needs, for example, Z is 84.

[0144] l j : The logical cage number of transfer field j. When the cages are insufficient, the transfer field adds the cage number. The logical cage number can be used to report errors.

[0145] Among them, I represents the vehicle allocation task, J represents the business point, STOCK j Indicates the inventory at the business point, EO j Indicates the number of empty cabins transferred out of the business point, FO j Indicates the number of full cages at the business point, SAFE_STOCK j Indicates the safety stock of the business point, EMPTYSPAEC i Indicates the number of cages that can be loaded for transfer task i, DEMAND j Indicates the demand of the business point (the demand for additional vehicles), COST irepresents the cost of task i, TROLLEY_ON_ROAD j Indicates the cage truck in transit at the business point, EMPTY_OUT j Indicates the number of cages transferred out of empty warehouse at the business point, FULL_OUT j Indicates the number of full cages sent out by the business point.

[0146] Among them, according to the above data, the allocation constraints, and the preset objective function, the gurobi solver (or cplex solver, or other solvers, different solvers take different time to solve) can be used to solve the model and obtain the final model output. This embodiment uses an integer programming model to calculate the cage resources that need to be allocated for each task. As shown in Table 5 below:

[0147] Table 5:

[0148]

[0149] In some embodiments of the present application, Figure 4 As shown, Figure 4 It is a flowchart of an embodiment of step 303 in the embodiment of the present application, which specifically includes steps 401, 402, 403 and 404, based on the allocation parameter value, the allocation constraint condition and the preset objective function, determining at least one target allocation path from the allocation path pool and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0150] 401. Determine a first allocation parameter value of a business parameter corresponding to an allocatable constraint condition and a second allocation parameter value of a business parameter corresponding to a preset objective function.

[0151] The first allocation parameter value corresponds to the allocation constraint, such as the five allocation constraints in step 303, each of which corresponds to multiple allocation parameters. The second allocation parameter value corresponds to the preset objective function, such as the multiple allocation parameters included in the preset objective function in step 303.

[0152] 402. Determine whether the allocation parameter value corresponding to the allocation constraint condition of each business point satisfies the allocation constraint condition.

[0153] Specifically, the target allocation path is determined based on the allocation constraints. According to the constraints in step 303, the constraints have restrictions on the cage resource allocation information corresponding to each business point. It can be done only when all the restrictions are met. For example, constraint one requires that each business point still meets its safety stock after completing the cage resource allocation.

[0154] 403. If yes, determine the target transfer path from the transfer path pool.

[0155] That is, when the allocation parameter value corresponding to the allocation constraint condition of each of the service points satisfies the allocation constraint condition, the target allocation path can be determined from the allocation path pool.

[0156] 404. Input the second allocation parameter value into a preset objective function to generate an allocation value of the vehicle adding task corresponding to each target allocation path.

[0157] The second allocation parameter value may be input into a preset objective function, and the model may be solved using a gurobi solver (or a cplex solver, or other solvers, and different solvers may take different amounts of time to solve) to obtain a final model output.

[0158] In some embodiments of the present application, Figure 5 As shown, Figure 5 50 is a flow chart of another embodiment of the cage resource allocation method in the embodiment of the present application. The method specifically includes step 501, step 502 and step 503.

[0159] 501. Obtain coding information of each business point.

[0160] The coding information of the service point is the identification information of each service point, and the coding information can be directly retrieved from the service processing system.

[0161] 502. Based on the demand information and inventory information of cage resources, determine the target business point that needs to be allocated.

[0162] It should be noted that the demand information needs to be determined based on the gap information of each business point. The gap information is calculated based on other data in the table. Gap information = demand + safety stock inventory - (inventory + full cages transferred in + empty cages transferred in - empty cages transferred out). When the gap information is a positive number, it can be determined that the corresponding business point has a positive demand for cage resources, that is, the gap information corresponds to the demand information for cage resources, thereby determining the target business point that needs to be transferred.

[0163] 503. According to the coding information, the demand information and the target business point are combined and processed to obtain statistical information of the target business point.

[0164] As shown in Table 6:

[0165] Business Points need Available Stock 010W 0 423 010WE 0 300 010WB 0 0 (-40, negative numbers are replaced by 0) 010X 20 0 (-77, negative numbers are replaced by 0)

[0166] In some embodiments of the present application, Figure 6 As shown, Figure 6It is another embodiment flow chart of the cage resource allocation method in the embodiment of the present application, wherein the inventory information also includes safety inventory information and initial inventory information for cage resources at each business point, and the method specifically also includes step 601 and step 602.

[0167] 601. Read the output information to obtain the in and out information of the cage resources of each business point within a preset period.

[0168] Specifically, the output information is shown in Table 1:

[0169] The preset period may be one day or two days. Specifically, it may be determined according to the cage resource usage of the business point. For example, when the cage resource usage frequency of the business point is very high, the preset period may be set to one day or half a day. The cage resource in-and-out information may include cage resource call-out information and call-in information. Specifically, the call-out information may include call-out empty cage information and call-out full cage information according to the cage resource usage, such as unloaded goods and loaded goods. Similarly, the call-in information may include call-in empty cage information and call-in full cage information.

[0170] It should be noted that the initial inventory may also include in-transit cage resources, which are cage resources that have not yet arrived at the business point but have left the corresponding cage resources in transit at the departure business point.

[0171] 602. Based on the initial inventory information, the safety inventory information, and the in / out information, determine the allocatable business points and the allocatable inventory information corresponding to the allocatable business points.

[0172] Among them, for the sake of safety, the transferable inventory information = initial inventory - safety inventory - transfer out full cages - transfer out empty cages. And the transferable business points are determined by calculating the gap information. The gap information is calculated based on other data in the table. Gap information = demand + safety inventory - (inventory + transfer in full cages + transfer in empty cages - transfer out empty cages). When the gap information is negative, it can be determined that the corresponding business point has a negative demand for cage resources, that is, the business point with a negative gap information is an transferable business point.

[0173] In some embodiments of the present application, Figure 7 As shown, Figure 7 It is a flowchart of an embodiment of step 202 in the embodiment of the present application, wherein the establishment of an allocation path pool based on the business information specifically includes steps 701, 702, and 703.

[0174] 701. Obtain geographic location information of each business point.

[0175] The geographic location information may include the latitude and longitude information corresponding to the business point.

[0176] The geographical location information of each business point can be obtained through the map application program interface.

[0177] 702. Generate transfer route information between any two business points in each business point based on the geographic location information.

[0178] Specifically, by inputting the geographical location information of each business point in a map application, the transfer route information between any two business points in each business point is obtained.

[0179] 703. Perform Cartesian product processing on the transfer route information to obtain a transfer path pool.

[0180] Specifically, based on the possible route information between all business points, a Cartesian product is performed, that is, each business point generates all routes with non-business points to obtain a complete route table. As shown in Table 7:

[0181] Table 7:

[0182] Issue business point Arrival at business point Spherical distance 010W 010X 9.35951 010WE 010X 9.26739 010WB 010X 43.98413 010W 010WB 53.32068 010WE 010WB 53.22979 010X 010WB 43.98413

[0183] The spherical distance refers to the actual distance of the route between the corresponding service originating point and the service arriving point.

[0184] In order to better implement the cage resource allocation method in the embodiment of the present application, based on the cage resource allocation method, a cage resource allocation device is also provided in the embodiment of the present application, such as Figure 8 As shown, Figure 8 800 is a schematic diagram of the structure of an embodiment of a cage resource allocation device provided in an embodiment of the present application. The cage resource allocation device 800 specifically includes a first receiving unit 801, a first establishing unit 802, a first decision unit 803 and a first execution unit 804.

[0185] A first receiving unit 801 is configured to receive a cage resource allocation request sent by a service processing system, wherein the cage resource allocation request includes cage resource allocation information of a service processed by the service processing system;

[0186] A first establishing unit 802 is configured to establish an allocation path pool based on the cage resource allocation information, wherein the allocation path pool is composed of at least one allocation path corresponding to different service information, and the allocation path includes multiple service points, and the service point corresponds to at least one allocation constraint condition;

[0187] The first decision unit 803 is used to decide a target allocation strategy from the allocation path pool according to the cage resource allocation information, the allocation constraint condition and a preset objective function; wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between a demand and an allocation amount;

[0188] A first execution unit 804 is configured to allocate cage resources according to the at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path;

[0189] The cage resource allocation information includes inventory information of cage resources at each business point, output information of empty cabins corresponding to each business point after allocation, and configuration information of transport vehicles at each business point, wherein the empty cabin allocation is to allocate cage resources using empty cabins with existing transport capacity tasks; the first decision unit specifically includes:

[0190] A first determining unit, configured to determine the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool based on the inventory information of the cage resources and the configuration information of the transport vehicle;

[0191] A second determining unit, configured to determine the allocation parameter values ​​of the preset objective function and the allocation constraint condition based on the inventory information of the cage resources, the output information, and the number of vehicle adding tasks;

[0192] The third determining unit is configured to determine at least one target allocation path and an allocation value of the vehicle adding task corresponding to each target allocation path from the allocation path pool based on the allocation parameter value, the allocation constraint condition and the preset objective function.

[0193] In the present application, a cage resource allocation request sent by a business processing system is received, and the cage resource allocation request includes business information of the business processed by the business processing system; based on the business information, an allocation path pool is established, and the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, and the business point corresponds to at least one constraint condition; according to the business information, the constraint condition and the preset objective function, a target allocation strategy is determined from the allocation path pool; according to the target allocation strategy, corresponding cage resource allocation processing is performed, so that cage resources between various business points can be allocated to each other, and the cage resource imbalance between various business points can be effectively prevented.

[0194] In some embodiments of the present application, the third determining unit is specifically configured to:

[0195] Determine a first allocation parameter value of a business parameter corresponding to the allocatable constraint condition and a second allocation parameter value of a business parameter corresponding to the preset objective function;

[0196] Determining whether the allocation parameter value corresponding to the allocation constraint condition of each of the service points satisfies the allocation constraint condition;

[0197] If yes, determining a target transfer path from the transfer path pool;

[0198] The second allocation parameter value is input into the preset objective function to generate an allocation value of the vehicle adding task corresponding to each target allocation path.

[0199] In some embodiments of the present application, the inventory information includes demand information of each business point for cage resources, and the first determining unit is specifically used to:

[0200] Obtain demand information for cage resources;

[0201] Extracting the demand parameter value in the demand information;

[0202] Based on the configuration information of the transport vehicle, determining a minimum cage parameter value in the configuration information;

[0203] The demand parameter value is compared with the minimum cage loading number to obtain the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool.

[0204] In some embodiments of the present application, the device further comprises:

[0205] Obtain the coding information of each business point;

[0206] Determine the target business point to be allocated based on the demand information and inventory information of the cage resources;

[0207] The demand information and the target service point are combined according to the coding information to obtain target service point statistical information.

[0208] In some embodiments of the present application, the inventory information further includes safety inventory information and initial inventory information of cage resources at each business point, and the device further includes:

[0209] Read the output information to obtain the in and out information of cage resources of each service point within a preset period;

[0210] Based on the initial inventory information, the safety inventory information, and the in-and-out information, an allocatable business point and allocatable inventory information corresponding to the allocatable business point are determined.

[0211] In some embodiments of the present application, the first establishing unit is specifically used to:

[0212] Obtain the geographic location information of each business point;

[0213] Based on the geographical location information, generating transfer route information between any two business points in each business point;

[0214] Cartesian product processing is performed on the allocation route information to obtain an allocation path pool.

[0215] In addition to the above-mentioned cage resource allocation method and device, the embodiment of the present application further provides a computer device, which integrates any cage resource allocation device provided in the embodiment of the present application, and the computer device includes:

[0216] one or more processors;

[0217] Memory; and

[0218] One or more applications, wherein the one or more applications are stored in the memory and are configured to be executed by the processor to perform the operations of any method described in any of the above cage resource allocation method embodiments.

[0219] The present application also provides a computer device that integrates any cage resource allocation device provided in the present application. Fig. 9 , Fig. 9 It is a schematic diagram of the structure of an embodiment of a computer device provided in an embodiment of the present application.

[0220] like Fig. 9 As shown, it shows a schematic diagram of the structure of the cage resource allocation device designed in the embodiment of the present application, specifically:

[0221] The cage resource allocation device may include one or more processors 901 of processing cores, one or more computer-readable storage media memories 902, a power supply 903, an input unit 904 and other components. Those skilled in the art will appreciate that Fig. 9 The cage resource allocation device structure shown in the figure does not constitute a limitation on the cage resource allocation device, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.

[0222] The processor is the control center of the cage resource allocation device. It uses various interfaces and lines to connect various parts of the entire cage resource allocation device. By running or executing software programs and / or modules stored in the memory 902 and calling data stored in the memory 902, it executes various functions of the cage resource allocation device and processes data, thereby monitoring the cage resource allocation device as a whole. Optionally, the processor 901 may include one or more processing cores; preferably, the processor 901 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 901.

[0223] The memory 902 can be used to store software programs and modules. The processor 901 executes various functional applications and data processing by running the software programs and modules stored in the memory 902. The memory 902 can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area can store data created according to the use of the cage resource allocation device, etc. In addition, the memory 902 can include a high-speed random access memory, and can also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices. Accordingly, the memory 902 can also include a memory controller to provide the processor 901 with access to the memory 902.

[0224] The cage resource allocation device also includes a power supply 903 for supplying power to each component. Preferably, the power supply 903 can be logically connected to the processor 901 through a power management system, so as to realize functions such as management of charging, discharging, and power consumption management through the power management system. The power supply 903 can also include any components such as one or more DC or AC power supplies, recharging systems, power failure detection circuits, power converters or inverters, and power status indicators.

[0225] The cage resource allocation device may further include an input unit 904, which may be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal input related to user settings and function control.

[0226] Although not shown, the cage resource allocation device may also include a display unit, etc., which will not be described in detail here. Specifically, in the embodiment of the present application, the processor 901 in the cage resource allocation device will load the executable files corresponding to the processes of one or more application programs into the memory 902 according to the following instructions, and the processor 901 will run the application programs stored in the memory 902, thereby realizing various functions, as follows:

[0227] A cage resource allocation request sent by a business processing system is received, wherein the cage resource allocation request includes cage resource allocation information of the business processed by the business processing system; an allocation path pool is established based on the cage resource allocation information, wherein the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, each of which corresponds to at least one allocatable constraint condition; a target allocation strategy is determined from the allocation path pool according to the cage resource allocation information, the allocatable constraint condition and a preset objective function, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between demand and allocation amount; cage resource allocation is performed according to the at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0228] In the present application, a cage resource allocation request sent by a business processing system is received, and the cage resource allocation request includes cage resource allocation information of the business processed by the business processing system; based on the cage resource allocation information, an allocation path pool is established, and the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, and each business point corresponds to at least one allocatable constraint condition; according to the cage resource allocation information, the allocatable constraint condition and the preset objective function, a target allocation strategy is determined from the allocation path pool, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of the difference between demand and allocation amount; cage resource allocation is performed according to at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path, so that cage resources between various business points can be allocated to each other, and the cage resource imbalance between various business points can be effectively prevented.

[0229] To this end, an embodiment of the present application provides a computer-readable storage medium, which may include: a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk, etc. The computer-readable storage medium stores a plurality of instructions, which can be loaded by a processor to execute the steps in any cage resource allocation method provided in the embodiment of the present application. For example, the instruction can execute the following steps:

[0230] A cage resource allocation request sent by a business processing system is received, wherein the cage resource allocation request includes cage resource allocation information of the business processed by the business processing system; an allocation path pool is established based on the cage resource allocation information, wherein the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, each of which corresponds to at least one allocatable constraint condition; a target allocation strategy is determined from the allocation path pool according to the cage resource allocation information, the allocatable constraint condition and a preset objective function, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between demand and allocation amount; cage resource allocation is performed according to the at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path.

[0231] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0232] The above is a detailed introduction to a cage resource allocation method, device and storage medium provided in an embodiment of the present application. Specific examples are used in this article to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea; at the same time, for technical personnel in this field, according to the idea of ​​the present application, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.

Claims

1. A cage resource allocation method, characterized in that: The method comprises: receiving a cage resource allocation request sent by a business processing system, wherein the cage resource allocation request includes cage resource allocation information of a business processed by the business processing system; Based on the cage resource allocation information, an allocation path pool is established, wherein the allocation path pool is composed of at least one allocation path corresponding to different business information, and the allocation path includes multiple business points, each of which corresponds to at least one allocation constraint condition; According to the cage resource allocation information, the allocation constraint conditions and the preset objective function, a target allocation strategy is determined from the allocation path pool, wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between a demand and an allocation amount; Allocating cage resources according to the at least one target allocation path and the allocation value of the vehicle adding task corresponding to each target allocation path; The cage resource allocation information includes inventory information of cage resources at each business point, output information of empty cabins corresponding to each business point after allocation, and configuration information of transport vehicles at each business point, wherein the empty cabin allocation is to allocate cage resources using empty cabins with existing transport capacity tasks; the target allocation strategy is decided from the allocation path pool according to the cage resource allocation information, the allocation constraint conditions and the preset objective function, including: Based on the inventory information of the cage resources and the configuration information of the transport vehicle, determining the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool; Determine the allocation parameter values ​​of the preset objective function and the allocation constraint condition based on the inventory information of the cage resources, the output information and the number of vehicle adding tasks; At least one target allocation path and an allocation value of the vehicle adding task corresponding to each target allocation path are determined from the allocation path pool based on the allocation parameter value, the allocation constraint condition and the preset objective function.

2. The cage resource allocation method according to claim 1, characterized in that: The at least one target allocation path determined from the allocation path pool based on the allocation parameter value, the allocation constraint condition and the preset objective function and the allocation value of the vehicle adding task corresponding to each target allocation path include: Determine a first allocation parameter value of a business parameter corresponding to the allocatable constraint condition and a second allocation parameter value of a business parameter corresponding to the preset objective function; Determining whether the allocation parameter value corresponding to the allocation constraint condition of each of the service points satisfies the allocation constraint condition; If yes, determining a target transfer path from the transfer path pool; The second allocation parameter value is input into the preset objective function to generate an allocation value of the vehicle adding task corresponding to each target allocation path.

3. The cage resource allocation method according to claim 1, characterized in that: The inventory information includes demand information of each business point for cage resources. The number of vehicle adding tasks corresponding to each allocation path in the allocation path pool is determined based on the inventory information of the cage resources and the configuration information of the transport vehicle, including: Obtain demand information for cage resources; Extracting the demand parameter value in the demand information; Based on the configuration information of the transport vehicle, determining a minimum cage parameter value in the configuration information; The demand parameter value is compared with the minimum cage loading parameter value to obtain the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool.

4. The cage resource allocation method according to claim 3, characterized in that: The method further comprises: Obtain the coding information of each business point; Determine the target business point to be allocated based on the demand information and inventory information of the cage resources; The demand information and the target service point are combined according to the coding information to obtain target service point statistical information.

5. The cage resource allocation method according to claim 1, characterized in that: The inventory information also includes safety inventory information and initial inventory information of cage resources at each business point, and the method further includes: Read the output information to obtain the in and out information of cage resources of each service point within a preset period; Based on the initial inventory information, the safety inventory information, and the in-and-out information, an allocatable business point and allocatable inventory information corresponding to the allocatable business point are determined.

6. The cage resource allocation method according to claim 1, characterized in that: The step of establishing an allocation path pool based on the cage resource allocation information includes: Obtain the geographic location information of each business point; Based on the geographical location information, generating transfer route information between any two business points in each business point; Cartesian product processing is performed on the allocation route information to obtain an allocation path pool.

7. A cage resource allocation device, characterized in that: The device comprises: A first receiving unit, configured to receive a cage resource allocation request sent by a service processing system, wherein the cage resource allocation request includes cage resource allocation information of a service processed by the service processing system; A first establishing unit is configured to establish an allocation path pool based on the cage resource allocation information, wherein the allocation path pool is composed of at least one allocation path corresponding to different service information, and the allocation path includes a plurality of service points, and the service points correspond to at least one allocation constraint condition; A first decision unit is used to decide a target allocation strategy from the allocation path pool according to the cage resource allocation information, the allocation constraint condition and a preset objective function; wherein the target allocation strategy includes at least one target allocation path determined from the allocation path pool and an allocation value of a vehicle adding task corresponding to each target allocation path, and the preset objective function is an objective function of a difference between a demand and an allocation amount; A first execution unit, configured to allocate cage resources according to the at least one target allocation path and an allocation value of a vehicle adding task corresponding to each target allocation path; The cage resource allocation information includes inventory information of cage resources at each business point, output information of empty cabins corresponding to each business point after allocation, and configuration information of transport vehicles at each business point, wherein the empty cabin allocation is to allocate cage resources using empty cabins with existing transport capacity tasks; the first decision unit specifically includes: A first determining unit, configured to determine the number of vehicle adding tasks corresponding to each allocation path in the allocation path pool based on the inventory information of the cage resources and the configuration information of the transport vehicle; A second determining unit, configured to determine the allocation parameter values ​​of the preset objective function and the allocation constraint condition based on the inventory information of the cage resources, the output information, and the number of vehicle adding tasks; The third determining unit is configured to determine at least one target allocation path and an allocation value of a vehicle adding task corresponding to each target allocation path from the allocation path pool based on the allocation parameter value, the allocation constraint condition and the preset objective function.

8. A computer device, characterized in that: The computer device comprises: one or more processors; Memory; and One or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the processor to implement the cage resource allocation method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and the computer program is loaded by a processor to execute the steps in the cage resource allocation method according to any one of claims 1 to 6.

Images