Transportation task allocation method and device, computing equipment, medium and program product

Abstract

The invention provides a transportation task allocation method and device, computing equipment, a medium and a program product, and belongs to the technical field of cargo transportation. The transport task allocation method comprises the steps of obtaining at least one associated parameter of a to-be-transported order in a transport task, transport parameters of a plurality of transport tools related to the transport task and storage parameters of a plurality of storage places related to the transport task; determining at least one objective function of the transportation task according to at least one of the at least one associated parameter, the transportation parameter and the storage parameter; and based on the at least one objective function and at least one predetermined constraint condition of the transportation task, generating a target allocation scheme of the transportation task, the target allocation scheme indicating a transportation scheme allocated to the to-be-transported order. The method can achieve the purposes of saving the transportation cost and improving the efficiency.

Description

Technical Field

[0001] The present application relates to the technical field of cargo transportation, and in particular to a method, apparatus, computing device, medium, and program product for allocating transportation tasks. Background Art

[0002] Currently, in the logistics sector, cargo types are becoming increasingly diverse, the number of logistics distribution points is increasing, and transportation options are becoming more flexible. The freight transportation process requires multi-dimensional considerations regarding route selection, vehicle selection, and various transportation methods. Therefore, the logistics industry is crucial in optimizing the allocation of transportation tasks, improving transportation efficiency, and reducing transportation costs. Summary of the Invention

[0003] The present application aims to at least solve the technical problems of low efficiency and high cost of transportation tasks in the background art. To this end, one purpose of the present application is to provide a method for allocating transportation tasks to reasonably allocate transportation tasks, thereby improving transportation efficiency and reducing transportation costs.

[0004] An embodiment of the first aspect of the present application provides a method for allocating transportation tasks, including: obtaining at least one associated parameter of an order to be transported in a transportation task, transportation parameters of multiple transportation tools related to the transportation task, and storage parameters of multiple storage locations related to the transportation task, wherein at least one associated parameter respectively indicates the transportation demand of the order to be transported, the transportation parameters respectively indicate the transportation capacity of multiple transportation tools, and the storage parameters respectively indicate the storage capacity of multiple storage locations; determining at least one objective function of the transportation task based on at least one associated parameter, at least one of the transportation parameters and the storage parameters; and generating a target allocation plan for the transportation task based on at least one objective function and at least one constraint condition of the transportation task determined in advance, the target allocation plan indicating the transportation plan allocated to the order to be transported.

[0005] An embodiment of the second aspect of the present application provides a device for allocating transportation tasks, including: an acquisition module for acquiring at least one associated parameter of an order to be transported in a transportation task, transportation parameters of multiple transportation tools related to the transportation task, and storage parameters of multiple storage locations related to the transportation task, wherein at least one associated parameter respectively indicates the transportation demand of the order to be transported, the transportation parameters respectively indicate the transportation capacity of multiple transportation tools, and the storage parameters respectively indicate the storage capacity of multiple storage locations; a determination module for determining at least one objective function of the transportation task based on at least one associated parameter, at least one transportation parameter, and at least one storage parameter; and a generation module for generating a target allocation plan for the transportation task based on at least one objective function and at least one constraint condition of a predetermined transportation task, the target allocation plan indicating the transportation plan allocated to the order to be transported.

[0006] An embodiment of the third aspect of the present application provides a computing device, comprising: at least one processor; and at least one memory communicatively connected to the at least one processor, the at least one memory storing instructions, which, when executed individually or collectively by the at least one processor, enable the computing device to execute the allocation method in the above embodiment.

[0007] An embodiment of the fourth aspect of the present application provides a computer-readable storage medium storing instructions, which, when executed individually or collectively by one or more processors of a computing device, cause the computing device to execute the allocation method in the above embodiment.

[0008] An embodiment of the fifth aspect of the present application provides a computer program product, comprising instructions, which, when executed individually or collectively by one or more processors of a computing device, cause the computing device to execute the allocation method in the above embodiment.

[0009] The technical solution of the present application embodiment comprehensively considers multiple factors related to the transport task to obtain an objective function for the transport task, which can effectively simulate the actual transport task. Based on the objective function and related constraints, a target allocation scheme is derived to achieve a reasonable allocation of transport tasks, thereby achieving the goal of saving transportation costs and improving efficiency.

[0010] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In the accompanying drawings, unless otherwise specified, the same reference numerals throughout the multiple drawings represent the same or similar components or elements. These drawings are not necessarily drawn to scale. It should be understood that these drawings only depict some embodiments disclosed in this application and should not be construed as limiting the scope of this application.

[0012] Figure 1 A flowchart of a method for allocating transport tasks according to some embodiments of the present application is provided;

[0013] Figure 2 A schematic diagram of a process for obtaining an objective function in some embodiments of the present application;

[0014] Figure 3 A schematic block diagram of a device for allocating transport tasks according to some embodiments of the present application;

[0015] Figure 4 A schematic block diagram of a computing device according to some embodiments of the present application. DETAILED DESCRIPTION

[0016] The following embodiments of the technical solution of the present application will be described in detail with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present application and are therefore only examples and are not intended to limit the scope of protection of the present application.

[0017] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application belongs; the terms used herein are only for the purpose of describing specific embodiments and are not intended to limit this application; the terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned figure descriptions are intended to cover non-exclusive inclusions.

[0018] In the description of the embodiments of this application, the technical terms "first" and "second" are used only to distinguish different objects and should not be understood to indicate or imply relative importance or implicitly specify the quantity, specific order, or primary and secondary relationship of the indicated technical features. In the description of the embodiments of this application, the meaning of "plurality" is more than two, unless otherwise clearly and specifically defined.

[0019] References herein to "embodiments" mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it constitute an independent or alternative embodiment that is mutually exclusive of other embodiments. It is understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0020] In the description of the embodiments of this application, the term "and / or" is simply a description of the association relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent the following three situations: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " in this document generally indicates that the associated objects are in an "or" relationship.

[0021] In the description of the embodiments of the present application, the term "plurality" refers to more than two (including two), and similarly, "multiple groups" refers to more than two (including two) groups.

[0022] Currently, in the logistics sector, cargo types are becoming increasingly diverse, the number of logistics distribution points is increasing, and the choice of transportation methods is becoming more flexible. Within a given logistics system, there are a large number of supplier shipping points, integration centers, and logistics centers, resulting in complex, multi-level, and intersecting cargo flows. The flow of goods involves multiple modes of transportation, such as land, rail, and water transport. There are various options for transporting goods, such as single-point pickup and single-point delivery, multiple-point pickup and single-point delivery, single-point pickup and multiple-point delivery, and multiple-point pickup and multiple-point delivery. The types of goods may include dry goods, frozen goods, and wet goods, and the transportation vehicles involved may include normal temperature vehicles, insulated vehicles (such as freezer trucks and refrigerated trucks), and three-temperature vehicles (for example, insulated vehicles divided into three temperature zones: frozen, dry, and wet). Therefore, the transportation process requires multi-dimensional considerations regarding the selection of transportation routes, the selection of transportation vehicles, and the various transportation methods.

[0023] Existing logistics scheduling systems rely heavily on manual allocation of transportation tasks, such as determining transportation routes and combining or splitting shipments of different goods. However, manual allocation cannot achieve optimal results, resulting in low transportation efficiency and a significant occupation of human resources.

[0024] To improve transport efficiency and reduce transport costs, parameters related to the transport task can be obtained, at least one objective function for the transport task can be determined, and a target allocation plan can be derived based on the objective function and pre-determined constraints. Because the target allocation plan satisfies the transport task constraints and optimizes the objective function, the target allocation plan derived from this allocation method can better meet the various requirements of the transport task, thereby achieving the goal of reducing transport costs and improving transport efficiency.

[0025] The embodiment of the present application provides a method for allocating transportation tasks. Figure 1 , the allocation method 100 includes steps 110 to 130.

[0026] Step 110: Obtain at least one associated parameter of a pending transport order in a transport task, transportation parameters of multiple transport vehicles associated with the transport task, and storage parameters of multiple storage locations associated with the transport task. The at least one associated parameter indicates the transport demand of the pending transport order. The transportation parameters indicate the transport capacity of the multiple transport vehicles. The storage parameters indicate the storage capacity of the multiple storage locations.

[0027] Step 120: determining at least one objective function of the transport task based on at least one associated parameter, a transport parameter, and a storage parameter.

[0028] Step 130: Generate a target allocation plan for the transport task based on at least one objective function and at least one predetermined constraint of the transport task. The target allocation plan indicates a transport plan allocated to the order to be transported.

[0029] A transport task involves multiple pending orders, transportation vehicles, and storage locations. A transport task may include multiple pending orders, each of which can include different types of goods, goods destined for different destinations, and goods shipped from different storage locations. Therefore, each pending order has different transportation requirements, which can be reflected through parameters associated with the pending order, such as the duration of the transport task, the transportation requirements for the goods in the order, and the weight and volume.

[0030] Transport vehicles may include different modes of transport, such as land, water, and air, as well as the attributes of different transport vehicles, such as those for transporting ambient temperature goods, those for transporting low-temperature goods, and those for transporting constant temperature goods. The transport capacity of each transport vehicle can be defined by its associated transport parameters, such as the vehicle's load capacity and the freight charges for a particular route.

[0031] Regarding storage locations, the goods required for a transport mission may be stored in different locations. For example, goods can be shipped from or shipped to a specific storage location, such as the supplier shipping point, consolidation center, or logistics center mentioned above. The storage capacity of each storage location can be defined by its associated storage parameters, such as the inventory of a specific item stored at the storage location and the daily shipment limit.

[0032] In step 110, the associated parameters of the transport order, the transport parameters of the transport vehicle, and the storage parameters of the storage location may be obtained. For example, the corresponding parameters may be obtained based on usage requirements or attributes of the transport task. In one example, the duration of the transport task, the set of available transport vehicles and transport routes during the duration, the inventory level of the goods in the transport order, the weight load limit and volume load limit of each transport vehicle, and the freight cost may be determined.

[0033] In step 120, the objective function of the transport task can be determined based on at least one of the acquired association parameters, transport parameters, and storage parameters. The objective function of the transport task can be established based on factors such as freight, the number of transport tools used, etc. Figure 2 As shown, according to different transportation requirements, step 120 may include at least one of steps 210 to 250. That is, according to different transportation requirements, the objective function of the transportation task can be selected from the objective functions mentioned in steps 210 to 250. It should be understood that Figure 2 The dotted connecting lines in FIG. 2 are for illustration only. When determining the objective function, any selection may be made from step 210 to step 250 , and there is no limitation on the order of execution.

[0034] In some embodiments, step 120 includes step 210: determining the number of transport tools required for the transport task based on the first number of time periods and the set of transport tools available in each time period in the first number of time periods to obtain a transport tool quantity objective function for the transport task.

[0035] The set of transportation means available in each time period includes at least one transportation means.

[0036] The time period can be set based on usage requirements, for example, it can be set to a day, month, year, or a time period of a specific duration. The first number, i.e., the number of time periods, can also be set based on usage requirements, for example, it can be determined based on the duration of the transport mission. This disclosure does not limit the method for setting the first number of time periods.

[0037] For example, the first quantity time period is set to D days, that is, transportation tasks within D days need to be allocated.

[0038] In step 210, the objective function of the number of transport vehicles can be expressed as follows:

[0039] f1=∑ d∈D ∑ j∈Jd x dj (1)

[0040] Where f1 represents the objective function of the number of transport vehicles, d represents the dth day in D days, D is the first quantity, and J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in x dj Indicates whether the j-th transport vehicle is selected for cargo transportation on the d-th day. In an example, x dj is a 0-1 variable, when x dj = 1, it means that the j-th transport vehicle is selected for cargo transportation on the d-th day; when x dj =0, it means that the j-th means of transport is not selected for cargo transportation on the d-th day.

[0041] As shown in the above formula (1), the transportation means quantity objective function can be determined by the number of transportation means used on each day within D days.

[0042] In some embodiments, step 120 includes step 220: determining the freight of the transport task based on the first number of time periods, the set of transport routes within each time period in the first number of time periods, the set of transport tools available within each time period in the first number of time periods, and the transport cost of each transport tool in the set of transport tools to obtain the freight objective function of the transport task.

[0043] The transport route set within each time period includes at least one transport route.

[0044] For each means of transport, when it chooses a certain transport route to transport goods, there will be corresponding transportation costs. Therefore, the freight objective function of the transportation task can be obtained.

[0045] The following description continues with the example where the first quantity time period is set to D days.

[0046] In step 220, the freight objective function can be expressed as follows:

[0047]

[0048] Where f2 represents the freight objective function, d represents the dth day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th transport tool in C jl represents the transportation cost when the j-th transport tool chooses the l-th transport route to transport goods, x djlIndicates whether the j-th transport vehicle on the d-th day chooses the l-th transport route for transportation. In one example, x djl is a 0-1 variable, when x djl = 1, it means that the jth means of transport on the dth day chooses the lth transport route on the dth day for transportation; when x djl =0, it means that the j-th means of transport on the d-th day did not choose the l-th transport route on the d-th day for transportation.

[0049] As shown in formula (2), the freight objective function can be determined by the freight required by the transportation tool on each day within D days.

[0050] In some embodiments, step 120 includes step 230: determining the order transportation volume of split-order transportation in the orders to be transported based on the first quantity time period, the set of transportation routes within each time period in the first quantity time period, the set of transportation tools that can be used within each time period in the first quantity time period, and the set of orders that can be transported within each time period in the first quantity time period, so as to obtain the split-order transportation volume objective function of the transportation task.

[0051] For some orders to be transported, they can be split into several orders and then transported separately. Therefore, in order to reasonably allocate the orders for split transportation, it is necessary to determine the transportation volume of the orders for split transportation.

[0052] The following description continues with the example where the first quantity time period is set to D days.

[0053] In step 230, the objective function of the split order transportation volume can be expressed as follows:

[0054]

[0055] Where f3 represents the objective function of split transport volume, d represents the dth day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O d represents the set of orders that can be transported on day d (for example, orders shipped on day d, or orders that can be transported via the transportation route on day d, etc.), and o represents the number of orders in the order set O. d The oth order in x odjl Indicates whether the oth order uses the jth transport tool on the dth day and chooses the lth transport route on the dth day for transportation. In an example, x odjlis a 0-1 variable, when x odjl = 1, it means that the oth order uses the jth transportation tool on the dth day and chooses the lth transportation route on the dth day for transportation; when x odjl =0, it means that the oth order was not transported by the jth transport tool on the dth day and the lth transport route on the dth day.

[0056] As shown in formula (3), the objective function of split order transportation volume can be determined by which transportation tools and transportation routes are used to transport each order on each day within D days.

[0057] In some embodiments, step 120 includes step 240: based on the first quantity time period, the set of transportation routes within each time period in the first quantity time period, the set of transportation tools that can be used within each time period in the first quantity time period, and the set of orders to be transported, determine the order transportation volume of the orders to be transported that are shipped in combination with other orders to obtain the combined transportation volume objective function of the transportation task.

[0058] For some orders to be transported, they can be shipped together with other orders. Therefore, in order to reasonably allocate the orders for the group transport, it is necessary to determine the order transportation volume of the group transport. For group transport, it can also include adding goods and discarding goods, which can also be expressed as incremental group transport and decremental group transport. Among them, adding goods means that the value and / or quantity of the goods have increased over a period of time; correspondingly, discarding goods means that the value and / or quantity of the goods have decreased over a period of time. For example, during the logistics transportation process, due to various reasons, the loaded goods cannot be shipped on the original means of transportation, and are delayed to the next batch of transportation or later. For the objective function of group transport volume, both incremental group transport and decremental group transport need to be considered.

[0059] The following description continues with the example where the first quantity time period is set to D days.

[0060] In step 240, the objective function of the combined shipping volume can be expressed as follows:

[0061]

[0062] Where f4 represents the target function of the combined transport volume, d represents the dth day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. dThe jth transport tool in the set O represents the set of orders to be transported, and o represents the oth order in the set O of orders to be transported. Indicates whether the o-th order chooses the l-th transport route on the d-th day for reduced order consolidation by the j-th transport means on the d-th day. Indicates whether the oth order is incrementally combined with the lth transport route on the dth day by the jth transport tool on the dth day. a and b are pre-set coefficients that can be optimized and adjusted according to usage requirements. For example, a can be set to 300 and b can be set to 0.1. In an example, and Both can be integer variables.

[0063] As shown in formula (4), the objective function of the combined order volume can be determined by the incremental and decremental combined orders of each order within D days.

[0064] In some embodiments, step 120 includes step 250: determining the empty rates of multiple transport tools based on the first number of time periods, the set of transport routes within each time period in the first number of time periods, the set of transport tools available within each time period in the first number of time periods, and the maximum cargo capacity of each transport tool in the set of transport tools to obtain an empty rate objective function for the transport task.

[0065] For each transport vehicle, in order to achieve optimal transport efficiency and lowest transport cost, it is desirable to use the vehicle to transport as much cargo as possible, that is, to minimize the empty load rate of the transport vehicle. Therefore, an empty load rate objective function can be determined.

[0066] In some embodiments, the maximum cargo capacity includes a maximum weight cargo capacity and a maximum volume cargo capacity. Using both weight and volume to evaluate the empty load rate can obtain a more reasonable allocation result and fully utilize each transportation tool.

[0067] The following description continues with the example where the first quantity time period is set to D days.

[0068] In step 250, the no-load rate objective function can be expressed as follows:

[0069]

[0070] Where f5 represents the empty load rate objective function, d represents the dth day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J.d The j-th means of transport in W j represents the maximum weight of the j-th transport vehicle, V j represents the maximum volumetric cargo capacity of the j-th transport vehicle, represents the weight empty rate of the j-th transport tool using the l-th transport route on the d-th day, C represents the empty volume rate of the j-th transport tool using the l-th transport route on the d-th day, d is a pre-set coefficient that can be optimized and adjusted according to usage requirements. In one example, and Both can be continuous variables in the range [0,1]. d You can set it based on whether you are placing a group order on the first day. For group orders on the first day, you can set C d Set to a larger parameter, for example, for the first day group order situation, C d Can be set to 10, and for non-first-day group orders, C d Can be set to 1.

[0071] As shown in formula (5), the empty rate objective function can be determined by the weight empty rate and volume empty rate of each transportation tool on each transportation route within D days.

[0072] In step 120, different objective functions are accurately and reasonably obtained. Different objective functions of the transport task can be used according to different focus conditions of the transport task, so that the target allocation plan can be more reasonable and more in line with the user's expectations for the transport task.

[0073] In order to obtain the target allocation plan, it is also necessary to set the constraints that need to be met for the objective function described above so that the generated target allocation plan can be realized.

[0074] In some embodiments, the at least one constraint includes at least one of the following:

[0075] Constraint 1: The transport capacity of each transport tool among multiple transport tools shall not exceed the maximum cargo capacity of the transport tool;

[0076] Constraint 2: The transport volume of each transport tool among multiple transport tools meets the pre-set full load factor condition;

[0077] Constraint 3: In response to the order to be shipped being a first type order, the shipping quantity of the order to be shipped meets a pre-set first inventory condition;

[0078] Constraint 4: In response to the order to be transported being a second type order, the order to be transported meets a pre-set order splitting condition;

[0079] Constraint 5: In response to the order to be shipped being a third type order, the shipping quantity of the order to be shipped meets a preset second inventory condition;

[0080] Constraint 6: The transportation volume of the split-order transportation orders in the transportation order list must meet the pre-set split-order transportation volume conditions;

[0081] Constraint 7: In response to the order to be transported being a fourth type order, the order to be transported satisfies a pre-set transport condition;

[0082] Constraint 8: The number of transportation routes corresponding to each of the multiple transportation tools is less than a preset number threshold;

[0083] Constraint 9: The order to be transported and each of the multiple transport tools meet the pre-set route conditions.

[0084] For constraint 1 (i.e., the transport capacity of each of the multiple transport vehicles is not greater than the maximum cargo capacity of the transport vehicle), the cargo capacity transported by each transport vehicle cannot exceed the maximum cargo capacity of the transport vehicle, including the weight and volume of the carried cargo, which cannot exceed the upper limit of the transport vehicle.

[0085] Constraint 1 can be expressed as follows:

[0086]

[0087] Where d represents the dth day in D days, D is the first quantity, and J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O d represents the set of orders that can be transported on day d (for example, orders shipped on day d, or orders that can be transported via the transportation route on day d, etc.), and o represents the number of orders in the order set O. d The oth order in the L, i represents the item i in the oth order, L dj represents the set of transport routes that can be selected by the j-th transport tool on day d, and l represents the set of transport routes in the transport route set L dj The lth transport route in W j represents the maximum weight of the j-th transport vehicle, V j represents the maximum volumetric cargo capacity of the j-th transport vehicle, represents the weight empty rate of the j-th transport tool using the l-th transport route on the d-th day, represents the empty volume rate of the j-th transport tool using the l-th transport route on the d-th day, x djlIndicates whether the j-th transport vehicle on the d-th day chooses the l-th transport route for transportation, y odjl W represents the transportation volume of the oth order using the jth transportation tool on the dth day and the lth transportation route on the dth day. i represents the weight of cargo i, V i In one example, y odjl is an integer variable.

[0088] In some embodiments, constraint 2 (i.e., the transport volume of each of the multiple transport vehicles satisfies a preset full load factor condition) includes at least one of the following:

[0089] The transport volume of each of the multiple transport vehicles meets a preset weight load factor condition;

[0090] The transport volume of each of the multiple transport vehicles meets a preset volumetric load factor condition.

[0091] For each means of transport, in order to increase the amount of cargo transported and reduce waste of transport means, it can be limited to using the means of transport for transportation only when at least one of the weight and volume transported by the means of transport meets a pre-set minimum load rate condition, that is, the weight transported by the means of transport must not be less than the minimum weight load rate condition and / or the volume transported must not be less than the minimum volume load rate condition.

[0092] The weight full load factor condition can be expressed as follows:

[0093]

[0094] Where d represents the dth day in D days, D is the first quantity, and J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O d represents the set of orders that can be transported on day d (for example, orders shipped on day d, or orders that can be transported via the transportation route on day d, etc.), and o represents the number of orders in the order set O. d The oth order in the L, i represents the item i in the oth order, L dj represents the set of transport routes that can be selected by the j-th transport tool on day d, and l represents the set of transport routes in the transport route set L dj The first transport route in Indicates whether the transport by the jth transport vehicle using the lth transport route on the dth day meets the weight full load rate condition of the transport vehicle, W jrepresents the maximum weight of the j-th transport vehicle, y odjl W represents the transportation volume of the oth order using the jth transportation tool on the dth day and the lth transportation route on the dth day. i represents the weight of cargo i, Indicates the weight full rate of the j-th transport tool using the l-th transport route, for example, it can be 98%. In one example, Can be a 0-1 variable.

[0095] The volumetric load factor condition can be expressed as follows:

[0096]

[0097] Where d represents the dth day in D days, D is the first quantity, and J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O d represents the set of orders that can be transported on day d (for example, orders shipped on day d, or orders that can be transported via the transportation route on day d, etc.), and o represents the number of orders in the order set O. d The oth order in the L, i represents the item i in the oth order, L dj represents the set of transport routes that can be selected by the j-th transport tool on day d, and l represents the set of transport routes in the transport route set L dj The first transport route in Indicates whether the transport by the jth transport vehicle using the lth transport route on the dth day meets the volume full load rate condition of the transport vehicle, V j represents the maximum volumetric cargo capacity of the j-th transport vehicle, y odjl V represents the transportation volume of the oth order using the jth transportation tool on the dth day and the lth transportation route on the dth day. i represents the volumetric cargo capacity of cargo i, Indicates the volumetric load rate of the j-th transport tool using the l-th transport route, for example, it can be 98%. In one example, Can be a 0-1 variable.

[0098] Since a transport vehicle must satisfy at least one of the weight load factor condition and the volume load factor condition before it can be used for a transport task, constraint 2 can be expressed as a hard constraint (i.e., a constraint that must be satisfied) as shown in the following equation (10):

[0099]

[0100] Where d represents the dth day in D days, D is the first quantity, and Jd represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in L dj represents the set of transport routes that can be selected by the j-th transport tool on day d, and l represents the set of transport routes in the transport route set L dj The first transport route in Indicates whether the transportation by the j-th transport vehicle using the l-th transport route on the d-th day meets the weight full load rate condition of the transport vehicle, Indicates whether the transport by the j-th transport vehicle using the l-th transport route on the d-th day meets the volume full load rate condition of the transport vehicle, x djl Indicates whether the j-th transport tool on the d-th day chooses the l-th transport route on the d-th day for transportation. In one example, and x djl Both can be 0-1 variables.

[0101] During the allocation process, we will try to make the allocation result meet the weight full load rate condition and the volume full load rate condition. However, due to certain restrictions (for example, the transportation tool cannot meet the weight full load rate condition or the volume full load rate condition, etc.), the weight full load rate condition and the volume full load rate condition may not be met. Therefore, it can be expressed as the soft constraints shown in the following equations (11) and (12):

[0102]

[0103] Where d represents the dth day in D days, D is the first quantity, and J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in L dj represents the set of transport routes that can be selected by the j-th transport tool on day d, and l represents the set of transport routes in the transport route set L dj The first transport route in Indicates whether the transportation by the j-th transport vehicle using the l-th transport route on the d-th day meets the weight full load rate condition of the transport vehicle, Indicates whether the transport by the j-th transport vehicle using the l-th transport route on the d-th day meets the volume full load rate condition of the transport vehicle, x djl Indicates whether the j-th transport tool on the d-th day chooses the l-th transport route on the d-th day for transportation. In one example, and x djl Both can be 0-1 variables.

[0104] In some embodiments, constraint 3 (i.e., in response to the order to be transported being a first type of order, the transport volume of the order to be transported meets a pre-set first inventory condition) includes: in response to the order to be transported being a first type of order, the transport volume of the order to be transported is not greater than the inventory of multiple storage locations.

[0105] For certain special types of orders (i.e., Type 1 orders), there are certain restrictions on the shipping method. When determining the shipping method, since it may involve split-order shipping and combined-order shipping, the storage capacity of the storage location needs to be considered.

[0106] The first type of order may include LTO (limited time offer) transfer orders for first-day shipments. LTO refers to products sold within a limited timeframe, typically several weeks or months, such as seasonal products.

[0107] For some SKUs (Stock Keeping Unit, SKU is the smallest inventory unit used to uniquely identify and manage goods) that have strict restrictions on transportation time and transportation volume, that is, the transportation time and transportation volume cannot be adjusted, if group shipping is carried out during the transportation process, then the group shipping volume must be equal to the inventory volume of the SKU.

[0108] For LTO transfer orders shipped on the first day of carpooling, storage capacity needs to be considered. That is, when the inventory is insufficient, there is no need to ship the goods temporarily.

[0109] In some embodiments, for an order to be shipped that is not subject to inventory constraints, it can be expressed as follows (13):

[0110]

[0111] Where d represents D o Day d in the day, D o Days is the first quantity time period, i.e. the time period set during which the o-th order can be transported in D days, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport, y odjl represents the transportation volume of the oth order using the jth transportation tool on the dth day and the lth transportation route on the dth day, d o represents the total shipping volume of the oth order, x o Indicates whether the oth order is shipped in a group. In an example, x oThis can be a 0-1 variable. The oth order could be, for example, an LTO (Learning To Order) order, a regular product transfer order (non-add / drop) order, a regular product direct pickup / delivery order, a 3PL (third-party logistics) order, which outsources logistics and transportation tasks to a professional third-party logistics service provider, a cross-docking order (small items that, upon arrival at a warehouse or distribution center, are not stored but instead are directly disassembled, sorted, and reassembled, then quickly loaded onto an outbound transport vehicle for delivery to their final destination), a small order, or a non-carpool first-day LTO transfer order.

[0112] In some embodiments, for LTO transfer orders shipped on the first day of carpooling, due to inventory constraints, the storage capacity needs to be considered, as shown in the following formula (14):

[0113]

[0114] Where d represents D o Day d in the day, D o Days is the first quantity time period, i.e. the time period set during which the o-th order can be transported in D days, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport, y odjl represents the transportation volume of the oth order using the jth transportation tool on the dth day and the lth transportation route on the dth day, d o represents the total shipping volume of the oth order, inv represents the inventory volume of the corresponding goods in the oth order, Represents the set of LTO transfer orders for first-day shipment of carpooling.

[0115] In some embodiments, constraint condition 4 (i.e., in response to the to-be-shipped order being a second-type order, the to-be-shipped order satisfies a pre-set order splitting condition) includes any one of the following:

[0116] In response to the order to be transported being an order of the second type, the order to be transported is split and transported;

[0117] In response to the order to be shipped being an order of the second type, the order to be shipped is not split and shipped, and the shipping time is changed.

[0118] For certain special types of orders (i.e., second-type orders), in order to meet the full load rate requirements of the transportation tools, when transporting these orders, they can be split and transported at the current transportation time, or they can be transported at a changed transportation time without splitting. However, only one of these two methods can be selected. That is, if the order is split and transported at the current transportation time, the entire order needs to be transported at that transportation time; if the order is not split, the entire order needs to be transported at the changed transportation time. In one example, when the order is not split and transported, the transportation time is first changed to a time that is earlier than the current transportation time, and then changed to a time that is later than the current transportation time.

[0119] In some embodiments, the second type of order may include orders for regular items that are picked up and delivered directly (for example, regular items that are picked up directly from suppliers or production sites and delivered directly to customers or retail locations, skipping intermediate warehouses or distribution centers) and items that are stored in smaller locations.

[0120] Constraint 4 can be expressed as follows:

[0121]

[0122] Where, Indicates whether the oth order is split for shipment. Indicates whether the oth order is shipped ahead of schedule or delayed, and the oth order is a second type order. In one example, and Can all be 0-1 variables.

[0123] For the above-mentioned situation of splitting orders for transportation at the current transportation time, it can be expressed as the following formula (16):

[0124]

[0125] Where, Indicates whether the oth order is split for shipment, d indicates the dth day in D days, D is the first quantity, J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The lth transport route in y odjl It represents the transportation volume of the o-th order using the j-th transportation tool on the d-th day and the l-th transportation route on the d-th day. M is a pre-set parameter that can be optimized and adjusted according to usage requirements. The o-th order is a second-type order.

[0126] For the above-mentioned situation of not splitting the order but changing the transportation time to transport the entire order, it can be shown as the following formula (17) and formula (18):

[0127]

[0128] Where, Indicates whether the oth order is shipped ahead of schedule or delayed, d′ is the updated shipping time, represents the d′th day in D days, D is the first quantity, J d′ represents the set of transportation tools available on day d′, and j represents the set of transportation tools available on day J. d′ The j-th means of transport in L d′ represents the set of transport routes that can be selected on day d′, and l represents the set of transport routes in the transport route set L d′ The lth transport route in y od′jl represents the transportation volume of the oth order using the jth transportation tool on the d′th day and the lth transportation route on the d′th day. M is a pre-set parameter that can be optimized and adjusted according to usage requirements. od′jl Indicates whether the o-th order uses the j-th transportation tool on the d'th day and chooses the l-th transportation route on the d'th day for transportation. The o-th order is a second type order.

[0129] In some embodiments, constraint 5 (i.e., in response to the order to be shipped being a third type of order, the shipping quantity of the order to be shipped meets a pre-set second inventory condition) includes: in response to the order to be shipped being a third type of order, the shipping quantity of the order to be shipped is determined based on the available inventory days of multiple storage locations.

[0130] Days of Supply (DOS) measures the number of days inventory can support future demand and is a key metric in supply chain management. For certain special types of orders (i.e., Type 3 orders), the shipping volume must meet DOS constraints.

[0131] In some embodiments, the third type of order may include SKU orders with DOS upper and lower limits in regular item transfers, LTO supplier direct delivery orders, 3PL orders, cross-docking small item orders, and scattered small item orders that cannot adjust the transportation time and transportation volume.

[0132] In one example, the shipping volume for the third type of order is determined based on the upper and lower limits of the DOS value of the SKU.

[0133] If the SKU cannot be added or dropped,

[0134] If the SKU can be added,

[0135] Where, Indicates whether the o-th order chooses the l-th transport route on the d-th day for reduced order consolidation by the j-th transport means on the d-th day. Indicates whether the o-th order is incrementally combined with the j-th transport tool on the d-th day and the l-th transport route on the d-th day.

[0136] The logic of adding and removing goods that needs to be satisfied by the transportation order is shown in the following formula (19):

[0137]

[0138] Where d represents D o Day d in the day, D o Days is the first quantity time period, i.e. the time period set during which the o-th order can be transported in D days, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O BC Indicates the set of SKU orders with DOS increase and drop upper and lower limits in the regular item transfer in the third type of order. o represents the oth order among them, and y odjl represents the transportation volume of the oth order using the jth transportation tool on the dth day and the lth transportation route on the dth day, d o represents the total shipping volume of the oth order, Indicates the minimum order quantity for item i in the o-th order. Indicates whether the o-th order chooses the l-th transport route on the d-th day for reduced order consolidation by the j-th transport means on the d-th day. Indicates whether the o-th order chooses the l-th transport route on the d-th day for incremental order consolidation by the j-th transport tool on the d-th day. M is a pre-set parameter that can be optimized and adjusted according to usage requirements. o Indicates whether the oth order is shipped in a group.

[0139] In one example, the first-day replenishment (T+2 or T+1) of the third type of order carpooling needs to meet the inventory constraints of the upstream storage location, as shown in the following formula (20):

[0140]

[0141] Where, L drepresents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O skuBP represents a set of SKU orders for a certain storage location in the third type of order, o represents the oth order, Indicates whether the o-th order chooses the l-th transport route on the d-th day for incremental order consolidation by the j-th transport tool on the d-th day. represents the minimum order increment for item i in order o, and invAvaiIncre represents the remaining available inventory increment at the upstream storage location. For T+2, d = 2; for T+1, d = 1. d represents the dth day in D days.

[0142] In an example, for a certain storage location of received goods, the number of goods arriving and added or dropped on a certain day will also be limited by the DOS value, as shown in the following formula (21):

[0143]

[0144] in,

[0145]

[0146] Where d represents the dth day in D days, d′ represents the d′th day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O skuBP represents the set of orders for a certain storage location in the third type of order, o represents the oth order, y odjl It represents the transportation volume of the o-th order using the j-th transportation tool on the d-th day and the l-th transportation route on the d-th day. Indicates the actual / estimated shipment data of MaxDII for the day. Indicates MinDII's actual / estimated shipment data for the day. Indicates the SKU shipment volume of the storage location on day d, Indicates the original SKU inventory at the storage location. MaxDII*skuNumAvg and MinDII*skuNumAvg indicate the values used when there is no shipment data.

[0147] Regarding constraint 6 (i.e., the transportation volume of the orders to be transported that are split and transported in the order to be transported meets the pre-set split transportation volume condition), in order to save transportation resources, it is hoped that all orders will not be split and transported as much as possible in the transportation task. In other words, there is a constraint on the transportation volume of each order using each transportation tool. Constraint 6 can be expressed as follows (22):

[0148]

[0149] Where d represents the dth day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O d represents the set of orders that can be transported on day d (for example, orders shipped on day d, or orders that can be transported via the transportation route on day d, etc.), and o represents the number of orders in the order set O. d The oth order in x odjl Indicates whether the o-th order uses the j-th transportation tool on the d-th day and the l-th transportation route on the d-th day for transportation, y odjl It represents the transportation volume of the o-th order using the j-th transportation tool on the d-th day and the l-th transportation route on the d-th day. M is a preset parameter that can be optimized and adjusted according to usage requirements.

[0150] In some embodiments, constraint 7 (i.e., in response to the order to be transported being an order of the fourth type, the order to be transported meets pre-set transportation conditions) includes: in response to the order to be transported being an order of the fourth type, the order to be transported is not split and transported by one of multiple transportation tools.

[0151] The fourth type of orders may include 3PL orders, cross-docking small item orders, etc. For the fourth type of orders, it is hoped that they will not be split for transportation and need to be transported using the same transportation tool.

[0152] Constraint 7 can be expressed as the following equations (23) and (24):

[0153]

[0154] Where d represents D o Day d in the day, D o Days is the first quantity time period, i.e. the time period set during which the o-th order can be transported in D days, L drepresents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O BP3PL represents the set of all fourth-type orders (e.g., cross-docking smalls orders and 3PL orders) at a certain storage location on a certain day, and o represents the oth order among them. Indicates the number of all fourth-type orders (e.g., cross-docking smalls orders and 3PL orders) at a storage location on a certain day, x odjl Indicates whether the o-th order uses the j-th transportation tool on the d-th day and chooses the l-th transportation route on the d-th day for transportation. Indicates whether the j-th transport tool is used to transport the fourth type of order on the d-th day. In one example, Can be a 0-1 variable.

[0155] For constraint 8 (i.e., the number of transport routes corresponding to each of the multiple transport tools is less than a preset threshold), since each transport tool can only select a limited number of transport routes within a certain timeframe, the number of transport routes for each transport tool must be less than the preset threshold. For example, for a particular transport task, a transport tool can only select one transport route; in this case, the threshold can be set to 2.

[0156] Constraint 8 can be expressed as the following equations (25) and (26):

[0157]

[0158] Where d represents the dth day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in Indicates whether the j-th transport tool is used to transport the fourth type of order on the d-th day, x dj Indicates whether the j-th transport vehicle is selected for cargo transportation on the d-th day, x djl Indicates whether the j-th means of transport on the d-th day chooses the l-th transport route for transportation.

[0159] For constraint 9 (i.e., the order to be transported and each of the multiple transport tools satisfy the pre-set route conditions), for each transport tool and each order, the constraint shown in formula (27) needs to be satisfied:

[0160]

[0161] Where d represents the dth day in D days, D is the first quantity, L d represents the set of transport routes that can be selected on day d, and l represents the set of transport routes in the transport route set L d The first transport route in J d represents the set of transportation tools available on day d, and j represents the set of transportation tools available on day J. d The j-th means of transport in O d represents the set of orders that can be transported on day d (for example, orders shipped on day d, or orders that can be transported via the transportation route on day d, etc.), and o represents the number of orders in the order set O. d The oth order in x djl Indicates whether the j-th transport vehicle chooses the l-th transport route on the d-th day for transportation, x odjl Indicates whether the o-th order is transported using the j-th transport tool on the d-th day and the l-th transport route on the d-th day. M is a pre-set parameter that can be optimized and adjusted according to usage requirements.

[0162] By setting different constraint functions, the objective function of the transportation task can be limited, so that the target allocation plan can be more accurate, reasonable and easy to implement.

[0163] In step 130, after obtaining the objective function and constraints, a target allocation plan for the transport task can be generated. In some embodiments, step 130 includes determining a plurality of target decision variables based on at least one constraint and each of the at least one objective function. Each of the plurality of target decision variables indicates at least one of a transport vehicle, a transport route, and a transport mode to be assigned to the transport order.

[0164] As described above, the different objective functions obtained in steps 210 to 250, when the constraints are satisfied, can determine the target decision variables based on the constraints and the objective functions. For example, each objective function can be minimized as much as possible, thereby obtaining a better allocation scheme. For example, for the objective function of the number of transport vehicles obtained in step 210, the target allocation scheme obtained by minimizing it can make the transport task use as few transport vehicles as possible; for the objective function of the freight rate obtained in step 220, the target allocation scheme obtained by minimizing it can make the freight rate of the transport task as low as possible; for the objective function of the split-order transport volume obtained in step 230, the target allocation scheme obtained by minimizing it can make the split-order transport volume as small as possible, that is, the orders to be transported in the transport task are transported as little as possible; for the objective function of the combined transport volume obtained in step 240, the target allocation scheme obtained by minimizing it can make the transport volume of the reduced combined order in the transport task as small as possible, while the transport volume of the incremental combined order is as large as possible; for the objective function of the empty load rate obtained in step 250, the target allocation scheme obtained by minimizing it can make the empty load rate of each transport vehicle as small as possible, thereby improving the utilization rate of the transport vehicle.

[0165] In some embodiments, the target decision variables may include the following variables:

[0166] x o : Indicates whether the o-th order is shipped in batches, for example, it can be a 0-1 variable.

[0167] x odjl : Indicates whether the o-th order uses the j-th transportation tool on the d-th day and selects the l-th transportation route on the d-th day for transportation. For example, it can be a 0-1 variable.

[0168] y odjl : Indicates the transportation volume of the o-th order using the j-th transportation tool on the d-th day and the l-th transportation route on the d-th day. For example, it can be an integer variable.

[0169] x dj : Indicates whether the j-th transport vehicle is selected for cargo transportation on the d-th day, for example, it can be a 0-1 variable.

[0170] Indicates whether the j-th transport tool is used to transport the fourth type of order (for example, cross-docking small orders and 3PL orders) on the d-th day, which can be a 0-1 variable.

[0171] Indicates whether the j-th means of transport on the d-th day is used to transport imported goods, for example, it can be a 0-1 variable.

[0172] x djl: Indicates whether the j-th means of transport on the d-th day chooses the l-th transport route for transportation. For example, it can be a 0-1 variable.

[0173] Indicates whether the transportation by the j-th transport vehicle using the l-th transport route on the d-th day meets the weight full load rate condition of the transport vehicle, for example, it can be a 0-1 variable.

[0174] Indicates whether the transportation by the j-th transport vehicle using the l-th transport route on the d-th day meets the volume load rate condition of the transport vehicle. For example, it can be a 0-1 variable.

[0175] It represents the weight empty rate of the j-th transport tool using the l-th transport route on the d-th day, for example, it can be a continuous variable in the range of [0,1].

[0176] It represents the empty volume rate of the j-th transport tool using the l-th transport route on the d-th day, and can be a continuous variable in the range of [0,1].

[0177] Indicates whether the o-th order is incrementally combined with the j-th transport tool on the d-th day via the l-th transport route on the d-th day. For example, it can be an integer variable.

[0178] Indicates whether the o-th order is combined with the j-th transport tool on the d-th day via the l-th transport route on the d-th day. For example, it can be an integer variable.

[0179] Indicates whether the o-th order is shipped ahead of schedule or delayed, for example, it can be a 0-1 variable.

[0180] Indicates whether the o-th order is split for shipment. For example, it can be a 0-1 variable.

[0181] x od : Indicates whether the o-th order is shipped in batches on the d-th day. For example, it can be a 0-1 variable.

[0182] According to different attributes of the transportation task, the output target decision variable can be determined from the above-mentioned variables. In other embodiments, other different variables may also be included, which is not limited in this disclosure.

[0183] The target decision variables obtained by the above allocation method fully consider the different attributes of the transportation orders, transportation tools, and storage locations in the transportation tasks, and obtain a reasonable transportation task allocation plan, which effectively improves transportation efficiency and greatly saves transportation costs.

[0184] Based on the same technical concept, the embodiment of the present application provides a transport task allocation device. The embodiment of the transport task allocation device can refer to the embodiment of the transport task allocation method, and the repeated parts will not be repeated. Figure 3 The transport task allocation device 300 includes an acquisition module 310 , a determination module 320 and a generation module 330 .

[0185] Acquisition module 310 is configured to acquire at least one associated parameter of a pending transport order in a transport task, transportation parameters of multiple transport vehicles associated with the transport task, and storage parameters of multiple storage locations associated with the transport task. The at least one associated parameter indicates the transport demand of the pending transport order. The transportation parameters indicate the transport capacity of the multiple transport vehicles. The storage parameters indicate the storage capacity of the multiple storage locations.

[0186] The determination module 320 is configured to determine at least one objective function of the transportation task according to at least one associated parameter, a transportation parameter, and a storage parameter.

[0187] The generation module 330 is used to generate a target allocation plan for the transport task based on at least one objective function and at least one constraint condition of the transport task determined in advance. The target allocation plan indicates the transport plan allocated to the order to be transported.

[0188] The acquisition module 310, determination module 320, and generation module 330 in the transport task allocation apparatus 300 may correspond to steps 110 to 130 in the transport task allocation method 100. For the sake of brevity, these steps are not further described here. It should be understood that, corresponding to the embodiment of the transport task allocation method 100, the embodiment of the transport task allocation apparatus 300 may further include further modules.

[0189] It should be noted that the functions of the various modules discussed herein can be divided into multiple modules, and / or at least some functions of multiple modules can be combined into a single module. The specific module discussed herein performing an action includes the specific module itself performing the action, or alternatively, the specific module calling or otherwise accessing another component or module that performs the action (or performs the action in conjunction with the specific module). Therefore, the specific module that performs an action can include the specific module itself that performs the action and / or another module that the specific module calls or otherwise accesses to perform the action.

[0190] It should also be understood that various techniques may be described herein in the general context of software hardware elements or program modules. Figure 3The various modules described can be implemented in hardware or in hardware in combination with software and / or firmware. For example, these modules can be implemented as computer program code / instructions, which are configured to be executed in one or more processors and stored in a computer-readable storage medium. Alternatively, these modules can be implemented as hardware logic / circuits. Hardware logic / circuits can include an integrated circuit chip (which includes a processor (e.g., a central processing unit (CPU), a microcontroller, a microprocessor, a digital signal processor (DSP), etc.), a memory, one or more communication interfaces, and / or one or more components in other circuits), and can optionally execute the received program code and / or include embedded firmware to perform a function.

[0191] The present application embodiment provides a computing device 400, such as Figure 4 shown. Figure 4 FIG4 shows an example configuration of a computing device 400 that can be used to implement the method 100 for allocating transport tasks described herein. For example, the aforementioned apparatus 300 for allocating transport tasks can be fully or at least partially implemented by the computing device 400 or a similar device or system.

[0192] The computing device 400 may include at least one processor 405 capable of communicating with each other, such as via a bus 404 or other appropriate connections, a memory 407, (a plurality of) communication interfaces 402, a display device 401, other input / output (I / O) devices 403, and one or more mass storage devices 406. The memory 407 stores instructions that, when executed by the processor 405, cause the processor 405 to perform the method for allocating transportation tasks as described in the above-described embodiments.

[0193] The computing device 400 can be a variety of different types of devices. Examples of computing device 400 include, but are not limited to, a desktop computer, a server computer, a laptop or netbook computer, a mobile device (e.g., a tablet computer, a cellular or other wireless phone (e.g., a smartphone), a notepad computer, a mobile station), a wearable device (e.g., eyeglasses, a watch), an entertainment device (e.g., an entertainment appliance, a set-top box communicatively coupled to a display device, a game console), a television or other display device, an automobile computer, and the like.

[0194] The processor 405 may be a single processing unit or multiple processing units, all of which may include a single or multiple computing units or multiple cores. The processor 405 may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, state machines, logic circuits, and / or any device that manipulates signals based on operational instructions. Among other capabilities, the processor 405 may be configured to retrieve and execute computer-readable instructions stored in the memory 407, mass storage device 406, or other computer-readable media, such as program code for an operating system 408, program code for application programs 409, program code for other programs 410, and the like.

[0195] Memory 407 and mass storage device 406 are examples of computer-readable storage media for storing instructions that are executed by processor 405 to implement the various functions described above. For example, memory 407 may generally include both volatile memory and non-volatile memory (e.g., RAM, ROM, etc.). In addition, mass storage device 406 may generally include a hard drive, a solid-state drive, removable media, including external and removable drives, memory cards, flash memory, floppy disks, optical disks (e.g., CDs, DVDs), storage arrays, network attached storage, storage area networks, etc. Memory 407 and mass storage device 406 may all be collectively referred to herein as memory or computer-readable storage media, and may be non-transitory media capable of storing computer-readable, processor-executable program instructions as computer program code that may be executed by processor 405 as a specific machine configured to implement the operations and functions described in the examples herein.

[0196] A plurality of programs may be stored on the mass storage device 406. These programs include an operating system 408, one or more application programs 409, other programs 410, and program data 411, and they may be loaded into the memory 407 for execution. Examples of such application programs or program modules may include, for example, computer program logic (e.g., computer program code or instructions) for implementing the following components / functions: the apparatus for allocating transport tasks 300 (including an acquisition module 310, a determination module 320, and a generation module 330), the method for allocating transport tasks 100 (including any suitable steps of the method for allocating transport tasks 100), and / or other embodiments described herein.

[0197] Although Figure 4 400 , but operating system 408 , application programs 409 , other programs 410 , and program data 411 , or portions thereof, may be implemented using any form of computer-readable media accessible by computing device 400 .

[0198] One or more communication interfaces 402 are used to exchange data with other devices, such as via a network, direct connection, and the like. Such communication interfaces can be one or more of the following: any type of network interface (e.g., a network interface card (NIC)), a wired or wireless (such as an IEEE 802.11 wireless LAN (WLAN)) wireless interface, a Worldwide Interoperability for Microwave Access (Wi-MAX) interface, an Ethernet interface, a Universal Serial Bus (USB) interface, a cellular network interface, a Bluetooth™ interface, a Near Field Communication (NFC) interface, and the like. The communication interface 402 can facilitate communication within a variety of network and protocol types, including wired networks (e.g., LAN, cable, and the like) and wireless networks (e.g., WLAN, cellular, satellite, and the like), the Internet, and the like. The communication interface 402 can also provide communication with external storage devices (not shown), such as storage arrays, network attached storage, storage area networks, and the like.

[0199] In some examples, a display device 401 such as a monitor may be included for displaying information and images to the user. Other I / O devices 403 may be devices that receive various inputs from the user and provide various outputs to the user, and may include a touch input device, a gesture input device, a camera, a keyboard, a remote control, a mouse, a printer, an audio input / output device, and the like.

[0200] The technology described herein can be supported by these various configurations of the computing device 400 and is not limited to the specific examples of the technology described herein. For example, the functionality can also be implemented in whole or in part on a "cloud" by using a distributed system. The cloud includes and / or represents a platform for resources. The platform abstracts the underlying functionality of the hardware (e.g., servers) and software resources of the cloud. Resources can include applications and / or data that can be used when performing computing processing on a server away from the computing device 400. Resources can also include services provided over the Internet and / or through a subscriber network such as a cellular or Wi-Fi network. The platform can abstract resources and functionality to connect the computing device 400 to other computer devices. Therefore, the implementation of the functionality described herein can be distributed throughout the cloud. For example, functionality can be implemented partially on the computing device 400 and partially through a platform that abstracts the functionality of the cloud.

[0201] An embodiment of the present application also provides a computer-readable storage medium having instructions stored thereon. When the instructions are executed individually or collectively by one or more processors of a computing device, the computing device executes a method as described in any of the above embodiments.

[0202] Computer-readable storage media includes volatile and nonvolatile, removable and non-removable media implemented by any method or technology for storage of information, such as computer-readable instructions, data structures, program modules, or other data. Computer-readable storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD), or other optical storage devices, magnetic cassettes, magnetic tape, magnetic disk storage devices or other magnetic storage devices, or any other non-transmission media that can be used to store information for access by a computer device.

[0203] An embodiment of the present application also provides a computer program product, including instructions, which, when executed individually or collectively by one or more processors of a computing device, enable the computing device to perform a method as described in any of the above embodiments.

[0204] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some or all of the technical features therein. These modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application, and they should all be included in the scope of the claims and specification of the present application. In particular, as long as there is no structural conflict, the various technical features mentioned in the various embodiments can be combined in any way. The present application is not limited to the specific embodiments disclosed herein, but includes all technical solutions that fall within the scope of the claims.

Claims

1. A method for allocating transportation tasks, comprising: Acquire at least one associated parameter of a to-be-transported order in a transportation task, transportation parameters of multiple transportation tools associated with the transportation task, and storage parameters of multiple storage locations associated with the transportation task, wherein the at least one associated parameter respectively indicates the transportation demand of the to-be-transported order, the transportation parameters respectively indicate the transportation capacity of the multiple transportation tools, and the storage parameters respectively indicate the storage capacity of the multiple storage locations; determining at least one objective function of the transport task based on at least one of the at least one associated parameter, the transport parameter, and the stored parameter; and Based on the at least one objective function and at least one predetermined constraint condition of the transportation task, a target allocation plan for the transportation task is generated, where the target allocation plan indicates a transportation plan allocated to the order to be transported.

2. The distribution method according to claim 1, wherein: Generating a target allocation plan for the transportation task based on the at least one objective function and at least one predetermined constraint of the transportation task includes: Based on the at least one constraint and each of the at least one objective function, a plurality of target decision variables are determined, each of the plurality of target decision variables respectively indicating at least one of the transport vehicle, transport route and transport mode assigned to the order to be transported.

3. The distribution method according to claim 1 or 2, wherein: Determining at least one objective function of the transportation task based on at least one associated parameter, the transportation parameter, and at least one of the storage parameters includes: Based on a first number of time periods and a set of transport tools available in each time period in the first number of time periods, the number of transport tools required for the transport task is determined to obtain a transport tool quantity objective function for the transport task, wherein the set of transport tools available in each time period includes at least one transport tool.

4. The distribution method according to any one of claims 1 to 3, wherein: Determining at least one objective function of the transportation task based on at least one associated parameter, the transportation parameter, and at least one of the storage parameters includes: Based on a first number of time periods, a set of transportation routes within each time period in the first number of time periods, a set of transportation tools that can be used within each time period in the first number of time periods, and the transportation cost of each transportation tool in the set of transportation tools, the freight of the transportation task is determined to obtain a freight objective function of the transportation task, wherein the set of transportation routes within each time period respectively includes at least one transportation route, and the set of transportation tools that can be used within each time period respectively includes at least one transportation tool.

5. The distribution method according to any one of claims 1 to 4, wherein: Determining at least one objective function of the transportation task based on at least one associated parameter, the transportation parameter, and at least one of the storage parameters includes: Based on the first quantity time period, the set of transportation routes within each time period in the first quantity time period, the set of transportation tools available within each time period in the first quantity time period, and the set of orders to be transported, the transportation volume of orders to be transported that are transported in combination with other orders is determined to obtain the combined transportation volume objective function of the transportation task, wherein the set of transportation routes within each time period respectively includes at least one transportation route, and the set of transportation tools available within each time period respectively includes at least one transportation tool.

6. The distribution method according to any one of claims 1 to 5, wherein: Determining at least one objective function of the transportation task based on at least one associated parameter, the transportation parameter, and at least one of the storage parameters includes: Based on a first number of time periods, a set of transport routes within each time period in the first number of time periods, a set of transport tools that can be used within each time period in the first number of time periods, and the maximum cargo capacity of each transport tool in the set of transport tools, the empty rates of the multiple transport tools are determined to obtain an empty rate objective function for the transport task, wherein the set of transport routes within each time period respectively includes at least one transport route, and the set of transport tools that can be used within each time period respectively includes at least one transport tool.

7. The distribution method according to claim 6, wherein: The maximum cargo capacity includes a maximum weight cargo capacity and a maximum volume cargo capacity.

8. The distribution method according to any one of claims 1 to 7, wherein: Determining at least one objective function of the transportation task based on at least one associated parameter, the transportation parameter, and at least one of the storage parameters includes: Based on the first quantity time period, the set of transportation routes within each time period in the first quantity time period, the set of transportation tools that can be used within each time period in the first quantity time period, and the set of orders that can be transported within each time period in the first quantity time period, the order transportation volume of the orders to be transported is determined to obtain the split transportation volume objective function of the transportation task, wherein the set of transportation routes within each time period respectively includes at least one transportation route, and the set of transportation tools that can be used within each time period respectively includes at least one transportation tool.

9. The distribution method according to any one of claims 1 to 8, wherein: The at least one constraint condition includes at least one of the following: The transport capacity of each transport means of the plurality of transport means is not greater than the maximum cargo capacity of the transport means; The transport volume of each of the plurality of transport vehicles satisfies a preset full load rate condition; In response to the order to be shipped being an order of the first type, the shipping volume of the order to be shipped meets a preset first inventory condition; In response to the order to be transported being an order of the second type, the order to be transported meets a pre-set order splitting condition; In response to the order to be shipped being an order of the third type, the shipping quantity of the order to be shipped meets a preset second inventory condition; The transportation volume of the split-order transportation order in the to-be-transported order meets the pre-set split-order transportation volume condition; In response to the order to be transported being an order of the fourth type, the order to be transported meets a preset transport condition; The number of transportation routes corresponding to each of the plurality of transportation tools is less than a preset number threshold; as well as The to-be-transported order and each of the plurality of transport tools meet a preset route condition.

10. The distribution method according to claim 9, wherein: The transport volume of each of the plurality of transport vehicles satisfies a preset full load factor condition, which includes at least one of the following: The transport volume of each of the plurality of transport vehicles satisfies a preset weight full load rate condition; The transport volume of each of the plurality of transport vehicles satisfies a preset volumetric load factor condition.

11. The distribution method according to claim 9 or 10, wherein: In response to the order to be shipped being a first type of order, the transportation quantity of the order to be shipped meeting a preset first inventory condition includes: In response to the order to be shipped being the first type of order, the shipping volume of the order to be shipped is not greater than the inventory volume of the multiple storage locations.

12. The distribution method according to any one of claims 9 to 11, wherein: In response to the order to be transported being an order of the second type, the order to be transported meeting a pre-set order splitting condition includes any one of the following: In response to the order to be shipped being an order of the second type, the order to be shipped is split and shipped; or In response to the order to be shipped being the second type of order, the order to be shipped is not split and shipped, and the shipping time is changed.

13. The distribution method according to any one of claims 9 to 12, wherein: In response to the order to be shipped being a third type order, the transportation quantity of the order to be shipped meeting a preset second inventory condition includes: In response to the order to be shipped being the third type of order, a shipping volume of the order to be shipped is determined based on days of available inventory at the plurality of storage locations.

14. The distribution method according to any one of claims 9 to 13, wherein: In response to the order to be transported being a fourth type of order, the order to be transported meeting a preset transport condition includes: In response to the order to be shipped being the fourth type of order, the order to be shipped is not split for shipping and is shipped by one of the multiple shipping tools.

15. A device for allocating transport tasks, comprising: an acquisition module, configured to acquire at least one associated parameter of an order to be transported in a transport task, transport parameters of a plurality of transport vehicles associated with the transport task, and storage parameters of a plurality of storage locations associated with the transport task, wherein the at least one associated parameter respectively indicates the transport demand of the order to be transported, the transport parameters respectively indicate the transport capacity of the plurality of transport vehicles, and the storage parameters respectively indicate the storage capacity of the plurality of storage locations; a determination module, configured to determine at least one objective function of the transport task based on at least one of the at least one associated parameter, the transport parameter, and the stored parameter; and A generation module is used to generate a target allocation plan for the transportation task based on the at least one objective function and at least one constraint condition of the transportation task determined in advance, wherein the target allocation plan indicates the transportation plan allocated to the order to be transported.

16. A computing device comprising: at least one processor; as well as At least one memory is communicatively connected to the at least one processor, the at least one memory storing instructions, which, when executed individually or collectively by the at least one processor, cause the computing device to perform the allocation method according to any one of claims 1 to 14. 17 . A computer-readable storage medium storing instructions, which, when executed individually or collectively by one or more processors of a computing device, cause the computing device to perform the allocation method according to claim 1 .

18. A computer program product comprising instructions which, when executed individually or collectively by one or more processors of a computing device, cause the computing device to perform the allocation method of any one of claims 1 to 14.

Images