A method, device, equipment and storage medium for determining a transport route

Abstract

The embodiment of the present invention discloses a method, device, equipment and storage medium for determining a transportation route, the method comprising: after determining a current node and a destination node, determining an intermediate node according to the current node and the destination node; determining a target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node and the line information supported by each node; and determining a transportation route according to the target route. The above technical scheme determines the target route according to the current time, the current node, the destination node, the intermediate node between the current node and the destination node, the shift information of each node and the line information supported by each node, and determines the transportation route according to the target route, so as to realize the consideration of the shift information and the line information, and determine the transportation route that meets the actual operation needs.

Description

Technical Field

[0001] The embodiments of the present invention relate to warehousing logistics technology, and in particular to a method, device, equipment and storage medium for determining a transportation route. Background Art

[0002] With the continuous development of e-commerce, the management of logistics links is becoming more and more important. The logistics management system can estimate the number of orders on the corresponding route based on experience data and historical sales data of the sales platform, and then determine the corresponding transportation route. Based on the route series connection, the transportation route between sites and sorting centers can be determined.

[0003] In the prior art, the indicators of the routing series problem, such as timeliness and cost, can be converted into edge weights in graph theory through the shortest path solution method, thereby converting the entire routing series into a shortest path problem, and then various shortest path algorithms can be used to determine the transportation route.

[0004] In the process of implementing the present invention, it is found that there are at least the following technical problems in the prior art:

[0005] The connection between shifts and routes has not been fully considered, resulting in the transport routes obtained in series not necessarily meeting actual operational needs. Summary of the invention

[0006] The present invention provides a method, device, equipment and storage medium for determining a transport route, so as to fully consider the shift information and line information and determine a transport route that meets the actual operation requirements.

[0007] In a first aspect, an embodiment of the present invention provides a method for determining a transportation route, comprising:

[0008] After determining the current node and the destination node, determining the intermediate node according to the current node and the destination node;

[0009] Determine the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the route information supported by each node;

[0010] A transportation route is determined according to the target route.

[0011] Further, determining the current node and the destination node includes:

[0012] The current node is determined according to the current location of the goods, and the destination node is determined according to the destination location of the goods.

[0013] Further, determining the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the route information supported by each node includes:

[0014] Determine the current shift according to the current time and the shift information of the current node, and determine the current route according to the current shift and the route information supported by the current node;

[0015] Determine the next shift according to the end node, the end time of the route and the processing time included in the route information of the current route, and determine the next route according to the next shift and the route information supported by the end node, until the end node of the next route is the destination node, wherein the end node belongs to the intermediate node;

[0016] The current route and each of the next routes are determined as target routes.

[0017] Further, determining the current shift according to the current time and the shift information of the current node includes:

[0018] The current shift is determined according to the current time and the shift start time and shift end time of each shift included in the current shift information of the current node.

[0019] Further, determining the current route according to the current shift and the route information supported by the current node includes:

[0020] If the loading information of a route includes the destination node and the start time of the route is later than the current time, the route is determined as the current route.

[0021] Further, determining the next shift according to the end node, route end time and processing time included in the route information of the current route includes:

[0022] The next time is determined according to the line end time and the processing time, and the next shift is determined according to the next time and the shift start time of each shift included in the last shift information of the end node.

[0023] Furthermore, after determining the next route according to the next shift and the route information supported by the end node, the method further includes:

[0024] If the last sorting of the next line is not the destination node, the current line is updated based on the next line, and the next shift is determined according to the last node, line end time and processing time included in the line information of the current line.

[0025] Further, determining a transportation route according to the target route includes:

[0026] Obtaining route information according to the start node and the end node of each target route;

[0027] Obtaining time information according to the route start time and route end time of each target route;

[0028] The transportation route is determined according to the line information and the time information.

[0029] Furthermore, while determining the transportation route according to the target route, it also includes:

[0030] The target cost of the transportation route is determined according to the cost information included in the route information of the target route.

[0031] In a second aspect, an embodiment of the present invention further provides a transport route determination device, comprising:

[0032] A node determination module, configured to determine a current node and a destination node, and then determine an intermediate node according to the current node and the destination node;

[0033] A target route determination module, used to determine the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node and the route information supported by each node;

[0034] The transport route determination module is used to determine the transport route according to the target route.

[0035] In a third aspect, an embodiment of the present invention further provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method for determining a transport route as described in any one of the first aspects is implemented.

[0036] In a fourth aspect, an embodiment of the present invention further provides a storage medium comprising computer executable instructions, wherein the computer executable instructions, when executed by a computer processor, are used to execute the transportation route determination method as described in any one of the first aspects.

[0037] The embodiments of the above invention have the following advantages or beneficial effects:

[0038] The embodiment of the present invention provides a method for determining a transport route, comprising: after determining a current node and a destination node, determining an intermediate node according to the current node and the destination node; determining a target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the line information supported by each node; and determining a transport route according to the target route. The above technical scheme can first determine the current node and the destination node, as well as the intermediate node between the current node and the destination node, and secondly determine the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the line information supported by each node, so as to fully consider the shift information and the line information, and determine a transport route that meets actual operational needs. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] Figure 1 A flow chart of a method for determining a transport route provided in Embodiment 1 of the present invention;

[0040] Figure 2 A flow chart of a method for determining a transport route provided in Embodiment 2 of the present invention;

[0041] Figure 3 A schematic diagram of a business point and a destination point in a method for determining a transportation route provided by an embodiment of the present invention;

[0042] Figure 4 A flowchart of step 230 in a method for determining a transport route provided in Embodiment 2 of the present invention;

[0043] Figure 5 A schematic diagram of route pruning in a method for determining a transport route provided in Embodiment 2 of the present invention;

[0044] Figure 6 A flow chart of a method for determining a transport route provided in Embodiment 2 of the present invention;

[0045] Figure 7 A schematic diagram of the structure of a transport route determination device provided in Embodiment 3 of the present invention;

[0046] Figure 8 A schematic diagram of the structure of a computer device provided in Embodiment 4 of the present invention. DETAILED DESCRIPTION

[0047] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

[0048] It should be mentioned before discussing exemplary embodiments in more detail that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe various operations (or steps) as sequential processes, many operations therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of various operations can be rearranged. The process can be terminated when its operation is completed, but can also have additional steps not included in the accompanying drawings. The process can correspond to methods, functions, procedures, subroutines, subprograms, etc. In addition, the embodiments in the present invention and the features in the embodiments can be combined with each other without conflict.

[0049] Embodiment 1

[0050] Figure 1 This is a flow chart of a method for determining a transport route provided in the first embodiment of the present invention. The embodiment of the present invention is applicable to situations where a transport route that meets actual operational needs needs to be determined. The method can be executed by a transport route determination device, which can be implemented in software and / or hardware. Figure 1 Said method specifically comprises the following steps:

[0051] Step 110: After determining the current node and the destination node, determine the intermediate node according to the current node and the destination node.

[0052] Among them, the node can be a node in the logistics system that is responsible for the transfer of goods, which can be a site, a sorting center or a distribution center.

[0053] When transporting goods from the current location to the destination location, it is necessary to pass through multiple nodes. The node corresponding to the current location is the current node, and the node corresponding to the destination location is the destination node. Of course, at least one intermediate node may be included between the current node and the destination node. Through multiple nodes, the transportation of goods can be achieved.

[0054] Specifically, the determined positions in each region may belong to the determined nodes. After the current position of the goods is determined, the current node may be determined according to the position information of the current position. After the destination position of the goods is determined, the destination node may be determined according to the destination position. Furthermore, all intermediate nodes that may be passed from the current node to the destination node may be determined based on the current node, the destination node, and the determined transportation route.

[0055] In the embodiment of the present invention, within the node, the staff can sort, transfer and transport the goods.

[0056] Step 120: Determine the target route according to the current time, the current node, the destination node, the intermediate nodes, the shift information of each node, and the route information supported by each node.

[0057] The server may pre-store the shift information of each node and the route information supported by each node. The shift information may include the working hours of each shift of the node, which may include the shift start time, shift end time and the latest arrival time. From the shift start time to the shift end time, the node can sort and dispatch the goods, and within a shift, if the reversing time is greater than the latest arrival time of the shift, then the vehicle cannot be dispatched within the shift. Route information may represent the route from one node to another.

[0058] Table 1 is a shift information table of a node provided in an embodiment of the present invention. As shown in Table 1, the shift information may include a node, a shift number, a shift start time, a shift end time, and a latest arrival time.

[0059] Table 1 Flight information

[0060] node Shift number Shift start time Latest arrival time Shift end time A <![CDATA[W A1 ]]> 1:00 7:30 8:00 A <![CDATA[W A2 ]]> 9:00 16:30 17:00 A <![CDATA[W A3 ]]> 18:00 23:30 0:00 B <![CDATA[W B1 ]]> 2:00 11:30 12:00 B <![CDATA[W B2 ]]> 15:00 21:30 22:30 C <![CDATA[W C1 ]]> 3:00 14:00 14:30 C <![CDATA[W C2 ]]> 16:00 22:30 23:00 D <![CDATA[W D1 ]]> 0:00 6:30 7:00 D <![CDATA[W D2 ]]> 8:00 16:30 17:00 D <![CDATA[W D3 ]]> 18:00 22:30 23:00

[0061] Table 2 is a line information table of nodes provided in an embodiment of the present invention. As shown in Table 2, line information may include line number, starting node, end node, line start time, line arrival time, number of days, port processing time, loading and cost, etc. Among them, the starting node may indicate the starting node of the line, and the end node may indicate the end node of the line. The port processing time may indicate that after the line reaches the end node, the goods need to be sorted based on the port processing time, and then the next shift can be determined. Loading may indicate the nodes that can be further reached after the line reaches the end node. For example, the loading of line l2 is E and F, indicating that after reaching node B from node A through line l2, it can further reach node E and / or node F; the loading of line l3 is C and D, indicating that after reaching node C from node A through line l2, it can further reach node D. Cost may indicate the cost required to transport goods from the starting node to the end node through the line.

[0062] Table 2 Line information

[0063]

[0064] Specifically, the server may pre-store the shift information and route information corresponding to each node, and further may pre-store Table 1 and Table 2 corresponding to each node. At the current time, if the goods need to be transported from the current node to the destination node, the shift information and route information of the current node, the destination node and the intermediate node may be retrieved, and the first shift may be determined according to the current time and the start time, the latest arrival time and the end time of each shift at the current node, and further the route on which the first shift can depart may be determined, and the arrival time and arrival processing time of the route may determine the next shift, and further the next route may be determined, and if the end node of the next route is not the end node, the shift and route may continue to be determined until the end node of the next route is the destination node.

[0065] A current route and at least one next route are determined as target routes.

[0066] In the embodiment of the present invention, according to the above description, it can be known that target routes in various combinations can be obtained from the current node to the destination node. Of course, in practical applications, the optimal target route can be determined based on time cost or money cost.

[0067] Step 130: Determine a transportation route according to the target route.

[0068] Specifically, the transportation route can be obtained by sequentially connecting the start node and the end node of each target route.

[0069] For example, the current node is A, the destination node is D, and the current time is 2:00. As shown in Tables 1 and 2, the current time can be attributed to the W of node A. A1 There are two available routes, l1 and l2. Although l2 has an earlier departure time, it cannot be used because it does not have the load of node D. If you arrive at node B from l1, on route W B2 Arrive before the latest arrival time, the arrival time 18:00 plus one hour of port processing time is 17:00, which can catch up with the departure time of line l5 at 22:00. The arrival time of line l5 is 6:00 and the number of days across is 1, so the arrival time is 6:00 on the next day. Therefore, the target route from node A to node D can be line l1→l5 (A->B->D), and it starts at 2:00 on the first day and arrives at 6:00 on the second day. Then determine the transportation route as l1→l5. In this transportation route, the time cost can be 28 hours and the money cost can be 90 yuan.

[0070] In addition, as shown in Tables 1 and 2, if W A1 The shift is not processed and accumulated to W A2 , the current time can also be attributed to the W of node A A2There is a departure line l3, which arrives at node C at 14:20, later than W C1 The latest arrival time of the bus, so it cannot match the start time of the L7 line. Therefore, it can be accumulated to W C2 The target route from node A to node D can be route l3→l8 (A->C->D), which starts at 2:00 on the first day and arrives at 13:30 on the second day. The transportation route is then determined to be l3→l8, in which the time cost can be 35.5 hours and the money cost can be 85 yuan.

[0071] Of course, as shown in Tables 1 and 2, if W A1 Shift and W A2 No shifts are processed, accumulated to W A3 There is a route l4 that can be dispatched, so node D can be reached directly from l4. Therefore, the target route from node A to node D can be route l4 (A->D), which starts at 2:00 on the first day and arrives at 5:00 on the second day. Then the transportation route is determined to be l4, in which the time cost can be 27 hours and the money cost can be 100 yuan.

[0072] In practical applications, after determining at least one transportation route, the target transportation route may also be determined based on time cost or money cost.

[0073] It should be noted that the monetary cost may include the aforementioned transportation cost and the stockpiling cost at each node, and the stockpiling cost may be determined based on the stockpiling time and the stockpiling volume.

[0074] A method for determining a transport route provided in a first embodiment of the present invention includes: after determining a current node and a destination node, determining an intermediate node according to the current node and the destination node; determining a target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the line information supported by each node; and determining a transport route according to the target route. The above technical scheme can first determine the current node and the destination node, as well as the intermediate node between the current node and the destination node, and secondly determine the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the line information supported by each node, so as to fully consider the shift information and the line information, and determine a transport route that meets actual operational needs.

[0075] Embodiment 2

[0076] Figure 2This is a flowchart of a method for determining a transportation route provided in the second embodiment of the present invention. The embodiment of the present invention is applicable to situations where it is necessary to determine a transportation route that meets actual operational needs. Based on the above embodiment, the embodiment of the present invention adds "determining the target cost of the transportation route based on the cost information contained in the route information of the target route" while determining the transportation route according to the target route. The explanations of the terms that are the same or corresponding to the above embodiments are not repeated here. Figure 2 The method for determining a transportation route provided by an embodiment of the present invention includes:

[0077] In the embodiment of the present invention, the node may be a sorting site in the logistics system. The transportation route determination method provided in the second embodiment of the present invention will be described in detail below in conjunction with the sorting site.

[0078] Step 210: Determine the current sorting center according to the current location of the goods, and determine the destination sorting center according to the destination location of the goods.

[0079] Specifically, the determined positions in each region may belong to the determined sorting centers. After the current position of the goods is determined, the current sorting center may be determined according to the position information of the current position. After the destination position of the goods is determined, the destination sorting center may be determined according to the destination position. Furthermore, all intermediate sorting centers that may be passed from the current sorting center to the destination sorting center may be determined based on the current sorting center, the destination sorting center, and the determined transportation route.

[0080] It should be noted that the current location may also be a business point, which may correspond to at least one sorting center, and the destination location may also be a destination point, which may also correspond to at least one sorting center. Figure 3 A schematic diagram of a business point and a destination point in a method for determining a transportation route provided by an embodiment of the present invention, such as Figure 3 As shown, when the current location is business point O, the current sorting center corresponding to business point O can be determined to be sorting center E or sorting center F; when the destination address is destination point S, the destination sorting center corresponding to the destination point can be determined to be sorting center D1 or sorting center D2. Then, the target route can be determined based on sorting center E and sorting center D1, sorting center F and sorting center D1, sorting center E and sorting center D2, or sorting center F and sorting center D2.

[0081] Step 220: Determine an intermediate sorting center according to the current sorting center and the destination sorting center.

[0082] Specifically, at least one intermediate sorting center may be included between the current sorting center and the destination sorting center. The transportation of goods may be achieved through multiple sorting centers.

[0083] Step 230: Determine the target route according to the current time, the current sorting center, the destination sorting center, the intermediate sorting center, the shift information of each sorting center, and the route information supported by each sorting center.

[0084] Specifically, a tree-based search strategy can be used to find a suitable route, and the routes can be connected in series to obtain the target route.

[0085] Figure 4 A flowchart of step 230 in a method for determining a transport route provided in Embodiment 2 of the present invention is shown in FIG. Figure 4 As shown, in one implementation, step 230 may specifically include:

[0086] Step 2310: determine the current shift according to the current time and the shift information of the current sorting center, and determine the current route according to the current shift and the route information supported by the current sorting center.

[0087] In one implementation, determining the current shift according to the current time and the shift information of the current sorting center includes:

[0088] The current shift is determined according to the current time and the shift start time and shift end time of each shift included in the current shift information of the current sorting center.

[0089] As described in the first embodiment, the server may include pre-stored shift information of each sorting center and route information supported by each sorting center. The shift information may include the working hours of each shift of the sorting center, and may specifically include the sorting center, shift number, shift start time, shift end time, and latest arrival time. The route information may represent the route from one sorting center to another sorting center, and may specifically include the route number, start sorting, end sorting, route start time, route arrival time, number of days, port processing time, loading and cost, etc.

[0090] In combination with Table 1 and Table 2, the available working time of each shift can be determined according to the shift start time, shift end time and the latest arrival time of each shift. If the current time is within the available working time, the at least one shift can be determined as the current shift.

[0091] In one implementation, determining the current route according to the current shift and the route information supported by the current sorting center includes:

[0092] If the loading information of a route includes the destination sorting center and the start time of the route is later than the current time, the route is determined as the current route.

[0093] Specifically, the current sorting center can support at least one route, and the route information of each route can include loading information, which can indicate the sorting centers that can be reached after the route reaches the last sorting. If the last sorting of the route is not in the set of sorting centers that have been traveled and the loading information includes the destination sorting center, it can be determined that the route is a travelable route, and then the route start time and the current time can be further compared. If the route start time is later than the current time, it can be determined that the route is the current route.

[0094] Step 2320: determine the next shift according to the last sorting center, line end time and processing time included in the line information of the current line, and determine the next line according to the next shift and the line information supported by the last sorting center.

[0095] In one embodiment, determining the next shift according to the last sorting center, the line end time and the processing time included in the line information of the current line includes:

[0096] The next time is determined according to the line end time and the processing time, and the next shift is determined according to the next time and the shift start time of each shift included in the last shift information of the last sorting center.

[0097] Specifically, the line end time may be the time of arrival at the last sorting center of the line. After arriving at the last sorting center, it takes time for processing at the port before sorting and transportation can continue. First, the next time can be determined according to the line end time and the port processing time, and the next shift can be determined according to the start time and end time of each shift in the last shift information of the last sorting center at the next time. Specifically, the next time and the start time and end time of each shift can be compared. If the next time is between the end time of any shift and the end time of the next shift corresponding to the shift, then the shift is determined to be the next shift, and sorting can be performed in the next shift.

[0098] Step 2330: If the last sorting center of the next route is not the destination sorting center, the current route is updated based on the next route, and the next shift is determined according to the last sorting center, route end time and processing time included in the route information of the current route until the last sorting center of the next route is the destination sorting center.

[0099] Among them, the final sorting center belongs to the intermediate sorting center.

[0100] Specifically, if the last sort of the next route is the destination sorting center, the current route and the next route are determined as the target route. If the last sort of the next route is not the destination sorting center, the current route can be updated based on the next route, and the next shift and the next route are continuously searched at the last sort until the last sort of the next route is the destination sorting center.

[0101] In the embodiment of the present invention, in the process of determining the next route, at least one next shift and at least one next route may be obtained. The next shift may be shift information at the intermediate sorting center, and the next route may connect two of the intermediate sorting centers in series.

[0102] In practical applications, the shortest route between any two sorting centers among the current sorting center, the destination sorting center, and the intermediate sorting centers can be determined by a search algorithm. Determining the shortest route between any two sorting centers may include: adding the adjacent sorting center of the first sorting center to the queue, and according to the first-in-first-out feature of the queue, adding the adjacent sorting centers of the subsequent adjacent sorting centers to the queue. In the process of entering the queue, the added sorting center cannot be added multiple times, and the upstream sorting center of each sorting center is recorded. When the search is completed, the complete shortest route can be obtained by searching upward through the sorting center.

[0103] Of course, if the loading conditions of each intermediate sorting center are not taken into consideration, all available routes of each intermediate sorting center can become candidate directions for tree search. At this time, the routes can be screened according to the number of outlets on each route. Figure 5 A schematic diagram of route pruning in a method for determining a transport route provided in Embodiment 2 of the present invention, such as Figure 5 As shown, the ellipsis indicates five transfer times. Assuming that the longest transfer times of the route is 6, from the current sorting center O to the destination sorting center D in series, because the transfer times from the intermediate sorting center G to the destination sorting center D is 6, plus one transfer from the current sorting center O to the intermediate sorting center G, the total number of transfer times is 7, which exceeds the limit of the longest transfer times, so it can be excluded to search for routes starting from the intermediate sorting center G.

[0104] In the above route search, loading can be ignored and only the longest number of transfers can be considered to determine the target route. At this time, the screening conditions can be weakened and target routes with slightly worse time efficiency can also be retained. Multiple candidate target routes can be obtained to facilitate subsequent screening.

[0105] Step 2340: determine the current route and each of the next routes as target routes.

[0106] Specifically, the current route and at least one next route may be determined as the target route.

[0107] In the embodiment of the present invention, multiple target routes may be determined. Of course, in practical applications, the optimal target route may be determined based on time cost or money cost.

[0108] Step 240: Determine a transportation route according to the target route.

[0109] In one implementation, step 240 may specifically include:

[0110] According to the start sorting and the end sorting of each target route, the route information is obtained; according to the route start time and the route end time of each target route, the time information is obtained; and according to the route information and the time information, the transportation route is determined.

[0111] Specifically, line information can be obtained according to the start sorting and end sorting of the target line, and the transportation path can be determined by the line information. Time information can be obtained according to the line start time and line end time of the target line, and the transportation time can be determined by the time information. Then, the transportation route can be determined according to the transportation path and transportation time.

[0112] It should be noted that during the interval of the transportation time, corresponding to the intermediate sorting centers in the transportation path, the goods may be stored in each intermediate sorting center during the interval, thereby generating storage costs. The storage costs and the transportation costs on each route can determine the monetary cost.

[0113] Step 250: Determine the target cost of the transportation route according to the cost information included in the route information of the target route.

[0114] The cost information includes monetary cost information and time cost information, and correspondingly, the target cost also includes target monetary cost and target time cost.

[0115] Specifically, the route information of each route may include the cost information generated by transporting the goods from the beginning sorting to the end sorting of the route, including monetary cost information and time cost information. In addition, the goods may be stored in each intermediate sorting center in the transportation path during the interval of transportation time, thereby generating storage costs, including monetary storage costs and time storage costs. The storage costs and the transportation costs on each route, i.e., the aforementioned cost information, may determine the target cost.

[0116] The monetary cost information and the monetary hoarding cost can determine the target monetary cost, and the time cost information and the time hoarding cost can determine the target time cost.

[0117] Step 260: Determine the target transportation route according to the monetary cost and time cost of each transportation route and the demand information.

[0118] Specifically, if the demand information is the lowest monetary cost, the transportation route with the lowest monetary cost can be determined as the target transportation route; if the demand information is the lowest time cost, the transportation route with the lowest time cost can be determined as the target transportation route.

[0119] In practical applications, the demand information may also be other information, and further, the corresponding other information may be pre-stored in Table 1 and Table 2, and other costs may be determined while determining the transportation route, and the transportation route with the lowest other costs may be further determined as the target transportation route.

[0120] For example, the demand information may also be the number of transfers. In this case, it is necessary to determine the transportation route with the least transfer data. The transportation route may be determined by ignoring the loading, and the transportation route with the least number of transfers may be determined as the target transportation route.

[0121] A method for determining a transport route provided in the second embodiment of the present invention includes: after determining the current sorting center and the destination sorting center, determining an intermediate sorting center according to the current sorting center and the destination sorting center; determining a target route according to the current time, the current sorting center, the destination sorting center, the intermediate sorting center, the shift information of each sorting center, and the route information supported by each sorting center; and determining a transport route according to the target route. The above technical scheme can first determine the current sorting center and the destination sorting center, as well as the intermediate sorting center between the current sorting center and the destination sorting center, and secondly determine the target route according to the current time, the current sorting center, the destination sorting center, the intermediate sorting center, the shift information of each sorting center, and the route information supported by each sorting center, so as to fully consider the shift information and route information and determine a transport route that meets actual operational needs.

[0122] Secondly, when determining the transportation route, a preset pruning strategy can be added, that is, the time cost or money cost can be minimized, and then the transportation route that best meets the needs can be determined. The time cost and money cost of the lines included in the transportation route are determined, and then the target transportation route is determined based on the time cost or money cost, realizing the determination of the optimal transportation route according to the needs.

[0123] In addition, the transportation route determination method provided in the embodiment of the present invention can support transportation route determination for multiple scenarios and multiple demands, and when the shortest transportation route is determined without considering loading, the efficiency of transportation route determination is improved by introducing pruning routes based on the longest number of transfers.

[0124] Figure 6 The following is a flowchart of a method for determining a transport route provided in the second embodiment of the present invention, and exemplifies one of the implementation methods. Figure 6 As shown, including:

[0125] Step 610: Determine the current sorting center according to the current location of the goods, and determine the destination sorting center according to the destination location of the goods.

[0126] Step 611: Determine an intermediate sorting center according to the current sorting center and the destination sorting center.

[0127] Step 612: Determine the current shift according to the current time and the shift information of the current sorting center, and determine the current route according to the current shift and the route information supported by the current sorting center.

[0128] Step 613: Determine the next shift according to the last sorting center, line end time and processing time included in the line information of the current line, and determine the next line according to the next shift and the line information supported by the last sorting center.

[0129] Step 614: Determine whether the last sorting of the next line is the destination sorting center.

[0130] If the last sorting of the next line is the destination sorting center, step 616 is executed; if the last sorting of the next line is not the destination sorting center, step 615 is executed.

[0131] Step 615: Update the current line based on the next line.

[0132] After step 615, the process returns to step 613.

[0133] Step 616: Determine the current route and each next route as the target route.

[0134] Step 617: Determine a transportation route according to the target route.

[0135] Step 618: Determine the target cost of the transportation route according to the cost information included in the route information of the target route.

[0136] Step 619: Determine the target transportation route according to the monetary cost and time cost of each transportation route and the demand information.

[0137] A second embodiment of the present invention provides an implementation of a method for determining a transport route, which includes determining the current sorting center according to the current location of the goods, determining the destination sorting center according to the destination location of the goods; determining an intermediate sorting center according to the current sorting center and the destination sorting center; determining the current shift according to the current time and the shift information of the current sorting center, and determining the current route according to the current shift and the route information supported by the current sorting center; determining the next shift according to the last sorting center, route end time and processing time included in the route information of the current route, and determining the next route according to the next shift and the route information supported by the last sorting center; determining whether the last sorting of the next route is the destination sorting center; if the next If the last sorting of a route is not the destination sorting center, the current route is updated based on the next route, and the next shift is determined according to the last sorting center, route end time and processing time included in the route information of the current route, and the next route is determined according to the next shift and the route information supported by the last sorting center, until the last sorting of the next route is the destination sorting center; if the last sorting of the next route is the destination sorting center, the current route and each next route are determined as the target route; the transportation route is determined according to the target route; the target cost of the transportation route is determined according to the cost information included in the route information of the target route; the target transportation route is determined according to the money cost and time cost of each transportation route and the demand information. The above technical solution can first determine the current sorting center and the destination sorting center, as well as the intermediate sorting center between the current sorting center and the destination sorting center. Secondly, according to the current time, the current sorting center, the destination sorting center, the intermediate sorting center, the shift information of each sorting center, and the line information supported by each sorting center, the target line can be determined, so as to fully consider the shift information and line information and determine the transportation route that meets the actual operation needs. In addition, when determining the transportation route, a preset pruning strategy can be added, that is, the time cost or money cost can be minimized, and then the transportation route that best meets the needs is determined. The time cost and money cost of the route included in the transportation route are determined, and then the target transportation route is determined according to the time cost or money cost, so as to achieve the determination of the optimal transportation route according to the needs.

[0138] Embodiment 3

[0139] Figure 7 A schematic diagram of the structure of a transport route determination device provided in Embodiment 3 of the present invention. The device and the transport route determination methods of the above-mentioned embodiments belong to the same inventive concept. For details not described in detail in the embodiments of the transport route determination device, reference can be made to the embodiments of the above-mentioned transport route determination methods.

[0140] The specific structure of the transport route determination device is as follows: Figure 7 As shown, including:

[0141] A node determination module 710 is used to determine the current node and the destination node, and then determine the intermediate node according to the current node and the destination node;

[0142] The target route determination module 720 is used to determine the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node and the route information supported by each node;

[0143] The transportation route determination module 730 is used to determine the transportation route according to the target route.

[0144] Based on the above embodiment, the node determination module 710 is specifically used for:

[0145] Determine the current node according to the current location of the goods, and determine the destination node according to the destination location of the goods;

[0146] An intermediate node is determined according to the current node and the destination node.

[0147] Based on the above embodiment, the target line determination module 720 includes:

[0148] A first determining unit, configured to determine a current shift according to the current time and the shift information of the current node, and determine a current route according to the current shift and the route information supported by the current node;

[0149] a second determining unit, configured to determine a next shift according to an end node, a route end time, and a processing time included in the route information of the current route, and determine a next route according to the next shift and the route information supported by the end node, until the end node of the next route is the destination node, wherein the end node belongs to the intermediate node;

[0150] The third determining unit is configured to determine the current line and each of the next lines as target lines.

[0151] Based on the above embodiment, the first determining unit is specifically configured to:

[0152] Determine the current shift according to the current time, and the shift start time and shift end time of each shift included in the current shift information of the current node;

[0153] If the loading information of a route includes the destination node and the start time of the route is later than the current time, the route is determined as the current route.

[0154] Based on the above embodiment, the second determining unit is specifically configured to:

[0155] Determine the next time according to the route end time and the processing time, and determine the next shift according to the next time and the start time of each shift included in the last shift information of the last node;

[0156] If the end node of the next route is not the destination node, the current route is updated based on the next route, and the next shift is determined according to the end node, route end time and processing time included in the route information of the current route.

[0157] Based on the above embodiment, the transportation route determination module 730 is specifically used for:

[0158] Obtaining route information according to the start node and the end node of each target route;

[0159] Obtaining time information according to the route start time and route end time of each target route;

[0160] The transportation route is determined according to the line information and the time information.

[0161] Based on the above embodiment, the device further includes:

[0162] The cost determination module is used to determine the target cost of the transportation route according to the cost information included in the route information of the target route.

[0163] The transport route determination device provided in the embodiment of the present invention can execute the transport route determination method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of executing the transport route determination method.

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

[0165] Embodiment 4

[0166] Figure 8 A schematic diagram of the structure of a computer device provided in Embodiment 4 of the present invention. Figure 8 A block diagram of an exemplary computer device 8 suitable for use in implementing embodiments of the present invention is shown. Figure 8 The computer device 8 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0167] like Figure 8 As shown, the computer device 8 is in the form of a general-purpose computing electronic device. The components of the computer device 8 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 connecting different system components (including the system memory 28 and the processing unit 16).

[0168] Bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor or a local bus using any of a variety of bus architectures. By way of example, these architectures include, but are not limited to, an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MAC) bus, an Enhanced ISA bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnect (PCI) bus.

[0169] The computer device 8 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the computer device 8, including volatile and non-volatile media, removable and non-removable media.

[0170] The system memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The computer device 8 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media ( Figure 8 not shown, usually called a "hard drive"). Although Figure 8 Not shown in the figure, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, a DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 18 via one or more data medium interfaces. The system memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present invention.

[0171] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in system memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. Program modules 42 generally perform the functions and / or methods of the embodiments described herein.

[0172] The computer device 8 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), one or more devices that enable a user to interact with the computer device 8, and / or any device that enables the computer device 8 to communicate with one or more other computing devices (e.g., network card, modem, etc.). Such communication may be performed through an input / output (I / O) interface 22. Furthermore, the computer device 8 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 20. Figure 8 As shown, the network adapter 20 communicates with other modules of the computer device 8 via the bus 18. It should be understood that although Figure 8 Not shown, other hardware and / or software modules may be used in conjunction with computer device 8, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0173] The processing unit 16 executes various functional applications and page displays by running the programs stored in the system memory 28, such as implementing the transportation route determination method provided in the embodiment of the present invention.

[0174] Wherein, when the method comprises:

[0175] After determining the current node and the destination node, determining the intermediate node according to the current node and the destination node;

[0176] Determine the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the route information supported by each node;

[0177] A transportation route is determined according to the target route.

[0178] Of course, those skilled in the art can understand that the processor can also implement the technical solution of the transportation route determination method provided by any embodiment of the present invention.

[0179] Embodiment 5

[0180] Embodiment 10 of the present invention provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the method for determining a transportation route provided in the embodiment of the present invention is implemented.

[0181] Wherein, when the method comprises:

[0182] After determining the current node and the destination node, determining the intermediate node according to the current node and the destination node;

[0183] Determine the target route according to the current time, the current node, the destination node, the intermediate node, the shift information of each node, and the route information supported by each node;

[0184] A transportation route is determined according to the target route.

[0185] The computer storage medium of the embodiment of the present invention can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this document, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0186] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0187] The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0188] Computer program code for performing the operations of the present invention may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0189] It should be understood by those skilled in the art that the modules or steps of the present invention described above can be implemented by a general-purpose computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, optionally, they can be implemented by a program code executable by a computer device, so that they can be stored in a storage device and executed by the computing device, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0190] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A method for determining a transport route, characterized in that: include: After determining the current node and the destination node, determining the intermediate node according to the current node and the destination node; Determine the current shift and the current route according to the current time and the shift information of the current node; Determine the next flight and the next route according to the current route; If the end node of the next route is not the destination node, the next route is used as the current route, and the process returns to determine the next shift and the next route according to the current route until the end node of the next route is the destination node; Determine a target route according to the current route and each of the next routes; A transportation route is determined according to the target route.

2. The method for determining a transport route according to claim 1, characterized in that: Determining the current node and the destination node includes: The current node is determined according to the current location of the goods, and the destination node is determined according to the destination location of the goods.

3. The method for determining a transportation route according to claim 1, characterized in that: Determining the current shift and the current route according to the current time and the shift information of the current node, including: determining the current shift according to the current time and the shift information of the current node, and determining the current route according to the current shift and the route information supported by the current node; Determining the next flight and the next route according to the current route includes: The next shift is determined according to the end node, the route end time and the processing time included in the route information of the current route, and the next route is determined according to the next shift and the route information supported by the end node.

4. The method for determining a transportation route according to claim 1, characterized in that: Determining the current shift according to the current time and the shift information of the current node includes: The current shift is determined according to the current time and the shift start time and shift end time of each shift included in the current shift information of the current node.

5. The method for determining a transportation route according to claim 3, characterized in that: Determining a current route according to the current shift and route information supported by the current node, including: If the loading information of a route includes the destination node and the start time of the route is later than the current time, the route is determined as the current route.

6. The method for determining a transportation route according to claim 3, characterized in that: Determining the next trip according to the end node, route end time and processing time included in the route information of the current route includes: The next time is determined according to the line end time and the processing time, and the next shift is determined according to the next time and the shift start time of each shift included in the last shift information of the end node.

7. The method for determining a transportation route according to claim 1, characterized in that: Determining a transportation route according to the target route includes: Obtaining route information according to the start node and the end node of each target route; Obtaining time information according to the route start time and route end time of each target route; The transportation route is determined according to the line information and the time information.

8. The method for determining a transportation route according to claim 1, characterized in that: While determining the transportation route according to the target route, it also includes: The target cost of the transportation route is determined according to the cost information included in the route information of the target route.

9. A transport route determination device, characterized in that: include: A node determination module, configured to determine a current node and a destination node, and then determine an intermediate node according to the current node and the destination node; A target route determination module, used to determine the current shift and the current route according to the current time and the shift information of the current node; Determine the next flight and the next route according to the current route; If the end node of the next route is not the destination node, the next route is used as the current route, and the process returns to determine the next shift and the next route according to the current route until the end node of the next route is the destination node; Determine a target route according to the current route and each of the next routes; The transport route determination module is used to determine the transport route according to the target route.

10. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the transportation route determination method as described in any one of claims 1-8 is implemented.

11. A storage medium comprising computer executable instructions, wherein the computer executable instructions are used to perform the transportation route determination method according to any one of claims 1 to 8 when executed by a computer processor.

Images