Goods jump node transportation method, device and equipment and storage medium
By splitting and sorting the cargo transportation link and selecting the optimal transportation method, the problems of low logistics transportation time and high cost are solved, and transportation efficiency is improved and the damage rate is reduced.
Patent Information
- Application Number
- CN202311721498.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-12-14
- Publication Date
- 2024-11-15
AI Technical Summary
The existing logistics and transportation methods have resulted in low time-efficiency in cargo transportation, and the transit process has increased the cargo damage rate and transportation costs.
By obtaining the initial transportation link and current location of the cargo waybill, identify the nodes and split them into sub-transport links, sort the distance and cargo volume, calculate the transit and direct transportation costs, and select the optimal transportation link to improve timeliness and reduce costs. .
It has achieved the improvement of transportation time, reduced overall transportation costs, and reduced cargo damage rate without increasing cargo costs.
Smart Images

Figure CN118966489A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of logistics technology, and in particular to a method, device, equipment and storage medium for transporting goods by skipping nodes. Background Art
[0002] With the rapid development of the logistics industry, the requirements for logistics timeliness are becoming increasingly higher. During the transportation of goods, it is necessary to complete logistics transportation at the fastest speed and the lowest price while ensuring the safety of the goods.
[0003] The traditional logistics transportation method, through the distribution of logistics outlets and the structure of the logistics company's transportation system, combined with the current pickup and dispatch operation mode, transports the goods according to the route batch mode fixed by manual experience after picking up the goods from the customer. As a result, early arriving goods cannot be dispatched in advance, thus reducing the timeliness of goods transportation.
[0004] In addition, when goods are transferred and collected at the same site, they also need to be loaded and unloaded, which increases the labor cost of goods transfer. If there are too many transfer links, the damage rate of goods will increase, thus affecting the safety of goods.
[0005] Therefore, there is an urgent need for a transportation method that can improve the timeliness of cargo transportation without increasing the cost of cargo. Summary of the invention
[0006] The present invention provides a method, device, equipment and storage medium for transporting goods by skipping nodes, so as to solve the technical problem of high time efficiency and low cost of goods transport in the existing transport methods.
[0007] In order to solve the above technical problems, in a first aspect, the present invention provides a method for transporting cargo by skipping nodes, the method comprising:
[0008] According to the initial transport link and current position of each cargo waybill, the node currently corresponding to each cargo waybill and the current transport link are determined respectively, wherein the initial transport link includes each node from the sending point to the receiving point, and the current transport link includes each node from the currently corresponding node to the receiving point;
[0009] For each cargo waybill currently corresponding to any node, split the current transport link of each cargo waybill to obtain a plurality of sub-transport links starting from the currently corresponding node and including at least three nodes, and determine the cargo waybill set corresponding to the sub-transport links with the same nodes;
[0010] The sub-transportation links are sorted by distance and cargo volume, and the transit transportation cost and direct transportation cost of the cargo waybill set corresponding to each sub-transportation link are calculated in sequence to determine the final transportation link and transport.
[0011] Optionally, the step of sequentially calculating the transit transportation cost and the direct transportation cost of the freight waybill set corresponding to each of the sub-transportation links, and determining the final transportation link comprises:
[0012] Calculate the total transit transportation cost and the total direct transportation cost of the current cargo waybill set corresponding to the current sub-transportation link;
[0013] If the total transit transportation cost is greater than the total direct transportation cost, determine to directly transport the current freight waybill set in the current sub-transportation link to form a final transportation link, delete the current freight waybill of the current freight waybill set from other freight waybill sets, and update the next sub-transportation link to the current sub-transportation link;
[0014] Otherwise, the next transport sub-link is updated to be the current transport sub-link.
[0015] Optionally, the step of sequentially calculating the transit transportation cost and the direct transportation cost of the freight waybill set corresponding to each of the sub-transportation links, and determining the final transportation link comprises:
[0016] Calculate the transit transportation cost and direct transportation cost of each current freight waybill in the current freight waybill set corresponding to the current sub-transportation link respectively;
[0017] If the transit transportation cost is greater than the direct transportation cost, determine to directly transport the current freight waybill through the current sub-transportation link to form a final transportation link, delete the current freight waybill from other freight waybill sets, and update the next sub-transportation link to the current sub-transportation link;
[0018] Otherwise, the next transport sub-link is updated to be the current transport sub-link.
[0019] Optionally, the cargo node-hopping transportation method further includes:
[0020] If the weight of the goods in the current cargo waybill is greater than a preset weight threshold, it is determined that the final transportation link of the current cargo waybill is to be directly delivered from the shipping place of the current cargo to the destination.
[0021] Optionally, the step of determining the node currently corresponding to each cargo waybill according to the initial transport link and the current position of each cargo waybill includes:
[0022] Determining whether each of the freight waybills is on the vehicle according to the current location of each of the freight waybills;
[0023] For the cargo waybill on the vehicle, obtain the vehicle's home site as the node currently corresponding to the cargo waybill;
[0024] For a freight waybill that is not on the vehicle, the current location of the freight waybill is matched with each node in the initial transport link to determine the node currently corresponding to the freight waybill.
[0025] Optionally, after the step of determining the cargo waybill set corresponding to the sub-transportation link with the same node, the cargo node-hopping transportation method further includes:
[0026] Calculating the travel time between the starting node and the ending node of each freight waybill in the freight waybill set;
[0027] Whether each of the freight waybills meets the timeliness requirement is determined according to the journey time, and the freight waybills that do not meet the timeliness requirement are deleted from the freight waybill set.
[0028] Optionally, after the step of determining the cargo waybill set corresponding to the sub-transportation link with the same node, the cargo node-hopping transportation method further includes:
[0029] Setting a cargo volume threshold and a distance threshold according to preset attribute parameters of each node in the sub-transportation link, wherein the preset attribute parameters include at least one of the region, transportation resources, and cargo waybill time;
[0030] The freight waybills in the freight waybill set corresponding to the sub-transportation link are screened according to the freight volume threshold and the distance threshold.
[0031] In a second aspect, the present invention provides a cargo node-hopping transport device, including an acquisition module, a splitting module, and a dispatching module;
[0032] The acquisition module is used to determine the node currently corresponding to each cargo waybill and the current transportation link according to the initial transportation link and current position of each cargo waybill, wherein the initial transportation link includes each node passing from the sending point to the receiving point, and the current transportation link includes each node passing from the currently corresponding node to the receiving point;
[0033] The splitting module is used to split the current transport link of each cargo waybill currently corresponding to any node, obtain a plurality of sub-transportation links starting from the currently corresponding node and including at least three nodes, and determine the cargo waybill set corresponding to the sub-transportation links with the same nodes;
[0034] The dispatch module is used to sort the sub-transportation links according to distance and cargo volume, and sequentially calculate the transit transportation cost and direct transportation cost of the cargo waybill set corresponding to each sub-transportation link, determine the final transportation link and transport.
[0035] In a third aspect, the present invention provides a cargo node-hopping transport device, including a memory and a processor, wherein:
[0036] The memory is used to store computer programs;
[0037] The processor is used to read the program in the memory and execute the steps of a cargo skip-node transportation method provided in the first aspect above.
[0038] In a fourth aspect, the present invention provides a computer-readable storage medium having a readable computer program stored thereon, which, when executed by a processor, implements the steps of a cargo skip-node transportation method provided in the first aspect above.
[0039] Compared with the prior art, the method, device, equipment and storage medium for transporting goods by skipping nodes provided by the present invention have the following beneficial effects:
[0040] The present invention obtains the initial transport link and current position of each freight waybill, determines the node currently corresponding to each freight waybill and the current transport link, splits the current transport link of each freight waybill, extracts the common link starting from the currently corresponding node and including at least three nodes, obtains the sub-transportation link and the corresponding freight waybill set, sorts the sub-transportation links according to distance and cargo volume, calculates the transit transportation cost and direct transportation cost of the freight waybill set in each sub-transportation link in turn, and selects the appropriate transportation mode as the final transportation link.
[0041] The embodiment of the present invention can clearly understand the changes in the current route of each freight waybill and the changes in the freight waybill in each point, and automatically combine the freight waybill of sub-transport links with at least three identical points, and perform permutations and combinations of the freight waybill sets corresponding to the sub-transport links to collect and calculate, and obtain the final transportation link with the greatest cost savings, thereby reducing the overall freight transportation cost while improving the timeliness of freight transportation. BRIEF DESCRIPTION OF THE DRAWINGS
[0042] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only part of the embodiments of the present invention, rather than all of the embodiments. For ordinary technicians in this field, without paying creative work, other drawings obtained based on these drawings all fall within the scope of protection of this application.
[0043] Figure 1 It is a flow chart of a method for transporting goods by skipping nodes provided by an embodiment of the present invention;
[0044] Figure 2It is a structural schematic diagram of a cargo node-hopping transport device provided by an embodiment of the present invention;
[0045] Figure 3 It is a structural schematic diagram of a cargo node-hopping transport device provided by an embodiment of the present invention;
[0046] Figure 4 It is a structural schematic diagram of a computer-readable storage medium provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0047] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.
[0048] In order to make the description of the disclosed content more detailed and complete, the following is an illustrative description of the implementation mode and specific examples of the present invention; however, this is not the only form of implementing or applying the specific embodiments of the present invention. The implementation mode covers the features of multiple specific embodiments and the method steps and their sequence for constructing and operating these specific embodiments. However, other specific embodiments can also be used to achieve the same or equal functions and step sequences. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of this application.
[0049] 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 numbers used in this way can be interchanged 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.
[0050] In the description of the embodiments of the present invention, unless otherwise specified, “ / ” means or, for example, A / B can mean A or B; “and / or” in the text is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, “multiple” refers to two or more than two, and other quantifiers are similar. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present invention, and are not used to limit the present invention, and the embodiments of the present application and the features in the embodiments may be combined with each other without conflict.
[0051] In the prior art, when there are too many goods at a certain time period, too many goods arrive at the secondary transfer yard for collection at the same time, which will increase the throughput requirements of the yard. Therefore, the prior art has the following problems:
[0052] 1. The overall volume of cargo cannot be predicted during transportation. When the overall volume of cargo in a region is too small, if the initial cargo meets the needs of direct delivery, but the subsequent cargo volume is not enough for direct delivery, normal transfer is required, which will lead to a waste of transportation resources.
[0053] 2. When calculating the planned transportation costs of goods, the transit costs are calculated in advance according to the manually planned costs. However, there may be temporary operational adjustments in actual transportation, resulting in errors between the planned and calculated costs and the actual costs.
[0054] Based on the above problems, the embodiments of the present invention propose a method, device, equipment and storage medium for transporting goods by skipping nodes:
[0055] Example 1
[0056] In response to the above problems, Figure 1 The flowchart of a cargo node-hopping transportation method provided in an embodiment of the present invention includes the following steps.
[0057] Step S110, according to the initial transport link and current position of each cargo waybill, respectively determine the node currently corresponding to each cargo waybill and the current transport link, the initial transport link includes each node from the sending point to the receiving point, and the current transport link includes each node from the currently corresponding node to the receiving point;
[0058] Collect cargo waybills, which generally include relevant information about the cargo to be transported, such as cargo weight, whether it is fragile, waybill number, pickup distance, mode of transportation, full route, delivery time, etc. The specific information can be determined based on actual conditions, and the embodiments of the present invention do not make specific limitations on this.
[0059] During the implementation of the cargo skip-node transportation method, the driver will report the goods after picking up the goods, and then the data will flow into the waybill system to generate a cargo waybill information. At the same time, the automatic distribution system will distribute the goods according to the service mode or transportation mode of the cargo waybill, confirm whether to go by air or chartered vehicle, and thus derive the planned route of the cargo waybill, the time to arrive at which venue, and the basic information of the cargo waybill, which includes the sending point, the receiving point, the delivery time of the waybill, etc., and generate the cargo waybill based on this information.
[0060] For example, Table 1 is a schematic table of a cargo waybill provided in an embodiment of the present invention, and the cargo waybill may include the information shown in Table 1:
[0061] Table 1
[0062]
[0063] After the cargo is declared, it is sent from the "shipping point" to the "receiving customer's location". The full route of the cargo can be obtained through the basic information and configuration information of the waybill: "shipping point - second level of shipping collection - outbound distribution - inbound distribution - second level of receiving collection - receiving point - receiving customer's location". According to the above logic, a route can be obtained for each cargo waybill reported.
[0064] It should be noted that the shipping point refers to the logistics point where the logistics company receives the goods.
[0065] After obtaining each cargo waybill, the initial transport link of each cargo waybill can be obtained according to the full route recorded in each cargo waybill. Different from the full route, the initial transport link refers to the routing nodes from the sending point to the receiving point, and does not include the route from the receiving point to the receiving customer address.
[0066] In addition, since the goods in the cargo waybill may be in the process of transportation, it is also necessary to obtain the current location of the goods in the cargo waybill, and the current location refers to the real-time location of the goods.
[0067] According to the initial transport link and current position of each freight waybill, the node and current transport link currently corresponding to the freight waybill are determined. In the embodiment of the present invention, the currently corresponding node refers to the routing node corresponding to the current position. According to certain rules, one of all nodes included in the initial transport link can be selected as the currently corresponding node. The selection method can be determined according to actual conditions, and the embodiment of the present invention does not specifically limit this. For example, in the embodiment of the present invention, the node closest to the current position is used as the currently corresponding node of the freight waybill.
[0068] After obtaining the node currently corresponding to the freight waybill, based on the currently corresponding node and the initial transportation link of the freight waybill, filter out the transportation link that starts from the currently corresponding node and passes through each node to the receiving point as the current transportation link corresponding to the freight waybill.
[0069] As an optional implementation mode, the step of determining the node currently corresponding to each cargo waybill according to the initial transport link and the current position of each cargo waybill includes:
[0070] Determining whether each of the freight waybills is on the vehicle according to the current location of each of the freight waybills;
[0071] For the cargo waybill on the vehicle, obtain the vehicle's home site as the node currently corresponding to the cargo waybill;
[0072] For a freight waybill that is not on the vehicle, the current location of the freight waybill is matched with each node in the initial transport link to determine the node currently corresponding to the freight waybill.
[0073] In the embodiment of the present invention, the current position of each cargo waybill is used to determine whether each cargo waybill is on the vehicle. The determination can be based on whether the current position corresponding to two adjacent sampling times changes. If it changes, it means that the cargo on the cargo waybill is on the vehicle. The determination can also be based on the current position of the cargo in the cargo waybill and the current position of the vehicle. If the current positions of the two are the same, it means that the cargo waybill is on the vehicle. The specific determination can be based on actual conditions, and the embodiment of the present invention does not specifically limit this.
[0074] For a cargo waybill with cargo on a vehicle, the vehicle's home site is obtained. The home site can be the final stop of the vehicle or the next stop of the vehicle. The specific location can be determined according to actual conditions, and the embodiment of the present invention does not specifically limit this. The vehicle's home site is used as the node currently corresponding to the cargo waybill.
[0075] For a freight waybill in which the goods are not on the vehicle, the current location of the freight waybill is matched with each routing node in the initial transport link. The node may be the point in the initial transport link that is closest to the current location, or the point in the initial transport link that takes the shortest time to reach the current location. The specific node may be determined based on actual conditions, and the embodiments of the present invention do not make any specific limitation on this.
[0076] The embodiment of the present invention can make full use of transportation resources by making real-time judgment on the node currently corresponding to the freight waybill.
[0077] Continue to Figure 1 In step S120, for each cargo waybill currently corresponding to any node, the current transport link of each cargo waybill is split to obtain a plurality of sub-transport links starting from the currently corresponding node and including at least three nodes, and determine the cargo waybill set corresponding to the sub-transport links with the same nodes;
[0078] For each node, obtain the freight waybill starting from the node, and split the current transport link of the freight waybill to obtain several sub-transport links starting from the current corresponding node and including at least three nodes. The specific splitting method can be determined according to actual conditions, and the embodiment of the present invention does not specifically limit this.
[0079] For example, take routing node A as any node for explanation, count the freight waybills currently corresponding to node A, that is, count all freight waybills departing from node A, and record the waybill number, freight weight, current transportation link and other information of the freight waybill. Table 2 is the current transportation link of the freight waybill corresponding to node A in an embodiment of the present invention, as shown in Table 2:
[0080] Table 2
[0081]
[0082]
[0083] The freight waybills corresponding to node A are [YD01, YD02, YD03, YD04, YD05, YD06]. The current transport links of each freight waybill are shown in Table 2. The current transport links of each freight waybill are split respectively. During the splitting process, the current transport links can be split according to the optimal principle of direct dispatch of goods. The so-called optimal principle of direct dispatch of goods means that the nodes with the largest number of transfer yards and the largest volume of goods in the same direction are skipped first, and at the same time, the split sub-transportation links are guaranteed to include at least three nodes. For example, the sub-transportation links split in Table 2 can be A-F, A-E, A-M, A-C and A-D.
[0084] After determining the above-mentioned sub-transportation link, a cargo waybill set corresponding to the sub-transportation link is obtained. The cargo waybill set includes at least one cargo waybill, and the nodes passed by the current transportation link of the cargo waybill include the nodes of the sub-transportation link. Table 3 is a schematic table of the cargo waybill set corresponding to each sub-transportation link in an embodiment of the present invention, as shown in Table 3:
[0085] Table 3
[0086] Sub-transportation link Direct Distance(KM) Total weight of line(KG) Cargo waybill set A—F 400 1000 YD01, YD02 A—E 300 1500 YD01, YD02, YD03 A—M 350 500 YD04 A—C 280 1500 YD04, YD05 A—D 250 1000 YD01, YD06
[0087] As an optional implementation manner, after the step of determining the cargo waybill set corresponding to the sub-transportation link with the same node, the cargo node-hopping transportation method further includes:
[0088] Calculating the travel time between the starting node and the ending node of each freight waybill in the freight waybill set;
[0089] Whether each of the freight waybills meets the timeliness requirement is determined according to the journey time, and the freight waybills that do not meet the timeliness requirement are deleted from the freight waybill set.
[0090] In the embodiment of the present invention, after obtaining the freight waybill set corresponding to the sub-transport link, it is also necessary to calculate the travel time from the starting node to the end node of the freight waybill contained in each freight waybill set. The calculation method of the travel time can be calculated according to the distance between the starting node and the end node and the vehicle transportation speed, and judge whether the freight waybill can be delivered to the destination within the time limit according to the travel time. If it can be delivered to the destination within the time limit, it means that the time limit requirement is met. If it cannot be delivered to the destination within the time limit, it means that the time limit requirement is not met, and the freight waybill that does not meet the time limit requirement will be deleted from the freight waybill set.
[0091] As an optional implementation manner, after the step of determining the cargo waybill set corresponding to the sub-transportation link with the same node, the cargo node-hopping transportation method further includes:
[0092] Setting a cargo volume threshold and a distance threshold according to preset attribute parameters of each node in the sub-transportation link, wherein the preset attribute parameters include at least one of the region, transportation resources, and cargo waybill time;
[0093] The freight waybills in the freight waybill set corresponding to the sub-transportation link are screened according to the freight volume threshold and the distance threshold.
[0094] In the embodiment of the present invention, after the sub-transportation link is obtained, the cargo volume threshold and distance threshold of the node are set according to the preset attribute parameters of each node in the sub-transportation link. The setting method can be determined according to actual conditions, and the embodiment of the present invention does not specifically limit this.
[0095] The preset attribute parameters include at least one of the region to which the node belongs, the transportation resources, and the cargo waybill time. When setting the cargo volume threshold and the distance threshold, it is necessary to consider the different operating modes and transportation capacity of the region to which it belongs, and it is also necessary to consider different configurations during off-peak and busy hours. For example: the cargo volume in a certain area is relatively large in the afternoon, and there is a possibility of insufficient transportation capacity. If the vehicle runs too far, it will reduce the vehicle utilization rate and affect the arrangement of the remaining cargo volume on the site. Therefore, the direct dispatch distance cannot exceed 300KM. If it exceeds, the direct dispatch task will not be executed. In this case, the distance threshold can be set to 300KM; at the same time, the direct dispatch volume cannot be less than "1000KG", that is, the weight threshold is 1000KG, and it can also be configured through different vehicle models.
[0096] Regarding the freight waybill time, if the freight waybill is picked up and reported in the early morning, there will be relatively fewer orders from customers at night, so the vehicle's transport capacity will increase, and the configuration conditions can be lowered, for example, increasing the preset distance threshold, or lowering the cargo volume threshold.
[0097] In the above example, the split sub-transportation links are screened according to the above rules, and the screened sub-transportation links are: "A-E", "A-C", and "A-D".
[0098] Continue to Figure 1 As described in step S130, the sub-transportation links are sorted by distance and cargo volume, and the transit transportation cost and direct transportation cost of the cargo waybill set corresponding to each sub-transportation link are calculated in sequence to determine the final transportation link and transport.
[0099] Finally, the sub-transportation links are sorted according to distance and cargo volume, and the transit transportation cost and direct transportation cost of the cargo waybill set corresponding to each sub-transportation link are calculated in turn according to the sorting order. The transportation mode of the node in the sub-transportation link is determined, and the transportation mode with lower cost is selected. Finally, the final transportation link of each cargo waybill is determined, and the cargo is transported according to the final transportation link.
[0100] As an optional implementation manner, the step of sequentially calculating the transit transportation cost and the direct transportation cost of the freight waybill set corresponding to each of the sub-transportation links, and determining the final transportation link includes:
[0101] Calculate the total transit transportation cost and the total direct transportation cost of the current cargo waybill set corresponding to the current sub-transportation link;
[0102] If the total transit transportation cost is greater than the total direct transportation cost, determine to directly transport the current freight waybill set in the current sub-transportation link to form a final transportation link, delete the current freight waybill of the current freight waybill set from other freight waybill sets, and update the next sub-transportation link to the current sub-transportation link;
[0103] Otherwise, the next transport sub-link is updated to be the current transport sub-link.
[0104] In the embodiment of the present invention, after sorting each sub-transport link according to distance and cargo volume, the total transit transportation cost and the total direct transportation cost of all current cargo waybills in the current cargo waybill set corresponding to each sub-transport link are calculated in turn. The judgment process for each sub-transport link is the same. For the sake of ease of description, the embodiment of the present invention takes one of the sub-transport links as the current sub-transport link as an example for explanation.
[0105] Calculate the total transit transportation cost and total direct transportation cost of all current freight waybills in the current freight waybill set corresponding to the current sub-transportation link. First, calculate the transit transportation cost of each current freight waybill. The transit transportation cost includes driving fees, fuel consumption fees, loading and unloading fees, handover fees, mileage performance fees, card entry fees, correction fees, cargo hauling fees, road and bridge fees, etc. The specific fees included can be determined according to actual conditions, and the embodiment of the present invention does not specifically limit this. After calculating the transit transportation cost of each current freight waybill, sum them up to obtain the total transit transportation cost of the current sub-transportation link.
[0106] Then calculate the total direct transportation cost of the current sub-transportation link. The direct transportation cost can refer to the cost of delivering the goods in the current freight waybill directly from the sender to the recipient. It can be the total direct transportation cost of the company's internal vehicles or the total direct transportation cost of external vehicles. The lesser of the two costs is used as the total direct transportation cost corresponding to the current sub-transportation link.
[0107] Then compare the total transit transportation cost with the total direct transportation cost. If the total transit transportation cost is greater than the total direct transportation cost, it means that direct transportation is more cost-effective. Therefore, direct transportation is used as the final transportation link of the current freight waybill set; and match other freight waybill sets. If the freight waybills contained in other freight waybill sets overlap with those in the current freight waybill set, the overlapping freight waybills in other freight waybill sets are deleted; the next sub-transportation link is also used as the current sub-transportation link, and the above calculation process is repeated until all sub-transportation links are calculated directly.
[0108] If the total transit transport cost is less than the total direct transport cost, the next sub-transport link is calculated as the current sub-transport link, and the above process is repeated until the current sub-transport link is the last sub-transport link.
[0109] In the above example, the sub-transport links "A-C", "A-D" and "A-E" are sorted according to distance and cargo volume. The sorted sub-transport links are "A-E", "A-C" and "A-D". The current cargo waybill set corresponding to "A-E" is [YD01, YD02, YD03], the current cargo waybill set corresponding to "A-C" is [YD04, YD05], and the current cargo waybill set corresponding to "A-D" is [YD01, YD06]. Taking the current sub-transport link "A-E" as an example, the current cargo waybill set is [YD01, YD02, YD03].
[0110] First calculate the transit transportation cost of YD01, calculate the node costs of A-B, B-D, D-E, and E-F, and then sum up these node costs to get the transit transportation cost. Calculate the transit transportation costs of YD02 and YD03 in the same way, and sum up the transit transportation costs of YD01, YD02, and YD03 to get the total transit transportation cost of the current cargo waybill set.
[0111] It should be noted that the node cost includes driving fees, fuel consumption fees, loading and unloading fees, handover fees, mileage performance fees, card entry fees, correction fees, cargo transportation fees, road and bridge fees, etc. The specific fees included can be determined based on actual conditions, and the embodiments of the present invention do not make specific limitations on this.
[0112] Calculate the internal direct transportation cost and external direct transportation cost of YD01, YD02 and YD03 respectively, and sum up the internal direct transportation costs of YD01, YD02 and YD03, and sum up the external direct transportation costs of YD01, YD02 and YD03 respectively, and take the smaller cost after the sum as the total direct transportation cost of the current sub-transportation link.
[0113] After comparison, it is found that the total transit transportation cost is greater than the total direct transportation cost, so [YD01, YD02, YD03] are directly transported. In addition, the current cargo waybill set corresponding to "A-C" is calculated as [YD04, YD05] and the current cargo waybill set corresponding to "A-D" is calculated as [YD01, YD06]. Since YD01 has been determined as direct transportation, the YD01 cargo waybill in the current cargo waybill set corresponding to "A-D" is deleted, and the current cargo waybill set corresponding to "A-D" is modified to [YD06], and then the final transportation link of the current cargo waybill set is calculated in the same way.
[0114] As another optional implementation, the step of sequentially calculating the transit transportation cost and the direct transportation cost of the freight waybill set corresponding to each of the sub-transportation links, and determining the final transportation link includes:
[0115] Calculate the transit transportation cost and direct transportation cost of each current freight waybill in the current freight waybill set corresponding to the current sub-transportation link respectively;
[0116] If the transit transportation cost is greater than the direct transportation cost, determine to directly transport the current freight waybill through the current sub-transportation link to form a final transportation link, delete the current freight waybill from other freight waybill sets, and update the next sub-transportation link to the current sub-transportation link;
[0117] Otherwise, the next transport sub-link is updated to be the current transport sub-link.
[0118] In the embodiment of the present invention, after sorting each sub-transport link according to distance and cargo volume, the transit transportation cost and direct transportation cost of each current cargo waybill in the sub-transport link are calculated in turn. The judgment process for each sub-transport link is the same. For the convenience of description, in the embodiment of the present invention, any one of the sub-transport links is used as the current sub-transport link for explanation.
[0119] The transit transportation cost and direct transportation cost of each current freight waybill in the current freight waybill set corresponding to the current sub-transportation link are calculated, and the current freight waybill is taken as an example for explanation.
[0120] The transit transportation cost of the current cargo waybill is calculated, where the transit transportation cost includes the sum of the transit costs of every two adjacent nodes in the sub-transportation link of the current cargo waybill.
[0121] It should be noted that the transit cost includes driving fees, fuel consumption fees, loading and unloading fees, handover fees, mileage performance fees, card entry fees, correction fees, cargo transportation fees, road and bridge fees, etc. The specific fees included can be determined based on actual conditions, and the embodiments of the present invention do not make specific limitations on this.
[0122] Then calculate the direct transportation cost of the current cargo waybill. The direct transportation cost refers to the cost of directly sending the goods in the current cargo waybill from the sender to the recipient. It can be the direct transportation cost of the company's internal vehicles or the direct transportation cost of an external vehicle. The direct transportation cost is the less expensive of the two methods.
[0123] Then compare the transit transportation cost of the current freight bill with the direct transportation cost of the current freight bill. If the transit transportation cost is greater than the direct transportation cost, it means that the direct transportation is more cost-effective. Therefore, the direct transportation is used as the final transportation link of the current freight bill. And match other freight bill sets. If other freight bill sets contain the current freight bill, delete the current freight bill in other freight bill sets. Calculate other freight bills in the current freight bill set in the same way. Also take the next sub-transportation link as the current sub-transportation link, repeat the above calculation process, and calculate all sub-transportation links directly.
[0124] If the transit transportation cost is less than the direct transportation cost, the next sub-transportation link is calculated as the current sub-transportation link.
[0125] In the above example, the sub-transport links "A-C", "A-D" and "A-E" are sorted according to distance and cargo volume. The sorted sub-transport links are "A-E", "A-C" and "A-D". The current cargo waybill set corresponding to "A-E" is [YD01, YD02, YD03], the current cargo waybill set corresponding to "A-C" is [YD04, YD05], and the current cargo waybill set corresponding to "A-D" is [YD01, YD06]. Taking the current sub-transport link "A-E" as an example, the current cargo waybill set is [YD01, YD02, YD03].
[0126] First calculate the transit transportation cost of YD01, calculate the node costs of A-B, B-D, D-E, and E-F, and then sum up these node costs to get the transit transportation cost. Then calculate the internal direct transportation cost and the external direct transportation cost of YD01, and use the smaller cost as the direct transportation cost of YD01.
[0127] It should be noted that the node cost includes driving fees, fuel consumption fees, loading and unloading fees, handover fees, mileage performance fees, card entry fees, correction fees, cargo transportation fees, road and bridge fees, etc. The specific fees included can be determined based on actual conditions, and the embodiments of the present invention do not make specific limitations on this.
[0128] Compare the transit transportation cost and direct transportation cost of YD01. After comparison, if it is found that the transit transportation cost is greater than the direct transportation cost, YD01 will be transported directly, and YD01 will be matched with the current cargo waybill set corresponding to "A-C" [YD04, YD05] and the current cargo waybill set corresponding to "A-D" [YD01, YD06] respectively. If [YD01, YD06] contains YD01, YD01 in the current cargo waybill set corresponding to "A-D" [YD01, YD06] will be deleted, and the modified cargo waybill set corresponding to "A-D" will be [YD06]; if the transit transportation cost is less than the direct transportation cost, YD01 will be transported via transit.
[0129] Use the same method to calculate the transit transportation cost and direct transportation cost of YD02 and YD03, and determine the final transportation link of YD02 and YD03.
[0130] After calculating each current freight waybill in the current freight waybill set corresponding to the current sub-transport link, the next sub-transport link is used as the current sub-transport link for cyclic calculation until the current sub-transport link is the last sub-transport link.
[0131] It should also be noted that after calculating the optimal cost per ticket and the overall optimal cost of the transportation plan, it can also be combined with the business area operation mode. Due to the flexibility and particularity of regional operations, when multiple plans appear, they are manually confirmed and one of them is selected for transportation.
[0132] The embodiment of the present invention can reduce the error between the estimated cost and the actual cost by calculating and comparing various methods of the freight waybill.
[0133] As an optional implementation manner, the cargo node-hopping transportation method further includes:
[0134] If the weight of the goods in the current cargo waybill is greater than a preset weight threshold, it is determined that the final transportation link of the current cargo waybill is to be directly delivered from the shipping place of the current cargo to the destination.
[0135] Since some heavy goods have greater risks during transportation, such as the risk of rollover, such goods need to be handled separately. Before transporting each current cargo waybill, the weight of the goods on the current cargo waybill is compared with the preset weight threshold. If the weight of the goods is greater than the preset weight threshold, the goods are sent directly from the sender to the destination.
[0136] In the embodiment of the present invention, the value of the preset weight threshold can be determined according to actual conditions, and the embodiment of the present invention does not make any specific limitation on this.
[0137] In the process of implementing the cargo skip-node transportation method, when the final transportation link is determined and transportation is carried out, when the transportation task is generated, it is assigned to the corresponding driver through regional scheduling or management. The driver can view the transportation task information on the bus gun and obtain the specific loading location. The driver can load the goods according to the cargo list of the task, and then deliver the goods to the designated destination to complete this direct delivery of goods.
[0138] An embodiment of the present invention provides a method for transporting goods by skipping nodes. The method obtains the initial transport link and current position of each cargo waybill, determines the node currently corresponding to each cargo waybill and the current transport link, splits the current transport link of each cargo waybill, extracts the common link starting from the currently corresponding node and including at least three nodes, obtains the sub-transportation link and the corresponding cargo waybill set, sorts the sub-transportation links according to distance and cargo volume, calculates the transit transportation cost and direct transportation cost of the cargo waybill set in each sub-transportation link in turn, and selects the appropriate transportation mode as the final transportation link.
[0139] The embodiment of the present invention can clearly understand the changes in the current route of each freight waybill and the changes in the freight waybill in each point, and automatically combine the freight waybill of sub-transport links with at least three identical points, and perform permutations and combinations of the freight waybill sets corresponding to the sub-transport links to collect and calculate, and obtain the final transportation link with the greatest cost savings, thereby reducing the overall freight transportation cost while improving the timeliness of freight transportation.
[0140] Example 2
[0141] Based on the above-mentioned cargo node-hopping transportation method, an embodiment of the present invention provides a cargo node-hopping transportation device, such as Figure 2 As shown, the device includes an acquisition module 210, a splitting module 220 and a dispatching module 230, wherein:
[0142] The acquisition module 210 is used to determine the node currently corresponding to each cargo waybill and the current transportation link according to the initial transportation link and current position of each cargo waybill, wherein the initial transportation link includes each node passing from the sending point to the receiving point, and the current transportation link includes each node passing from the currently corresponding node to the receiving point;
[0143] The splitting module 220 is used to split the current transport link of each cargo waybill currently corresponding to any node, obtain a plurality of sub-transportation links starting from the currently corresponding node and including at least three nodes, and determine the cargo waybill set corresponding to the sub-transportation links with the same nodes;
[0144] The dispatch module 230 is used to sort the sub-transportation links according to distance and cargo volume, and sequentially calculate the transit transportation cost and direct transportation cost of the cargo waybill set corresponding to each sub-transportation link, determine the final transportation link and transport.
[0145] For other details about how the modules in the cargo hopping node transport device implement the above technical solution, please refer to the description of the cargo hopping node transport method provided in the above invention embodiment, which will not be repeated here.
[0146] Based on the above cargo node-hopping transportation method, Figure 3 As shown, an embodiment of the present invention further provides a structural schematic diagram of a cargo node-hopping transport device, wherein the identification device includes a processor 31 and a memory 32 coupled to the processor 31. The memory 32 stores a computer program, and when the computer program is executed by the processor 31, the processor 31 executes the steps of the cargo node-hopping transport method in the above embodiment.
[0147] For other details about the processor 31 in the above-mentioned cargo hopping node transportation equipment to implement the above-mentioned technical solution, please refer to the description of a cargo hopping node transportation method provided in the above-mentioned invention embodiment, which will not be repeated here.
[0148] Among them, the processor 31 can also be called a CPU (Central Processing Unit), and the processor 31 may be an integrated circuit chip with signal processing capabilities; the processor 31 can also be a general-purpose processor, DSP (Digital Signal Process), ASIC (Application Specific Integrated Circuit), FPGA (Field Programmable Gate Array) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, among which the general-purpose processor can be a microprocessor or the processor 31 can also be any conventional processor, etc.
[0149] like Figure 4 As shown, the embodiment of the present invention also provides a schematic diagram of the structure of a computer-readable storage medium, on which a readable computer program 41 is stored; wherein the computer program 41 can be stored in the above storage medium in the form of a software product, including a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, magnetic disk or optical disk, ROM (Read-Only Memory), RAM (Random Access Memory) and other media that can store program codes, or terminal devices such as computers, servers, mobile phones, and tablets.
[0150] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the modules is only a logical function division. There may be other division methods in actual implementation, such as multiple modules 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 modules, which can be electrical, mechanical or other forms.
[0151] The modules described as separate components may or may not be physically separated, and the components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed on multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0152] In addition, each functional module in each embodiment of the present application can be integrated into a processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The above-mentioned integrated module can be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium.
[0153] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments may be implemented in the form of a computer program product.
[0154] The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, a computer, a server, or a data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server, or data center. The computer-readable storage medium may be any available medium that a computer can store or a data storage device such as a server or a data center that includes one or more available media integrations. The available medium may be a magnetic medium, (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive (SSD)), etc.
[0155] The technical solution provided by the present application is introduced in detail above. The principles and implementation methods of the present application are explained by using specific examples in the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea. At the same time, for those skilled in the art, according to the idea of the present application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.
[0156] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0157] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 process or processes and / or
[0158] or Box Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0159] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0160] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0161] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.
Claims
1. A method for transporting goods by skipping nodes, characterized in that: include: According to the initial transport link and current position of each cargo waybill, the node currently corresponding to each cargo waybill and the current transport link are determined respectively, wherein the initial transport link includes each node from the sending point to the receiving point, and the current transport link includes each node from the currently corresponding node to the receiving point; For each cargo waybill currently corresponding to any node, split the current transport link of each cargo waybill to obtain a plurality of sub-transport links starting from the currently corresponding node and including at least three nodes, and determine the cargo waybill set corresponding to the sub-transport links with the same nodes; The sub-transportation links are sorted by distance and cargo volume, and the transit transportation cost and direct transportation cost of the cargo waybill set corresponding to each sub-transportation link are calculated in sequence to determine the final transportation link and transport.
2. The cargo node-hopping transportation method according to claim 1, characterized in that: The steps of sequentially calculating the transit transportation cost and the direct transportation cost of the cargo waybill set corresponding to each of the sub-transportation links and determining the final transportation link include: Calculate the total transit transportation cost and the total direct transportation cost of the current cargo waybill set corresponding to the current sub-transportation link; If the total transit transportation cost is greater than the total direct transportation cost, determine to directly transport the current freight waybill set in the current sub-transportation link to form a final transportation link, delete the current freight waybill of the current freight waybill set from other freight waybill sets, and update the next sub-transportation link to the current sub-transportation link; Otherwise, the next transport sub-link is updated to be the current transport sub-link.
3. The cargo node-hopping transportation method according to claim 1, characterized in that: The steps of sequentially calculating the transit transportation cost and the direct transportation cost of the cargo waybill set corresponding to each of the sub-transportation links and determining the final transportation link include: Calculate the transit transportation cost and direct transportation cost of each current freight waybill in the current freight waybill set corresponding to the current sub-transportation link respectively; If the transit transportation cost is greater than the direct transportation cost, determine to directly transport the current freight waybill through the current sub-transportation link to form a final transportation link, delete the current freight waybill from other freight waybill sets, and update the next sub-transportation link to the current sub-transportation link; Otherwise, the next transport sub-link is updated to be the current transport sub-link.
4. The cargo node-hopping transportation method according to claim 2 or 3, characterized in that: The cargo node-hopping transportation method further includes: If the weight of the goods in the current cargo waybill is greater than a preset weight threshold, it is determined that the final transportation link of the current cargo waybill is to be directly delivered from the shipping place of the current cargo to the destination.
5. The cargo node-hopping transportation method according to claim 1, characterized in that: The step of determining the node currently corresponding to each cargo waybill according to the initial transport link and the current position of each cargo waybill comprises: Determining whether each of the freight waybills is on the vehicle according to the current location of each of the freight waybills; For the cargo waybill on the vehicle, obtain the vehicle's home site as the node currently corresponding to the cargo waybill; For a freight waybill that is not on the vehicle, the current location of the freight waybill is matched with each node in the initial transport link to determine the node currently corresponding to the freight waybill.
6. The cargo node-hopping transportation method according to claim 1, characterized in that: After the step of determining the cargo waybill set corresponding to the sub-transportation link with the same node, the cargo node-hopping transportation method further includes: Calculating the travel time between the starting node and the ending node of each freight waybill in the freight waybill set; Whether each of the freight waybills meets the timeliness requirement is determined according to the journey time, and the freight waybills that do not meet the timeliness requirement are deleted from the freight waybill set.
7. The cargo node-hopping transportation method according to claim 1 or 5, characterized in that: After the step of determining the cargo waybill set corresponding to the sub-transportation link with the same node, the cargo node-hopping transportation method further includes: Setting a cargo volume threshold and a distance threshold according to preset attribute parameters of each node in the sub-transportation link, wherein the preset attribute parameters include at least one of the region, transportation resources, and cargo waybill time; The freight waybills in the freight waybill set corresponding to the sub-transportation link are screened according to the freight volume threshold and the distance threshold.
8. A cargo node-hopping transport device, characterized in that: Includes acquisition module, splitting module and dispatching module; The acquisition module is used to determine the node currently corresponding to each cargo waybill and the current transportation link according to the initial transportation link and current position of each cargo waybill, wherein the initial transportation link includes each node passing from the sending point to the receiving point, and the current transportation link includes each node passing from the currently corresponding node to the receiving point; The splitting module is used to split the current transport link of each cargo waybill currently corresponding to any node, obtain a plurality of sub-transportation links starting from the currently corresponding node and including at least three nodes, and determine the cargo waybill set corresponding to the sub-transportation links with the same nodes; The dispatch module is used to sort the sub-transportation links according to distance and cargo volume, and sequentially calculate the transit transportation cost and direct transportation cost of the cargo waybill set corresponding to each sub-transportation link, determine the final transportation link and transport.
9. A cargo node-hopping transport device, characterized in that: comprising a memory and a processor, wherein: The memory is used to store computer programs; The processor is used to read the computer program in the memory and execute the steps of the cargo node-hopping transportation method as described in any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that: A readable computer program is stored thereon, and when the program is executed by a processor, the steps of the cargo node-hopping transportation method as described in any one of claims 1 to 7 are implemented.
Citation Information
Cited By
Cross-border logistics trajectory data tracking method and system
CN119151419A
Transportation processing method, system and equipment for inter-provincial trunk jump nodes and storage medium
CN121146660A
Inter-provincial trunk line skip-node transportation handling methods, systems, equipment and storage media
CN121146660B
