Method, system, computer equipment and storage medium for direct transportation of goods by skipping nodes

Abstract

The present invention discloses a method, system, computer equipment and storage medium for direct dispatch of goods by skipping nodes, wherein the method comprises: obtaining the initial transport link of all goods orders of the target point; the initial transport link includes each node of the route; screening out the target order set having the same node in the route and meeting the direct dispatch condition; and directly dispatching the target order set to the same node meeting the direct dispatch condition. The present invention reduces the pressure of the cargo transfer yard by skipping nodes, improves the timeliness of goods and the loading rate of direct dispatch, reduces the overall cost of cargo transportation, and can also monitor the cargo volume of the site in real time, and the cargo volume of the region can be combined to arrange the cargo transportation in advance.

Description

Technical Field

[0001] The present application relates to the technical field of cargo transportation, and in particular to a method, system, computer equipment and storage medium for direct cargo transportation by skipping nodes. Background Art

[0002] With the development of the logistics industry, competition in the logistics market is also intensifying. In order to better serve customers, improve the timeliness of customer cargo transportation and reduce transportation prices are the directions that all logistics companies are working towards.

[0003] The existing cargo transportation process forms a pickup and dispatch operation area based on the distribution of logistics company outlets. It is necessary to transport cargo according to a fixed route mode, and it also requires human experience to arrange the transportation of cargo. For example: after the customer places an order, when the driver picks up the goods, the corresponding site manager or dispatcher needs to refresh the cargo status and analyze the cargo timeliness through the system in real time. When the goods picked up by the driver reach the timeliness or when it is manually determined that the goods are not needed, the driver will be arranged to return to the secondary transfer yard according to the fixed route transportation mode, and then the goods will be collected at the secondary transfer yard. All of these require human estimation of the cargo volume to determine how to arrange resources. At the same time, due to the rapid development of logistics companies and the increase in cargo volume in the logistics industry, when the goods are concentrated and returned to the secondary transfer yard in batches for collection, the demand for site transfer capacity will increase greatly, which will invisibly increase the risk of warehouse explosion in the operation of the transfer yard. Summary of the invention

[0004] The present application provides a method, system, computer equipment and storage medium for direct transportation of goods by skipping nodes, so as to solve the problem that it is impossible to accurately know the quantity of goods ordered by customers in advance, and subsequent goods cannot be arranged for direct transportation together, resulting in that these goods cannot achieve the maximum utilization rate of overall resources.

[0005] In order to solve the above technical problems, a technical solution adopted by the present application is to provide a method for direct transportation of goods by skipping nodes, including:

[0006] Obtain the initial transport link of all cargo orders at the target point; the initial transport link includes each node along the way;

[0007] Filter out the target order set that has the same nodes and meets the direct dispatch conditions;

[0008] The target order set is directly transported to the same node that meets the direct delivery conditions.

[0009] As a further improvement of the present application, the transport nodes are set with priorities, and a target order set having the same nodes and meeting the direct delivery conditions is screened out, including:

[0010] According to the transportation node priority from high to low, the order sets of the same node with high priority are filtered out one by one to determine whether the total weight of their goods is greater than the preset value. If so, it is the target order set.

[0011] As a further improvement of the present application, the priorities are set from high to low from the terminal node to the starting node.

[0012] As a further improvement of the present application, the target order set having the same nodes in the path and meeting the direct dispatch conditions is previously screened out including:

[0013] Filter out the order sets with the same route nodes and transport them directly to the terminal nodes.

[0014] As a further improvement of the present application, there is at least one node between the same node and the starting node.

[0015] As a further improvement of the present application, the initial transport link of all cargo orders of the target point is obtained; the initial transport link includes each node of the route and also includes:

[0016] The cargo orders of each point whose travel distance is within the preset distance threshold are aggregated into the cargo orders of the target point.

[0017] As a further improvement of the present application, for the order set that undergoes direct delivery, the node information between the starting node and the direct delivery node in the initial transportation link of each order is updated and deleted.

[0018] In order to solve the above technical problems, another technical solution adopted by the present application is to provide a cargo node-hopping direct dispatch transportation system, comprising:

[0019] The acquisition module acquires the initial transport links of all cargo orders at the target point; the initial transport links include all nodes along the way;

[0020] The screening module screens out the target order set that has the same nodes and meets the direct dispatch conditions;

[0021] The direct delivery module directly delivers the target order set to the same node that meets the direct delivery conditions.

[0022] In order to solve the above-mentioned technical problems, another technical solution adopted in the present application is: to provide a computer device, the computer device includes a processor and a memory coupled to the processor, the memory stores program instructions, and when the program instructions are executed by the processor, the processor executes the steps of any one of the above-mentioned methods for direct transportation of goods by skipping nodes.

[0023] In order to solve the above-mentioned technical problems, another technical solution adopted in the present application is: to provide a storage medium storing a program file capable of implementing any of the above-mentioned methods of direct transportation of goods by skipping nodes.

[0024] The beneficial effects of the present application are as follows: the method for direct dispatch of goods by skipping nodes of the present application obtains the initial transportation links of all goods orders of the target point, screens out the target order set that has the same node and meets the direct dispatch conditions, and directly dispatches the target order set to the same node that meets the direct dispatch conditions. The present invention reduces the pressure of the cargo transfer yard by using direct dispatch of goods by skipping nodes, improves the timeliness of goods and the loading rate of direct dispatch, reduces the overall cost of cargo transportation, and can also monitor the cargo volume of the site in real time, and the cargo volume of the region can be combined to arrange the cargo transportation in advance. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 It is a flowchart of a method for direct transport of goods by skipping nodes according to an embodiment of the present invention;

[0026] Figure 2 This is a schematic diagram of the functional modules of the cargo node-hopping direct dispatch transportation system according to an embodiment of the present invention;

[0027] Figure 3 is a schematic diagram of the structure of a computer device according to an embodiment of the present invention;

[0028] Figure 4 It is a schematic diagram of the structure of the storage medium of an embodiment of the present invention. DETAILED DESCRIPTION

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

[0030] The terms "first", "second", "third" in this application are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Thus, the features defined as "first", "second", "third" can expressly or implicitly include at least one of the features. In the description of this application, the meaning of "multiple" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined. In the embodiments of this application, all directional indications (such as up, down, left, right, front, back...) are only used to explain the relative position relationship, movement, etc. between the components under a certain specific posture (as shown in the accompanying drawings). If the specific posture changes, the directional indication also changes accordingly. 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 comprising a series of steps or units is not limited to the steps or units listed, but optionally also includes steps or units that are not listed, or optionally also includes other steps or units inherent to these processes, methods, products or devices.

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

[0032] Figure 1 is a flow chart of a method for direct dispatch of goods by skipping nodes according to an embodiment of the present invention. It should be noted that if there is substantially the same result, the method of the present application is not limited to Figure 1 The process sequence shown is limited. Figure 1 As shown, the method includes:

[0033] Step S1: Obtain the initial transport link of all cargo orders at the target point; the initial transport link includes each node along the way.

[0034] When the target point receives the goods, it will receive the goods order information corresponding to the goods. The goods order information contains the initial transportation link composed of various nodes to be passed through later. The target point is the current node, that is, the first node of each node to be passed through in the initial transportation link. The target point can be the first node where the goods order starts to be transported after the order is placed, or it can be any node arrived during transportation. In one embodiment, from the ordering of goods to the delivery to the recipient, the entire transportation link includes: "shipping point-shipping collection level 2-outbound distribution-inbound distribution-receiving collection level 2-receiving point", among which the shipping collection level 2 and the receiving collection level 2 are the secondary transit yards for goods, and the outbound distribution and inbound distribution are the airport transit yards. Then, the target point can be any node except the receiving point.

[0035] Before step S1, the method further includes: aggregating cargo orders of various points whose travel distances are within a preset distance threshold range as cargo orders of a target point.

[0036] It should be noted that during the cargo transportation process, the order volume of each point is constantly changing. In the business operation scenario, there will be new orders flowing in and new orders flowing out. The calculation of cargo volume is a critical issue. Therefore, in order to ensure the rationality of operation and the maximum possible direct delivery of goods, multi-dimensional cargo volume calculations are carried out, including analyzing the cargo volume distribution of each point within the preset distance threshold, and the cargo throughput capacity of each point, so as to combine the cargo volume of multiple points for direct delivery analysis.

[0037] For example, the points whose driving distances are within the preset distance threshold are point "A", "B" and "C". After further analysis of the cargo volume and cargo throughput capacity, point A is set as the target point, and the cargo orders of points B and C are aggregated into the cargo orders of target point A, and then subsequent analysis is carried out in a unified manner.

[0038] Step S2: Filter out a target order set that has the same nodes in the route and meets the direct dispatch conditions.

[0039] The initial transportation link information of the cargo order of the target point, that is, the current node, is screened to obtain a target order set having the same nodes and meeting the direct dispatch conditions.

[0040] Before step S2, the process also includes: screening out a set of orders with the same route nodes and directly transporting them to the terminal nodes.

[0041] Specifically, for an order set that has all the same nodes, there is no need to further calculate whether it meets the direct delivery condition, but the order set is directly shipped to the terminal node.

[0042] Furthermore, the transport nodes are set with priorities, and the target order set that has the same nodes and meets the direct delivery conditions is screened out, including:

[0043] According to the transportation node priority from high to low, the order sets of the same node with high priority are filtered out one by one to determine whether the total weight of their goods is greater than the preset value. If so, it is the target order set.

[0044] The priority setting, in one embodiment, can be set so that the priority is set from high to low in the direction from the terminal node to the starting node. For example, the transportation link is "shipping point department - second level of shipping collection - outbound distribution - inbound distribution - second level of receiving collection - receiving point department", and it is set from high to low from "receiving point department" to "shipping point department"; in another embodiment, it can also be set so that the last node of the shipping part node has the highest priority, the second highest priority is the first node of the receiving part node, and the priorities of the remaining nodes are set from high to low in the direction from the terminal node to the starting node, wherein the last node of the shipping part node is the outbound distribution, and the first node of the receiving part node is the inbound distribution. For example, the transport link is "shipping point department - second level of shipment collection - outbound distribution - inbound distribution - second level of collection - collection point department", where the airport is used as the basis for dividing the shipping part and the collection part, then "shipping point department - second level of shipment collection - outbound distribution" is the shipping part node, inbound distribution - second level of collection - collection point department is the collection part node, then the priority is ranked from high to low as outbound distribution, inbound distribution, collection point department, second level of collection, second level of shipment collection, shipping point department. It should be noted that the node priority can be set according to timeliness and cost, in accordance with the actual transportation situation.

[0045] Furthermore, after all orders are classified according to the transport node priority from high to low, if the total weight of the order goods in the order set of the same node with the top priority reaches a preset value (for example, 3 tons), the order set of the same node with the top priority of the line is the target order set.

[0046] It should be noted that, in the embodiments of the present invention, the following examples are all described by setting the priority from the terminal node to the starting node in the overall transportation link from high to low. For example, the transportation link is "shipping point department - second level of shipping collection - outbound distribution - inbound distribution - second level of receiving collection - receiving point department", that is, the transportation link contains 6 nodes.

[0047] The following example illustrates how to filter out a target order set that has the same nodes in the route and meets the direct delivery conditions according to the priority setting. The order in Table 1 is taken as an example, where the letters in the table represent the nodes in the transportation link, and the target point is the shipping point.

[0048] Table 1

[0049]

[0050]

[0051] Currently, the maximum number of nodes is 6. First, filter by the highest priority, and then filter the orders with the same nodes 1 and 6. The data is as follows:

[0052] Transport link: A-A1 order includes: YD001, YD002, with a total cargo weight of 2000kg;

[0053] Transport link: A-A2 order includes: YD003, YD005, with a total cargo weight of 2000kg;

[0054] Transport link: A-A3 order includes: YD004, YD006, with a total cargo weight of 2000kg;

[0055] In the three cases, the weight of the goods in each case did not reach the preset value of 3 tons, so the conditions for triggering direct dispatch were not met. All orders continued to be substituted into the subsequent line analysis logic.

[0056] After this round of calculation, the data status is as shown in Table 2:

[0057] Table 2

[0058]

[0059] Start by lowering the priority level by one level, that is, analyzing the 5 nodes according to the transport link (that is, routing nodes 1-5 according to the transport sequence).

[0060] After filtering out the orders with the same first and last routes in nodes 1-5, the data is as follows:

[0061] Transport link: ABC-C1-B1 Order: YD001, YD002, YD003, YD004, total cargo weight 4000kg;

[0062] Transport link: ABC-C1-B2 Order: YD005, YD006, total cargo weight 2000kg;

[0063] After analysis,

[0064] The total weight of transport link ABC-C1-B1 is >= 3 tons, which meets the direct dispatch conditions.

[0065] The total weight of transport link ABC-C1-B2 is less than 3 tons, which does not meet the direct dispatch conditions. All orders under this route will continue to be substituted into the subsequent route analysis logic. After this round of calculation, the data status is as shown in Table 3:

[0066] Table 3

[0067]

[0068] We start to lower the priority level by one level, that is, we analyze the four nodes according to the transport link (that is, we route nodes 1-4 according to the transport sequence).

[0069] After filtering, the data is as follows:

[0070] Transport link: ABC-C1 order: YD005, YD006, YD007, total cargo weight 3000kg; after analysis,

[0071] Transport link: The total weight of ABC-C1 is >= 3 tons, and direct delivery can be arranged. After this round of calculation, the data status is as shown in Table 4:

[0072] Table 4

[0073]

[0074] Among them, in the above tables, the mark 1 means that direct delivery business can be arranged.

[0075] Furthermore, there is at least one node between the same node and the starting node.

[0076] Specifically, the initial transportation link of all cargo orders at the target point is obtained. The initial link includes each node along the way. Order sets of the same nodes with a high priority are filtered out one by one according to the transportation node priority from high to low. The same node is at least one node away from the starting node.

[0077] Step S3: directly transport the target order set to the same node that meets the direct delivery condition.

[0078] Specifically, when the system generates a direct transport task, the manager or regional dispatcher can select a driver to perform the direct transport task, and can specify the driver, vehicle and other task arrangements in the route details. Due to the flexibility of skip-node direct dispatch, manual arrangements are required to facilitate task execution. The driver uses the bar gun function to execute the issued direct dispatch task. He will arrive at the corresponding point according to the bar gun requirements and load the goods according to the task list, and then deliver the goods to the final node of the direct dispatch task to complete the skip-node direct dispatch of goods. Through automated algorithms and some functional configurations, combined with business operation scenarios, the "cargo skip-node transportation" of direct dispatch of goods on the optimal route is realized, and the original series of offline operations and human-dependent experience methods, such as manual data screening through the system, personnel contacting the goods status by phone, etc., are transformed into online and intelligent operations. Through real-time monitoring of goods and the system automatically combining goods from multiple pick-up and dispatch points to collect goods when time permits, it automatically analyzes and generates tasks that can be "skipped node direct dispatched". At the same time, the system issues tasks to drivers to perform tasks, thereby improving the timeliness of goods transportation and reducing the overall cost of goods transportation.

[0079] Furthermore, for the order set that undergoes direct transport, the node information between the starting node and the direct transport node in the initial transport link of each order is updated and deleted.

[0080] Specifically, when the system monitors and calculates the corresponding target point to meet the node-jumping direct dispatch task, it will automatically generate a direct dispatch task route in the task list. For the order set that undergoes direct dispatch transportation, the node information between the starting node and the direct dispatch node in the initial transportation link of each order will be updated and deleted. At the same time, the route planning is performed for the starting node and the direct dispatch node, so that the driver who receives the task can execute it according to the route planning content. At the same time, the above direct dispatch route information will count the waybill details, weight and other multi-dimensional information of the current direct dispatch task.

[0081] The method for direct dispatch of goods by skipping nodes in an embodiment of the present invention obtains the initial transportation links of all goods orders of the target point, screens out a target order set that has the same node and meets the direct dispatch conditions, and directly dispatches the target order set to the same node that meets the direct dispatch conditions. The present invention uses direct dispatch of goods by skipping nodes to reduce the pressure on the cargo transfer station, improve the timeliness of goods and the loading rate of direct dispatch, reduce the overall cost of cargo transportation, and can also monitor the cargo volume of the site in real time, and the cargo volume of the region can be combined to arrange the cargo transportation in advance.

[0082] Figure 2 Schematic diagram of the functional modules of the cargo node-hopping direct dispatching transportation system of the embodiment of the present application. Figure 2 As shown, the cargo skip-node direct dispatch transportation system 2 includes an acquisition module 21 , a screening module 22 , and a direct dispatch module 23 .

[0083] The acquisition module 21 is used to acquire the initial transport link of all cargo orders of the target point; the initial transport link includes each node of the route;

[0084] A screening module 22 is used to screen out a target order set that has the same nodes in the route and meets the direct dispatch conditions;

[0085] The direct dispatch module 23 is used to directly dispatch the target order set to the same node that meets the direct dispatch condition.

[0086] Optionally, the transport nodes are set with priorities to filter out target order sets that have the same nodes and meet direct delivery conditions, including:

[0087] According to the transportation node priority from high to low, the order sets of the same node with high priority are filtered out one by one to determine whether the total weight of their goods is greater than the preset value. If so, it is the target order set.

[0088] Optionally, the priorities are set from high to low from the terminal node to the starting node.

[0089] Optionally, the target order set having the same nodes in the path and meeting the direct dispatch condition is filtered out, including:

[0090] Filter out the order sets with the same route nodes and transport them directly to the terminal nodes.

[0091] Optionally, there is at least one node between the same node and the starting node.

[0092] Optionally, the initial transport link of all cargo orders at the target point is obtained; the initial transport link includes each node along the way and also includes:

[0093] The cargo orders of each point whose travel distance is within the preset distance threshold are aggregated into the cargo orders of the target point.

[0094] Optionally, for the order set that undergoes direct delivery, the node information between the starting node and the direct delivery node in the initial transportation link of each order is updated and deleted.

[0095] For other details about the technical solutions for implementing each module in the cargo skipping node direct transportation system in the above-mentioned embodiment, please refer to the description of the cargo skipping node direct transportation method in the above-mentioned embodiment, which will not be repeated here.

[0096] It should be noted that the various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other. For system embodiments, since they are basically similar to method embodiments, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0097] See also Figure 3 , Figure 3 Schematic diagram of the structure of the computer device of the embodiment of the present application. Figure 3 As shown, the computer device 30 includes a processor 31 and a memory 32 coupled to the processor 31 .

[0098] The memory 32 stores program instructions. When the program instructions are executed by the processor 31, the processor 31 executes the steps of the method for direct transportation of goods by skipping nodes in the above embodiment.

[0099] The processor 31 may also be referred to as a CPU (Central Processing Unit). The processor 31 may be an integrated circuit chip having signal processing capabilities. The processor 31 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0100] See also Figure 4 , Figure 4 Schematic diagram of the structure of the storage medium of the embodiment of the present application. The storage medium of the embodiment of the present application stores a program file 41 that can implement all the above methods, wherein the program file 41 can be stored in the above storage medium in the form of a software product, including a number of instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) or a processor (processor) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk, or a terminal device such as a computer, a server, a mobile phone, and a tablet.

[0101] In the several embodiments provided in the present application, it should be understood that the disclosed terminals, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0102] In addition, each functional unit in each embodiment of the present application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of software functional units. The above is only an implementation method of the present application, and does not limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made by using the description and drawings of this application, or directly or indirectly used in other related technical fields, is also included in the patent protection scope of the present application.

Claims

1. A method for direct transportation of goods by skipping nodes, characterized in that: include: S1. Obtain the initial transportation links of all cargo orders at the target point in real time; The initial transport link is composed of various nodes that the cargo order will subsequently pass through; S2. Filter out the target order set that has the same nodes and meets the direct dispatch conditions; S3, directly transporting the target order set to the same node that meets the direct delivery condition; The node is set with a priority, and the target order set having the same node and meeting the direct dispatch condition is screened out, including: screening out order sets with the same node having a higher priority in order from high to low according to the node priority, and judging whether the total weight of the goods is greater than a preset value, and if so, the order set is the target order set; Before step S1, the method further includes: aggregating cargo orders of each point whose travel distance is within a preset distance threshold range as cargo orders of the target point; Among them, for the order set that undergoes direct delivery, the node information between the starting node and the direct delivery node in the initial transportation link of each order is updated and deleted.

2. The method for direct transportation of goods by skipping nodes according to claim 1 is characterized in that: The priorities are set from high to low from the terminal node to the starting node.

3. The method for direct transportation of goods by skipping nodes according to claim 1 is characterized in that: The step S2 includes: Filter out the order sets with the same route nodes and transport them directly to the terminal nodes.

4. The method for direct transportation of goods by skipping nodes according to claim 1 is characterized in that: The same node is at least one node away from the starting node.

5. A cargo node-hopping direct dispatching transportation system, the system is used to implement the cargo node-hopping direct dispatching transportation method according to any one of claims 1 to 4, characterized in that: include: The acquisition module acquires the initial transportation links of all cargo orders at the target point; The screening module screens out the target order set that has the same nodes and meets the direct dispatch conditions; The direct delivery module directly delivers the target order set to the same node that meets the direct delivery conditions.

6. A computer device, characterized in that: The computer device includes a processor and a memory coupled to the processor, wherein program instructions are stored in the memory. When the program instructions are executed by the processor, the processor executes the steps of the method for direct transportation of goods by skipping nodes as described in any one of claims 1 to 4.

7. A storage medium, characterized in that: A program file is stored which can implement the method for direct transport of goods by skipping nodes as described in any one of claims 1-4.

Images