Logistics network route planning method, device, equipment and computer storage medium

Abstract

The application provides a logistics network line planning method, device and equipment and a computer storage medium; the method comprises the following steps: acquiring transportation route information; determining round-trip routes according to the transportation route information, and combining the round-trip routes to form route combinations; acquiring the number of required train services of each round-trip route in each route combination, and calculating the required train service difference of each route combination; performing vehicle scheduling according to the transportation route information, each route combination and the required train service difference of each route combination to obtain a logistics network line planning scheme; in the embodiment of the application, the round-trip routes are combined, the required train service difference of the round-trip routes is calculated, and the vehicle scheduling is performed according to the required train service difference and the route combination, so that the empty running of the vehicle is reduced, the logistics transportation efficiency is improved, and the logistics transportation cost is reduced.

Description

Technical Field

[0001] The present application relates to the field of logistics, and specifically to a logistics network route planning method, device, equipment and computer storage medium. Background Art

[0002] With the rapid development of the global logistics industry, the volume of transportation business is increasing. Transportation services are of paramount importance to the entire logistics system, and their costs account for a relatively large proportion of the overall logistics costs.

[0003] Currently, most vehicle transportation modes are round-trip pick-up / delivery tasks between two points. This vehicle transportation mode has a situation where the demand for cargo in one direction is far greater than the cargo in the opposite direction, resulting in frequent empty return trips. This has caused a waste of vehicle resources to a certain extent, resulting in low logistics and transportation efficiency, and invisibly raised transportation costs. Summary of the Invention

[0004] The present application provides a logistics network route planning method, device, equipment and computer storage medium, which aims to solve the technical problems of vehicle resource waste, low transportation efficiency and high transportation cost in the process of cargo transportation.

[0005] In one aspect, the present application provides a logistics network route planning method, comprising:

[0006] Obtain transportation route information;

[0007] Determine a round trip route based on the transport route information, and combine the round trip routes to form a route combination;

[0008] Obtain the number of required trips for the round-trip routes in each of the route combinations, and calculate the difference in the number of required trips for each group of the route combinations;

[0009] Vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the difference in the number of required trains for each of the route combinations to obtain a logistics network route planning solution.

[0010] In some embodiments of the present application, determining a round-trip route based on the transportation route information and combining the round-trip routes to form a route combination includes:

[0011] Extracting a target route, and a starting point and an end point of the target route from the transport route information;

[0012] According to the starting point and the end point of the target route, query the transport route information to determine whether there is a return route corresponding to the target route;

[0013] If there is a return route corresponding to the target route, the target route and the return route are combined to obtain a route combination.

[0014] In some embodiments of the present application, after querying the transportation route information to determine whether there is a return route corresponding to the target route based on the starting point and the end point of the target route, the method includes:

[0015] If there is no return route corresponding to the target route, create a return route corresponding to the target route;

[0016] The target route and the return route are combined to obtain a route combination.

[0017] In some embodiments of the present application, vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the difference in the number of required trains for each of the route combinations to obtain a logistics network route planning solution, including:

[0018] Sort the route combinations according to the difference in the number of trains required for the route combinations from largest to smallest, and obtain the main route combination with the largest difference in the number of trains required;

[0019] The route with the largest number of required trips in the main route combination is selected as the forward route, and a secondary route combination is searched based on the end point of the forward route in the main route combination, wherein the distance between the starting point of the forward route in the secondary route combination and the end point of the forward route in the main route combination is less than a preset distance;

[0020] Vehicle scheduling is performed according to the main route combination and the sub-route combination to obtain a logistics network route planning solution.

[0021] In the embodiment of the present application, the vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations to obtain a logistics network route planning scheme, including:

[0022] Merging the main route combination and the sub-route combination to calculate the new required train frequency difference;

[0023] Comparing the new required train number difference with the required train number difference of the main route combination;

[0024] If the new required train number difference is less than the required train number difference of the main route combination, vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the required train number difference of each of the route combinations to obtain a logistics network route planning solution.

[0025] In an embodiment of the present application, the route with a large number of required trips in the main route combination is used as the forward route, and a secondary route combination is searched based on the terminal position of the forward route in the main route combination. After the distance between the starting position of the forward route in the secondary route combination and the terminal position of the forward route in the main route combination is less than a preset distance, the method includes:

[0026] Calculating a dispatch distance between an end point of the forward route in the primary route combination and a starting point of the forward route in the secondary route combination, and comparing the dispatch distance with a one-way transport distance in the primary route combination;

[0027] If the dispatch distance is less than the one-way transport distance, vehicle dispatch is performed according to the transport route information, each route combination, and the difference in the number of required trains for each route combination to obtain a logistics network route planning solution.

[0028] In the embodiment of the present application, after obtaining the number of required trains for the round-trip routes in each of the route combinations and calculating the difference in the number of required trains for each group of the route combinations, the method includes:

[0029] Comparing the required train number difference of the route combination with a preset quantity threshold;

[0030] If the difference in the number of trains required for the route combination is greater than the preset quantity threshold, the step of performing vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations is executed to obtain a logistics network route planning solution.

[0031] In another aspect, the present application provides a logistics network route planning device, comprising:

[0032] Acquisition module, used to obtain transportation route information;

[0033] a combining module, configured to determine a round trip route based on the transport route information, and combine the round trip routes to form a route combination;

[0034] A calculation module is used to obtain the number of required trains for the round-trip routes in each of the route combinations, and calculate the difference in the number of required trains for each group of the route combinations;

[0035] The planning module is used to perform vehicle scheduling based on the transportation route information, each route combination, and the difference in the number of required vehicles for each route combination to obtain a logistics network route planning solution.

[0036] On the other hand, the present application also provides a logistics network route planning device, comprising:

[0037] one or more processors;

[0038] Memory; and

[0039] One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the steps of the logistics network route planning method.

[0040] On the other hand, the present application also provides a computer-readable storage medium on which a computer program is stored, and the computer program is loaded by a processor to execute the steps in the logistics network route planning method.

[0041] In the technical solution of the present application, transport route information is obtained, and the vehicle transport information includes route identification, the starting position of each route, the end position of each route, and the number of trains required for each route; round-trip routes are determined according to the transport route information, and the round-trip routes are combined to form a route combination; the number of trains required for the round-trip routes in each of the route combinations is obtained, and the difference in the number of trains required for each group of the route combinations is calculated; vehicle scheduling is performed according to the transport route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations to obtain a logistics network route planning solution; in the embodiment of the present application, round-trip routes are combined according to the transport route information, and the number of trains required for each of the route combinations is calculated. The difference in the number of required trips for a group of round-trip routes is used to recombine the route combinations according to the transport route information, the route combinations, and the difference in the number of required trips for each route combination, and to dispatch vehicles between different route combinations. This reduces the number of round-trip trips of vehicles within the combination, and assigns logistics transport tasks to a specific transport vehicle to execute, which can alleviate the pressure on vehicle resource management. At the same time, based on the consideration of round-trip convection balance, the efficiency of transport vehicle utilization is improved, and routes and vehicles can be adjusted according to different logistics and transport business scenarios and business measurement indicators. The logistics network route planning solution is highly versatile and suitable for scenarios with multiple transport route management. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0043] Figure 1 This is a scenario diagram of the logistics network route planning method provided by an embodiment of the present application;

[0044] Figure 2 This is a flow chart of an embodiment of logistics network route planning in the logistics network route planning method in the embodiment of the present application;

[0045] Figure 3 This is a schematic diagram of a specific scenario of an embodiment of logistics network route planning in the logistics network route planning method in the embodiment of this application;

[0046] Figure 4 This is a flow chart of an embodiment of route combination in the logistics network route planning method in the embodiment of the present application;

[0047] Figure 5 This is a schematic diagram of a specific scenario of an embodiment of a route combination in the logistics network route planning method provided in the embodiments of the present application;

[0048] Figure 6 This is a flow chart of an embodiment of vehicle dispatch route planning in the logistics network route planning method provided in the embodiments of the present application;

[0049] Figure 7 This is a flow chart of an embodiment of a logistics network route planning method based on the difference in demanded trains provided in the embodiments of the present application;

[0050] Figure 8 This is a flow chart of vehicle scheduling based on distance in the logistics network route planning method provided in an embodiment of the present application;

[0051] Figure 9 This is a schematic diagram of the structure of an embodiment of a logistics network route planning device provided in an embodiment of the present application;

[0052] Figure 10 It is a schematic diagram of the structure of an embodiment of the logistics network route planning device provided in the embodiments of this application. DETAILED DESCRIPTION

[0053] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the embodiments described are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative efforts are within the scope of the present invention.

[0054] In this application, the word "exemplary" is used to mean "serving as an example, illustration, or illustration." Any embodiment described in this application as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments. The following description is given to enable any person skilled in the art to make and use the invention. In the following description, details are listed for the purpose of explanation. It should be understood that one of ordinary skill in the art will recognize that the invention can be practiced without these specific details. In other instances, well-known structures and processes are not described in detail to avoid obscuring the description of the invention with unnecessary detail. Therefore, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

[0055] The embodiments of the present application provide a logistics network route planning method, apparatus, device and computer storage medium, which are described in detail below.

[0056] The logistics network route planning method in an embodiment of the present invention is applied to a logistics network route planning device, and the logistics network route planning device is arranged in a logistics network route planning device. The logistics network route planning device is provided with one or more processors, memories, and one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the logistics network route planning method; the logistics network route planning device can be a mobile terminal, such as a mobile phone, a tablet computer or a camera.

[0057] like Figure 1 As shown, Figure 1 This is a scenario diagram of the logistics network route planning method in an embodiment of the present application. The logistics network route planning scenario in the embodiment of the present invention includes a logistics network route planning device 100 (the logistics network route planning device 100 is integrated with a logistics network route planning device), and the logistics network route planning device 100 runs a computer-readable storage medium corresponding to the logistics network route planning to execute the steps of logistics network route planning.

[0058] It is understandable that Figure 1 The logistics network route planning equipment in the logistics network route planning scenario shown, or the devices included in the logistics network route planning equipment, do not constitute a limitation on the embodiments of the present invention. That is, the number of devices and types of devices included in the logistics network route planning scenario, or the number and types of devices included in each device do not affect the overall implementation of the technical solution in the embodiments of the present invention, and can all be regarded as equivalent replacements or derivatives of the technical solution claimed to be protected in the embodiments of the present invention.

[0059] The logistics network route planning device 100 in the embodiment of the present invention is mainly used to: obtain transportation route information, the vehicle transportation information includes route identification, the starting position of each route, the end position of each route and the number of trains required for each route; determine the round-trip route based on the transportation route information, and combine the round-trip routes to form a route combination; obtain the number of trains required for the round-trip routes in each of the route combinations, and calculate the difference in the number of trains required for each group of the route combinations; perform vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations, to obtain a logistics network route planning solution.

[0060] In the embodiment of the present invention, the logistics network route planning device 100 can be an independent logistics network route planning device, or a logistics network route planning device network or logistics network route planning device cluster composed of logistics network route planning devices. For example, the logistics network route planning device 100 described in the embodiment of the present invention includes but is not limited to a computer, a network host, a single network logistics network route planning device, a set of multiple network logistics network route planning devices, or a cloud logistics network route planning device composed of multiple logistics network route planning devices. The cloud logistics network route planning device is composed of a large number of computers or network logistics network route planning devices based on cloud computing.

[0061] Those skilled in the art will understand that Figure 1 The application environment shown in the figure is only one application scenario of the present application solution and does not constitute a limitation on the application scenario of the present application solution. Other application environments may also include Figure 1 More or fewer logistics network route planning devices as shown in , or network connection relationships of logistics network route planning devices, such as Figure 1 Only one logistics network route planning device is shown. It can be understood that the logistics network route planning scenario can also include one or more other logistics network route planning devices, which are not limited here. The logistics network route planning device 100 can also include a memory for storing data, for example, storing operation demand information, etc.

[0062] In addition, in the logistics network route planning scenario of the present application, the logistics network route planning device 100 can be provided with a display device, or the logistics network route planning device 100 is not provided with a display device and is in communication connection with an external display device 200, and the display device 200 is used to output the results of the execution of the logistics network route planning method in the logistics network route planning device. The logistics network route planning device 100 can access a backend database 300 (the backend database can be in the local memory of the logistics network route planning device, or the backend database can also be set in the cloud), and the backend database 300 stores information related to logistics network route planning.

[0063] It should be noted that Figure 1 The scenario diagram of the logistics network route planning method shown is only an example. The scenario of logistics network route planning described in the embodiment of the present invention is to more clearly illustrate the technical solution of the embodiment of the present invention, and does not constitute a limitation on the technical solution provided by the embodiment of the present invention.

[0064] like Figure 2 As shown, Figure 2 This is a flow chart of an embodiment of logistics network route planning in the logistics network route planning method in the embodiment of this application.

[0065] The steps of logistics network route planning in the logistics network route planning method of this embodiment include:

[0066] 201, obtain transportation route information.

[0067] In this embodiment, the logistics network route planning method is applied to the logistics network route planning equipment. The type of logistics network route planning equipment is not specifically limited. For example, the logistics network route planning equipment can be a terminal or a server. In this embodiment, the server is used as an example for illustration.

[0068] The server receives the logistics network route planning instruction, wherein the triggering method of the logistics network route planning instruction is not specifically limited, that is, the user can manually trigger the logistics network route planning instruction, for example, the user enters the vehicle dispatching request for the xxx area in the terminal, the terminal sends the vehicle dispatching request to the server, and the server triggers the logistics network route planning instruction; or the server automatically triggers the logistics network route planning instruction, for example, the server pre-sets that the difference in the number of required trains in the round-trip route exceeds the preset train threshold and is automatically triggered. The preset train threshold can be flexibly set according to the specific scenario, for example, the preset quantity threshold is set to 10 vehicles; the server obtains the number of required trains in each round-trip route in real time, the server subtracts the number of required trains in the round-trip route to obtain the difference in required trains, and the server compares the difference in required trains with the preset quantity threshold. If the difference in required trains is greater than the preset quantity threshold, the server automatically triggers the logistics network route planning instruction.

[0069] After the server receives the logistics network route planning instruction, the server obtains the transportation route information corresponding to the logistics network route planning instruction; the transportation route information refers to the information related to the transportation vehicle, transportation time and transportation distance in each transportation task, for example, the transportation route information includes but is not limited to: route identification, the starting position of each route, the end position of each route and the required number of trips for each route; the route identification refers to the identification information that uniquely identifies the route, for example, the route number.

[0070] 202 : Determine round-trip routes based on the transportation route information, and combine the round-trip routes to form a route combination.

[0071] The server randomly draws a route identifier of a transport route, obtains the starting point and the end point associated with the route identifier of the transport route, obtains the route identifier of a transport route that is opposite to the starting point and the end point of the transport route, and combines the route identifiers of the two transport routes with the starting points and the end points in opposite directions to form a route combination.

[0072] In this embodiment, the server obtains the transportation route information to perform route combination according to the transportation route information to form route combinations of different round-trip routes, and performs route planning and vehicle scheduling according to the route combination.

[0073] 203 , obtaining the number of required trips for the round-trip routes in each of the route combinations, and calculating the difference in the number of required trips for each group of the route combinations.

[0074] The server obtains the number of required trips for the round-trip routes in each route combination. The server uses the route with the larger number of required trips in the round-trip route combination as the forward route, and the route with the smaller number of required trips in the opposite direction of the forward route as the reverse route. The server subtracts the number of required trips for the forward route from the number of required trips for the reverse route to obtain the difference in the number of required trips for each route combination.

[0075] Furthermore, after step 203, the following steps are included:

[0076] (1) comparing the difference in the number of trains required for the route combination with a preset number threshold;

[0077] (2) If the difference in the number of trains required for the route combination is greater than the preset quantity threshold, the step of performing vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations is executed to obtain a logistics network route planning solution.

[0078] That is, the server compares the difference in the number of trains required for each route combination with a preset number threshold; the preset number threshold can be flexibly set according to the specific scenario. For example, the preset number threshold is set to 5 vehicles. If the difference in the number of trains required for the route combination is less than or equal to the preset number threshold, the server outputs the planning completion; if the difference in the number of trains required for the route combination is greater than the preset number threshold, the server executes the step of dispatching vehicles based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations to obtain a logistics network route planning solution. In this embodiment, when the difference in the number of trains required for a route combination is large, the server performs a technical solution for logistics network planning. In this way, the server can reduce the amount of data while ensuring the comprehensiveness of vehicle allocation. Specifically:

[0079] 204 , performing vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of required trains for each of the route combinations to obtain a logistics network route planning solution.

[0080] After obtaining the difference in the number of demanded trains for each route combination, the server determines whether there is an empty return trip on the convection route. After determining that there is an empty return trip, the server sorts the route combinations according to the difference in the number of demanded trains, and obtains the route combination with the largest difference in the number of demanded trains as the main route combination. The server determines whether there is an available vehicle at the end position of the forward route in the main route combination. The server searches based on the end position of the forward route in the main route combination and obtains a sub-route combination with the end position as the starting position in other route combinations. The server dispatches vehicles based on the two route combinations to obtain a logistics network route planning solution.

[0081] In the embodiment of the present application, round-trip routes are combined according to the transport route information, the difference in the number of required trips for each group of round-trip routes is calculated, and the route combinations are recombined according to the transport route information, the route combinations, and the difference in the number of required trips for each of the route combinations, and vehicles are dispatched between different route combinations. In this way, the number of round-trip trips of vehicles within the combination is reduced, and the logistics transportation task is assigned to a specific transport vehicle for execution, which can alleviate the pressure on vehicle resource management; at the same time, based on the consideration of round-trip convection balance, the efficiency of transport vehicle utilization is improved, and routes and vehicles can be adjusted according to different logistics transportation business scenarios and business measurement indicators. The logistics network route planning solution is highly versatile and suitable for scenarios with multiple transport route management.

[0082] For ease of understanding, Figure 3 As shown, Figure 3 This is a schematic diagram of a specific scenario of an embodiment of logistics network route planning in the logistics network route planning method in the embodiment of this application;

[0083] In this embodiment, all route combinations are arranged in descending order according to the difference in round-trip train demands, and the following steps are performed starting from the main route combination with the largest difference in train demands:

[0084] a. For route combination i, if it is not marked as , it is used as the main route combination. Based on its forward route endpoint (such as endpoint 1), the forward route starting points of other nearby sub-route combinations (such as starting point 2) must be retrieved. The following three conditions must be met: ① The search must be within the same province; ② The dispatch support distance from the forward endpoint of the main route combination to the forward starting points of other sub-route combinations should be less than the one-way distance of the main route combination, from the starting position of the forward path to the terminal end point; ③ The distance from the forward end point of the sub-route combination to the forward starting point of the main route combination should be less than a preset threshold D;

[0085] b. After retrieving another starting point that meets the conditions (such as starting point 2), if the route combination where the starting point is located is not marked, try to merge its corresponding secondary route combination with the main route combination, and calculate the difference between the forward and reverse demand trains of the new route combination DIF' = the number of forward trains of the main route combination + the number of reverse trains of the secondary route combination - the number of reverse trains of the main route combination - the number of forward trains of the secondary route combination. If DIF' <DIF,则合并成功,需要将副路线组合进行标记,否则失败;

[0086] c. Repeat step b until all other route combinations except the main route combination are traversed, and then mark the main route combination as well;

[0087] d. Repeat the above steps to output the new combination results and measure the overall optimization effect, such as the number of combinations reduced, the difference between the forward and reverse train times reduced, etc. in this embodiment.

[0088] In the embodiment of the present application, the server combines round-trip routes, calculates the difference in the number of required trains for the round-trip routes, and dispatches vehicles based on the difference in the number of required trains and the route combination, thereby reducing the empty operation of vehicles, improving logistics transportation efficiency, and reducing logistics transportation costs.

[0089] like Figure 4 As shown, Figure 4 This is a flow chart of an embodiment of route combination in the logistics network route planning method in the embodiment of the present application. The logistics network route planning method includes:

[0090] 301 , extracting a target route, and a starting point and an end point of the target route from the transportation route information.

[0091] The server extracts a target route from the transportation route information, wherein the target route refers to a randomly selected route, and the server obtains the starting position and the ending position of the target route.

[0092] 302. According to the starting point and the ending point of the target route, query the transportation route information to determine whether there is a return route corresponding to the target route.

[0093] The server traverses the transportation route information based on the starting point and end point of the target route to determine whether there is a return route corresponding to the target route. That is, the server uses the end point of the target route as the starting point, traverses the starting point of each route in the transportation route information, and the server determines whether there is a return route corresponding to the target route.

[0094] 303. If there is a return route corresponding to the target route, combine the target route and the return route to obtain a route combination.

[0095] 304. If there is no return route corresponding to the target route, create a return route corresponding to the target route; and combine the target route and the return route to obtain a route combination.

[0096] If there is a return route corresponding to the target route, the server combines the target route and the return route to obtain a route combination; if there is no return route corresponding to the target route, the server creates a return route corresponding to the target route; the server combines the target route and the return route to obtain a route combination.

[0097] It should be noted that if there is no return route corresponding to the target route, the server will create a return route corresponding to the target route, and the server will set the demand quantity of the return route to 0. In this way, the difference in the demand number of route combinations in the server is the demand number of the target route.

[0098] For ease of understanding, this embodiment provides a specific implementation of route combination. Figure 5 , Figure 5 This is a schematic diagram of a specific scenario of an embodiment of a route combination in the logistics network route planning method provided in the embodiments of the present application;

[0099] In this embodiment, the server takes any route x in the transport route information and assumes that the starting position is xstarting point and the ending position is xending point:

[0100] (1) If there is a route y such that the starting point x = the end point y and the end point x = the starting point y, then routes x and y are classified into the same route combination. The route with the larger total number of required vehicles is marked as the forward route, and the other is the reverse route. The difference in round-trip required vehicles DIF is calculated as - = the total number of required vehicles on the forward route - the total number of required vehicles on the reverse route.

[0101] (2) If there is no route y for route x, such that the starting point of x = the end point of y and the end point of x = the starting point of y, then create a virtual route z, set the starting point of z = the end point of x, the end point of z = the starting point of x, and the total number of vehicles required for route z is 0. Routes x and z are classified into the same route combination, where route x is the forward route and route z is the reverse route, and the difference in the number of round-trip demanded vehicles DIF is calculated as follows: the total number of vehicles required for the forward route - the total number of vehicles required for the reverse route.

[0102] (3) The server numbers all round-trip route combinations in sequence.

[0103] In this embodiment, the server determines the round-trip route based on the transportation route information, and combines the round-trip routes to form a route combination as a transportation stage. Later, multiple route combinations can be reorganized to form transportation tasks. In this way, the number of combinations is reduced, and a single transportation task is assigned to a specific transportation vehicle for execution, which can alleviate the pressure on vehicle resource management.

[0104] Reference Figure 6 , Figure 6 This is a flow chart of an embodiment of vehicle dispatch route planning in the logistics network route planning method provided in the embodiments of this application.

[0105] In some embodiments of the present application, a technical solution for performing vehicle scheduling by combining routes in a logistics network route planning method includes:

[0106] 401 , sorting the route combinations from largest to smallest according to the difference in the number of trains required for the route combinations, and obtaining a main route combination with the largest difference in the number of trains required.

[0107] The server sorts the route combinations from largest to smallest according to the difference in the number of trains required, and obtains the main route combination with the largest difference in the number of trains required. In this embodiment, the server combines routes according to the difference in the number of trains required, thereby reducing the number of combinations and reducing the number of empty vehicles. Specifically:

[0108] 402. A route with a large number of required trips in the main route combination is selected as a forward route. A secondary route combination is searched based on the end point of the forward route in the main route combination. The distance between the starting point of the forward route in the secondary route combination and the end point of the forward route in the main route combination is less than a preset distance.

[0109] The server takes the route with a large number of required trains in the main route combination as the forward route, and searches for whether there is a sub-route combination based on the end position of the forward route in the main route combination. The distance between the starting position of the forward route in the sub-route combination and the end position of the forward route in the main route combination is less than a preset distance. The preset distance can be set according to the specific scenario. For example, the preset distance is set to 10km; or, the server searches for a sub-route combination within a preset range based on the end position of the forward route. The preset range can be set according to the specific scenario, for example, the preset range is set to within xxx province.

[0110] 403 , performing vehicle scheduling according to the main route combination and the sub-route combination to obtain a logistics network route planning solution.

[0111] The server combines the main route combination and the secondary route combination, and then dispatches vehicles based on the main route combination and the secondary route combination. The server obtains the number of secondary route combinations and the difference in the number of required vehicles corresponding to each secondary route combination. The server selects the secondary route combination with the smallest difference in the number of required vehicles with the main route combination and recombines it. The server then dispatches vehicles to obtain a logistics network route planning solution.

[0112] In the embodiment of the present application, the server will obtain the main route combination with the largest difference in the number of required trains; the server will use the route with the largest number of required trains in the main route combination as the forward route, and the server will search for the secondary route combination based on the terminal position of the forward route in the main route combination. In this way, the optimal vehicle scheduling plan is determined, the situation of vehicles running empty is reduced, and the vehicle transportation efficiency is improved.

[0113] Reference Figure 7 , Figure 7 This is a flow chart of an embodiment of a logistics network route planning method based on the difference in demanded trains provided in the embodiments of the present application;

[0114] The logistics network route planning method in this embodiment includes the following steps:

[0115] 501 , merging the main route combination and the sub-route combination, and calculating the new required train frequency difference.

[0116] The server merges the main route combination and the secondary route combination and calculates a new required train number difference; for example, the server subtracts the number of vehicle required trains on the forward route of the secondary route combination from the number of vehicle required trains on the forward route of the main route combination, and then calculates the new required train number difference.

[0117] 502 : Compare the new required train number difference with the required train number difference of the main route combination.

[0118] 503. If the new required train number difference is less than the required train number difference of the main route combination, then execute the vehicle scheduling based on the transportation route information, each of the route combinations, and the required train number difference of each of the route combinations to obtain a logistics network route planning solution.

[0119] The server compares the new demand train number difference with the demand train number difference of the main route combination. If the new demand train number difference is greater than or equal to the demand train number difference of the main route combination, the route combination will not be merged and vehicle scheduling will not be performed; if the new demand train number difference is less than the demand train number difference of the main route combination, the vehicle scheduling based on the transportation route information, each of the route combinations, and the demand train number difference of each of the route combinations will be executed to obtain a logistics network route planning solution.

[0120] In this embodiment, after searching for a secondary route combination near the primary route combination, the server updates the required vehicle frequency difference and determines whether to perform route combination, thereby avoiding the problem of unresolved empty loads after route combination, thereby improving vehicle utilization.

[0121] Reference Figure 8 , Figure 8 This is a flow chart of vehicle scheduling based on distance in the logistics network route planning method provided in an embodiment of the present application. The steps for determining the updated solution in the logistics network route planning method in this embodiment are as follows:

[0122] 601, calculating a dispatch distance between an end point of the forward route in the primary route combination and a starting point of the forward route in the secondary route combination, and comparing the dispatch distance with a one-way transport distance in the primary route combination;

[0123] The server calculates the dispatch distance between the end point of the forward route in the main route combination and the starting point of the forward route in the secondary route combination, and compares the dispatch distance with the one-way transport distance in the main route combination; if the dispatch distance is greater than or equal to the one-way transport distance, no route combination and vehicle dispatch are performed.

[0124] 602. If the dispatch distance is less than the one-way transport distance, vehicle dispatch is performed based on the transport route information, each route combination, and the difference in the number of required trains for each route combination to obtain a logistics network route planning solution.

[0125] If the dispatch distance is less than the one-way transport distance, the server performs vehicle dispatch based on the transport route information, each route combination, and the difference in the number of required trips for each route combination, to obtain a logistics network route planning solution. In this embodiment, after searching for sub-route combinations within a preset distance, the vehicle dispatch distance is further compared with the one-way transport route to avoid incorrect vehicle dispatch and ensure that vehicle dispatch is considered in each specific scenario.

[0126] Those skilled in the art will appreciate that the technical solution of the present application can perform logistics planning for complex logistics scenarios, and at the same time can adjust parameters according to specific scenarios, making the logistics network route planning method more versatile and generally applicable to most transportation route management scenarios.

[0127] In order to better implement the logistics network route planning method in the embodiment of the present application, based on the logistics network route planning method, a logistics network route planning device is also provided in the embodiment of the present application.

[0128] like Figure 9 As shown, Figure 9 This is a schematic diagram of the structure of an embodiment of a logistics network route planning device; the logistics network route planning device includes:

[0129] Acquisition module 701, used to obtain transportation route information;

[0130] A combining module 702 is configured to determine a round trip route based on the transport route information and combine the round trip routes to form a route combination;

[0131] The calculation module 703 is used to obtain the number of required trains for the round-trip routes in each of the route combinations, and calculate the difference in the number of required trains for each group of the route combinations;

[0132] The planning module 704 is used to perform vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of required trains for each of the route combinations to obtain a logistics network route planning solution.

[0133] In some embodiments of the present application, the combination module 702 in the logistics network route planning device includes:

[0134] Extracting a target route, and a starting point and an end point of the target route from the transport route information;

[0135] According to the starting point and the end point of the target route, query the transport route information to determine whether there is a return route corresponding to the target route;

[0136] If there is a return route corresponding to the target route, the target route and the return route are combined to obtain a route combination.

[0137] In some embodiments of the present application, the combination module 702 in the logistics network route planning device includes:

[0138] If there is no return route corresponding to the target route, create a return route corresponding to the target route;

[0139] The target route and the return route are combined to obtain a route combination.

[0140] In some embodiments of the present application, the planning module 703 in the logistics network route planning device includes:

[0141] Sort the route combinations according to the difference in the number of trains required for the route combinations from largest to smallest, and obtain the main route combination with the largest difference in the number of trains required;

[0142] The route with the largest number of required trips in the main route combination is selected as the forward route, and a secondary route combination is searched based on the end point of the forward route in the main route combination, wherein the distance between the starting point of the forward route in the secondary route combination and the end point of the forward route in the main route combination is less than a preset distance;

[0143] Vehicle scheduling is performed according to the main route combination and the sub-route combination to obtain a logistics network route planning solution.

[0144] In some embodiments of the present application, the planning module 703 in the logistics network route planning device includes:

[0145] Merging the main route combination and the sub-route combination to calculate the new required train frequency difference;

[0146] Comparing the new required train number difference with the required train number difference of the main route combination;

[0147] If the new required train number difference is less than the required train number difference of the main route combination, vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the required train number difference of each of the route combinations to obtain a logistics network route planning solution.

[0148] In some embodiments of the present application, the planning module 703 in the logistics network route planning device further includes:

[0149] Calculating a dispatch distance between an end point of the forward route in the primary route combination and a starting point of the forward route in the secondary route combination, and comparing the dispatch distance with a one-way transport distance in the primary route combination;

[0150] If the dispatch distance is less than the one-way transport distance, vehicle dispatch is performed according to the transport route information, each route combination, and the difference in the number of required trains for each route combination to obtain a logistics network route planning solution.

[0151] In some embodiments of the present application, the logistics network route planning device further includes:

[0152] Comparing the required train number difference of the route combination with a preset quantity threshold;

[0153] If the difference in the number of trains required for the route combination is greater than the preset quantity threshold, the step of performing vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations is executed to obtain a logistics network route planning solution.

[0154] In this embodiment, the logistics network route planning device combines round-trip routes according to the transportation route information, calculates the difference in the number of required trains for each group of round-trip routes, and recombines the route combinations according to the transportation route information, the route combinations, and the difference in the number of required trains for each of the route combinations, and performs vehicle scheduling between different route combinations. In this way, the number of round-trip trips of vehicles in the combination is reduced, and the logistics transportation task is assigned to a specific transportation vehicle to execute, which can alleviate the pressure on vehicle resource management; at the same time, based on the consideration of round-trip convection balance, the utilization efficiency of transportation vehicles is improved, and routes and vehicles can be adjusted according to different logistics transportation business scenarios and business measurement indicators. The logistics network route planning solution has strong versatility and is suitable for scenarios with multiple transportation route management.

[0155] The embodiment of the present invention also provides a logistics network route planning device, such as Figure 10 As shown, it shows a structural diagram of the logistics network route planning device involved in an embodiment of the present invention.

[0156] The logistics network route planning device integrates any of the logistics network route planning devices provided in the embodiments of the present invention, and the logistics network route planning device includes:

[0157] one or more processors;

[0158] Memory; and

[0159] One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to execute the steps of the logistics network route planning method described in any of the above-mentioned logistics network route planning method embodiments.

[0160] Specifically, the logistics network route planning device may include one or more processing core processors 801, one or more computer-readable storage media memories 802, a power supply 803, and an input unit 804. Those skilled in the art will understand that Figure 10 The structure of the logistics network route planning device shown in the figure does not constitute a limitation on the logistics network route planning device, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently. Among them:

[0161] Processor 801 is the control center of the logistics network route planning device. It uses various interfaces and lines to connect the various parts of the entire logistics network route planning device. By running or executing software programs and / or modules stored in memory 802 and calling data stored in memory 802, it performs various functions of the logistics network route planning device and processes data, thereby monitoring the logistics network route planning device as a whole. Optionally, processor 801 may include one or more processing cores; preferably, processor 801 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into processor 801.

[0162] The memory 802 can be used to store software programs and modules. The processor 801 executes various functional applications and data processing by running the software programs and modules stored in the memory 802. The memory 802 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area may store data created based on the use of the logistics network route planning device, etc. In addition, the memory 802 may include a high-speed random access memory and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage device. Accordingly, the memory 802 may also include a memory controller to provide the processor 801 with access to the memory 802.

[0163] The logistics network route planning device also includes a power supply 803 for supplying power to various components. Preferably, the power supply 803 can be logically connected to the processor 801 via a power management system, thereby enabling the power management system to manage charging, discharging, and power consumption. The power supply 803 can also include one or more DC or AC power supplies, a recharging system, a power failure detection circuit, a power converter or inverter, a power status indicator, and other arbitrary components.

[0164] The logistics network route planning device may also include an input unit 804, which can be used to receive input digital or character information, and generate keyboard, mouse, joystick, optical or trackball signal input related to user settings and function control.

[0165] Although not shown, the logistics network route planning device may also include a display unit, etc., which will not be described in detail here. Specifically, in this embodiment, the processor 801 in the logistics network route planning device will load the executable files corresponding to one or more application processes into the memory 802 according to the following instructions, and the processor 801 will run the application stored in the memory 802 to implement various functions as follows:

[0166] Obtain transportation route information;

[0167] Determine a round trip route based on the transport route information, and combine the round trip routes to form a route combination;

[0168] Obtain the number of required trips for the round-trip routes in each of the route combinations, and calculate the difference in the number of required trips for each group of the route combinations;

[0169] Vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the difference in the number of required trains for each of the route combinations to obtain a logistics network route planning solution.

[0170] Those skilled in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be accomplished by instructions, or by controlling related hardware through instructions. The instructions may be stored in a computer-readable storage medium and loaded and executed by a processor.

[0171] To this end, an embodiment of the present invention provides a computer-readable storage medium, which may include: a read-only memory (ROM), a random access memory (RAM), a disk, or an optical disk. A computer program is stored thereon, and the computer program is loaded by a processor to execute the steps of any of the logistics network route planning methods provided in the embodiments of the present invention. For example, the computer program loaded by the processor may execute the following steps:

[0172] Obtain transportation route information;

[0173] Determine a round trip route based on the transport route information, and combine the round trip routes to form a route combination;

[0174] Obtain the number of required trips for the round-trip routes in each of the route combinations, and calculate the difference in the number of required trips for each group of the route combinations;

[0175] According to the transportation route information, the route combinations, and the demand train difference of each route combination, vehicle scheduling is performed to obtain a logistics network line planning scheme.

[0176] In the above embodiments, the description of each embodiment has its own focus, and the parts not described in detail in a certain embodiment can be referred to the detailed description of other embodiments above, which will not be repeated here.

[0177] In the implementation, each unit or structure above can be implemented as an independent entity, or can be combined as the same or several entities, and the specific implementation of each unit or structure above can be referred to the method embodiments above, which will not be repeated here.

[0178] The specific implementation of each operation above can be referred to the embodiments above, which will not be repeated here.

[0179] The above describes in detail a logistics network line planning method provided by the embodiments of the present application, and the principle and implementation manner of the present application are described by applying specific examples; the above embodiment description is only used to help understand the method of the present application and its core idea; meanwhile, for those skilled in the art, according to the idea of the present application, the specific implementation manner and application range will be changed, and the above description should not be understood as the limitation of the present application.

Claims

1. A logistics network route planning method, characterized in that: The method comprises: Acquire transportation route information; wherein the transportation route information includes the starting location of each transportation route, the end location of each transportation route, and the required number of trips for each transportation route; Determining round-trip routes based on the transport route information, and combining the round-trip routes to form a route combination; wherein the round-trip routes represent two transport routes with a starting point and an end point in opposite directions; Obtain the number of required trips for the round-trip routes in each of the route combinations, and calculate the difference in the number of required trips for each group of the route combinations; Perform vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of required trains for each of the route combinations to obtain a logistics network route planning solution; The vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations to obtain a logistics network route planning solution, including: Sort the route combinations according to the difference in the number of trains required for the route combinations from largest to smallest, and obtain the main route combination with the largest difference in the number of trains required; The route with the largest number of required trips in the route combination is used as the forward route, and a secondary route combination is searched based on the end point of the forward route in the primary route combination, wherein the distance between the starting point of the forward route in the secondary route combination and the end point of the forward route in the primary route combination is less than a preset distance; Merging the main route combination and the sub-route combination to calculate a new required train frequency difference; Comparing the new required train number difference with the required train number difference of the main route combination; If the new required train number difference is less than the required train number difference of the main route combination, vehicle scheduling is performed according to the main route combination and the sub-route combination to obtain a logistics network route planning solution.

2. The logistics network route planning method according to claim 1, characterized in that: The determining of the round-trip routes according to the transport route information and combining the round-trip routes to form a route combination includes: Extracting a target route, and a starting point and an end point of the target route from the transport route information; According to the starting point and the end point of the target route, query the transport route information to determine whether there is a return route corresponding to the target route; If there is a return route corresponding to the target route, the target route and the return route are combined to obtain a route combination.

3. The logistics network route planning method according to claim 2, characterized in that: After querying the transport route information based on the starting point and the end point of the target route to determine whether there is a return route corresponding to the target route, the method includes: If there is no return route corresponding to the target route, create a return route corresponding to the target route; The target route and the return route are combined to obtain a route combination.

4. The logistics network route planning method according to claim 1, wherein: After selecting a route with a large number of required trips in the route combination as a forward route and searching for a secondary route combination based on the terminal position of the forward route in the primary route combination, the method includes: Calculating a dispatch distance between an end point of the forward route in the primary route combination and a starting point of the forward route in the secondary route combination, and comparing the dispatch distance with a one-way transport distance in the primary route combination; If the dispatch distance is less than the one-way transport distance, vehicle dispatch is performed according to the transport route information, each route combination, and the difference in the number of required trains for each route combination to obtain a logistics network route planning solution.

5. The logistics network route planning method according to any one of claims 1 to 4, characterized in that: After obtaining the number of required trains for the round-trip routes in each of the route combinations and calculating the difference in the number of required trains for each group of the route combinations, the method includes: Comparing the required train number difference of the route combination with a preset quantity threshold; If the difference in the number of trains required for the route combination is greater than the preset quantity threshold, the step of performing vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations is executed to obtain a logistics network route planning solution.

6. A logistics network route planning device, characterized in that: The logistics network route planning device includes: An acquisition module is used to acquire transport route information; wherein the transport route information includes the starting position of each transport route, the end position of each transport route and the required number of trips for each transport route; a combination module, configured to determine a round trip route based on the transport route information, and combine the round trip routes to form a route combination; wherein the round trip route represents two transport routes with a starting point and an end point in opposite directions; A calculation module is used to obtain the number of required trains for the round-trip routes in each of the route combinations, and calculate the difference in the number of required trains for each group of the route combinations; A planning module is used to perform vehicle scheduling based on the transportation route information, each of the route combinations, and the difference in the number of required trains for each of the route combinations to obtain a logistics network route planning solution; The vehicle scheduling is performed based on the transportation route information, each of the route combinations, and the difference in the number of trains required for each of the route combinations to obtain a logistics network route planning solution, including: Sort the route combinations according to the difference in the number of trains required for the route combinations from largest to smallest, and obtain the main route combination with the largest difference in the number of trains required; The route with the largest number of required trips in the route combination is used as the forward route, and a secondary route combination is searched based on the end point of the forward route in the primary route combination, wherein the distance between the starting point of the forward route in the secondary route combination and the end point of the forward route in the primary route combination is less than a preset distance; Merging the main route combination and the sub-route combination to calculate a new required train frequency difference; Comparing the new required train number difference with the required train number difference of the main route combination; If the new required train number difference is less than the required train number difference of the main route combination, vehicle scheduling is performed according to the main route combination and the sub-route combination to obtain a logistics network route planning solution.

7. A logistics network route planning device, characterized in that: The logistics network route planning device includes: one or more processors; Memory; and One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the steps in the logistics network route planning method according to any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that A computer program is stored thereon, and the computer program is loaded by a processor to execute the steps in the logistics network route planning method according to any one of claims 1 to 5.

Images