Method, device, equipment and storage medium for dynamically adjusting driving route
By obtaining and analyzing historical order data, generating vehicle scheduling strategies, and dynamically adjusting driving routes when new orders arrive, the problem of automation of driving route adjustment in the existing technology is solved, which improves transportation efficiency and safety and reduces transportation costs.
Patent Information
- Application Number
- CN202110655114.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-06-11
- Publication Date
- 2025-02-18
- Estimated Expiration
- 2041-06-11
AI Technical Summary
The existing technology is difficult to automatically realize dynamic adjustment of driving routes, resulting in low transportation efficiency and high transportation costs.
By obtaining the address information and transportation data of historical orders, establishing mapping relationships, and performing data analysis to generate vehicle scheduling strategies. When a new order is detected, the address information is extracted, the vehicle is determined according to the strategy and the driving route is planned, and the road network information during transportation is collected for dynamic adjustment.
It realizes automatic dynamic adjustment of driving routes, improves transportation efficiency, ensures transportation safety, thereby reducing transportation costs and saving transportation time.
Smart Images

Figure CN113469614B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of logistics distribution, and in particular to a method, device, equipment and storage medium for dynamically adjusting a driving route. Background Art
[0002] During the logistics and delivery process, customers enter order information into the order management system, and the logistics carrier obtains the order information and arranges the delivery of the order. Faced with a large number of order resources and available vehicles and driver information, the carrier dispatches the transport vehicles and drivers according to the order dispatching strategy and plans the vehicle's driving route. The vehicle transports the order according to the planned driving route.
[0003] In the actual transportation process, due to the emergence of weather, complex real-time road conditions and other issues, it is often necessary to adjust the driving route accordingly. At present, the adjustment of the driving route is generally made by the driver based on his own driving experience, which is prone to human judgment errors and difficult to ensure the safety of transportation, resulting in low transportation efficiency and high transportation costs. How to automatically realize the dynamic adjustment of the driving route, improve transportation efficiency, and effectively reduce transportation costs and save transportation time is an urgent problem to be solved. Summary of the invention
[0004] The main purpose of the present invention is to solve the technical problem in the prior art that it is difficult to automatically realize the dynamic adjustment of the driving route, resulting in low transportation efficiency.
[0005] A first aspect of the present invention provides a method for dynamically adjusting a driving route, the method comprising: obtaining address information of historical orders and transportation data when transporting the historical orders, and establishing a mapping relationship between the address information and the transportation data; performing data analysis on the address information and the transportation data according to the mapping relationship, and generating a vehicle scheduling strategy; when a new order is detected, extracting the address information of the new order, and determining a vehicle that can transport the new order and planning a driving route according to the vehicle scheduling strategy and the address information of the new order; collecting road network information in the process of transporting the new order, and dynamically adjusting the driving route according to the road network information.
[0006] Optionally, in a first implementation method of the first aspect of the present invention, the address information and the transportation data are analyzed according to the mapping relationship to generate a vehicle scheduling strategy, including: extracting the sending place information and the receiving place information in the address information according to the mapping relationship to determine the starting point and the end point of the transportation; extracting the transportation route in the transportation data, and determining the transfer points during the transportation process and the directed paths between the starting point, the end point and each of the transportation points according to the transportation route, and generating a directed graph according to the directed path; extracting the parameter values in the directed graph, and generating an adjacency matrix according to the parameter values; calling a preset neural network to construct a correspondence between each element in the adjacency matrix and each neuron in the neural network; performing network evolution on the adjacency matrix according to the corresponding relationship to generate a transposition matrix, and generating a vehicle scheduling strategy according to the transposition matrix and the transportation vehicles in the transportation data.
[0007] Optionally, in a second implementation method of the first aspect of the present invention, the extracting the address information of the new order, and determining the vehicle that can transport the new order and planning the driving route based on the vehicle scheduling strategy and the address information of the new order includes: extracting the address information of the new order, and determining the vehicle that can transport the new order and the transfer points in the transportation process based on the address information of the new order and the vehicle scheduling strategy; freely combining the routes of each transfer point to generate at least one route; calculating the path length of each route and comparing the values of each path length; and according to the comparison result, selecting the route with the smallest path length from at least one route as the driving route.
[0008] Optionally, in a third implementation method of the first aspect of the present invention, extracting the address information of the new order, and determining the vehicle that can transport the new order and planning the driving route based on the vehicle scheduling strategy and the address information of the new order also includes: generating a first table based on each of the transfer points, wherein each of the transfer points is a table element in the first table; filling in the first table based on a preset northwest corner method to obtain a first initial solution; calculating a first check digit for the spaces in the first table according to a preset potential method; adjusting the first initial solution according to the first check digit to obtain a first optimal solution, and generating a driving route according to the first optimal solution.
[0009] Optionally, in a fourth implementation method of the first aspect of the present invention, extracting the address information of the new order, and determining the vehicle that can transport the new order and planning the driving route based on the vehicle scheduling strategy and the address information of the new order also includes: generating a second table based on each of the transfer points, wherein each of the transfer points is a table element in the second table; calculating and comparing the data values of each table element in each row and column of the second table to obtain the minimum element and the second smallest element in each row and column; calculating the difference between the minimum element and the second smallest element in each row and column, and generating a second initial solution based on the difference; calculating a second check digit for the spaces in the second table according to a preset potential method; adjusting the second initial solution based on the second check digit to obtain a second optimal solution, and generating a driving route based on the second optimal solution.
[0010] Optionally, in a fifth implementation method of the first aspect of the present invention, the collecting of road network information during the transportation of the new order and dynamically adjusting the driving route based on the road network information includes: obtaining the road network information of the starting point and each of the transit points during the transportation of the new order; calculating the shortest path between the starting point and each of the transit points based on a preset link state routing algorithm and the road network information; iterating the shortest path multiple times to obtain an optimal path, and dynamically adjusting the driving route based on the optimal path to obtain a real-time driving route.
[0011] Optionally, in a sixth implementation method of the first aspect of the present invention, the collecting of road network information during the transportation of the new order and dynamically adjusting the driving route based on the road network information also includes: obtaining the road network information of the starting point, the end point and each transfer point during the transportation of the new order; based on a preset Bellman-Ford algorithm and the road network information, calculating at least one first distance between the starting point and each transfer point and at least one second distance between each transfer point and the end point; performing arithmetical addition processing on at least one of the first distances and at least one of the second distances respectively to obtain at least one distance value; performing numerical comparison on at least one of the distance values, and obtaining the shortest path based on the result of the numerical comparison; dynamically adjusting the driving route according to the shortest path to obtain a real-time driving route.
[0012] The second aspect of the present invention proposes a dynamic adjustment device for a driving route, which includes: an acquisition module, used to acquire address information of historical orders and transportation data when transporting the historical orders, and establish a mapping relationship between the address information and the transportation data; an analysis module, used to perform data analysis on the address information and the transportation data according to the mapping relationship, and generate a vehicle scheduling strategy; a planning module, used to extract the address information of the new order when a new order is detected, and determine the vehicle that can transport the new order and plan the driving route according to the vehicle scheduling strategy and the address information of the new order; an adjustment module, used to collect road network information in the process of transporting the new order, and dynamically adjust the driving route according to the road network information.
[0013] Optionally, in a first implementation method of the second aspect of the present invention, the analysis module is specifically used to: extract the sending place information and the receiving place information in the address information according to the mapping relationship, and determine the starting point and end point of the transportation; extract the transportation route in the transportation data, and determine the transfer points and the starting point, the end point and the directed paths between the transfer points according to the transportation route, and generate a directed graph according to the directed path; extract the parameter values in the directed graph, and generate an adjacency matrix according to the parameter values; call a preset neural network to construct a corresponding relationship between each element in the adjacency matrix and each neuron in the neural network; according to the corresponding relationship, perform network evolution on the adjacency matrix to generate a transposition matrix, and generate a vehicle scheduling strategy according to the transposition matrix and the transportation vehicles in the transportation data.
[0014] Optionally, in a second implementation method of the second aspect of the present invention, the planning module is specifically used to: extract the address information of the new order, and determine the vehicle that can transport the new order and the transfer points during the transportation process based on the address information of the new order and the vehicle scheduling strategy; freely combine the routes of each transfer point to generate at least one route; calculate the path length of each route and compare the values of each path length; based on the comparison result, select the route with the smallest path length value from at least one of the routes as the driving route.
[0015] Optionally, in a third implementation method of the second aspect of the present invention, the planning module is further specifically used to: generate a first table based on each of the transfer points, wherein each of the transfer points is a table element in the first table; based on a preset northwest corner method, fill in the first table to obtain a first initial solution; according to a preset potential method, calculate a first check digit for the spaces in the first table; according to the first check digit, adjust the first initial solution to obtain a first optimal solution, and generate a driving route based on the first optimal solution.
[0016] Optionally, in a fourth implementation of the second aspect of the present invention, the planning module is further specifically used to: generate a second table according to each of the transfer points, wherein each of the transfer points is a table element in the second table; calculate and compare the data values of each table element in each row and column of the second table to obtain the minimum element and the second smallest element in each row and column; calculate the difference between the minimum element and the second smallest element in each row and column, and generate a second initial solution according to the difference; calculate a second check number for the spaces in the second table according to a preset potential method; adjust the second initial solution according to the second check number to obtain a second optimal solution, and generate a driving route according to the second optimal solution. .
[0017] Optionally, in a fifth implementation method of the second aspect of the present invention, the adjustment module is specifically used to: obtain the road network information of the starting point and each of the transit points during the transportation of the new order; calculate the shortest path between the starting point and each of the transit points based on a preset link state routing algorithm and the road network information; iterate the shortest path multiple times to obtain an optimal path, and dynamically adjust the driving route based on the optimal path to obtain a real-time driving route.
[0018] Optionally, in a sixth implementation method of the second aspect of the present invention, the adjustment module is further specifically used to: obtain the road network information of the starting point, the end point and each transfer point during the transportation process of the new order; based on a preset Bellman-Ford algorithm and the road network information, calculate at least one first distance between the starting point and each transfer point and at least one second distance between each transfer point and the end point; perform arithmetical addition processing on at least one first distance and at least one second distance respectively to obtain at least one distance value; perform numerical comparison on at least one distance value, and obtain the shortest path based on the result of the numerical comparison; dynamically adjust the driving route according to the shortest path to obtain a real-time driving route.
[0019] A third aspect of the present invention provides a dynamic adjustment device for a driving route, the dynamic adjustment device for the driving route comprising: a memory and at least one processor, the memory storing instructions, the memory and the at least one processor being interconnected via lines; the at least one processor calling the instructions in the memory so that the dynamic adjustment device for the driving route executes the steps of the above-mentioned dynamic adjustment method for the driving route.
[0020] A fourth aspect of the present invention provides a computer-readable storage medium, on which instructions are stored, which, when executed on a computer, enable the computer to execute the steps of the above-mentioned method for dynamically adjusting the driving route.
[0021] In the technical solution provided by the present invention, the address information of historical orders and the transportation data when transporting historical orders are obtained, and a mapping relationship is established between the address information and the transportation data; according to the mapping relationship, data analysis is performed on the address information and the transportation data to generate a vehicle scheduling strategy; when a new order is detected, the address information of the new order is extracted, and according to the vehicle scheduling strategy and the address information of the new order, the vehicle that can transport the new order is determined and the driving route is planned; the road network information in the process of transporting the new order is collected, and the driving route is dynamically adjusted according to the road network information. The technical solution provided by the present invention realizes the automatic dynamic adjustment of the driving route, improves the transportation efficiency, and adjusts the driving route according to the road network information during the transportation process, ensuring the safety of transportation, thereby reducing the transportation cost and saving transportation time. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] Figure 1 It is a schematic diagram of a first embodiment of a method for dynamically adjusting a driving route in an embodiment of the present invention;
[0023] Figure 2 Schematic diagram of a second embodiment of a method for dynamically adjusting a driving route in an embodiment of the present invention;
[0024] Figure 3 Schematic diagram of a third embodiment of a method for dynamically adjusting a driving route in an embodiment of the present invention;
[0025] Figure 4 Schematic diagram of a fourth embodiment of a method for dynamically adjusting a driving route in an embodiment of the present invention;
[0026] Figure 5 A schematic diagram of an embodiment of a dynamic adjustment device for a driving route in an embodiment of the present invention;
[0027] Figure 6 It is a schematic diagram of an embodiment of a dynamic adjustment device for a driving route in an embodiment of the present invention. DETAILED DESCRIPTION
[0028] The embodiment of the present invention provides a method, device, equipment and storage medium for dynamically adjusting a driving route, by acquiring the address information of historical orders and the transportation data when transporting the historical orders, and establishing a mapping relationship between the address information and the transportation data; performing data analysis on the address information and the transportation data according to the mapping relationship, and generating a vehicle scheduling strategy; when a new order is detected, extracting the address information of the new order, and determining the vehicle that can transport the new order and planning the driving route according to the vehicle scheduling strategy and the address information of the new order; collecting the road network information in the process of transporting the new order, and dynamically adjusting the driving route according to the road network information. The embodiment of the present invention realizes automatic dynamic adjustment of the driving route, improves transportation efficiency, and adjusts the driving route according to the road network information during transportation, ensuring the safety of transportation, thereby reducing the cost of transportation and saving transportation time.
[0029] The terms "first", "second", "third", "fourth", etc. (if any) in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "including" or "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0030] For ease of understanding, the specific contents of the embodiments of the present invention are described below. Figure 1 , a first embodiment of the method for dynamically adjusting a driving route in an embodiment of the present invention includes:
[0031] 101, obtaining address information of historical orders and transportation data when transporting historical orders, and establishing a mapping relationship between the address information and the transportation data;
[0032] The customer enters the order and related order information on the order management system. The logistics carrier executes order scheduling through the server based on the order information and the transportation vehicle and driver information. That is, the server schedules the transportation vehicle and driver based on the order information, and plans the vehicle's driving route when transporting the order. When transporting the order, the server automatically collects the road network information of each transit point where the transportation vehicle arrives to form the transportation data of the order. Orders that have completed transportation are historical orders, that is, orders that have been signed by the customer at the place of receipt are historical orders. Among them, the order information includes but is not limited to address information (place of issuance and place of receipt), recipient and sender information; each transit point is an operating outlet for transit, and each operating outlet is responsible for distribution and delivery. The transportation data includes but is not limited to the address of each transit point, the driving route and the information of the transportation vehicle.
[0033] The server collects all historical orders, retrieves the address information corresponding to the historical order and the transportation data generated when the historical order is transported from the order management system, and establishes a mapping relationship between the transportation data and the address information.
[0034] 102, performing data analysis on the address information and the transportation data according to the mapping relationship, and generating a vehicle dispatching strategy;
[0035] According to the mapping relationship between the address information of historical orders and the transportation data, the place of shipment information and the place of receipt information in the address information are extracted to determine the starting point and end point of the transportation; the transportation route in the transportation data is extracted, and based on the transportation route, the various transfer points during the transportation process and the directed paths between the starting point, the end point and each transfer point are determined, and a directed graph is generated based on the directed path; the parameter values in the directed graph are extracted, and an adjacency matrix is generated based on the parameter values; the preset neural network is called to construct the corresponding relationship between each element in the adjacency matrix and each neuron in the neural network; based on the corresponding relationship, the adjacency matrix is subjected to network evolution to generate a transposition matrix, and a vehicle scheduling strategy is generated based on the transposition matrix and the transportation vehicles in the transportation data.
[0036] Specifically, the starting point, the end point and each confluence point passed by the vehicle are abstracted into the nodes of the network, and the directed paths between them are abstracted into the edges of the network, thereby forming a directed graph G = (N, L, D), where N represents the number of nodes, L represents the number of edges, and D is an N*N matrix. According to the optimization target, the length, cost or time corresponding to the edge (i, j) can be defined, so that the distance adjacency matrix, cost adjacency matrix and time adjacency matrix can be defined. If there is a path between two nodes, the value of the corresponding matrix element is the length of the path or the freight or the transportation time; if there is no path between the two nodes, the value of the corresponding matrix element is ∞. For the constraints in vehicle scheduling, they are treated as an energy term of the neural network, and a penalty term is applied to them and added to the energy equation of the network. In this way, as the network converges, the energy of the constraints gradually tends to a steady state, so that the constraints are reflected. Each element in the adjacency matrix corresponds to a neuron, and the output of the neuron at position (x, i) is defined as Vxi. First, determine the energy function of the network, which includes the output energy function of the network and the energy function of each constraint transformation. Then, determine the transfer function and state transition equation of the neuron, and evolve the network repeatedly until convergence. When the network finally converges after evolution, a transposition matrix composed of 0 and 1 can be formed. The position of 1 in the matrix represents the node passed through. The sum of the distance, cost and transportation time between these nodes is the shortest distance, minimum freight and minimum transportation time. The vehicle scheduling strategy is generated based on the shortest distance, minimum freight and minimum transportation time path formed by the transposition matrix.
[0037] 103, when a new order is detected, the address information of the new order is extracted, and according to the vehicle dispatching strategy and the address information of the new order, a vehicle that can transport the new order is determined and a driving route is planned;
[0038] When the server detects that a new order needs to be transported, the server obtains the address information of the new order and dispatches the vehicle for the new order according to the vehicle dispatching strategy and the address information of the new order. Specifically, according to the address information of the new order, all vehicles and drivers that can transport the new order are determined, and the weights are calculated according to the vehicle dispatching strategy and the preset weights of each vehicle and driver. Vehicles and drivers with larger weights are dispatched first. Then, the driving route is planned according to the address information of the new order.
[0039] Specifically, according to the greedy algorithm for solving the traveling salesman problem model, the server obtains the address information of the new order, and determines the vehicle that can transport the new order and the transfer points in the transportation process according to the address information of the new order and the vehicle scheduling strategy; freely combines the routes for each transfer point to generate at least one route; calculates the path length of each route and compares the values of each path length; according to the comparison result, selects the best route from at least one route as the driving route, that is, the best route is the route with the smallest path length.
[0040] In the process of planning the driving route, the server can also obtain the address information of the new order according to the table operation method, and determine the vehicle that can transport the new order and the transfer points in the transportation process according to the address information of the new order and the vehicle scheduling strategy; generate a first table according to each transfer point, wherein each transfer point is a table element in the first table; based on the preset northwest corner method, fill in the first table to obtain a first initial solution; according to the preset potential method, calculate the first check digit of the blanks in the first table; according to the first check digit, adjust the first initial solution to obtain a first optimal solution, and generate a driving route according to the first optimal solution.
[0041] In the process of planning the driving route, the server can also obtain the address information of the new order according to the Vogel method, and determine the vehicle that can transport the new order and the transfer points in the transportation process according to the address information of the new order and the vehicle scheduling strategy; generate a second table according to the transfer points, wherein each transfer point is a table element in the second table; calculate and compare the data value of each table element in each row and column of the second table to obtain the minimum element and the second smallest element in each row and column; calculate the difference between the minimum element and the second smallest element in each row and column, and generate a second initial solution based on the difference; calculate the second check digit of the space in the second table according to the preset potential method; adjust the second initial solution according to the second check digit to obtain the second optimal solution, and generate the driving route according to the second optimal solution.
[0042] 104, collecting the road network information in the process of transporting the new order, and dynamically adjusting the driving route according to the road network information.
[0043] In the process of calling a new vehicle transport order, the server collects the road network information of each transfer point through which the new vehicle transport order passes, and organizes the road network information through real-time query, time-sharing query, partition query or a combination of the three query methods, and pushes it to customers or relevant operators in the form of text messages, mobile application push, WeChat push, etc., and the server dynamically adjusts the driving route. In this process, when the vehicle travels according to the planned driving route, the road section where the vehicle is located is determined according to the road network information, that is, whether the vehicle has reached the destination. If the vehicle has not reached the destination, the shortest path is calculated according to the road network information, and the driving route is dynamically adjusted to generate a real-time driving route. In this embodiment, the real-time driving route is determined according to the routing selection algorithm.
[0044] Specifically, the server obtains the road network information of each transfer point during the transportation process of the new order; based on the preset link state routing algorithm and the road network information, the shortest path between the starting point in the transfer point and each transfer point is calculated; the shortest path is iterated multiple times to obtain the optimal path, and the driving route is dynamically adjusted based on the optimal path to obtain the real-time driving route. In addition, it can also be that the server obtains the road network information of the starting point, the starting point and each transfer point during the transportation process of the new order; based on the preset Bellman-Ford algorithm and the road network information, at least one first distance between the starting point and each transfer point and at least one second distance between each transfer point and the end point are calculated; at least one first distance and at least one second distance are respectively arithmetically added to obtain at least one distance value; at least one distance value is numerically compared, and the shortest path is obtained according to the result of the numerical comparison; the driving route is dynamically adjusted according to the shortest path to obtain the real-time driving route.
[0045] In the embodiment of the present invention, the address information and transportation data of historical orders are obtained and analyzed to generate a vehicle dispatching strategy; when a new order is detected, the address information of the new order is extracted, and the vehicle that can transport the new order is determined and the driving route is planned based on the vehicle dispatching strategy and the address information of the new order; the road network information in the process of transporting the new order is collected, and the driving route is dynamically adjusted based on the road network information. The embodiment of the present invention realizes the automatic dynamic adjustment of the driving route, improves the transportation efficiency, ensures the safety of transportation, thereby reducing the transportation cost and saving transportation time.
[0046] See also Figure 2 , a second embodiment of the method for dynamically adjusting a driving route in an embodiment of the present invention includes:
[0047] 201, obtaining address information of historical orders and transportation data when transporting historical orders, and establishing a mapping relationship between the address information and the transportation data;
[0048] The customer enters the order and related order information on the order management system. The logistics carrier executes order scheduling through the server based on the order information and the transportation vehicle and driver information. That is, the server schedules the transportation vehicle and driver based on the order information, and plans the vehicle's driving route when transporting the order. When transporting the order, the server automatically collects the road network information of each transit point where the transportation vehicle arrives to form the transportation data of the order. Orders that have completed transportation are historical orders, that is, orders that have been signed by the customer at the place of receipt are historical orders. Among them, the order information includes but is not limited to address information (place of issuance and place of receipt), recipient and sender information; each transit point is an operating outlet for transit, and each operating outlet is responsible for distribution and delivery. The transportation data includes but is not limited to the address of each transit point, the driving route and the information of the transportation vehicle.
[0049] The server collects all historical orders, retrieves the address information corresponding to the historical order and the transportation data generated when the historical order is transported from the order management system, and establishes a mapping relationship between the transportation data and the address information.
[0050] 202, performing data analysis on the address information and the transportation data according to the mapping relationship, and generating a vehicle dispatching strategy;
[0051] According to the mapping relationship between the address information of historical orders and the transportation data, the place of shipment information and the place of receipt information in the address information are extracted to determine the starting point and end point of the transportation; the transportation route in the transportation data is extracted, and based on the transportation route, the various transfer points during the transportation process and the directed paths between the starting point, the end point and each transfer point are determined, and a directed graph is generated based on the directed path; the parameter values in the directed graph are extracted, and an adjacency matrix is generated based on the parameter values; the preset neural network is called to construct the corresponding relationship between each element in the adjacency matrix and each neuron in the neural network; based on the corresponding relationship, the adjacency matrix is subjected to network evolution to generate a transposition matrix, and a vehicle scheduling strategy is generated based on the transposition matrix and the transportation vehicles in the transportation data.
[0052] Specifically, the starting point, the end point and each confluence point passed by the vehicle are abstracted into the nodes of the network, and the directed paths between them are abstracted into the edges of the network, thereby forming a directed graph G = (N, L, D), where N represents the number of nodes, L represents the number of edges, and D is an N*N matrix. According to the optimization target, the length, cost or time corresponding to the edge (i, j) can be defined, so that the distance adjacency matrix, cost adjacency matrix and time adjacency matrix can be defined. If there is a path between two nodes, the value of the corresponding matrix element is the length of the path or the freight or the transportation time; if there is no path between the two nodes, the value of the corresponding matrix element is ∞. For the constraints in vehicle scheduling, they are treated as an energy term of the neural network, and a penalty term is applied to them and added to the energy equation of the network. In this way, as the network converges, the energy of the constraints gradually tends to a steady state, so that the constraints are reflected. Each element in the adjacency matrix corresponds to a neuron, and the output of the neuron at position (x, i) is defined as Vxi. First, determine the energy function of the network, which includes the output energy function of the network and the energy function of each constraint transformation. Then, determine the transfer function and state transition equation of the neuron, and evolve the network repeatedly until convergence. When the network finally converges after evolution, a transposition matrix composed of 0 and 1 can be formed. The position of 1 in the matrix represents the node passed through. The sum of the distance, cost and transportation time between these nodes is the shortest distance, minimum freight and minimum transportation time. The vehicle scheduling strategy is generated based on the shortest distance, minimum freight and minimum transportation time path formed by the transposition matrix.
[0053] 203, when a new order is detected, the address information of the new order is extracted, and according to the address information of the new order and the vehicle dispatching strategy, the vehicle that can transport the new order and the transfer points in the transportation process are determined;
[0054] 204, freely combining routes for each transfer point to generate at least one route;
[0055] 205, calculating the path length of each route and comparing the values of each path length;
[0056] 206 , according to the comparison result, selecting a route with the smallest path length from at least one route as the driving route;
[0057] When the server detects that a new order needs to be transported, the server obtains the address information of the new order according to the preset greedy algorithm, and dispatches the vehicle for the new order according to the vehicle dispatching strategy and the address information of the new order. Specifically, according to the address information of the new order, all vehicles and drivers that can transport the new order are determined, and the weights are calculated according to the vehicle dispatching strategy and the preset weights of each vehicle and driver. Vehicles and drivers with larger weights are dispatched first.
[0058] According to the address information of the new order (the place of issuance and the place of receipt), all the transit points where the new order may be transferred during the transportation process are determined, and the routes of each transit point are freely combined to generate at least one route, that is, the transit points are randomly selected from all the transit points and sorted to perform free combination of routes to generate at least one route; the path length value of at least one route is calculated, and the path length values of each route are numerically compared to obtain the route with the smallest path length value. This route is the optimal route and is used as the driving route.
[0059] 207, obtaining the road network information of each transfer point in the transportation process of the new order;
[0060] 208, calculating the shortest path between the starting point in the transit meeting point and each transit meeting point based on a preset link state routing algorithm and road network information;
[0061] 209 , performing multiple iterations on the shortest path to obtain an optimal path, and dynamically adjusting the driving route based on the optimal path to obtain a real-time driving route.
[0062] Obtain the road network information of each transfer point during the transportation of the new order, and determine the road section where the vehicle is located based on the road network information, that is, determine whether the vehicle has reached the destination. If the vehicle has not reached the destination, calculate the shortest path from the starting point of the transfer point to other transfer points based on the road network information. After k iterations, the shortest path to k destination transfer points is obtained. The shortest path after iteration is used as the optimal path, and the current driving route of the vehicle is dynamically adjusted according to the optimal path to obtain the real-time driving route.
[0063] In an embodiment of the present invention, the road network information of each transfer point in the transportation process of a new order is obtained, and the shortest path is calculated based on the road network information. The shortest path is iterated multiple times to obtain the optimal path, and the driving route is dynamically adjusted based on the optimal path. This implementation realizes the dynamic adjustment of the driving route, and the adjusted real-time driving route is the shortest driving route, which improves transportation efficiency and saves transportation time and cost.
[0064] See also Figure 3 A third embodiment of the method for dynamically adjusting a driving route in an embodiment of the present invention includes:
[0065] 301, obtaining address information of historical orders and transportation data when transporting historical orders, and establishing a mapping relationship between the address information and the transportation data;
[0066] 302, performing data analysis on the address information and the transportation data according to the mapping relationship, and generating a vehicle dispatching strategy;
[0067] 303, when a new order is detected, the address information of the new order is extracted, and according to the address information of the new order and the vehicle dispatching strategy, the vehicle that can transport the new order and the transfer points in the transportation process are determined;
[0068] 304, generating a first table according to each transfer point;
[0069] 305, based on the preset northwest corner method, fill in the first table to obtain a first initial solution;
[0070] 306, calculating a first check digit for a space in the first table according to a preset potential method;
[0071] 307, adjusting the first initial solution according to the first check number to obtain a first optimal solution, and generating a driving route according to the first optimal solution;
[0072] When the server detects that a new order needs to be transported, the server obtains the address information of the new order according to the preset table operation method, and dispatches the vehicle for the new order according to the vehicle dispatch strategy and the address information of the new order. Specifically, according to the address information of the new order, all vehicles and drivers that can transport the new order are determined, and the weights are calculated according to the vehicle dispatch strategy and the preset weights of each vehicle and driver. Vehicles and drivers with larger weights are dispatched first.
[0073] According to the address information of the new order (place of issuance and place of receipt), determine all the transit points where the new order may be transferred during transportation, and list these transit points in the first table, that is, generate the first table based on all the transit points, and the transit points are used as table elements. According to the northwest corner method of the table operation method, start from the northwest corner (upper left corner) of the first table, mark the maximum number allowed in the lower right corner of the cell, and then mark the number of the next cell by row (column). If the path length of a row (column) meets the shortest path requirement, cross out the other cells of the row (column), and continue in this way until a first initial solution is obtained. Calculate the test number of each non-basic variable to determine whether the optimal solution is reached. If the optimal solution is reached, stop the calculation, otherwise go to the next step and use the potential method to calculate; there are a total of m+n constraints for the transportation problem, where m is the distance limit; n is the time limit. Its dual problem should also have m+n variables, based on this: δ ij =c ij -(u i +v j ), where the first m are counted as u i (i=1,2...m), the first n are counted as v j (i=1,2...n);
[0074] From the simplex method, we know that the delta of the basis variable ij =0;c ij -(u i +v j )=0, so u i , v j It can be obtained. Improve the current basic feasible solution (determine the variables to be swapped in and out) and adjust it using the closed loop method; δ ij ≥0 (because the objective function requires minimization), the places with transportation volume in the table are basic variables, and the blanks are non-basic variables. Test number of basic variables δ ij =0, the test number of non-basic variables δ ij ≥0.δ ij <0 means the freight is reduced, δ ij >0 indicates that the freight has increased. Repeat the above steps until the optimal solution is obtained, and use the optimal solution as the shortest path. Adjust the driving route according to the shortest path to generate a real-time driving route.
[0075] 308, obtaining the road network information of the starting point and each transfer point in the transportation process of the new order;
[0076] 309, calculating the shortest path between the starting point and each transfer point based on a preset link state routing algorithm and road network information;
[0077] 310, performing multiple iterations on the shortest path to obtain an optimal path, and dynamically adjusting the driving route based on the optimal path to obtain a real-time driving route.
[0078] Obtain the road network information of the starting point and each transfer point during the transportation of the new order, and determine the road section where the vehicle is located based on the road network information, that is, determine whether the vehicle has reached the destination. If the vehicle has not reached the destination, calculate the shortest path from the starting point to other transfer points based on the road network information. After k iterations, the shortest path to k destination transfer points is obtained. The shortest path after iteration is used as the optimal path, and the current driving route of the vehicle is dynamically adjusted according to the optimal path to obtain the real-time driving route.
[0079] In the embodiment of the present invention, steps 301-302 are consistent with steps 101-102 of the first embodiment of the above-mentioned method for dynamically adjusting the driving route, and are not described in detail here.
[0080] In an embodiment of the present invention, when planning a driving route, a table is formed from the transfer points in the transportation process according to a preset table operation method, and an initial solution and a check number are calculated to generate a driving route with the shortest path length, thereby saving transportation costs. In addition, during the transportation process, the driving route is dynamically adjusted according to the road network information, thereby improving the actual transportation efficiency.
[0081] See also Figure 4 The fourth embodiment of the method for dynamically adjusting the driving route in the embodiment of the present invention includes:
[0082] 401, obtain the address information of the historical order and the transportation data when transporting the historical order, and establish a mapping relationship between the address information and the transportation data;
[0083] 402, performing data analysis on the address information and the transportation data according to the mapping relationship, and generating a vehicle dispatching strategy;
[0084] 403, when a new order is detected, the address information of the new order is extracted, and according to the address information of the new order and the vehicle dispatching strategy, the vehicle that can transport the new order and the transfer points in the transportation process are determined;
[0085] 404, generating a second table according to each transfer point;
[0086] 405, calculating and comparing the data values of the table elements in each row and column of the second table, and obtaining the smallest element and the second smallest element in each row and column;
[0087] 406, calculating the difference between the smallest element and the second smallest element in each row and column, and generating a second initial solution according to the difference;
[0088] 407, calculating a second check digit for a space in the second table according to a preset potential method;
[0089] 408, adjusting the second initial solution according to the second check number to obtain a second optimal solution, and generating a driving route according to the second optimal solution;
[0090] When the server detects that a new order needs to be transported, the server obtains the address information of the new order according to the preset table operation method, and dispatches the vehicle for the new order according to the vehicle dispatch strategy and the address information of the new order. Specifically, according to the address information of the new order, all vehicles and drivers that can transport the new order are determined, and the weights are calculated according to the vehicle dispatch strategy and the preset weights of each vehicle and driver. Vehicles and drivers with larger weights are dispatched first.
[0091] According to the address information of the new order (place of issuance and place of receipt), all the transit points where the new order may be transferred during transportation are determined, and these transit points are listed in a second table, that is, the second table is generated according to all the transit points, and the transit points are used as table elements. The data values of the transportation costs of each table element in each row and column of the second table are calculated and compared to obtain the minimum element and the second minimum element in each row and column, that is, the minimum cost and the second minimum cost, and the difference between the minimum element and the second minimum element in each row and column in the table is calculated, and the largest difference is marked (if several differences are the same, one can be selected at random), and the largest number is filled in the smallest element in the row or column with the largest difference. Repeat the above steps for the uncrossed rows and columns until a second initial solution is obtained. Call the preset potential method to calculate the second check number of the blank in the second table, and then adjust the second initial solution according to the second check number to obtain the second optimal solution, which is the shortest path. According to the shortest path, the current driving route is adjusted to obtain the real-time driving route.
[0092] 409, obtaining the road network information of the starting point, the end point and each transfer point in the transportation process of the new order;
[0093] 410, based on a preset Bellman-Ford algorithm and road network information, calculating at least one first distance between the starting point and each transfer point and at least one second distance between each transfer point and the end point;
[0094] 411, performing arithmetic addition processing on at least one first distance and at least one second distance respectively to obtain at least one distance value;
[0095] 412, performing numerical comparison on at least one distance value, and obtaining the shortest path according to the result of the numerical comparison;
[0096] 413, dynamically adjust the driving route according to the shortest path to obtain a real-time driving route.
[0097] Obtain the road network information of the starting point, end point and each transfer point of the new order during the transportation process, determine the road section where the vehicle is located according to the road network information, that is, determine whether the vehicle has arrived at the destination; if the vehicle has not arrived at the destination, calculate the first distance from the starting point to each transfer point and the second distance from each transfer point to the end point according to the road network information and the preset Bellman-Ford algorithm; perform arithmetic addition operation on the first distance and the second distance to obtain the distance value, that is, the shortest path between the starting point and the end point is the distance value after the first distance and the second distance are added; compare the numerical values of all distance values to obtain the distance value with the minimum numerical value, that is, the path corresponding to the distance value is the shortest path, and adjust the current vehicle's driving route according to the shortest path to obtain the real-time driving route.
[0098] In the embodiment of the present invention, steps 401-402 are consistent with steps 101-102 of the first embodiment of the above-mentioned method for dynamically adjusting the driving route, and are not described in detail here.
[0099] In an embodiment of the present invention, the road network information of all transfer points in the transportation process is obtained, the distance value from the starting point to the transfer point and the distance value from the transfer point to the end point are calculated according to the road network information, the shortest path is generated according to these two distance values, and the driving route is dynamically adjusted according to the shortest path, thereby improving the actual transportation efficiency.
[0100] The above describes the method for dynamically adjusting the driving route in the embodiment of the present invention. The following describes the device for dynamically adjusting the driving route in the embodiment of the present invention. Figure 5 , an embodiment of the dynamic adjustment device of the driving route in the embodiment of the present invention includes:
[0101] The acquisition module 501 is used to acquire the address information of the historical order and the transportation data when the historical order is transported, and establish a mapping relationship between the address information and the transportation data;
[0102] An analysis module 502 is used to perform data analysis on the address information and the transportation data according to the mapping relationship to generate a vehicle dispatch strategy;
[0103] The planning module 503 is used to extract the address information of the new order when a new order is detected, and determine the vehicle that can transport the new order and plan the driving route according to the vehicle scheduling strategy and the address information of the new order;
[0104] The adjustment module 504 is used to collect the road network information during the transportation of the new order and dynamically adjust the driving route according to the road network information.
[0105] Optionally, the analysis module 502 is specifically used for:
[0106] According to the mapping relationship, extract the sending place information and the receiving place information in the address information to determine the starting point and the end point of the transportation;
[0107] Extracting a transportation route from the transportation data, and determining, based on the transportation route, each junction for transfer during the transportation process and a directed path between the starting point, the end point and each of the junctions, and generating a directed graph based on the directed path;
[0108] Extracting each parameter value in the directed graph, and generating an adjacency matrix according to each parameter value;
[0109] Calling a preset neural network to construct a corresponding relationship between each element in the adjacency matrix and each neuron in the neural network;
[0110] According to the corresponding relationship, the adjacency matrix is subjected to network evolution to generate a transposition matrix, and a vehicle dispatching strategy is generated according to the transposition matrix and the transport vehicles in the transport data.
[0111] Optionally, the planning module 503 is specifically used for:
[0112] Extracting the address information of the new order, and determining the vehicle that can transport the new order and each transfer point in the transportation process according to the address information of the new order and the vehicle dispatching strategy;
[0113] Freely combining routes for each of the transfer points to generate at least one route;
[0114] Calculating the path lengths of the routes and comparing the values of the path lengths;
[0115] According to the comparison result, a route with the smallest path length value is selected from at least one of the routes as the driving route.
[0116] Optionally, the planning module 503 is further specifically configured to:
[0117] Generate a first table according to each of the transfer points, wherein each of the transfer points is a table element in the first table;
[0118] Based on the preset northwest corner method, fill in the first table to obtain a first initial solution;
[0119] Calculating a first check digit for a space in the first table according to a preset potential method;
[0120] The first initial solution is adjusted according to the first check number to obtain a first optimal solution, and a driving route is generated according to the first optimal solution.
[0121] Optionally, the planning module 503 is further specifically configured to:
[0122] Generate a second table according to each of the transfer points, wherein each of the transfer points is a table element in the second table;
[0123] Calculate and compare the data values of each table element in each row and column of the second table to obtain the smallest element and the second smallest element in each row and column;
[0124] Calculate the difference between the minimum element and the second smallest element in each row and column, and generate a second initial solution according to the difference;
[0125] Calculating a second check digit for each space in the second table according to a preset potential method;
[0126] The second initial solution is adjusted according to the second check number to obtain a second optimal solution, and a driving route is generated according to the second optimal solution.
[0127] Optionally, the adjustment module 504 is specifically used for:
[0128] Obtaining the road network information of the starting point and each of the transfer points during the transportation process of the new order;
[0129] Based on a preset link state routing algorithm and the road network information, the shortest path between the starting point and each of the transit points is calculated;
[0130] The shortest path is iterated multiple times to obtain an optimal path, and the driving route is dynamically adjusted based on the optimal path to obtain a real-time driving route.
[0131] Optionally, the adjustment module 504 is further specifically configured to:
[0132] Obtaining the road network information of the starting point, the end point and each of the transfer points during the transportation process of the new order;
[0133] Based on a preset Bellman-Ford algorithm and the road network information, at least one first distance between the starting point and each transfer point and at least one second distance between each transfer point and the end point are calculated;
[0134] Performing arithmetic addition processing on at least one of the first distances and at least one of the second distances respectively to obtain at least one distance value;
[0135] Performing numerical comparison on at least one of the distance values, and obtaining the shortest path according to the result of the numerical comparison;
[0136] The driving route is dynamically adjusted according to the shortest path to obtain a real-time driving route.
[0137] In an embodiment of the present invention, the dynamic adjustment device of the driving route generates a vehicle dispatching strategy by acquiring the address information and transportation data of historical orders and performing data analysis; when a new order is detected, the address information of the new order is extracted, and the vehicle that can transport the new order is determined and the driving route is planned based on the vehicle dispatching strategy and the address information of the new order; the road network information in the process of transporting the new order is collected, and the driving route is dynamically adjusted based on the road network information. The embodiment of the present invention realizes the automatic dynamic adjustment of the driving route, improves the transportation efficiency, ensures the safety of transportation, thereby reducing the transportation cost and saving transportation time.
[0138] See also Figure 6 , an embodiment of a dynamic adjustment device for a driving route in an embodiment of the present invention is described in detail below from the perspective of hardware processing.
[0139] Figure 6 : is a schematic diagram of the structure of a dynamic adjustment device for a driving route provided by an embodiment of the present invention. The dynamic adjustment device 600 for a driving route may have relatively large differences due to different configurations or performances, and may include one or more processors (central processing units, CPU) 610 (for example, one or more processors) and a memory 620, and one or more storage media 630 (for example, one or more mass storage devices) storing application programs 633 or data 632. Among them, the memory 620 and the storage medium 630 may be temporary storage or permanent storage. The program stored in the storage medium 630 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations in the dynamic adjustment device 600 for the driving route. Furthermore, the processor 610 may be configured to communicate with the storage medium 630 to execute a series of instruction operations in the storage medium 630 on the dynamic adjustment device 600 for the driving route.
[0140] The driving route dynamic adjustment device 600 may also include one or more power supplies 640, one or more wired or wireless network interfaces 650, one or more input and output interfaces 660, and or, one or more operating systems 631, such as Windows Server, Mac OS X, Unix, Linux, FreeBSD, etc. It will be appreciated by those skilled in the art that Figure 6 The structure of the dynamic adjustment device for the driving route shown does not constitute a limitation of the dynamic adjustment device for the driving route, and may include more or fewer components than shown in the figure, or a combination of certain components, or a different arrangement of components.
[0141] The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When the instructions are executed on a computer, the computer executes the steps of the method for dynamically adjusting the driving route.
[0142] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described devices and units can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0143] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program codes.
[0144] As described above, the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features thereof may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A method for dynamically adjusting a driving route, characterized in that: The dynamic adjustment method of the driving route includes: Acquire address information of historical orders and transportation data when transporting the historical orders, and establish a mapping relationship between the address information and the transportation data; According to the mapping relationship, the address information and the transportation data are analyzed to generate a vehicle scheduling strategy, including: according to the mapping relationship, extracting the information of the place of origin and the place of receipt in the address information to determine the starting point and the end point of the transportation; extracting the transportation route in the transportation data, and according to the transportation route, determining the various junctions for transfer during the transportation process and the directed paths between the starting point, the end point and each of the junctions, and generating a directed graph according to the directed path, wherein the optimization target is the cost or time corresponding to the edge; extracting the parameter values in the directed graph, and generating an adjacency matrix according to each of the parameter values, wherein the adjacency matrix is a cost adjacency matrix or a time adjacency matrix, and if there is a path between two nodes, the value of the corresponding matrix element is the freight or transportation time of the path; calling a preset neural network to construct a corresponding relationship between each element in the adjacency matrix and each neuron in the neural network; according to the corresponding relationship, performing network evolution on the adjacency matrix to generate a transposition matrix, and generating a vehicle scheduling strategy according to the minimum freight or minimum transportation time path formed by the transposition matrix and the transportation vehicles in the transportation data; When a new order is detected, the address information of the new order is extracted, and according to the vehicle dispatching strategy and the address information of the new order, a vehicle that can transport the new order is determined and a driving route is planned; The road network information during the transportation of the new order is collected, and the driving route is dynamically adjusted according to the road network information.
2. The method for dynamically adjusting the driving route according to claim 1, characterized in that: The extracting the address information of the new order, and determining the vehicle that can transport the new order and planning the driving route according to the vehicle dispatching strategy and the address information of the new order includes: Extracting the address information of the new order, and determining the vehicle that can transport the new order and each transfer point in the transportation process according to the address information of the new order and the vehicle dispatching strategy; Freely combining routes for each of the transfer points to generate at least one route; Calculating the path lengths of the routes and comparing the values of the path lengths; According to the comparison result, a route with the smallest path length value is selected from at least one of the routes as the driving route.
3. The method for dynamically adjusting the driving route according to claim 2, characterized in that: The extracting the address information of the new order, and determining the vehicle that can transport the new order and planning the driving route according to the vehicle dispatching strategy and the address information of the new order also includes: Generate a first table according to each of the transfer points, wherein each of the transfer points is a table element in the first table; Based on the preset northwest corner method, fill in the first table to obtain a first initial solution; Calculating a first check digit for a space in the first table according to a preset potential method; The first initial solution is adjusted according to the first check number to obtain a first optimal solution, and a driving route is generated according to the first optimal solution.
4. The method for dynamically adjusting the driving route according to claim 2, characterized in that: The extracting the address information of the new order, and determining the vehicle that can transport the new order and planning the driving route according to the vehicle dispatching strategy and the address information of the new order also includes: Generate a second table according to each of the transfer points, wherein each of the transfer points is a table element in the second table; Calculate and compare the data values of each table element in each row and column of the second table to obtain the smallest element and the second smallest element in each row and column; Calculate the difference between the minimum element and the second smallest element in each row and column, and generate a second initial solution according to the difference; Calculating a second check digit for each space in the second table according to a preset potential method; The second initial solution is adjusted according to the second check number to obtain a second optimal solution, and a driving route is generated according to the second optimal solution.
5. The method for dynamically adjusting a driving route according to any one of claims 1 to 4, characterized in that: The collecting of the road network information during the transportation of the new order and dynamically adjusting the driving route according to the road network information includes: Obtaining the road network information of the starting point and each of the transfer points during the transportation process of the new order; Based on a preset link state routing algorithm and the road network information, the shortest path between the starting point and each of the transit points is calculated; The shortest path is iterated multiple times to obtain an optimal path, and the driving route is dynamically adjusted based on the optimal path to obtain a real-time driving route.
6. The method for dynamically adjusting the driving route according to claim 5, characterized in that: The collecting of the road network information during the transportation of the new order and dynamically adjusting the driving route according to the road network information further includes: Obtaining the road network information of the starting point, the end point and each of the transfer points during the transportation process of the new order; Based on a preset Bellman-Ford algorithm and the road network information, at least one first distance between the starting point and each transfer point and at least one second distance between each transfer point and the end point are calculated; Performing arithmetic addition processing on at least one of the first distances and at least one of the second distances respectively to obtain at least one distance value; Performing numerical comparison on at least one of the distance values, and obtaining the shortest path according to the result of the numerical comparison; The driving route is dynamically adjusted according to the shortest path to obtain a real-time driving route.
7. A dynamic adjustment device for a driving route, characterized in that: The dynamic adjustment device of the driving route includes: An acquisition module, used to acquire address information of historical orders and transportation data when transporting the historical orders, and establish a mapping relationship between the address information and the transportation data; The analysis module is used to perform data analysis on the address information and the transportation data according to the mapping relationship and generate a vehicle scheduling strategy, including: extracting the information of the place of origin and the place of receipt in the address information according to the mapping relationship to determine the starting point and the end point of the transportation; extracting the transportation route in the transportation data, and determining the various junctions for transfer during the transportation process and the directed paths between the starting point, the end point and each of the junctions according to the transportation route, and generating a directed graph according to the directed path, wherein the optimization target is the cost or time corresponding to the edge; extracting the parameter values in the directed graph, and generating an adjacency matrix according to each of the parameter values, wherein the adjacency matrix is a cost adjacency matrix or a time adjacency matrix, and if there is a path between two nodes, the value of the corresponding matrix element is the freight or transportation time of the path; calling a preset neural network to construct a corresponding relationship between each element in the adjacency matrix and each neuron in the neural network; performing network evolution on the adjacency matrix according to the corresponding relationship to generate a transposition matrix, and generating a vehicle scheduling strategy according to the minimum freight or minimum transportation time path formed by the transposition matrix and the transportation vehicles in the transportation data; A planning module, for extracting the address information of the new order when a new order is detected, and determining a vehicle that can transport the new order and planning a driving route according to the vehicle dispatching strategy and the address information of the new order; The adjustment module is used to collect the road network information during the transportation of the new order and dynamically adjust the driving route according to the road network information.
8. A dynamic adjustment device for a driving route, characterized in that: The dynamic adjustment device of the driving route includes: A memory and at least one processor, wherein instructions are stored in the memory, and the memory and the at least one processor are interconnected via a line; The at least one processor calls the instructions in the memory to enable the network access detection device to execute the steps of the method for dynamically adjusting the driving route according to any one of claims 1-6.
9. A computer-readable storage medium having instructions stored thereon, characterized in that: When the instructions are executed by the processor, the steps of the method for dynamically adjusting the driving route according to any one of claims 1-6 are implemented.
Citation Information
Patent Citations
Real-time path planning method based on vehicle self-organizing network
CN108629455A
Logistics route planning method, device and equipment and storage medium
CN111461624A
