Task network division method and device, electronic equipment and storage medium

Abstract

The embodiment of the invention discloses a task network division method and device, electronic equipment and a storage medium. The method comprises the following steps: determining reference attribute information of a reference transportation task; aiming at each distributable transportation network in the at least two distributable transportation networks, obtaining a standard transportation cost required to be paid for obtaining the transportation service provided by the distributable transportation network; and determining a task network access standard of each distributable transportation network based on the reference attribute information and the standard transportation cost of each distributable transportation network by taking the task transportation cost needing to be paid for completing the reference transportation task as an optimization target, so as to complete the distribution of the goods transportation task under the condition that the goods transportation task is subjected to network division. And based on the task network access standard and the target attribute information of the article transportation task, distributing the article transportation task in at least two distributable transportation networks. According to the technical scheme, the task transportation cost can be effectively controlled.

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of logistics, and in particular to a task network division method, device, electronic equipment and storage medium. Background Art

[0002] With the rapid development of the logistics industry, when allocating item transportation tasks, there are more and more allocable transportation networks available for allocation. It should be emphasized that the task transportation costs required when allocating item transportation tasks to different allocable transportation networks are likely to be different.

[0003] At present, the allocable transport networks are usually allocated for the goods transportation tasks according to the task access standards of each allocable transport network (hereinafter referred to as network division), and the task access standards are manually configured by the operators based on their experience.

[0004] In the process of realizing the present invention, the inventors found that the prior art has the following technical problems: the task access standard is forcibly dependent on manual configuration and the task transportation cost cannot be effectively controlled. Summary of the invention

[0005] The embodiments of the present invention provide a task network partitioning method, device, electronic device and storage medium to effectively control the task transportation cost.

[0006] According to one aspect of the present invention, a task network partitioning method is provided, which may include:

[0007] Determine reference attribute information of the reference transportation task;

[0008] For each of the at least two allocable transportation networks, obtain a standard transportation price required to obtain transportation services provided by the allocable transportation network;

[0009] Taking the task transportation cost required to complete the reference transportation task as the optimization target, based on the reference attribute information and the standard transportation cost of each allocatable transportation network, determining the task network entry standard of each allocatable transportation network, so as to allocate the item transportation task to at least two allocatable transportation networks based on the task network entry standard and the target attribute information of the item transportation task when the item transportation task is divided into networks;

[0010] Among them, the item transportation task corresponds to the reference transportation task, and the standard transportation cost and the task access standard are related to the information type of the reference attribute information.

[0011] According to another aspect of the present invention, a task network division device is provided, which may include:

[0012] A reference attribute information determination module, used to determine reference attribute information of a reference transportation task;

[0013] A standard transportation cost acquisition module, used for acquiring, for each of at least two allocable transportation networks, a standard transportation cost required to be paid for obtaining transportation services provided by the allocable transportation network;

[0014] The task network division module is used to determine the task network entry standard of each allocatable transportation network based on the reference attribute information and the standard transportation cost of each allocatable transportation network, taking the task transportation cost required to complete the reference transportation task as the optimization target, so as to allocate the item transportation task to at least two allocatable transportation networks based on the task network entry standard and the target attribute information of the item transportation task when the item transportation task is divided into networks;

[0015] Among them, the item transportation task corresponds to the reference transportation task, and the standard transportation cost and the task access standard are related to the information type of the reference attribute information.

[0016] According to another aspect of the present invention, there is provided an electronic device, which may include:

[0017] at least one processor; and

[0018] a memory communicatively connected to at least one processor; wherein,

[0019] The memory stores a computer program that can be executed by at least one processor. The computer program is executed by at least one processor so that the at least one processor implements the task networking method provided by any embodiment of the present invention when executing the computer program.

[0020] According to another aspect of the present invention, a computer-readable storage medium is provided, on which computer instructions are stored. The computer instructions are used to enable a processor to implement the task networking method provided by any embodiment of the present invention when executed.

[0021] The technical solution of the embodiment of the present invention determines the reference attribute information of the reference transport task, and for each of the at least two allocable transport networks, obtains the standard transport cost related to the information type of the reference attribute information that needs to be paid to obtain the transport service provided by the allocable transport network; then, taking the task transport cost required to complete the reference transport task as the optimization target, based on the reference attribute information and the standard transport cost of each allocable transport network, determine the task access standard related to the above information type for each allocable transport network, so that when the item transport task corresponding to the reference transport task is divided into networks, the item transport task can be allocated to at least two allocable transport networks based on the task access standard and the target attribute information of the item transport task. The above technical solution automatically determines the task access standard by combining the reference attribute information and the standard transport cost, taking the task transport cost as the optimization target, so that when the task is divided into networks based on the task access standard, the task transport cost required to complete the item transport task can be effectively controlled.

[0022] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0024] Figure 1 is a flow chart of a task network partitioning method provided according to an embodiment of the present invention;

[0025] Figure 2 is a flow chart of another task network partitioning method provided according to an embodiment of the present invention;

[0026] Figure 3 is a flow chart of another task network partitioning method provided according to an embodiment of the present invention;

[0027] Figure 4 is a flow chart of another task network partitioning method provided according to an embodiment of the present invention;

[0028] Figure 5a is a first schematic diagram of an optional example of another task networking method provided in an embodiment of the present invention;

[0029] Figure 5bis a second schematic diagram of an optional example of another task networking method provided in an embodiment of the present invention;

[0030] Figure 6 is a structural block diagram of a task network division device provided according to an embodiment of the present invention;

[0031] Figure 7 It is a structural diagram of an electronic device for implementing the task networking method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0032] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0033] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. The situations of "target", "original", etc. are similar and will not be repeated here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0034] Figure 1 It is a flow chart of a task networking method provided in an embodiment of the present invention. This embodiment is applicable to the case where the item transportation task is assigned to one of at least two assignable transportation networks, and is particularly applicable to the case where the task networking is performed by a task access standard that can ensure the optimal task transportation cost. The method can be executed by the task networking device provided in an embodiment of the present invention, and the device can be implemented by software and / or hardware, and the device can be integrated on an electronic device, and the electronic device can be various user terminals or servers.

[0035] See also Figure 1 The method of the embodiment of the present invention specifically includes the following steps:

[0036] S110: Determine reference attribute information of the reference transportation task.

[0037] Among them, the reference transportation task can be understood as a transportation task that serves as a reference for automatically determining the task access standards of the assignable transportation network. Combined with the application scenarios that may be involved in the embodiments of the present invention, it may be a transportation task estimated based on big data, that is, it may be different from the actual item transportation task that needs to be transported through the assignable transportation network. This is applicable to the situation where the item transportation task for T+1 day cannot be determined on T day; it may also be an item transportation task, which is applicable to the situation where the item transportation task for T+1 day has been determined on T day; and so on, which are not specifically limited here. Combined with the e-commerce scenario, the above-mentioned reference transportation tasks and item transportation tasks can be understood as orders.

[0038] The reference attribute information can be understood as the attribute information of the reference transport task, and its information type can be set according to the actual situation. For example, it can be weight and / or volume, and the reference attribute information is the weight value and / or volume value. Considering that the number of reference transport tasks may be one, two or more, in the case of at least two, the reference attribute information can be the reference attribute information of each reference transport task; it can also be the reference attribute information of the whole. For example, in combination with the above example, it can be the sum of weight values ​​and / or the sum of volume values.

[0039] The reference attribute information of the reference transport task is determined. The specific determination process may be prediction or direct acquisition, which is related to the actual situation of the reference transport task and is not specifically limited here.

[0040] S120. For each of the at least two allocable transportation networks, obtain a standard transportation price required to obtain transportation services provided by the allocable transportation network, wherein the standard transportation price is related to an information type of the reference attribute information.

[0041] Among them, the allocatable transportation network can be understood as a network that can be assigned to an item transportation task, thereby providing transportation services for the item transportation task. Combined with the application scenarios that may be involved in the embodiments of the present invention, it can optionally be a B2B network that is handed over to a business-to-business (B2B) third-party carrier for transportation, an express network where a self-built fleet is responsible for transportation, and a self-built express network, etc. This is related to the actual application scenario and is not specifically limited here.

[0042] For each of the at least two allocable transportation networks, a standard transportation cost required to obtain the transportation service provided by the allocable transportation network is obtained, and the standard transportation cost is related to the above-mentioned information type. In practical applications, the standard transportation cost can be optionally reflected in economics, time, or manpower, etc. For example, taking economics as an example, combined with the above-mentioned information type example, it can be a quotation given by relevant personnel of the allocable transportation network, such as a quotation by kilogram segment, a quotation by volume segment, or a whole vehicle quotation for a vehicle with a load of XX kilograms, etc.

[0043] It should be noted that the preset transportation routes covered by different allocable transportation networks may overlap or may differ. Each allocable transportation network can only provide the standard transportation costs for the preset transportation routes covered by itself. Therefore, the preset transportation routes covered by each allocable transportation network can be determined based on the obtained standard transportation costs, that is, the distribution of their transportation resources.

[0044] S130. Taking the task transportation cost required to complete the reference transportation task as the optimization target, based on the reference attribute information and the standard transportation cost of each allocatable transportation network, determine the task network access standard of each allocatable transportation network, and perform the following steps based on the task network access standard, wherein the task network access standard is related to the information type.

[0045] Among them, the task access standard of a certain allocable transportation network can be understood as the standard for allocating reference transportation tasks to the allocable transportation network, which is related to the above-mentioned information type. For example, it means that the reference transportation tasks with a weight exceeding XX kilograms or a volume exceeding XX cubic meters can be allocated to the allocable transportation network. Such task access standard can also be called the minimum access standard.

[0046] In order to effectively control the task transportation cost, the task transportation cost required to complete the reference transportation task can be used as the optimization target, and the task access standard of each assignable transportation network can be determined based on the reference attribute information and the standard transportation cost of each assignable transportation network. In other words, the reference attribute information and the standard transportation cost of each assignable transportation network are used as fixed parameters in the optimization process, and the optimal task transportation cost is obtained by continuously adjusting the task access standard of each assignable transportation network, and the task access standard of each assignable transportation network corresponding to the optimal task transportation cost is used as the task access standard of each assignable transportation network finally determined.

[0047] After obtaining the task access standards of each allocatable transport network, the task network division process can be implemented based on this, as shown in the following steps. It should be noted that the electronic device used to implement the task access standard acquisition process and the electronic device used to implement the task network division process can be the same or different electronic settings, which is related to the actual settings and is not specifically limited here.

[0048] S140. In the case of dividing the item transportation tasks into different networks, based on the task access criteria and target attribute information of the item transportation tasks, the item transportation tasks are allocated in at least two allocatable transportation networks, wherein the item transportation tasks correspond to the reference transportation tasks.

[0049] Among them, the item transportation task can be understood as a task for transporting items to be transported. Since the task access standard of each assignable transportation network is determined based on the reference transportation task, and the reference transportation task corresponds to the item transportation task, as illustrated in the example above, the task access standard of each assignable transportation network determined above is still applicable to the item transportation task. Then, in the case of network segmentation of the item transportation task, the item transportation task can be allocated in at least two assignable transportation networks based on the task access standard of each assignable transportation network and the target attribute information of the item transportation task, that is, the item transportation task is allocated to one of the at least two assignable transportation networks, thereby realizing the network segmentation process. It should be noted that the essence of the reference attribute information and the target attribute information (here, the information type) are the same, except that the former corresponds to the reference transportation task and the latter corresponds to the item transportation task. Therefore, the attribute information of the two types of transportation tasks is distinguished by naming.

[0050] It should be noted that in actual applications, there may be a situation where the item transportation task does not meet the task access standards of any assignable transportation network, but in order to ensure the effective completion of the item transportation task, it needs to be assigned to one of at least two assignable transportation networks later. In order to deal with the above situation, an optional solution is to use one of the at least two assignable transportation networks as a fallback network, that is, to set the task access standards of the fallback network to empty, and then in the above optimization process, a constraint condition can be added to indicate that the task access standards of the fallback network are empty. At this time, when the item transportation task does not meet the task access standards of any other network, it can be guaranteed that the item transportation task is assigned to the assignable transportation network other than the fallback network in at least two assignable transportation networks.

[0051] In addition, there may be a situation where the item transportation task satisfies at least two of the at least two allocatable transportation networks. In this case, the item transportation task can be assigned to one of the at least two allocatable transportation networks that it satisfies, or the item transportation task can be assigned to the allocatable transportation network that is satisfied first according to the preset allocation order of each allocatable transportation network; and so on, which are not specifically limited here.

[0052] It should also be noted that in actual applications, item transportation tasks may continue to appear. Therefore, each time an item transportation task is detected, the item transportation task can be networked based on the above steps; of course, when a preset number of item transportation tasks are detected, these item transportation tasks can be networked together; and so on, which are not specifically limited here.

[0053] The technical solution of the embodiment of the present invention determines the reference attribute information of the reference transport task, and for each of the at least two allocable transport networks, obtains the standard transport cost related to the information type of the reference attribute information that needs to be paid to obtain the transport service provided by the allocable transport network; then, taking the task transport cost required to complete the reference transport task as the optimization target, based on the reference attribute information and the standard transport cost of each allocable transport network, determine the task access standard related to the above information type for each allocable transport network, so that when the item transport task corresponding to the reference transport task is divided into networks, the item transport task can be allocated to at least two allocable transport networks based on the task access standard and the target attribute information of the item transport task. The above technical solution automatically determines the task access standard by combining the reference attribute information and the standard transport cost, taking the task transport cost as the optimization target, so that when the task is divided into networks based on the task access standard, the task transport cost required to complete the item transport task can be effectively controlled.

[0054] An optional technical solution for determining reference attribute information of a reference transport task may include: determining a reference quantity of reference transport tasks, and reference attribute information of the reference quantity of reference transport tasks; taking the task transport cost required to complete the reference transport task as the optimization target, and determining the task network access standard of each allocable transport network based on the reference attribute information and the standard transport cost of each allocable transport network, including: taking the task transport cost required to complete the reference quantity of reference transport tasks as the optimization target, and determining the task network access standard of each allocable transport network based on the reference quantity, reference attribute information and the standard transport cost of each allocable transport network.

[0055] Among them, in order to further improve the control effect of the task transportation cost, when determining the task access standard, in addition to considering the reference attribute information and the standard transportation cost, the reference quantity of the reference transportation task is also an important factor, which is particularly important in scenarios such as e-commerce where there is a fluctuating order volume. Therefore, the reference quantity of the reference transportation task and the reference attribute information of the reference quantity of the reference transportation task can be determined, so as to jointly determine the task access standard based on the reference quantity, reference attribute information and the standard transportation cost. Such a task access standard further improves the control effect of the task transportation cost.

[0056] On this basis, optionally, the reference quantity of reference transport tasks, and reference attribute information of the reference quantity of reference transport tasks are determined, including: obtaining the historical quantity of historical transport tasks that have been completed at historical times, and historical attribute information of the historical quantity of historical transport tasks; predicting the reference quantity of reference transport tasks to be completed in the future, and reference attribute information of the reference quantity of reference transport tasks based on the historical quantity and historical attribute information.

[0057] Among them, since the historical transportation task has been completed at the historical time, its historical quantity and historical attribute information can be directly obtained. For the reference transportation task to be completed in the future, because it is an event that has not occurred, its reference quantity and reference attribute information can be predicted based on the historical quantity and historical attribute information. For example, the reference quantity is predicted based on the historical quantity, and then the reference attribute information is predicted based on the historical quantity, historical attribute information and reference quantity. In addition, when predicting the reference quantity, in addition to considering the historical quantity, factors such as whether there will be a target activity in the future can also be considered, which is not specifically limited here. The specific examples of this technical solution will be explained in combination with the other technical solutions in the following.

[0058] Another optional technical solution for determining reference attribute information of a reference transportation task includes:

[0059] For each preset transportation route of at least one preset transportation route, determining reference attribute information of a reference transportation task corresponding to the preset transportation route;

[0060] For each of the at least two allocable transportation networks, a standard transportation price to be paid for obtaining the transportation service provided by the allocable transportation network is obtained, including:

[0061] For each of the at least two allocable transportation networks, obtain a standard transportation price that needs to be paid in order to obtain the transportation service provided by the allocable transportation network on the preset transportation route;

[0062] Based on the reference attribute information and the standard transportation cost of each allocatable transportation network, the task entry criteria of each allocatable transportation network are determined, including:

[0063] Based on the reference attribute information and the standard transportation cost of each assignable transportation network on the preset transportation route, the task access standard of each assignable transportation network on the preset transportation route is determined.

[0064] As mentioned above, an allocable transportation network can cover one or more preset transportation routes, and the one or more preset transportation routes are routes that are pre-set by the allocable transportation network and can provide transportation services. Since the standard transportation costs of the same allocable transportation network on different preset transportation routes may be different, and the reference attribute information on different preset transportation routes may also be different, in order to more effectively control the task transportation cost, the reference attribute information determination process can be focused on the dimension of the preset transportation route (hereinafter referred to as the route dimension), and then combined with the standard transportation cost that is also focused on the route dimension, the task access standard obtained is also the task access standard on the route dimension, thereby ensuring the effective control of the task transportation cost on the route dimension, and further ensuring the effective control of the global task transportation cost.

[0065] Figure 2 It is a flow chart of another task networking method provided in an embodiment of the present invention. This embodiment is optimized based on the above-mentioned technical solutions. In this embodiment, optionally, based on the reference attribute information and the standard transportation cost of each allocable transportation network, the above-mentioned task networking method also includes: determining the network acceptance standard of each allocable transportation network, wherein the network acceptance standard is related to the information type; based on the task network access standard and the target attribute information of the item transportation task, allocating the item transportation task among at least two allocable transportation networks, including: based on the task network access standard, the network acceptance standard and the target attribute information of the item transportation task, allocating the item transportation task among at least two allocable transportation networks. Among them, the explanations of the terms that are the same or corresponding to the above-mentioned embodiments are not repeated here.

[0066] See also Figure 2 The method of this embodiment may specifically include the following steps:

[0067] S210: Determine reference attribute information of the reference transportation task.

[0068] S220. For each of the at least two allocable transportation networks, obtain a standard transportation price required to obtain transportation services provided by the allocable transportation network, wherein the standard transportation price is related to an information type of the reference attribute information.

[0069] S230. Taking the task transportation cost required to complete the reference transportation task as the optimization target, based on the reference attribute information and the standard transportation cost of each allocatable transportation network, determine the task access standard and network acceptance standard for each allocatable transportation network, and perform the following steps based on the task access standard and network acceptance standard, wherein the task access standard and network acceptance standard are both related to the information type.

[0070] Among them, the task transportation cost can include two parts: road transportation cost and terminal distribution cost (i.e., serial point distribution cost). The former can be understood as the cost to be paid for transporting the reference transportation items in the reference transportation task from the departure point to the terminal site corresponding to the destination. The terminal site can be an actual terminal site, or it can be the location of the transportation vehicle when entering the terminal distribution link from the road transportation link, etc., which is not specifically limited here; the latter can be understood as the cost to be paid for the distribution of reference transportation items. It should be noted that, considering that the number of reference transportation tasks may be one, two or more, that is, the destinations corresponding to these reference transportation tasks may be one, two or more, when there are at least two destinations, this means that the transportation vehicle needs to go to at least two destinations for distribution, which is serial point distribution. It can be seen that in order to better control the task transportation cost, the road transportation cost and the terminal distribution cost can be controlled separately. Specifically,

[0071] According to the above explanation, the task access standard can also be called the minimum access standard. This is because only the item transportation tasks that exceed the required weight value (here taking the information type as weight as an example) can enter the allocable transportation network for transportation. This can avoid the situation where a destination needs to be traveled to in order to deliver a very light item transportation task during terminal distribution, thereby effectively controlling the terminal distribution cost.

[0072] On this basis, in order to control the cost of road transportation, the concept of network acceptance standard is proposed here, which is used to indicate the standard that the allocable transportation network can undertake (or provide transportation services). In other words, even if the item transportation task meets the task access standard of the allocable transportation network, it only means that it can enter the allocable transportation network, but whether the allocable transportation network can undertake the item transportation task depends on whether the item transportation task meets its network acceptance standard. For example, taking the information type as weight as an example, the network acceptance standard can be described as that only when the sum of the weight values ​​of all item transportation tasks entering the allocable transportation network exceeds XX kilograms, the allocable transportation network can undertake these item transportation tasks and provide transportation services for them. In this way, only when many item transportation tasks enter the allocable transportation network, the allocable transportation network will provide transportation services. It should be noted that the more item transportation tasks there are, the lower the road transportation cost is. Therefore, the setting of the network acceptance standard can effectively control the road transportation cost.

[0073] Therefore, the task transportation cost required to complete the reference transportation task can be used as the optimization target. Based on the reference attribute information and the standard transportation cost of each allocable transportation network, the task access standard and network acceptance standard of each allocable transportation network can be determined. That is, each allocable transportation network has its own network acceptance standard, and then the task networking process is jointly implemented based on the two sets of standards.

[0074] S240. In the case of dividing the item transportation tasks into different networks, the item transportation tasks are allocated among at least two allocatable transportation networks based on the task access standards, the network acceptance standards and the target attribute information of the item transportation tasks, wherein the item transportation tasks correspond to the reference transportation tasks.

[0075] The technical solution of the embodiment of the present invention controls the terminal delivery cost through the application of the task access standard, and controls the road transportation cost through the application of the network acceptance standard. These two aspects cooperate with each other, thereby improving the control effect of the task transportation cost as a whole.

[0076] Figure 3It is a flow chart of another task networking method provided in an embodiment of the present invention. This embodiment is optimized based on the above technical solution. In this embodiment, optionally, based on the task access standard, the network acceptance standard and the target attribute information of the item transportation task, the item transportation task is allocated in at least two allocable transportation networks, including: for the current network in at least two allocable transportation networks, when the target attribute information of the item transportation task meets the task access standard of the current network, the item transportation task is aggregated into the unallocated task set of the current network, and the unallocated task set is updated; when the set attribute information of the unallocated task set meets the network acceptance standard of the current network, all the unallocated tasks in the unallocated task set are allocated to the current network. Among them, the explanations of the terms that are the same or corresponding to the above embodiments are not repeated here.

[0077] See also Figure 3 The method of this embodiment may specifically include the following steps:

[0078] S310: Determine reference attribute information of the reference transportation task.

[0079] S320. For each of the at least two allocable transportation networks, obtain a standard transportation price required to obtain transportation services provided by the allocable transportation network, wherein the standard transportation price is related to an information type of the reference attribute information.

[0080] S330. Taking the task transportation cost required to complete the reference transportation task as the optimization target, based on the reference attribute information and the standard transportation cost of each allocatable transportation network, determine the task access standard and network acceptance standard for each allocatable transportation network, and perform the following steps based on the task access standard and network acceptance standard, wherein the task access standard and network acceptance standard are both related to the information type.

[0081] S340. When the item transportation tasks are divided into different networks, for the current network among at least two assignable transportation networks, if the target attribute information of the item transportation tasks meets the task access criteria of the current network, the item transportation tasks are aggregated into the unassigned task set of the current network, and the unassigned task set is updated.

[0082] Among them, the current network can be understood as the allocable transportation network currently used to determine whether to allocate the item transportation task to it among at least two allocable transportation networks. Exemplarily, the corresponding allocation order can be set in advance for at least two allocable transportation networks. For example, at least two allocable transportation networks include A, B, C and D, and their allocation order is ABCD. Then A can be used as the current network first to determine whether to allocate the item transportation task to A, and if yes, allocate the item transportation task to A, and if no, continue to perform the following steps; update B to the current network, determine whether to allocate the item transportation task to B, and if yes, allocate the item transportation task to B, and if no, continue to perform the following steps; update C to the current network, and so on.

[0083] The unassigned task set, for the current network, can be understood as a set of item transportation tasks that have entered the current network but have not yet been assigned to the current network. Compared with the item transportation tasks described above, the item transportation tasks here appear earlier. The item transportation tasks in the unassigned task set are called unassigned tasks. Therefore, for the newly appeared item transportation tasks, if their target attribute information meets the task access criteria of the current network, this means that the item transportation task can enter the current network, but whether it can be assigned to the current network is uncertain. Therefore, the item transportation task can be aggregated into the unassigned task set and used as part of the unassigned task set, and then updated to the unassigned task set based on the aggregated unassigned task set.

[0084] S350: When the set attribute information of the unassigned task set meets the network acceptance standard of the current network, all the unassigned tasks in the unassigned task set are assigned to the current network.

[0085] The set attribute information can be understood as the attribute information of the unassigned task set, which can be obtained by processing the unassigned attribute information of all unassigned tasks. For example, taking the information type of weight as an example, the sum of the weight values ​​of all unassigned tasks can be used as the set attribute information. When the set attribute information meets the network acceptance standard of the current network, it means that the current network can accept these unassigned tasks, and these unassigned tasks can be assigned to the current network.

[0086] The technical solution of the embodiment of the present invention is not to divide the network by the dimension of a single item transportation task, but to divide the network by aggregating item transportation tasks (that is, by multiple item transportation task dimensions), and on this basis cooperate with the network acceptance standard, thereby achieving effective control of road transportation costs.

[0087] An optional technical solution, when the set attribute information of the unassigned task set meets the network acceptance standard of the current network, all the unassigned tasks in the unassigned task set are assigned to the current network, including: when the current time is the aggregation end time corresponding to the current network, and the set attribute information of the unassigned task set meets the network acceptance standard of the current network, all the unassigned tasks in the unassigned task set are assigned to the current network. Among them, in order to improve the control effect of the road transportation cost, all the item transportation tasks that meet the task network access standard and arrive before the aggregation end time can be aggregated into the unassigned task set, and then when the current time is the aggregation end time and the set attribute information meets the network acceptance standard, all the unassigned tasks are assigned to the current network. The above-mentioned aggregation end time can be understood as the time when the current network stops aggregating item transportation tasks, which can be set according to actual conditions, for example, according to the transportation start time of the current network.

[0088] On this basis, the above-mentioned task networking method also includes: when the current time is the aggregation end time and the collection attribute information does not meet the network acceptance standard of the current network, the first next network of the current network is used as the current network, wherein the first next network includes at least two allocable transportation networks determined according to a pre-set first allocation order; for each unallocated task in all unallocated tasks, the unallocated task is used as an item transportation task, and it is determined whether the target attribute information of the item transportation task meets the task network access standard of the current network.

[0089] That is to say, when the aggregation end time has been reached, the collection attribute information still does not meet the network acceptance standard of the current network, which means that the current network is indeed unable to accept these unassigned tasks. Then the first next network of the current network can be used as the current network, and the unassigned tasks can be divided into networks by repeatedly executing the above scheme, thereby determining whether the first next network can accept these unassigned tasks, thereby ensuring the effective division of these unassigned tasks. It should be noted that the first allocation order can be understood as the allocation order pre-set for at least two allocatable transportation networks, such as ABCD in the above example, so the next network of the current network is determined from at least two allocatable transportation networks according to the first allocation order, and then the next network is used as the first next network.

[0090] Another optional technical solution is to aggregate the item transportation tasks into the unassigned task set of the current network, including: obtaining the target transportation route and / or target transportation time of the item transportation tasks; if there is an unassigned task set in the current network that matches the target transportation route and / or target transportation time, aggregate the item transportation tasks into the unassigned task set; and / or, if there is no unassigned task set, generate an unassigned task set based on the item transportation tasks to aggregate the item transportation tasks into the unassigned task set. That is, the item transportation tasks are aggregated according to the target transportation route and / or target transportation time, thereby realizing a more fine-grained item transportation task aggregation process, so as to further ensure the control effect of the road transportation cost.

[0091] Another optional technical solution, the above-mentioned task network division method may also include: when the target attribute information does not meet the task network access standard of the current network, the second next network of the current network is used as the current network, and it is determined whether the target attribute information meets the task network access standard of the current network; wherein the second next network includes at least two assignable transportation networks that are determined according to the preset second allocation order. That is, when the target attribute information does not meet the task network access standard of the current network, it means that the item transportation task cannot be assigned to the current network, then the second next network of the current network can be used as the current network, and by repeatedly executing the above scheme, it is determined whether the item transportation task can be assigned to the second next network, thereby ensuring the effective network division of the item transportation task. The determination process of the second next network is similar to the determination process of the first next network in the above text, and will not be repeated here. It should be emphasized that the first next network and the second next network are essentially the same, and different names are used here only to distinguish the next networks in different technical schemes, and it is not a specific limitation of their substantive meanings.

[0092] Figure 4 It is a flow chart of another task networking method provided in an embodiment of the present invention. This embodiment is optimized based on the above-mentioned technical solutions. In this embodiment, optionally, the above-mentioned task networking method also includes: for the changed tasks that have changed in all unassigned tasks, when the set attribute information does not meet the network acceptance standard of the current network and the unassigned task set can continue to be aggregated, the changed tasks are removed from the unassigned task set and the unassigned task set is updated. Among them, the explanations of the terms that are the same or corresponding to the above-mentioned embodiments are not repeated here.

[0093] See also Figure 4 The method of this embodiment may specifically include the following steps:

[0094] S410: Determine reference attribute information of the reference transportation task.

[0095] S420. For each of the at least two allocable transportation networks, obtain a standard transportation price required to obtain transportation services provided by the allocable transportation network, wherein the standard transportation price is related to an information type of the reference attribute information.

[0096] S430. Taking the task transportation cost required to complete the reference transportation task as the optimization target, based on the reference attribute information and the standard transportation cost of each allocatable transportation network, determine the task access standard and network acceptance standard for each allocatable transportation network, and perform the following steps based on the task access standard and network acceptance standard, wherein the task access standard and network acceptance standard are both related to the information type.

[0097] S440. When the item transportation tasks are divided into different networks, for the current network among at least two assignable transportation networks, if the target attribute information of the item transportation tasks meets the task access criteria of the current network, the item transportation tasks are aggregated into the unassigned task set of the current network, and the unassigned task set is updated.

[0098] S450: When the set attribute information of the unassigned task set meets the network acceptance standard of the current network, all the unassigned tasks in the unassigned task set are assigned to the current network.

[0099] S460. For changed tasks among all unassigned tasks, if the set attribute information does not meet the network acceptance standard of the current network and the unassigned task set can continue to be aggregated, remove the changed tasks from the unassigned task set and update the unassigned task set.

[0100] Among them, the changed task can be understood as an unassigned task that has changed among all unassigned tasks. This change can be reflected in many aspects, such as changes in the target transportation address, changes in the target transportation time limit, task cancellation or task splitting, etc., which are not specifically limited here.

[0101] When the current network is still gathering item transport tasks and has not gathered them successfully, the change task can be removed from the unassigned task set to ensure that the unassigned task set that the current network finally gathers can complete the transportation based on the optimal task transportation cost. Of course, when the current network is still gathering and has gathered successfully or the current network has failed to gather, whether to remove the change task from the unassigned task set depends on the change type of the change task and is not specifically limited here.

[0102] The technical solution of the embodiment of the present invention removes the changed tasks from the unassigned task set that has not been successfully aggregated and can continue to be aggregated, thereby ensuring that the unassigned task set that the current network finally aggregates to can complete transportation based on the optimal task transportation cost.

[0103] An optional technical solution, for the changed tasks that have changed in all the unassigned tasks, includes: for the changed tasks that have changed in the target transportation address and / or target transportation time efficiency in all the unassigned tasks; the above-mentioned task networking method also includes: updating the changed tasks to the goods transportation tasks to network the goods transportation tasks. Among them, when the target transportation address and / or the target transportation time efficiency change, the target transportation route and / or the target transportation time efficiency of the corresponding changed tasks may change, so the changed tasks can be updated to the goods transportation tasks and re-networked. In other words, in many cases, such as the set attribute information does not meet the network acceptance standard of the current network, and the unassigned task set can continue to be aggregated (i.e., in the collection order); the unassigned task set stops gathering (i.e., the collection order fails); the set attribute information meets the network acceptance standard of the current network (i.e., the collection order succeeds); etc., at this time, the changed tasks can be used as the goods transportation tasks to re-network, thereby ensuring the accuracy of the changed tasks during the transportation process.

[0104] In order to better understand the above-mentioned technical solutions as a whole, the following is an illustrative description of the above-mentioned technical solutions in combination with specific examples. For example, the transportation of goods in an order (hereinafter referred to as an order) through a B2B network, a fast transportation network and a courier network is taken as an example. Figure 5a :

[0105] At 0:00 every day, big data captures historical data, such as the order volume of the previous day, the sum of the weight / volume of the order volume of the previous day, the average daily order volume in the past month, and the sum of the weight / volume of the average daily order volume, and combines it with the promotional activity data of the next day. These data are processed based on certain weights to predict the order volume of the next day and the sum of the weight / volume of the order volume of the next day.

[0106] For the above three transportation networks, the B2B network is generally preferred, followed by the express network, and the express network is the last resort (this is the pre-set allocation order). Therefore, based on the prediction results, combined with the preset transportation routes (hereinafter referred to as routes) actually operated by the B2B network, express network and express network and the quotations for the routes (originating fourth-level address-destination fourth-level address), the minimum network access standards of the B2B network and express network (such as the minimum weight / volume of a single order) that can optimize the overall cost (i.e., the task transportation cost mentioned above) can be calculated, as well as the network acceptance standards of the B2B network and express network (such as the minimum weight / volume of the line dimension / collection single dimension). The application of the minimum network access standard can optimize the terminal distribution cost; the application of the network acceptance standard can optimize the road transportation cost (i.e., the line cost). As can be seen from the above, the above two sets of standards are configured according to network + line + weight / volume, that is, one network corresponds to two weight / volume thresholds on one line.

[0107] After the distribution order receiving layer receives the order, the network layer compares and judges the order's route, weight, volume and other factors with the minimum network access standard of the B2B network. If the minimum network access standard is met, the order collection process begins. It supports the formation of collection orders by the same time and same route dimensions, and synchronously updates the weight and volume of the collection order. For example, if there is a collection order of "collection in progress" & same time and same route, the order will be bound to the collection order, and the weight and volume of the collection order will be updated, and the order status will be updated to "collection in progress"; for example, if there is no collection order of "collection in progress" & same time and same route, a collection order can be generated according to the same route + same time and same route, and the order status will be updated to "collection in progress" according to the B2B network collection. In the process of order collection, the cancellation, splitting and information changes of orders are detected and processed in real time, which will be explained in detail later. If the order collection reaches the B2B network acceptance standard before the end of the collection, it is considered that the order collection is successful according to the B2B network, and the order in the collection is updated to "successful collection", marked as going through the B2B network, and the B2B network is allocated for transportation; if the order collection is not successful before the end of the collection, the express network will be downgraded. In addition, if the minimum network access standard of the B2B network is not met, the express network will be downgraded.

[0108] The processing of the express network is similar to that of the B2B network, so I will not repeat it here. If the minimum entry standard of the express network is not met or the order is not successfully collected in the express network, the express network will be downgraded and it will be responsible for the backup.

[0109] As shown above, the definition of the order collection end time is different for different transportation networks. For the B2B network, it can be 1 hour before the start of transportation, and for the express network, it can be 30 minutes before the start of transportation.

[0110] See also Figure 5bFor the order cancellation / splitting scenario, the upstream order layer notifies the order cancellation / splitting through MQ, and the sub-network layer identifies the order status for processing. For example, if the order status is in order collection, it means that the order collection has not yet ended. In order to obtain the best order collection effect, the order can be removed from the collection order, and the order is set to "order collection failure", and the failure reason and remarks (cancellation / splitting) are recorded; for another example, if the order status is successful order collection, the canceled order can be processed at the operation layer, and the split order can continue to be placed in the collection order because the order address has not changed. Therefore, no processing is required at the sub-network layer at this time, that is, the order is not processed, and remarks (cancellation / splitting) are recorded; for another example, if the order status is failed order collection, the canceled order is directly canceled, and the split order can be re-networked as a new order. Therefore, no processing is required at the sub-network layer at this time, that is, the order is not processed, and remarks (cancellation / splitting) are recorded.

[0111] For scenarios where order information changes (such as order address modification, etc.), the upstream order layer can re-push the order information, and the network layer identifies the order status for processing. For example, if the order status is in the order collection, the order is removed from the order collection and set to "order collection failure", the reason for failure is [order information modification], and the network collection and distribution is restarted according to the new order; for example, if the order status is successful, the order is marked with [order information changed after successful order collection, re-order collection], and the network collection and distribution is restarted according to the new order; for example, if the order status is failed, the order is marked with [order information changed, re-order collection], and the network collection and distribution is restarted according to the new order. In other words, for scenarios where order information changes, since its target transportation route and target transportation time may change, no matter what order status the order is in, it is necessary to enter the network collection and distribution restart according to the new order to ensure the accuracy of order transportation.

[0112] The above technical solution aims at optimizing the overall cost. Under the premise of fully considering the order quantity and actual transportation resources, the two sets of standards for different transportation networks are dynamically calculated by big data, and no longer rely on manual configuration. At the same time, it supports combining single orders in different transportation network ranges according to the same time + same route dimensions, and dynamically detects order changes and adjusts the collection order during the collection process, dynamically downgrades the transportation network collection order according to the end time of the collection, and considers the optimal cost within the overall range. It can be seen that the above technical solution can reduce human computing intervention, reduce dependence on manual configuration, and achieve cost optimization from a global perspective.

[0113] Figure 6 This is a structural block diagram of a task network device provided in an embodiment of the present invention, and the device is used to execute the task network method provided in any of the above embodiments. The device and the task network method in the above embodiments belong to the same inventive concept. For details not described in detail in the embodiment of the task network device, please refer to the embodiment of the above task network method. Figure 6 The device may specifically include: a reference attribute information determination module 510, a standard transportation cost acquisition module 520 and a task network division module 530.

[0114] A reference attribute information determination module 510, for determining reference attribute information of a reference transportation task;

[0115] A standard transportation cost acquisition module 520 is used to acquire, for each of the at least two allocable transportation networks, a standard transportation cost required to obtain transportation services provided by the allocable transportation network;

[0116] The task network division module 530 is used to determine the task network entry standard of each allocatable transportation network based on the reference attribute information and the standard transportation cost of each allocatable transportation network, taking the task transportation cost required to complete the reference transportation task as the optimization target, so as to allocate the item transportation task to at least two allocatable transportation networks based on the task network entry standard and the target attribute information of the item transportation task when the item transportation task is divided into networks;

[0117] Among them, the item transportation task corresponds to the reference transportation task, and the standard transportation cost and task access standard are both related to the information type of the reference attribute information.

[0118] Optionally, the reference attribute information determination module 510 may include:

[0119] A reference attribute information determination unit, used to determine a reference quantity of reference transport tasks and reference attribute information of the reference quantity of reference transport tasks;

[0120] The task network module 530 may include:

[0121] The first determination unit of the task access standard is used to determine the task access standard of each allocatable transportation network based on the reference quantity, reference attribute information and the standard transportation cost of each allocatable transportation network, taking the task transportation cost required to complete the reference quantity of reference transportation tasks as the optimization target.

[0122] On this basis, optionally, a reference attribute information determination unit is specifically used to:

[0123] Obtain the historical number of historical transportation tasks that have been completed in historical time, and the historical attribute information of the historical number of historical transportation tasks;

[0124] Based on the historical quantity and the historical attribute information, a reference quantity of reference transportation tasks to be completed in the future and reference attribute information of the reference quantity of reference transportation tasks are predicted.

[0125] Optionally, the reference attribute information determination module 510 is specifically configured to:

[0126] For each preset transportation route of at least one preset transportation route, determining reference attribute information of a reference transportation task corresponding to the preset transportation route;

[0127] The standard transportation cost acquisition module 520 is specifically used for:

[0128] For each of the at least two allocable transportation networks, obtain a standard transportation price that needs to be paid in order to obtain the transportation service provided by the allocable transportation network on the preset transportation route;

[0129] The task network module 530 may include:

[0130] The task access standard second determination unit is used to determine the task access standard of each assignable transportation network on the preset transportation route based on the reference attribute information and the standard transportation cost of each assignable transportation network on the preset transportation route.

[0131] Optionally, the task network module 530 may include:

[0132] A network acceptance standard determination submodule is used to determine the network acceptance standard of each allocatable transportation network based on the reference attribute information and the standard transportation cost of each allocatable transportation network, wherein the network acceptance standard is related to the information type;

[0133] The task network distribution submodule is used to distribute the item transportation task among at least two allocatable transportation networks based on the task network access standard, network acceptance standard and target attribute information of the item transportation task.

[0134] On this basis, optional task sub-network modules may include:

[0135] The item transportation task aggregation unit is used to aggregate the item transportation tasks into the unassigned task set of the current network and update the unassigned task set for the current network in the at least two allocatable transportation networks, if the target attribute information of the item transportation tasks meets the task access criteria of the current network;

[0136] The task network distribution unit is used to allocate all the unallocated tasks in the unallocated task set to the current network when the set attribute information of the unallocated task set meets the network acceptance standard of the current network.

[0137] On this basis, an optional task sub-network unit is specifically used to:

[0138] When the current time is the aggregation end time corresponding to the current network and the set attribute information of the unassigned task set meets the network acceptance standard of the current network, all the unassigned tasks in the unassigned task set are assigned to the current network.

[0139] On this basis, the optional task sub-module also includes:

[0140] A current network first updating unit, used for the current network first updating unit, is used to use the first next network of the current network as the current network when the current time is the aggregation end time and the aggregate attribute information does not meet the network acceptance standard of the current network, wherein the first next network includes an allocatable transportation network determined according to a preset first allocation order among at least two allocatable transportation networks;

[0141] The first task access standard judgment unit is used to update each unassigned task in all unassigned tasks to an item transportation task, and determine whether the target attribute information of the item transportation task meets the task access standard of the current network.

[0142] Alternatively, the item transportation task aggregation unit may include:

[0143] A target transportation time efficiency acquisition subunit is used to acquire a target transportation route and / or target transportation time efficiency of an item transportation task;

[0144] The item transportation task aggregation subunit is used to aggregate the item transportation tasks into an unassigned task set when there is an unassigned task set that matches the target transportation route and / or target transportation time limit in the current network; and / or, when no unassigned task set exists, generate an unassigned task set based on the item transportation tasks to aggregate the item transportation tasks into the unassigned task set.

[0145] Another optional, optional, task sub-networking sub-module may include:

[0146] The second task network access standard judgment unit is used for taking the second next network of the current network as the current network and determining whether the target attribute information meets the task network access standard of the current network when the target attribute information does not meet the task network access standard of the current network;

[0147] The second next network includes an allocatable transportation network determined according to a preset second allocation order among at least two allocatable transportation networks.

[0148] Another optional task network submodule may include:

[0149] The changed task elimination unit is used to eliminate the changed tasks from the unassigned task set and update the unassigned task set for the changed tasks that have changed in all unassigned tasks, if the set attribute information does not meet the network acceptance standard of the current network and the unassigned task set can continue to be aggregated.

[0150] On this basis, optional changes to the task elimination unit may include:

[0151] The changed task determination subunit is used for determining the changed tasks for which the target transportation address and / or target transportation time limit have changed among all the unassigned tasks.

[0152] Based on any of the above devices, optionally, the information type includes weight and / or volume.

[0153] The task network division device provided by the embodiment of the present invention determines the reference attribute information of the reference transportation task through the cooperation between the reference attribute information determination module and the standard transportation cost acquisition module, and obtains the standard transportation cost related to the information type of the reference attribute information that needs to be paid for obtaining the transportation service provided by the at least two allocable transportation networks for each allocable transportation network; further, the task network division module takes the task transportation cost required to complete the reference transportation task as the optimization target, and determines the task network entry standard related to the above information type for each allocable transportation network based on the reference attribute information and the standard transportation cost of each allocable transportation network, so that when the item transportation task corresponding to the reference transportation task is divided into networks, the item transportation task can be allocated to at least two allocable transportation networks based on the task network entry standard and the target attribute information of the item transportation task. The above device automatically determines the task network entry standard with the task transportation cost as the optimization target by combining the reference attribute information and the standard transportation cost, so that when the task network division is performed based on the task network entry standard, the task transportation cost required to complete the item transportation task can be effectively controlled.

[0154] The task networking device provided in the embodiment of the present invention can execute the task networking method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

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

[0156] Figure 7A schematic diagram of the structure of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0157] like Figure 7 As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0158] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0159] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as the task network method.

[0160] In some embodiments, the task networking method can be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the task networking method described above can be performed. Alternatively, in other embodiments, the processor 11 can be configured to perform the task networking method in any other appropriate manner (for example, by means of firmware).

[0161] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0162] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

[0163] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0164] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0165] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0166] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0167] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0168] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A task network division method, characterized in that: include: Determine reference attribute information of the reference transportation task; For each of the at least two allocable transportation networks, obtain a standard transportation price required to obtain transportation services provided by the allocable transportation network; Taking the task transportation cost required to complete the reference transportation task as the optimization target, based on the reference attribute information and the standard transportation cost of each allocatable transportation network, determining the task network entry standard of each allocatable transportation network, so as to allocate the item transportation task among the at least two allocatable transportation networks based on the task network entry standard and the target attribute information of the item transportation task when the item transportation task is divided into networks; The item transportation task corresponds to the reference transportation task, and the standard transportation cost and the task network access standard are both related to the information type of the reference attribute information.

2. The method according to claim 1, characterized in that: The step of determining the reference attribute information of the reference transportation task includes: Determine a reference quantity of reference transport tasks and reference attribute information of the reference quantity of reference transport tasks; The optimization objective is to determine the task transport cost required to complete the reference transport task, based on the reference attribute information and the standard transport cost of each allocatable transport network, the task access standard of each allocatable transport network, including: Taking the task transportation cost required to complete the reference transportation task of the reference quantity as the optimization target, the task access standard of each allocable transportation network is determined based on the reference quantity, the reference attribute information and the standard transportation cost of each allocable transportation network.

3. The method according to claim 2, characterized in that The step of determining a reference quantity of reference transport tasks and reference attribute information of the reference quantity of reference transport tasks includes: Obtaining the historical number of historical transportation tasks that have been completed at historical times, and the historical attribute information of the historical number of historical transportation tasks; Based on the historical quantity and the historical attribute information, a reference quantity of reference transportation tasks to be completed at a future time and reference attribute information of the reference quantity of reference transportation tasks are predicted.

4. The method according to claim 1, characterized in that: The step of determining the reference attribute information of the reference transportation task includes: For each preset transport route of at least one preset transport route, determining reference attribute information of a reference transport task corresponding to the preset transport route; The step of obtaining, for each of the at least two allocable transportation networks, a standard transportation price required to obtain the transportation service provided by the allocable transportation network comprises: For each of the at least two allocable transportation networks, obtaining a standard transportation price that needs to be paid in order to obtain the transportation service provided by the allocable transportation network on the preset transportation route; The determining of the task access standard of each allocatable transportation network based on the reference attribute information and the standard transportation cost of each allocatable transportation network includes: Based on the reference attribute information and the standard transportation cost of each allocable transportation network on the preset transportation route, a task access standard of each allocable transportation network on the preset transportation route is determined.

5. The method according to claim 1, characterized in that After the reference attribute information and the standard transportation cost of each allocatable transportation network are used, the method further includes: Determining a network acceptance standard for each of the allocatable transportation networks, wherein the network acceptance standard is related to the information type; The allocating the item transportation task among the at least two allocable transportation networks based on the task network access standard and the target attribute information of the item transportation task comprises: Based on the task network access standard, the network acceptance standard and the target attribute information of the item transportation task, the item transportation task is allocated among the at least two allocable transportation networks.

6. The method according to claim 5, characterized in that The allocating the item transportation task among the at least two allocable transportation networks based on the task network access standard, the network acceptance standard and the target attribute information of the item transportation task comprises: For a current network among the at least two assignable transportation networks, if the target attribute information of the item transportation task meets the task access criteria of the current network, the item transportation task is aggregated into an unassigned task set of the current network, and the unassigned task set is updated; In a case where the set attribute information of the unassigned task set meets the network acceptance standard of the current network, all the unassigned tasks in the unassigned task set are assigned to the current network.

7. The method according to claim 6, characterized in that When the set attribute information of the unassigned task set meets the network acceptance standard of the current network, allocating all the unassigned tasks in the unassigned task set to the current network includes: When the current time is the aggregation end time corresponding to the current network and the set attribute information of the unassigned task set meets the network acceptance standard of the current network, all the unassigned tasks in the unassigned task set are assigned to the current network.

8. The method according to claim 6, characterized in that The step of aggregating the item transportation tasks into a set of unassigned tasks of the current network includes: Obtaining a target transportation route and / or target transportation time for the item transportation task; In the case where there is an unassigned task set in the current network that matches the target transportation route and / or the target transportation time limit, the item transportation tasks are aggregated into the unassigned task set; and / or, in the case where the unassigned task set does not exist, the unassigned task set is generated based on the item transportation tasks to aggregate the item transportation tasks into the unassigned task set.

9. The method according to claim 6, characterized in that Also includes: For the changed tasks among all the unassigned tasks, if the set attribute information does not meet the network acceptance standard of the current network and the unassigned task set can continue to be aggregated, the changed tasks will be removed from the unassigned task set and the unassigned task set will be updated.

10. The method according to claim 9, characterized in that The changed tasks for changes in all the unassigned tasks include: For changed tasks in which the target transportation address and / or target transportation time limit are changed among all the unassigned tasks; The method further comprises: The changed tasks are used as the item transportation tasks to divide the item transportation tasks into different networks.

11. A task network device, characterized in that: include: A reference attribute information determination module, used to determine reference attribute information of a reference transportation task; A standard transportation cost acquisition module, used for acquiring, for each of at least two allocable transportation networks, a standard transportation cost required to obtain transportation services provided by the allocable transportation network; A task network division module is used to determine the task network entry standard of each allocatable transportation network based on the reference attribute information and the standard transportation cost of each allocatable transportation network, taking the task transportation cost required to complete the reference transportation task as the optimization target, so as to allocate the item transportation task among the at least two allocatable transportation networks based on the task network entry standard and the target attribute information of the item transportation task when the item transportation task is divided into networks; The item transportation task corresponds to the reference transportation task, and the standard transportation cost and the task network access standard are both related to the information type of the reference attribute information.

12. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor to enable the at least one processor to perform the task networking method according to any one of claims 1 to 10.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the task networking method as described in any one of claims 1-10 when executed.

Images