Transportation route planning method and device based on graph database, equipment and medium

Abstract

The application relates to the technical field of transportation route planning, and provides a transportation route planning method, device and equipment based on a graph database and a medium. The application can quickly obtain and visually provide a transportation route planning result meeting constraint conditions set by a user based on a graph database, improve route planning efficiency and save operation cost. The method comprises the following steps: acquiring a graph database constructed based on node attribute information of each transportation node and transportation capacity attribute information between each transportation node; acquiring transportation route constraint conditions set by the user; acquiring a transportation route planning result formed by at least two transportation nodes with node and transportation capacity attribute information meeting the constraint conditions in the graph database and displaying the result according to the node and transportation capacity attribute information stored in the graph database.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of transportation route planning, in particular to a transportation route planning method and device based on a graph database, computer equipment and a storage medium. BACKGROUND

[0002] Transportation route planning is an effective way to guide efficient transportation of express delivery.

[0003] For transportation route planning, the main way currently adopted by the technology includes a depth and breadth search algorithm. However, the depth and breadth search algorithm has a high time complexity and is difficult to apply in the logistics industry with increasingly large network points and transportation capacity. However, trying to limit the range of route search by experience or rules will inevitably make the search lose flexibility and comprehensiveness and thus difficult to effectively complete the transportation route planning task, resulting in the technical problem of low planning efficiency of such transportation route planning scheme. SUMMARY

[0004] Therefore, it is necessary to provide a transportation route planning method and device based on a graph database, computer equipment and a storage medium in view of the above technical problems.

[0005] A transportation route planning method based on a graph database, the method comprising:

[0006] obtaining a graph database constructed based on network point attribute information of each transportation network point and transportation capacity attribute information between each transportation network point;

[0007] obtaining a transportation route constraint condition set by a user;

[0008] obtaining a transportation route planning result formed by at least two transportation network points in the graph database having network point attribute information and transportation capacity attribute information satisfying the transportation route constraint condition from the graph database according to the network point attribute information of each transportation network point and the transportation capacity attribute information between each transportation network point stored in the graph database;

[0009] displaying the transportation route planning result.

[0010] A transportation route planning device based on a graph database, comprising:

[0011] a graph database obtaining module configured to obtain a graph database constructed based on network point attribute information of each transportation network point and transportation capacity attribute information between each transportation network point;

[0012] a constraint condition obtaining module configured to obtain a transportation route constraint condition set by a user;

[0013] A route planning obtaining module is configured to obtain a transport route planning result formed by at least two transport network points in the graph database that satisfy the transport route constraint condition according to the network point attribute information and the transport capacity attribute information of the transport network points stored in the graph database.

[0014] A route planning display module is configured to display the transport route planning result.

[0015] A computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0016] A graph database is obtained based on network point attribute information of each transport network point and transport capacity attribute information between transport network points; a transport route constraint condition set by a user is obtained; a transport route planning result formed by at least two transport network points in the graph database that satisfy the transport route constraint condition according to the network point attribute information and the transport capacity attribute information of the transport network points stored in the graph database is obtained; and the transport route planning result is displayed.

[0017] A computer readable storage medium stores a computer program, and the computer program is executed by a processor to implement the following steps:

[0018] A graph database is obtained based on network point attribute information of each transport network point and transport capacity attribute information between transport network points; a transport route constraint condition set by a user is obtained; a transport route planning result formed by at least two transport network points in the graph database that satisfy the transport route constraint condition according to the network point attribute information and the transport capacity attribute information of the transport network points stored in the graph database is obtained; and the transport route planning result is displayed.

[0019] The above-mentioned transport route planning method, device, equipment and medium based on a graph database obtain a graph database constructed based on network point attribute information of each transport network point and transport capacity attribute information between transport network points, obtain a transport route constraint condition set by a user, obtain a transport route planning result formed by at least two transport network points in the graph database that satisfy the constraint condition according to the network point attribute information and the transport capacity attribute information stored in the graph database, and display the transport route planning result. This scheme can quickly obtain and visually provide a transport route planning result that satisfies the constraint condition set by a user based on a graph database, improve route planning efficiency, and save computing cost. In addition, the visual route planning result can help the user to intuitively and comprehensively understand and control the transport route planning result to make more effective judgments and decisions. Attached Figure Description

[0020] Figure 1 This is a flowchart illustrating a transportation route planning method based on a graph database in one embodiment;

[0021] Figure 2 This is a schematic diagram of the data structure of the graph database in one embodiment;

[0022] Figure 3 This is a schematic diagram of the transportation network points and the transportation capacity between each transportation network point in one embodiment;

[0023] Figure 4 This is a schematic diagram illustrating the associated topological relationships in one embodiment;

[0024] Figure 5 This is a flowchart illustrating a transportation route planning method based on a graph database in another embodiment;

[0025] Figure 6 This is a structural block diagram of a transportation route planning device based on a graph database in one embodiment;

[0026] Figure 7 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0027] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0028] The transportation route planning method based on graph database provided in this application can be applied to user terminals, which may include, but are not limited to, various personal computers, laptops, smartphones, and tablets. The transportation route planning process may include first generating an ordered sequence of candidate routes from the origin to the destination and via points of interest for a logistics order; then connecting these ordered candidate routes using appropriate transportation resources; and further, filtering and sorting operations may be performed based on logistics business objectives to obtain the optimal transportation route planning result that meets user needs.

[0029] The transportation route planning method based on graph database provided in this application will be described below with reference to the embodiments and corresponding figures.

[0030] In one embodiment, such as Figure 1 As shown, a transportation route planning method based on a graph database is provided, which may include the following steps:

[0031] In step S101, a graph database is obtained based on the node attribute information of each transport network point and the transport capacity attribute information between each transport network point.

[0032] In this step, the terminal obtains the graph database before providing the user with the transport route planning result. The graph database is obtained based on the node attribute information of each transport network point and the transport capacity attribute information between each transport network point.

[0033] For example, the node attribute information can include the type, size, belonging area, responsible person, whether it is a port, customs declaration start time, customs clearance end time, interval days between customs declaration and customs clearance, port working period, and the like. The port working period refers to which days in a week can be declared, for example, "1, 3, 7" means that only on Monday, Wednesday, and Sunday can the port be declared; when the node is not a port, the port-related data can be set to empty.

[0034] For example, the transport capacity attribute information can include the latest departure time, arrival time, interval days between the latest departure time and the arrival time, transport capacity type, transport capacity working period, transport resource loss, and the like. The transport capacity type is mainly divided into land and air; the transport capacity working period indicates which days in a week have the transport capacity, for example, "1, 3, 7" means that only on Monday, Wednesday, and Sunday can the transport capacity work.

[0035] In some embodiments, the graph database can be constructed before step S101 in the following manner, and the specific steps include:

[0036] The node attribute information of each transport network point and the transport capacity attribute information between each transport network point stored in the original transport information database are determined; and the node attribute information of each transport network point and the transport capacity attribute information between each transport network point stored in the original transport information database are imported into the graph database in the form of node-transport capacity-node for storage.

[0037] In this embodiment, the data information stored in the original transport information database is imported into the graph database for storage, and the data information stored in the original transport information database is imported into the graph database in the form of node-transport capacity-node. The original transport information database can be a relational database, and in this embodiment, the node attribute information of each transport network point and the transport capacity attribute information between each transport network point in the original transport information database built by the relational database can be imported into the graph database in the form of node-transport capacity-node for storage, and for the same "node-transport capacity-node" in the graph database, according to different time, transport capacity type, and working period attribute information, multiple possible transport capacities can be included, such as Figure 2The data structure of an exemplary graph database in the present application is shown, wherein the circles represent transport network points (referred to as network points), and the names of the corresponding network points are identified by, for example, "010X", "010AA" in the circles. The connection lines between the circles represent the transport capacity (TO) between the transport network points. In the present embodiment, the network point attribute information of each transport network point and the transport capacity attribute information between the transport network points are stored in the graph database in the form of "network point-transport capacity-network point", which can intuitively present the correlation between the network points and is helpful to quickly extract the relevant transport network points to form the corresponding transport route planning result when planning the transport route.

[0038] In some embodiments, when the original transport information library is updated, the graph database is emptied, and the updated network point attribute information of each transport network point and the transport capacity attribute information between the transport network points are imported into the graph database in the form of network point-transport capacity-network point.

[0039] The present embodiment mainly synchronously updates the information stored in the graph database when the information stored in the original transport information library is updated or changed, so as to ensure that the data in the graph database is the latest data, thereby guaranteeing the accuracy of the transport route planning result obtained therefrom. Specifically, the graph database is emptied, and then the updated network point attribute information of each transport network point and the transport capacity attribute information between the transport network points in the original transport information library are imported into the graph database in the form of network point-transport capacity-network point again.

[0040] Step S102, obtaining the transport route constraint condition set by the user;

[0041] In the present step, the terminal can obtain the transport route constraint condition set by the user when the user needs to plan the transport route. The condition is mainly used to constrain the selection manner and strategy of the terminal to the relevant transport network points in the graph database in the transport route planning process.

[0042] Step S103, obtaining the transport route planning result formed by at least two transport network points with the network point attribute information and the transport capacity attribute information satisfying the transport route constraint condition in the graph database in series according to the network point attribute information of each transport network point and the transport capacity attribute information between the transport network points stored in the graph database;

[0043] The step mainly takes the node attribute information of each transport network point and the transport capacity attribute information between each transport network point stored in the graph database as the basis to form one or more transport route planning results from at least two transport network points meeting the transport route constraint conditions set by the user from the graph database, that is, each transport route planning result contains at least two transport network points, that is, at least includes a transport starting point and a transport ending point and a corresponding transport capacity used to connect the two transport network points. Among them, at least two transport network points meeting the transport route constraint conditions set by the user refer to at least two transport network points with node attribute information and transport capacity attribute information meeting the transport route constraint conditions, that is, the terminal needs to select at least two transport network points meeting the constraint conditions and connect to form a transport route planning result according to the constraint conditions set by the user in combination with the node attribute information of each transport network point and the transport capacity attribute information between each transport network point stored in the graph database.

[0044] Specifically, the transport route constraint conditions can include basic conditions and screening conditions; wherein the basic conditions can include a transport starting point, a transport ending point and a transport departure time; wherein the transport starting point and the transport ending point are the starting point and the ending point of the logistics transportation, and the transport departure time is the time when the goods such as express delivery need to be sent from the transport starting point, which can specifically include a departure date and a departure time. The departure date is a certain day, and the departure time is a certain time on that day. For example, the departure date can be October 21, 2020, and the departure time can be 12:20:00. That is, the user can set the transport starting point, the transport ending point and the transport departure time as the basic conditions in the transport route constraint conditions, and set the screening conditions for further screening on this basis.

[0045] In some embodiments, step S103 can specifically include: according to the node attribute information of each transport network point and the transport capacity attribute information between each transport network point stored in the graph database, obtaining the optional transport route planning formed by at least two transport network points in the graph database with node attribute information and transport capacity attribute information meeting the basic conditions; and obtaining the transport route planning result from the optional transport route planning according to the screening conditions.

[0046] In this embodiment, the terminal can determine at least two transport network points with the basic conditions of the transport starting point, the transport ending point and the transport departure time set by the user from the graph database, and obtain the optional transport route planning by connecting them. The number of optional transport route planning is usually multiple, and then the terminal can further obtain the transport route planning result from the optional transport route planning according to the screening conditions set by the user.

[0047] For obtaining the optional transportation route planning from the graph database, exemplary, it is assumed that the user-provided basic conditions include the transportation starting point 010AS, the transportation ending point 479B, and the transportation departure time 2020-10-21, 12:20:00. According to this, for each feasible next network point (such as network point 2) from the transportation starting point 010AS, there is a transport capacity represented as to, according to the different time, transport capacity type, and working period, and other attribute information, the transport capacity to can include one or more transport capacities (assuming to be to1), according to the transportation departure time, the transportation arrival date and time corresponding to each to1 is calculated, and here the to1 (assuming to1_fastest) with the fastest transportation arrival can be selected as the transport capacity from the transportation starting point 010AS to the next network point (such as network point 2) (the time spent during includes “transportation departure time -> the latest departure time of to1” and “the latest departure time of to1 -> the transportation arrival time of to1”). The transportation arrival time of to1_fastest is the transportation departure time from network point 2 to network point 3. Among them, the terminal can judge whether there is the transport capacity on the day according to the transportation departure time, assuming that the transportation departure time 2020-10-21 is Wednesday, and the working period of a certain to1 is “1, 2”, then the transport capacity needs to be used to wait until the next Monday; and the terminal can judge whether it can catch the to1 on the day according to the transportation departure time, for example, the departure time of the transportation departure time is 12:20:00, and the latest departure time of a certain to1 is 12:30:00, then it cannot catch the to1 on the day, and the transport capacity needs to be used to wait until the next time when the transport capacity is available. In specific application, the date attribute of the transport capacity can be dynamically added in each route planning process according to the user-set transportation departure time and the above process, and the attribute can be deleted after completing a route planning.

[0048] By analogy, the terminal can reach the transportation ending point 479B from the transportation starting point 010AS in series, thereby obtaining the optional transportation route planning.

[0049] In the above process, the next network point is selected according to the “fastest transportation arrival” condition, referring to Figure 3 That is, in some embodiments, the user-set basic conditions can also include the “fastest transportation arrival” condition, and the terminal can screen the transportation network points and the transport capacity according to this, so that the adjacent transportation network points in the optional transportation route planning obtained by the terminal satisfy the condition of the fastest transportation arrival.

[0050] In some other embodiments, in addition to the “fastest transportation arrival”, according to the specific business needs, the user-set basic conditions can also be conditions such as the must-pass network point, the minimum transportation resource consumption, the maximum number of transportation network points, and the like.

[0051] The necessary network point refers to one or more transport network points that must be passed during transport, for example, a certain network point must be passed to reach a certain port. The user can set the necessary network point condition in the basic condition before transport path planning. The transport route planning obtained by the terminal based on the above process needs to include the necessary network point.

[0052] The minimum transport resource loss refers to the minimum transport resource loss of the transport capacity of the two adjacent transport network points in series. The user can also set the minimum transport resource loss condition in the basic condition before transport path planning. Thus, the adjacent transport network points in the transport route planning obtained by the terminal based on the above process satisfy the minimum transport resource loss condition.

[0053] The maximum number of transport network points refers to the maximum number of transport network points included in each optional transport route planning. The user can also set the maximum number of transport network points in the basic condition, so that the number of transport network points included in the optional transport route planning selected by the terminal is less than or equal to the maximum number of transport network points. For example, the user can set the maximum number of transport network points as L in the basic condition. The terminal can set the repeated execution condition of obtaining the optional transport route planning as 0

[0054] For the screening condition in the transport route constraint condition, the transport resource loss threshold and / or the transport time length threshold can be included. The transport resource loss refers to the total transport resource loss corresponding to each optional transport route planning obtained by the terminal through the above process. The transport time length refers to the total transport time length corresponding to each optional transport route planning. In the process of obtaining each optional transport route planning by the terminal, the terminal can also calculate the transport resource loss (such as the total transport cost corresponding to each transport capacity) and the transport time length (such as the total time spent corresponding to each transport capacity) corresponding to each optional transport route planning. That is, the terminal can obtain the transport resource loss and the transport time length corresponding to each optional transport route planning at the same time as obtaining each optional transport route planning. The optional transport route planning can be screened according to the transport resource loss and the transport time length corresponding to each optional transport route planning.

[0055] In some embodiments, the obtaining the transport route planning result from the optional transport route planning according to the screening condition can include:

[0056] obtaining the transport route planning result according to the optional transport route planning with a transport time length less than or equal to the transport time length threshold.

[0057] In this embodiment, the terminal can screen the one or more optional transport route planning according to the transport resource loss threshold in the screening condition, for example, the terminal can take the optional transport route planning with a transport resource loss less than or equal to the transport resource loss threshold as the final transport route planning result, or further sort the optional transport route planning with a transport resource loss less than or equal to the transport resource loss threshold in ascending or descending order to form the final transport route planning result; in addition, the terminal can also directly take the optional transport route planning with the minimum transport resource loss as the final transport route planning result, so as to obtain the transport route planning result with the lowest transport resource loss in theory.

[0058] In some other embodiments, the obtaining the transport route planning result from the optional transport route planning according to the screening condition can include:

[0059] obtaining the transport route planning result according to the optional transport route planning with a transport time length less than or equal to the transport time length threshold.

[0060] In this embodiment, the terminal can screen the one or more optional transport route planning according to the transport resource loss threshold in the screening condition, for example, the terminal can take the optional transport route planning with a transport resource loss less than or equal to the transport resource loss threshold as the final transport route planning result, or further sort the optional transport route planning with a transport resource loss less than or equal to the transport resource loss threshold in ascending or descending order to form the final transport route planning result; in addition, the terminal can also directly take the optional transport route planning with the minimum transport resource loss as the final transport route planning result, so as to obtain the transport route planning result with the lowest transport resource loss in theory.

[0061] Step S104: displaying the transport route planning result.

[0062] This step mainly displays the transport route planning result obtained by the terminal to the user in a visual manner, which can include a sequence of nodes formed by the transport nodes, transport capacity, transport time, etc., and the corresponding transport time length, transport resource loss, etc. information. The transport route planning result obtained by the terminal can include one or more.

[0063] In some embodiments, step S104 can include: obtaining a planning result ranking index according to the transportation route constraint condition; and sequentially displaying the transportation route planning result based on the planning result ranking index.

[0064] The embodiment mainly describes that the terminal can sequentially display one or more transportation route planning results according to a planning result ranking index represented by the transportation route constraint condition. Specifically, the planning result ranking index represented by the transportation route constraint condition can include transportation time length, transportation resource loss, etc., that is, the transportation route planning results can be sequentially displayed according to the transportation time length of each transportation route planning result, for example, from small to large, or the transportation route planning results can be sequentially displayed according to the transportation resource loss of each transportation route planning result, for example, from small to large.

[0065] Therefore, based on the characteristics and functions of the graph database, the transportation route planning result can be quickly obtained and visually displayed, and the transportation route planning result can be further flexibly displayed according to the planning result ranking index defined by the user.

[0066] Further, in some embodiments, after the terminal displays one or more transportation route planning results, the terminal can further obtain a selection operation of a user on a route element in the selected transportation route planning result, and display element detail information of the route element and an associated topological relationship of the route element in response to the selection operation.

[0067] The selected transportation route planning result refers to a transportation route planning result selected by the user from one or more transportation route planning results displayed by the terminal. Specifically, as shown in Figure 4 The terminal displays one or more transportation route planning results, the user can select one transportation route planning result as the selected transportation route planning result, and the user can further select a route element (such as a transportation node, a transportation capacity, etc.) in the selected transportation route planning result. After the terminal detects the selection operation, the terminal can further display detail information of the route element, such as a district of a node passed by the route element, a person in charge, a type, etc., and display an associated topological relationship of the selected transportation node or transportation capacity, so that the user can quickly know which other transportation nodes can be connected by a certain transportation node, information of an alternative transportation capacity between given transportation nodes, etc.

[0068] The above-mentioned transportation route planning method based on a graph database obtains a graph database constructed based on the node attribute information of each transportation network point and the transportation capacity attribute information between each transportation network point, obtains the transportation route constraint conditions set by a user, and obtains the transportation route planning result formed by at least two transportation network points with node and transportation capacity attribute information satisfying the constraint conditions in the graph database according to the node and transportation capacity attribute information stored in the graph database, and displays the result. This scheme can quickly obtain and visually provide the user with the transportation route planning result satisfying the constraint conditions set by the user based on the graph database, improve the route planning efficiency, and save the operation cost. In addition, the user can intuitively and comprehensively understand and control the transportation route planning result through the visualization of the route planning result to make more effective judgments and decisions.

[0069] To more clearly present the scheme provided in the present application, the following Figure 5 The transportation route planning method based on a graph database is described as a whole:

[0070] The node attribute information of each transportation network point and the transportation capacity attribute information between each transportation network point stored in the original transportation information database (corresponding to the source database) are imported into the graph database in the form of node-transportation capacity-node. The graph database can be deployed in a server cluster, which facilitates parallel processing of queries during subsequent route planning and further speeds up the process. Whenever data in the original transportation information database is changed / updated, the graph database is emptied and the updated data is imported again.

[0071] Accordingly, the terminal can provide the user with a transportation route planning service with limited conditions and sorting indicators (i.e., transportation route constraint conditions). The user can set conditions such as the starting and ending points of the transportation route planning, the expected departure time, and the maximum number of transportation network points on the terminal, as well as sorting indicators such as the transportation time and transportation resource consumption. The terminal can query the transportation route planning result in real time according to these limited conditions and sorting indicators through the background (server cluster), and display the result returned by the background. On the one hand, the terminal can display basic route information (such as a node sequence formed by the series connection of each transportation network point, transportation capacity, and transportation time, as well as corresponding transportation time and transportation resource consumption information). Based on the characteristics and functions of the graph database, the returned transportation route planning result can quickly, visually, and flexibly display various details related to the route. On the other hand, after the user selects a certain transportation route planning result, the user can further select elements (such as network points and transportation capacity) in the result. The terminal can also query and display detailed information of the elements (such as the area, responsible person, and type of the network points) through the background, and display the associated topological relationship of a selected network point or transportation capacity (for example, the user can quickly know which other network points can be connected to a certain network point, and the alternative transportation capacity information between given network points).

[0072] The method for planning a transport route based on a graph database has the following beneficial effects:

[0073] 1. The graph database is used to store and calculate the transport route planning result, so that all possible transport network points and transport capacity can be quickly traversed under reasonable given conditions to obtain a global optimal solution, greatly improving the route planning efficiency, saving calculation time, and realizing real-time optimal route planning.

[0074] 2. Based on the characteristics of the graph database, not only can the basic route information be displayed to the user, but also the detailed information of each element and the corresponding associated topological relationship can be quickly, flexibly, and customized to display, helping the user to more intuitively and comprehensively control the transport route planning result, and assisting in better judgment and decision-making.

[0075] 3. Based on actual business needs, the related route data can be displayed in real time and in multiple dimensions to help the user derive the optimal alternative solution, and through detailed visual display, the user can better understand the transport route and make accurate decisions.

[0076] It should be understood that although each step in the above flowchart is displayed in sequence according to the arrow, these steps are not necessarily executed in the order indicated by the arrow. Unless explicitly stated in this document, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least part of the steps in the above flowchart can include multiple steps or multiple stages, which are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily sequential, but can be executed in rotation or alternation with at least part of other steps or steps or stages in other steps.

[0077] In one embodiment, as shown in Figure 6 , a device for planning a transport route based on a graph database is provided, and the device 600 can include:

[0078] A graph database acquisition module 601 is configured to acquire a graph database constructed based on network point attribute information of each transport network point and transport capacity attribute information between each transport network point.

[0079] A constraint condition acquisition module 602 is configured to acquire a transport route constraint condition set by a user.

[0080] A route planning acquisition module 603 is configured to acquire a transport route planning result formed by at least two transport network points in the graph database that have network point attribute information and transport capacity attribute information satisfying the transport route constraint condition, according to the network point attribute information of each transport network point and the transport capacity attribute information between each transport network point stored in the graph database.

[0081] The route planning display module 604 is configured to display the transport route planning result.

[0082] In an embodiment, the device 600 further comprises a graph database construction module configured to determine the node attribute information of each transport node and the transport capacity attribute information between each transport node stored in the original transport information database; and import the node attribute information of each transport node and the transport capacity attribute information between each transport node stored in the original transport information database into the graph database in the form of node-transport capacity-node.

[0083] In an embodiment, the graph database construction module is further configured to, when the original transport information database is updated, empty the graph database, and import the node attribute information of each transport node and the transport capacity attribute information between each transport node after the update into the graph database in the form of node-transport capacity-node.

[0084] In an embodiment, the route planning display module 604 is configured to obtain a planning result ranking index according to the transport route constraint condition; and display the transport route planning result in sequence based on the planning result ranking index; the number of the transport route planning result is one or more.

[0085] The route planning display module 604 is further configured to, in response to a selection operation of a route element in the selected transport route planning result by the user, display element detail information of the route element and an associated topological relationship of the route element; the selected transport route planning result is a transport route planning result selected by the user from one or more transport route planning results displayed.

[0086] In an embodiment, the transport route constraint condition comprises a basic condition and a screening condition; the basic condition comprises a transport starting point, a transport ending point, and a transport departure time; the route planning acquisition module 603 is configured to acquire an optional transport route planning formed by at least two transport nodes with node attribute information and transport capacity attribute information satisfying the basic condition in the graph database in sequence according to the node attribute information of each transport node and the transport capacity attribute information between each transport node stored in the graph database; and acquire the transport route planning result from the optional transport route planning according to the screening condition.

[0087] In an embodiment, the basic condition further comprises a must-pass node; and the optional transport route planning comprises the must-pass node.

[0088] The basic condition further comprises a must-pass node; and the optional transport route planning comprises the must-pass node.

[0089] and / or,

[0090] The basic condition further includes the fastest transportation arrival; the condition of meeting the fastest transportation arrival between adjacent transportation network points in the optional transportation route planning;

[0091] and / or,

[0092] The basic condition further includes the lowest transportation resource loss; the condition of meeting the lowest transportation resource loss between adjacent transportation network points in the optional transportation route planning;

[0093] and / or,

[0094] The basic condition further includes the maximum number of transportation network points; the number of transportation network points contained in the optional transportation route planning is less than or equal to the maximum number of transportation network points.

[0095] In one embodiment,

[0096] The screening condition includes a transportation resource loss threshold; the route planning acquisition module 603 is configured to obtain the transportation route planning result according to the optional transportation route planning with a transportation resource loss less than or equal to the transportation resource loss threshold in the optional transportation route planning.

[0097] and / or,

[0098] The screening condition includes a transportation time threshold; the route planning acquisition module 603 is configured to obtain the transportation route planning result according to the optional transportation route planning with a transportation time less than or equal to the transportation time threshold in the optional transportation route planning.

[0099] The specific limitations of the transportation route planning device based on the graph database can refer to the limitations of the transportation route planning method based on the graph database in the foregoing, and will not be described here. Each module in the above transportation route planning device based on the graph database can be realized by software, hardware and a combination thereof in whole or in part. The above each module can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory in the computer device in the form of software, so as to call and execute the operations corresponding to each module by the processor.

[0100] In one embodiment, a computer device is provided, which can be a terminal, and the internal structure diagram thereof can be as shown in Figure 7As shown in the figure. The computer device includes a processor, a memory, a communication interface, a display screen and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operating system and the computer program in the non-volatile storage medium to run. The communication interface of the computer device is used to communicate with external terminals in a wired or wireless manner. Wireless mode can be achieved through WIFI, operator network, NFC (near field communication) or other technologies. The computer program is executed by the processor to implement a transport route planning method based on a graph database. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen. The input device of the computer device can be a touch layer overlaid on the display screen, or a key, trackball or touchpad arranged on the shell of the computer device, or an external keyboard, touchpad or mouse, etc.

[0101] Those skilled in the art can understand that, Figure 7 The skilled in the art can understand that,

[0102] In one embodiment, a computer device is also provided, including a memory and a processor, the memory stores a computer program, and the processor executes the computer program to implement the steps in each of the above method embodiments.

[0103] In one embodiment, a computer readable storage medium is provided, which stores a computer program, and the computer program is executed by a processor to implement the steps in each of the above method embodiments.

[0104] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer readable storage medium, and when executed, can include the processes of the above-mentioned embodiment methods. Any reference to memory, storage, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration but not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).

[0105] Any combination of the technical features of the above embodiments can be made. In order to make the description simple, all possible combinations of the technical features in the above embodiments are not described, but as long as the combination of the technical features does not exist, it should be considered as the scope of the present application.

[0106] The above embodiments only express several implementation manners of the present application, and the description is more specific and detailed, but it should not be understood as a limitation on the scope of the patent. It should be pointed out that for those skilled in the art, without departing from the concept of the present application, some modifications and improvements can be made, which are all within the protection scope of the present application. Therefore, the protection scope of the patent of the present application should be subject to the appended claims.

Claims

1. A transportation route planning method based on graph database, characterized in that, The method includes: The network attribute information of each transportation network point and the capacity attribute information between each transportation network point are determined from the original transportation information database; the network attribute information of each transportation network point and the capacity attribute information between each transportation network point stored in the original transportation information database are imported into a graph database for storage in the form of network point-capacity-network point; the graph database constructed based on the network attribute information of each transportation network point and the capacity attribute information between each transportation network point is obtained; the capacity attribute information includes the capacity type, which is divided into land and air transport. Obtain the user-defined transportation route constraints; the transportation route constraints include basic conditions and filtering conditions; the basic conditions include the origin and destination of the logistics transportation and the transportation departure time; Based on the network attribute information of each transportation network point and the capacity attribute information between each transportation network point stored in the graph database, an optional transportation route plan is obtained by connecting at least two transportation network points in the graph database that have network attribute information and capacity attribute information that meet the basic conditions; and the transportation route planning result is obtained from the optional transportation route plan according to the filtering conditions. The transportation route planning results are displayed.

2. The method according to claim 1, characterized in that, The method further includes: When the original transportation information database is updated, the graph database is cleared, and the updated network attribute information of each transportation network and the transportation capacity attribute information between each transportation network are imported into the graph database for storage in the form of network-capacity-network.

3. The method according to claim 1, characterized in that, The presentation of the transportation route planning results includes: Based on the aforementioned transportation route constraints, the ranking index of the planning results is obtained; Based on the sorting index of the planning results, the transportation route planning results are displayed in sequence; the number of transportation route planning results is one or more. The method further includes: In response to the user's selection of a route element in the selected transportation route planning results, the element details and associated topology of the route element are displayed; the selected transportation route planning result is the transportation route planning result selected by the user from one or more displayed transportation route planning results.

4. The method according to claim 1, characterized in that, The basic conditions also include essential transit points; the optional transportation route planning includes these essential transit points; And / or, The basic conditions also include the fastest transportation arrival; the optional transportation route planning satisfies the condition of fastest transportation arrival between adjacent transportation points; And / or, The basic conditions also include minimum transportation resource loss; the optional transportation route planning meets the condition of minimum transportation resource loss between adjacent transportation network points; And / or, The basic conditions also include the maximum number of transportation network points; the number of transportation network points included in the optional transportation route plan is less than or equal to the maximum number of transportation network points.

5. The method according to claim 1, characterized in that, The screening criteria include a threshold for transportation resource loss. The step of obtaining the transportation route planning result from the optional transportation route plans based on the filtering conditions includes: The transportation route planning result is obtained based on the optional transportation route plans that have a value less than or equal to the transportation resource loss threshold. And / or, The filtering criteria include a transportation time threshold; obtaining the transportation route planning result from the optional transportation route plans based on the filtering criteria includes: The transportation route planning result is obtained based on the optional transportation route plans that have a duration less than or equal to the transportation time threshold.

6. A transportation route planning device based on a graph database, characterized in that, include: The graph database acquisition module is used to determine the network attribute information of each transportation network point and the transportation capacity attribute information between each transportation network point stored in the original transportation information database. The network attribute information of each transportation network point and the capacity attribute information between each transportation network point stored in the original transportation information database are imported into the graph database in the form of network point-capacity-network point; the graph database constructed based on the network attribute information of each transportation network point and the capacity attribute information between each transportation network point is obtained; the capacity attribute information includes the capacity type, which is divided into land and air. The constraint acquisition module is used to acquire user-defined transportation route constraints; the transportation route constraints include basic conditions and filtering conditions; the basic conditions include the origin and destination of the logistics transportation and the transportation departure time. The route planning acquisition module is used to acquire, based on the network attribute information of each transportation network point and the capacity attribute information between each transportation network point stored in the graph database, an optional transportation route plan formed by connecting at least two transportation network points with network attribute information and capacity attribute information that meet the basic conditions in the graph database. Based on the filtering criteria, the transportation route planning results are obtained from the optional transportation route plans; The route planning display module is used to display the transportation route planning results.

7. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the method of any one of claims 1 to 5.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1 to 5.

Images