A method, device, equipment and storage medium for cargo transportation route planning

Abstract

The present application provides a method, device, equipment and storage medium for route planning of cargo transportation, the method comprising: determining at least one procurement location that can meet the delivery requirements corresponding to the attributes based on the attributes of the target goods and the location of the delivery location; determining multiple paths from the at least one procurement location to the delivery location that meet the delivery requirements based on the at least one procurement location and the location of the delivery location; and selecting at least one recommended path from the multiple paths based on the influencing conditions of the recommended path and displaying it to the user. The method can achieve the effect of reasonably recommending paths to users.

Description

Technical Field

[0001] The present application relates to the field of cargo transportation, and in particular, to a method, device, equipment and storage medium for cargo route planning. Background Art

[0002] At present, the transportation industry as a whole is relatively traditional, especially coal transportation, which mostly uses primitive manual calculation methods in route planning, and the information used is mostly data already available on the data information platform.

[0003] In the process of path planning, many aspects of resources need to be considered. There are problems such as data information lag and incomplete consideration of key factors, which lead to inaccurate calculations, heavy workload, and long time consumption. The path finally planned is not the most reasonable path.

[0004] Therefore, how to reasonably recommend paths to users is a technical problem that needs to be solved. Summary of the invention

[0005] The purpose of the embodiments of the present application is to provide a method for route planning for cargo transportation. Through the technical solution of the embodiments of the present application, it is possible to achieve the effect of reasonably recommending routes to users.

[0006] In a first aspect, an embodiment of the present application provides a method for path planning for cargo transportation, comprising, based on the attributes of target goods and the location of the delivery location, determining at least one procurement location that can meet the delivery requirements corresponding to the attributes; based on the at least one procurement location and the location of the delivery location, determining multiple paths from the at least one procurement location to the delivery location that meet the delivery requirements; based on the influencing conditions of the recommended path, selecting at least one recommended path from the multiple paths and displaying it to the user.

[0007] In the above process, the purchase place can be given priority through the attributes of the goods and the location of the delivery place, and then a more reasonable complete path from the purchase place to the delivery place can be determined according to the delivery requirements. Compared with the existing manual calculation method, it can more reasonably and accurately recommend transportation routes to users.

[0008] In one embodiment, based on the attributes of the target goods and the location of the delivery location, determining at least one procurement location that can meet the delivery requirements corresponding to the attributes includes:

[0009] Based on the attributes of the target product, determine whether there is a purchasing location within a preset distance from the delivery location that can meet the delivery requirements corresponding to the attributes;

[0010] If there are procurement locations that can meet the delivery requirements corresponding to the attributes within a preset distance range of the delivery location, at least one procurement location is determined from the procurement locations.

[0011] In the above process, a range can be set based on the location of the delivery place, and the purchasing place that meets the requirements can be determined within this range, so that the purchasing place can be arranged more reasonably, saving more resources in the subsequent transportation of goods.

[0012] In one embodiment, after determining whether there is a purchase location that can meet the delivery requirements corresponding to the attributes within a preset distance range of the delivery location based on the attributes of the target goods, the method further includes:

[0013] If there is no purchase location that can meet the delivery requirements corresponding to the attributes within the preset distance range of the delivery location;

[0014] The value of the preset distance is increased until there is at least one purchasing location within the preset distance range of the delivery location that can meet the delivery requirements corresponding to the attributes.

[0015] In the above process, if there is no purchasing location that can meet the delivery requirements corresponding to the attributes within the preset distance range set at the beginning, the preset distance value can be increased until a reasonable purchasing location is found, which can ensure that the purchasing location is reasonably selected and the corresponding purchasing location can be found.

[0016] In one embodiment, based on the locations of at least one procurement location and a delivery location, determining multiple paths from at least one procurement location to the delivery location that meet the delivery requirements includes:

[0017] Determine at least one transit node that meets the delivery requirements based on at least one location of a purchase location and a delivery location, and a difference between attributes of goods at the purchase location and attributes of target goods;

[0018] Based on at least one transit node, at least one purchasing location and a delivery location, multiple paths from at least one purchasing location to the delivery location that meet the delivery requirements are determined.

[0019] In the above process, the difference between the purchased goods and the target goods is used to determine the transit nodes required for the target goods to ultimately meet the delivery requirements, and then multiple paths are determined based on the purchase location, delivery location and intermediate nodes, so that the paths planned in the path planning process are more complete and correct, and can better meet the needs of users.

[0020] In one embodiment, the influencing conditions of the recommended path include at least one of the following conditions:

[0021] The transportation time from the purchase location to the delivery location, the transportation distance from the purchase location to the delivery location, and the total cost incurred from the purchase location to the delivery location.

[0022] In the above process, the influencing conditions of the recommended path can make the delivery path planning more accurate and better meet the needs of users.

[0023] In one embodiment, based on the influencing conditions of the recommended paths, at least one recommended path is selected from multiple paths and displayed to the user, including:

[0024] Scoring each of the multiple paths based on the weight ratio of at least one of the influencing conditions of the recommended path;

[0025] The path with the highest score among the multiple paths is displayed to the user, or the top N paths with the highest scores among the multiple paths are sorted in order from high score to low score and displayed to the user, where N is a positive integer greater than or equal to 2.

[0026] In the above process, each path can be scored according to the weight ratio of each condition in the influencing conditions, and the one or more paths with the highest scores can be displayed to the user for the user to use, so as to more accurately recommend reasonable paths to the user.

[0027] In one embodiment, after displaying the path with the highest score among the multiple paths to the user or sorting the top N paths with the highest scores among the multiple paths in order from high score to low score and displaying them to the user, the method further includes:

[0028] The transportation time, delivery distance and total cost from the purchase location to the delivery location corresponding to the path with the highest score are displayed to the user.

[0029] In the above process, the transportation time, delivery distance and total cost from the purchase location to the delivery location corresponding to the path with the highest score are summarized and displayed to the user, which facilitates the user's judgment and saves the user's time in path planning.

[0030] In a second aspect, an embodiment of the present application provides a device for cargo route planning, including:

[0031] A first determination module is used to determine at least one purchasing location that can meet the delivery requirements corresponding to the attributes of the target goods based on the attributes and the location of the delivery location;

[0032] A second determination module is used to determine multiple paths from the at least one procurement location to the delivery location that meet the delivery requirements based on the locations of the at least one procurement location and the delivery location;

[0033] The selection module is used to select at least one recommended path from the multiple paths based on the influencing conditions of the recommended paths and display the recommended path to the user.

[0034] Optionally, the first determining module is specifically used for:

[0035] Based on the attributes of the target product, determine whether there is a purchasing location within a preset distance from the delivery location that can meet the delivery requirements corresponding to the attributes;

[0036] If there are procurement locations that can meet the delivery requirements corresponding to the attributes within a preset distance range of the delivery location, at least one procurement location is determined from the procurement locations.

[0037] Optionally, the device further comprises:

[0038] a third confirmation module, for after the first confirmation module determines whether there is a purchase location that can meet the delivery requirements corresponding to the attributes within a preset distance range of the delivery location based on the attributes of the target goods, if there is no purchase location that can meet the delivery requirements corresponding to the attributes within the preset distance range of the delivery location;

[0039] The value of the preset distance is increased until there is at least one purchasing location within the preset distance range of the delivery location that can meet the delivery requirements corresponding to the attributes.

[0040] Optionally, the second confirmation module is specifically used for:

[0041] Determine at least one transit node that meets the delivery requirements based on at least one location of a purchase location and a delivery location, and a difference between attributes of goods at the purchase location and attributes of target goods;

[0042] Based on at least one transit node, at least one purchasing location and a delivery location, multiple paths from at least one purchasing location to the delivery location that meet the delivery requirements are determined.

[0043] Optionally, the influencing conditions of the recommended path include at least one of the following conditions:

[0044] The transportation time from the purchase location to the delivery location, the transportation distance from the purchase location to the delivery location, and the total cost incurred from the purchase location to the delivery location.

[0045] Optionally, select the module specifically for:

[0046] Scoring each of the multiple paths based on the weight ratio of at least one of the influencing conditions of the recommended path;

[0047] The path with the highest score among the multiple paths is displayed to the user, or the top N paths with the highest scores among the multiple paths are sorted in order from high score to low score and displayed to the user, where N is a positive integer greater than or equal to 2.

[0048] Optionally, the device further comprises:

[0049] A summary module is used for displaying the transportation time, delivery distance and total cost from the purchase location to the delivery location corresponding to the path with the highest score to the user, after the selection module displays the path with the highest score among multiple paths to the user or sorts the top N paths with the highest scores among multiple paths in order from high score to low score and displays them to the user.

[0050] In a third aspect, an embodiment of the present application provides an electronic device, comprising a processor and a memory, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the steps in the method provided in the first aspect are performed.

[0051] In a fourth aspect, an embodiment of the present application provides a readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps in the method provided in the first aspect are performed.

[0052] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or be understood by practicing the embodiments of the present application. The purpose and other advantages of the present application can be realized and obtained by the structures specifically pointed out in the written description, claims, and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0054] Figure 1 A flow chart of a method for cargo route planning provided in an embodiment of the present application;

[0055] Figure 2 A detailed implementation flow chart of a method for cargo route planning provided in an embodiment of the present application;

[0056] Figure 3 A schematic diagram of a route planning for cargo transportation provided in an embodiment of the present application;

[0057] Figure 4 A schematic block diagram of a device for cargo route planning provided in an embodiment of the present application;

[0058] Figure 5 A schematic diagram of the structure of a device for cargo route planning provided in an embodiment of the present application. DETAILED DESCRIPTION

[0059] The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all of the embodiments. The components of the embodiments of the present application usually described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of the application claimed for protection, but merely represents the selected embodiments of the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of protection of the present application.

[0060] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0061] This application is applied to the scenario of cargo transportation. The specific scenario is to give priority to selecting a suitable purchase location based on the properties of the cargo and the location of the delivery location, and then recommend some reasonable routes to users based on the purchase location to the delivery location and some processing nodes in between.

[0062] However, in the current cargo transportation, the overall method adopted is the traditional manual calculation method, which cannot select the purchasing place and some intermediate processing nodes and transfer nodes for users based on more comprehensive information. Therefore, a lot of time will be wasted, and the path provided to users in the end is not the most reasonable transportation path.

[0063] To this end, this application can give priority to the purchase location through the attributes of the goods and the location of the delivery location, and then determine multiple paths from the purchase location to the delivery location that meet the delivery requirements based on the locations of the purchase location and the delivery location, and finally recommend some of the more reasonable paths to the user. Through such a summary method, the route that meets the user's needs can be recommended to the user based on the node information from the purchase location to the delivery location and in between, which improves the calculation efficiency and reduces the time from several hours or even days at the beginning to several seconds, bringing greater convenience to the user.

[0064] In the embodiment of the present application, the execution entity can be a path planning device in a cargo transportation path planning system. In actual applications, the path planning device can be electronic devices such as terminal devices and server devices, which are not limited here.

[0065] The scheme of the present application is described in detail below with reference to the accompanying drawings and taking coal transportation in cargo transportation as an example.

[0066] Combine the following Figure 1 The method for cargo route planning in an embodiment of the present application is described in detail.

[0067] Please see Figure 1 , Figure 1 A flow chart of a method for cargo route planning provided in an embodiment of the present application, such as Figure 1 The method for cargo route planning shown includes:

[0068] Step 110: Based on the attributes of the target goods and the location of the delivery location, determine at least one procurement location that can meet the delivery requirements corresponding to the attributes.

[0069] In the above process, a more reasonable purchasing location can be determined based on the properties of the target goods and the location of the delivery place, which can better meet the needs of users and save time and resources.

[0070] The attributes of the target goods may indicate the type of the target goods or the type of components of the target goods, etc. For example, the attributes of coal may indicate the type of coal or the raw material composition of coal or the raw material composition of the coal obtained after processing, etc. Therefore, the purchase place of the corresponding delivery requirement may be a purchase place that can directly produce the goods, or a purchase place that can produce the raw materials of the goods, or a purchase place that can produce the target goods after processing the produced raw materials, etc., and the present application is not limited thereto.

[0071] It should be understood that when determining the delivery location, the delivery location can be manually set according to the user's needs, or the delivery location can be automatically matched according to the set value of the distance to the delivery location.

[0072] Specifically, when executing step 110, the following steps may be adopted:

[0073] Step S1101: Based on the attributes of the target product, determine whether there is a purchasing location within a preset distance from the delivery location that can meet the delivery requirements corresponding to the attributes.

[0074] Step S1102: If there are procurement locations that can meet the delivery requirements corresponding to the attributes within the preset distance range of the delivery location, at least one procurement location is determined from the procurement locations.

[0075] In the above process, a range can be set based on the location of the delivery place, and the purchasing place that meets the requirements can be determined within this range, so that the purchasing place can be arranged more reasonably, saving more resources in the subsequent transportation of goods.

[0076] Among them, the preset distance can be a diameter distance set according to the location of the delivery place, or the range of the preset distance can be set according to the driving time or driving distance, for example, within 50 kilometers from the delivery place, within 50 kilometers of the delivery place, or within thirty minutes of driving time from the delivery place. The purchasing place can be one or more, and a quantity range value can also be set to limit the number of purchasing places.

[0077] It should be understood that within the preset distance there may be a purchasing location that can meet the delivery requirements corresponding to the attributes, or there may not be a purchasing location that can meet the delivery requirements corresponding to the attributes.

[0078] Furthermore, after executing step S1101, the following steps may also be performed:

[0079] Step S11011: If there is no purchasing location that can meet the delivery requirements corresponding to the attributes within the preset distance range of the delivery location.

[0080] Step S11012: Increase the value of the preset distance until there is at least one purchasing location within the preset distance range of the delivery location that can meet the delivery requirements corresponding to the attributes.

[0081] In the above process, if there is no purchasing location that can meet the delivery requirements corresponding to the attributes within the preset distance range set at the beginning, the preset distance value can be increased until a reasonable purchasing location is found, which can ensure that the purchasing location is reasonably selected and the corresponding purchasing location can be found.

[0082] For example: If no reasonable purchasing location is found within a 50-kilometer diameter range from the delivery location, the preset distance value can be increased to 60 kilometers, and the final range can be determined based on this distance as the diameter. Then, a reasonable purchasing location can be searched again. If no reasonable purchasing location is found, the preset distance value can be increased to 70 kilometers, and so on, until at least one reasonable purchasing location is found.

[0083] Step 120: Based on the locations of at least one procurement location and a delivery location, determine multiple paths from at least one procurement location to the delivery location that meet the delivery requirements.

[0084] In the above process, according to the location of the purchase place and the delivery place, multiple complete transportation routes can be determined according to the delivery requirements, which can provide users with accurate cargo transportation routes in a more systematic way.

[0085] Among them, the delivery requirements are used to determine some intermediate processing nodes based on the difference between the purchased goods obtained at the procurement site and the target goods at the delivery site, so that the purchased goods can eventually meet the requirements at the time of delivery, and then determine multiple paths based on the purchase site, the location of the delivery site and the processing nodes. For example: in the process of coal transportation, the required coal type is coal A. If coal washing, coal blending or coal type combination processing is required in the middle, some intermediate processing nodes will be determined based on relevant information such as cost, time and processing cost, so that the target goods at the final delivery can meet the delivery requirements, and then multiple transportation paths will be determined based on the purchase site, delivery site and processing nodes.

[0086] It should be understood that there may be certain differences between the purchased goods and the target goods. Therefore, some intermediate processing nodes should be considered during the path planning process.

[0087] Specifically, when executing step 120, the following steps may be adopted:

[0088] Step S1201: Based on the location of at least one procurement location and a delivery location, and the difference between the attributes of the goods at the procurement location and the attributes of the target goods, determine at least one transit node that meets the delivery requirements.

[0089] Step S1202: Based on at least one transit node, at least one purchasing location and a delivery location, multiple paths from at least one purchasing location to the delivery location that meet the delivery requirements are determined.

[0090] In the above process, the difference between the purchased goods and the target goods is used to determine the transit nodes required for the target goods to ultimately meet the delivery requirements, and then multiple paths are determined based on the purchase location, delivery location and intermediate nodes, so that the paths planned in the path planning process are more complete and correct, and can better meet the needs of users.

[0091] Among them, the difference between the attributes of the goods at the purchase site and the attributes of the target goods is used to estimate the processing steps required for the purchased goods, and then determine some intermediate transfer nodes. The intermediate nodes are used to process the purchased goods. The number of intermediate nodes can be set according to the needs of the user to ensure that the number of intermediate nodes remains within the preset range. For example, according to the difference in the attributes of the target coal type A and the purchased coal type B, some transfer nodes for processing the purchased coal type B are determined. The target coal type A can be obtained by processing the transfer nodes, wherein the transfer nodes can be nodes for processing the purchased coal type B such as coal washing or coal blending. In addition, some intermediate transfer nodes can be set by the user according to the needs. For example, which node or nodes the user wants to use for processing can be set according to the needs, and then the path is recommended for the user according to the nodes set by the user. In addition, the purchase site, the purchased raw materials, the price of the raw materials, the delivery site, the time limit, the distance limit, the cost limit, the transportation method and some paths can also be set manually by the user. If it is the transportation of coal, the coal washing fee, the coal blending fee and the coal blending ratio can also be set by the user.

[0092] Step 130: Based on the influencing conditions of the recommended paths, at least one recommended path is selected from the multiple paths and displayed to the user.

[0093] In the above process, reasonable paths are recommended to the user through the influencing conditions of the recommended paths, and one or more paths that meet the user's requirements can be selected from multiple paths and displayed to the user for selection.

[0094] Specifically, the influencing conditions of the recommended path include:

[0095] The transportation time from the purchase location to the delivery location, the transportation distance from the purchase location to the delivery location, and the total cost incurred from the purchase location to the delivery location.

[0096] In the above process, the influencing conditions of the recommended path can make the delivery path planning more accurate and better meet the needs of users.

[0097] Among them, the transportation time from the purchase place to the delivery place includes the total transportation time and the time required for processing and other pauses in the middle. The transportation distance from the purchase place to the delivery place includes the total distance of the entire path. The total cost generated from the purchase place to the delivery place includes all costs such as transportation fees generated by different sections, transportation fees generated by different transportation methods, warehouse storage fees, purchase fees at different purchase places, and different processing fees corresponding to different nodes. If it is coal transportation, there are also different loading and unloading fees, spraying fees, etc. at different nodes. In addition, part of the distance can be set by the user. According to the part of the path, purchase place, delivery place and other transfer nodes set by the user, the path required by the user is recommended to the user, or according to some restrictions set by the user, such as processing nodes and purchase places, the path that meets some restrictions set by the user is selected from the above-mentioned multiple paths and recommended to the user.

[0098] It should be understood that different influencing conditions will lead to different paths for path planning. Therefore, different influencing conditions have different weights, and the results of recommending the paths will also be different.

[0099] Specifically, when executing step 130, the following steps may be adopted:

[0100] Step S1301: scoring each of the multiple paths based on the weight ratio of at least one influencing condition among the influencing conditions of the recommended path.

[0101] Step S1302: Display the path with the highest score among the multiple paths to the user, or sort the top N paths with the highest scores among the multiple paths in order from high score to low score and display them to the user, where N is a positive integer greater than or equal to 2.

[0102] In the above process, each path can be scored according to the weight ratio of each condition in the influencing conditions, and the one or more paths with the highest scores can be displayed to the user for the user to use, so as to more accurately recommend reasonable paths to the user.

[0103] Among them, the weight ratio can be determined according to which condition the user prefers among the transportation time from the purchase place to the delivery place, the transportation distance from the purchase place to the delivery place, and the total cost generated from the purchase place to the delivery place. For example, if the user wants to save costs, the weight ratio of time and distance will be reduced, and the weight ratio of cost will be increased. In addition, the income expenses and the cargo damage expenses during transportation will also affect the final scoring results.

[0104] Furthermore, after executing step S1302, the following steps may also be performed:

[0105] The transportation time, delivery distance and total cost from the purchase location to the delivery location corresponding to the path with the highest score are displayed to the user.

[0106] In the above process, the transportation time, delivery distance and total cost from the purchase location to the delivery location corresponding to the path with the highest score are summarized and displayed to the user, which facilitates the user's judgment and saves the user's time in path planning.

[0107] In summary, the present application determines at least one purchase location that can meet the delivery requirements corresponding to the attributes based on the attributes of the target goods and the location of the delivery location; determines multiple paths from at least one purchase location to the delivery location that meet the delivery requirements based on the at least one purchase location and the location of the delivery location; and selects at least one recommended path from multiple paths based on the influencing conditions of the recommended path and displays it to the user. This method can achieve the effect of reasonably recommending paths to users.

[0108] Previous article Figure 1 The method of path planning for cargo transportation is described. The following is an example of path planning for coal transportation based on cost. Figure 2 The specific implementation method of the above-mentioned cargo route planning is described in detail.

[0109] Please refer to Figure 2 , which is a detailed implementation flow chart of a method for cargo route planning provided in an embodiment of the present application.

[0110] Assume that there are purchasing locations A and B, and the required coal type is coal C. The coal types of coal C and purchasing location A, as well as coal C and purchased B are different. Assuming that the required weight of coal C is two tons, it is calculated that 1 ton needs to be purchased from purchasing locations A and B respectively, and the weight of the coal does not change after processing. For example, the delivery location is D, the coal washing plant is E, the coal washing plant is F, the transfer node G has a toll of 10,000 yuan / ton, the cost of purchasing location A is 55,000 yuan / ton, the cost of purchasing location B is 50,000 yuan / ton, and the freight of AE is 3,000 yuan / ton. , BE freight is 4,000 yuan / ton, ED freight is 2,000 yuan / ton, EG freight is 5,000 yuan / ton, GD freight is 5,000 yuan / ton, AF freight is 3,000 yuan / ton, BF freight is 4,000 yuan / ton, FD freight is 4,000 yuan / ton, FG freight is 2,000 yuan / ton, the loading fee of purchasing place A is 1,000 yuan / ton, the loading fee of purchasing place B is 2,000 yuan / ton, the loading fee of coal washing plant E is 2,000 yuan / ton, the loading fee of coal washing plant F is 1,000 yuan / ton, and the unloading fee of coal washing plant E is The unloading fee at the coal washing plant F is 20,000 yuan / ton, the unloading fee at the delivery place D is 10,000 yuan / ton, the protection fee at the delivery place D is 50,000 yuan / ton, and the box usage fees for each section are: (AE, 10,000 yuan / ton), (BE, 20,000 yuan / ton), (ED, 30,000 yuan / ton), (EG, 10,000 yuan / ton), (GD, 10,000 yuan / ton), (AF, 20,000 yuan / ton), (BF, 30,000 yuan / ton), (FD, 40,000 yuan / ton), (FG, 0.1 million yuan / ton), the processing fee of coal washing plant E is 35,000 yuan / ton, and the processing fee of coal washing plant F is 30,000 yuan / ton. The prices of processing raw coal in different proportions are different. Here the ratio of raw coal is 1:1, then the processing fee of E is 70,000 yuan, and the processing fee of F is 60,000 yuan. In addition, taxes, storage fees, service fees, dust suppression fees, spraying fees, storage fees, platform usage fees, platform service fees, bundling fees, pick-up and delivery fees, coal blending prices, vehicle damage fees and freight prices of different modes of transportation can all be included, but this application is not limited to this.

[0111] Step 210: Based on the composition of coal C and the delivery location D, determine that the purchase locations A and B that can meet the composition of coal C are determined.

[0112] Specifically, according to the composition of coal C, it can be known that the raw coal from purchasing place A and purchasing place B needs to be washed by coal washing plant E or coal washing plant F to obtain coal C.

[0113] Step 220: Based on the purchasing location A, the purchasing location B and the delivery location D, multiple paths are determined.

[0114] Please refer to Figure 3 A schematic diagram of a route planning for cargo transportation provided by the present application, wherein the route and nodes are Figure 2 Correspondingly, they are: Route 1 (AE, BE, ED), Route 2 (AE, BE, EGD), Route 3 (AF, BF, FD) and Route 4 (AF, BF, FGD).

[0115] Step 230: Based on the total cost incurred during the coal transportation process, the path with the lowest cost among the multiple paths is displayed to the user.

[0116] Assuming that the quality of coal does not change after being processed by coal washing plants E and F, the cost of route one is: the sum of the cost of the purchase site, freight, loading and unloading fees, protection fees, box fees and the processing fees of coal washing plant E is 216,000 yuan, the cost of route two is: the sum of the cost of purchase, freight, loading and unloading fees, protection fees, box fees and the processing fees of coal washing plant E is 214,000 yuan, the cost of route three is: the sum of the cost of purchase, freight, loading and unloading fees, protection fees, box fees and the processing fees of coal washing plant F is 214,000 yuan, and the cost of route four is: the sum of the cost of purchase, freight, loading and unloading fees, protection fees, box fees and the processing fees of coal washing plant F is 209,000 yuan. Therefore, the route four with the lowest cost is recommended to users as: AF, BF, FGD.

[0117] Previous article Figure 1-Figure 3 Describes the method of cargo route planning. Figure 4-Figure 5 A device for route planning for cargo transportation is described.

[0118] Please refer to Figure 4 , is a schematic block diagram of a device 400 for cargo route planning provided in an embodiment of the present application, and the device 400 may be a module, program segment or code on an electronic device. Figure 1 The method embodiment corresponds to and can be executed Figure 1 The various steps involved in the method embodiment and the specific functions of the device 400 can be found in the description below. To avoid repetition, the detailed description is appropriately omitted here.

[0119] Optionally, the device 400 includes:

[0120] A first determination module 410 is used to determine at least one procurement location that can meet the delivery requirements corresponding to the attributes of the target goods based on the attributes and the location of the delivery location;

[0121] A second determining module 420, configured to determine, based on the locations of the at least one purchasing location and the delivery location, a plurality of paths from the at least one purchasing location to the delivery location that meet the delivery requirements;

[0122] The selection module 430 is used to select at least one recommended path from the multiple paths based on the influencing conditions of the recommended paths and display the recommended path to the user.

[0123] Optionally, the first determining module is specifically used for:

[0124] Based on the attributes of the target product, determine whether there is a purchasing location within a preset distance from the delivery location that can meet the delivery requirements corresponding to the attributes;

[0125] If there are procurement locations that can meet the delivery requirements corresponding to the attributes within a preset distance range of the delivery location, at least one procurement location is determined from the procurement locations.

[0126] Optionally, the device further comprises:

[0127] a third confirmation module, for after the first confirmation module determines whether there is a purchase location that can meet the delivery requirements corresponding to the attributes within a preset distance range of the delivery location based on the attributes of the target goods, if there is no purchase location that can meet the delivery requirements corresponding to the attributes within the preset distance range of the delivery location;

[0128] The value of the preset distance is increased until there is at least one purchasing location within the preset distance range of the delivery location that can meet the delivery requirements corresponding to the attributes.

[0129] Optionally, the second confirmation module is specifically used for:

[0130] Determine at least one transit node that meets the delivery requirements based on at least one location of a purchase location and a delivery location, and a difference between attributes of goods at the purchase location and attributes of target goods;

[0131] Based on at least one transit node, at least one purchasing location and a delivery location, multiple paths from at least one purchasing location to the delivery location that meet the delivery requirements are determined.

[0132] Optionally, the influencing conditions of the recommended path include at least one of the following conditions:

[0133] The transportation time from the purchase location to the delivery location, the transportation distance from the purchase location to the delivery location, and the total cost incurred from the purchase location to the delivery location.

[0134] Optionally, select the module specifically for:

[0135] Scoring each of the multiple paths based on the weight ratio of at least one of the influencing conditions of the recommended path;

[0136] The path with the highest score among the multiple paths is displayed to the user, or the top N paths with the highest scores among the multiple paths are sorted in order from high score to low score and displayed to the user, where N is a positive integer greater than or equal to 2.

[0137] Optionally, the device further comprises:

[0138] A summary module is used for displaying the transportation time, delivery distance and total cost from the purchase location to the delivery location corresponding to the path with the highest score to the user, after the selection module displays the path with the highest score among multiple paths to the user or sorts the top N paths with the highest scores among multiple paths in order from high score to low score and displays them to the user.

[0139] Please refer to Figure 5 The structure of a device 500 for planning a cargo transportation route provided in an embodiment of the present application is schematically shown. The device may include a memory 510 and a processor 520. Optionally, the device may also include: a communication interface 530 and a communication bus 540. The device is similar to the above Figure 1 The method embodiment corresponds to and can be executed Figure 1 The various steps involved in the method embodiment and the specific functions of the device can be found in the description below.

[0140] Specifically, the memory 510 is used to store computer-readable instructions.

[0141] Processor 520, configured to process readable instructions stored in the memory, capable of executing Figure 1 The various steps of method embodiments 110 to 130.

[0142] The communication interface 530 is used for signaling or data communication with other node devices, for example, for communication with a server or a terminal, or for communication with other device nodes, but the embodiments of the present application are not limited thereto.

[0143] The communication bus 540 is used to realize direct connection and communication among the above components.

[0144] The communication interface 530 of the device in the embodiment of the present application is used to communicate signals or data with other node devices. The memory 510 can be a high-speed RAM memory or a non-volatile memory, such as at least one disk memory. The memory 510 can also be at least one storage device located away from the aforementioned processor. The memory 510 stores computer-readable instructions. When the computer-readable instructions are executed by the processor 520, the electronic device executes the aforementioned Figure 1The method process shown. The processor 520 can be used on the device 400 and used to perform the functions in the present application. Exemplarily, the above-mentioned processor 520 can be a general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, and the embodiments of the present application are not limited thereto.

[0145] The embodiment of the present application also provides a readable storage medium, when the computer program is executed by a processor, Figure 1 The method process in the method embodiment shown is executed by the electronic device.

[0146] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the device described above can refer to the corresponding process in the aforementioned method, and will not be described in detail here.

[0147] In summary, the embodiments of the present application provide a method, device, electronic device and storage medium for route planning of cargo transportation, the method comprising: determining at least one procurement location that can meet the delivery requirements corresponding to the attributes based on the attributes of the target goods and the location of the delivery location; determining multiple paths from at least one procurement location to the delivery location that meet the delivery requirements based on the at least one procurement location and the location of the delivery location; and selecting at least one recommended path from multiple paths based on the influencing conditions of the recommended path and displaying it to the user. This method can achieve the effect of reasonably recommending paths to users.

[0148] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0149] In addition, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0150] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods 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 magnetic disk or an optical disk.

[0151] The above description is only an embodiment of the present application and is not intended to limit the scope of protection of the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0152] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0153] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

Claims

1. A method for cargo transportation path planning, characterized in that: include: Based on the attributes of the target commodity and the location of the delivery place, at least one purchasing place that can meet the delivery requirements corresponding to the attributes is determined, wherein when the target commodity is coal, the attributes of the target commodity include: the type of the coal, the raw material composition of the coal, or the raw material composition of the coal obtained after processing, and the purchasing place includes: the purchasing place where the coal is produced, the purchasing place where the raw materials of the coal are produced, and the purchasing place where the coal is obtained after processing the produced raw materials; Based on the locations of the at least one procurement location and the delivery location, determining a plurality of paths from the at least one procurement location to the delivery location that meet the delivery requirements; Based on the influencing conditions of the recommended paths, selecting at least one recommended path from the multiple paths and presenting it to the user; The determining of multiple paths from the at least one purchasing location to the delivery location that meet the delivery requirements based on the locations of the at least one purchasing location and the delivery location comprises: determining at least one transit node that meets the delivery requirements based on the locations of the at least one purchasing location and the delivery location, and the difference between the attributes of the goods at the purchasing location and the attributes of the target goods, wherein the transit node is used to process the purchased goods at the at least one purchasing location; and determining multiple paths from the at least one purchasing location to the delivery location that meet the delivery requirements based on the at least one transit node, the at least one purchasing location and the location of the delivery location.

2. The method according to claim 1, characterized in that The step of determining, based on the attributes of the target product and the location of the delivery location, at least one procurement location that can meet the delivery requirements corresponding to the attributes includes: Based on the attributes of the target goods, determine whether there is a purchasing location within a preset distance of the delivery location that can meet the delivery requirements corresponding to the attributes; If there are procurement locations that can meet the delivery requirements corresponding to the attributes within a preset distance range of the delivery location, at least one procurement location is determined from the procurement locations.

3. The method according to claim 2, characterized in that After determining, based on the attributes of the target product, whether there is a purchase location within a preset distance from the delivery location that can meet the delivery requirements corresponding to the attributes, the method further includes: If there is no purchase location that can meet the delivery requirements corresponding to the attributes within the preset distance range of the delivery location; The value of the preset distance is increased until there is at least one purchasing location within the preset distance range of the delivery location that can meet the delivery requirements corresponding to the attribute.

4. The method according to claim 1, characterized in that: The influencing conditions of the recommended path include at least one of the following conditions: The transportation time from the purchase place to the delivery place, the transportation distance from the purchase place to the delivery place and the total cost incurred from the purchase place to the delivery place.

5. The method according to claim 1 or 4, characterized in that: The selecting at least one recommended path from the plurality of paths based on the influencing conditions of the recommended paths and presenting the recommended path to the user includes: Scoring each of the multiple paths based on a weight ratio of at least one of the influencing conditions of the recommended path; The path with the highest score among the multiple paths is displayed to the user, or the top N paths with the highest scores among the multiple paths are sorted in order from high score to low score and displayed to the user, where N is a positive integer greater than or equal to 2.

6. The method according to claim 4, characterized in that After displaying the path with the highest score among the multiple paths to the user or sorting the top N paths with the highest scores among the multiple paths in order from high score to low score and displaying them to the user, the method further includes: The transportation time, delivery distance and total cost from the purchase location to the delivery location corresponding to the path with the highest score are displayed to the user.

7. A device for cargo transport path planning, characterized in that: include: A first determination module is used to determine at least one purchasing location that can meet the delivery requirements corresponding to the attributes of the target commodity based on the attributes and the location of the delivery location, wherein when the target commodity is coal, the attributes of the target commodity include: the type of the coal, the raw material composition of the coal, or the raw material composition of the coal obtained after processing, and the purchasing location includes: the purchasing location where the coal is produced, the purchasing location where the raw materials of the coal are produced, and the purchasing location where the coal is obtained after processing the produced raw materials; A second determination module is used to determine multiple paths from the at least one procurement location to the delivery location that meet the delivery requirements based on the locations of the at least one procurement location and the delivery location; A selection module, configured to select at least one recommended path from the plurality of paths based on the influencing conditions of the recommended paths and present the recommended path to the user; The second determination module is specifically used to: determine at least one transit node that meets the delivery requirements based on the locations of the at least one purchasing location and the delivery location, and the difference between the attributes of the goods at the purchasing location and the attributes of the target goods, wherein the transit node is used to process the purchased goods at the at least one purchasing location; and determine multiple paths from the at least one purchasing location to the delivery location that meet the delivery requirements based on the at least one transit node, the at least one purchasing location and the location of the delivery location.

8. A device for cargo route planning, characterized in that: include: A memory and a processor, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the steps in the method according to any one of claims 1 to 6 are executed.

9. A computer-readable storage medium, characterized in that: include: A computer program, when the computer program is run on a computer, causes the computer to execute the method according to any one of claims 1 to 6.

Images