Vehicle scheduling method, device, equipment, computer readable medium and program product

Abstract

The embodiment of the invention discloses a vehicle scheduling method, device and equipment, a computer readable medium and a program product. A specific embodiment of the method comprises the following steps: constructing a route transportation network diagram for a historical transportation data set; determining node attribute information corresponding to each graph node and edge attribute information corresponding to each edge in the route transportation network graph; according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, performing network graph simplification on the route transportation network graph to obtain a simplified route transportation network graph; screening out a bilateral round-trip route set and a trilateral loop route set corresponding to the target initial transportation position from the simplified route transportation network diagram; and executing vehicle scheduling of the vehicle set corresponding to the current time according to the bilateral round-trip route set and the trilateral loop route set. The implementation mode is related to vehicle intelligent scheduling, and each vehicle in a vehicle set can be accurately and efficiently scheduled, so that high-efficiency transportation of goods is realized.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of computer technology, and in particular to a vehicle dispatching method, apparatus, device, computer-readable medium, and program product. Background Art

[0002] At present, in the fast and rapid logistics transportation scenario, the reasonable dispatch of vehicles transporting goods can greatly improve the logistics efficiency and avoid the waste of transportation resources. For the dispatch of transportation vehicles, the usual method is: the relevant fleet managers manually dispatch each transportation vehicle.

[0003] However, the inventors have found that when the above method is used to dispatch vehicles, the following technical problems often occur:

[0004] Manual vehicle dispatching for each vehicle not only results in low decision-making efficiency, but also lags in vehicle dispatching. In addition, there is also the problem of inaccurate vehicle dispatching.

[0005] The above information disclosed in this Background section is only for enhancement of understanding of the background of the inventive concept and therefore it may contain information that does not form the prior art that is already known in this country to a person of ordinary skill in the art. Summary of the invention

[0006] The content of this disclosure is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this disclosure is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.

[0007] Some embodiments of the present disclosure propose vehicle dispatching methods, devices, equipment, computer-readable media, and program products to solve the technical problems mentioned in the above background technology section.

[0008] In a first aspect, some embodiments of the present disclosure provide a vehicle scheduling method, including: constructing a route transportation network graph for a historical transportation data set; determining node attribute information corresponding to each graph node and edge attribute information corresponding to each edge in the route transportation network graph; simplifying the route transportation network graph according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge to obtain a simplified route transportation network graph; screening out a bilateral round-trip route set and a three-side loop route set corresponding to a target starting transportation position from the simplified route transportation network graph; and executing vehicle scheduling of a vehicle set corresponding to the current time according to the bilateral round-trip route set and the three-side loop route set.

[0009] Optionally, the above-mentioned route transportation network diagram is simplified according to the node attribute information corresponding to the above-mentioned each graph node and the edge attribute information corresponding to the above-mentioned each edge to obtain a simplified route transportation network diagram, including: for each transportation route in the transportation route set included in the above-mentioned route transportation network diagram, the following determination steps are performed: according to the node attribute information corresponding to the above-mentioned each graph node and the edge attribute information corresponding to the above-mentioned each edge, the transportation duration and transportation cargo volume information of the above-mentioned transportation route within the target time period are determined; in response to determining that the above-mentioned transportation duration is less than the target duration and / or the above-mentioned transportation cargo volume information is less than the target transportation cargo volume value, the above-mentioned transportation route is determined as a route to be clipped; and each edge corresponding to the obtained set of routes to be clipped is removed from the above-mentioned route transportation network diagram to obtain a clipped route transportation network diagram as the above-mentioned simplified route transportation network diagram.

[0010] Optionally, the above-mentioned screening out the bilateral round-trip route set and the three-sided loop route set corresponding to the target starting transportation position from the above-mentioned simplified route transportation network graph includes: screening out the bilateral round-trip route set corresponding to the above-mentioned target starting transportation position from the above-mentioned simplified route transportation network graph; removing each edge corresponding to the above-mentioned bilateral round-trip route set from the above-mentioned simplified route transportation network graph to obtain a route transportation network graph after removal; screening out the three-sided loop route set corresponding to the above-mentioned target starting transportation position from the above-mentioned route transportation network graph after removal.

[0011] Optionally, the above-mentioned screening out of the bilateral round-trip route set corresponding to the above-mentioned target starting transportation position from the above-mentioned simplified route transportation network diagram includes: determining the first adjacent forward transportation site information in the above-mentioned simplified route transportation network diagram corresponding to the transportation site information corresponding to the above-mentioned target starting transportation position; for each first adjacent forward transportation site information in the above-mentioned first adjacent forward transportation site information set, performing the following first generation step: determining the second adjacent forward transportation site information set corresponding to the above-mentioned first adjacent forward transportation site information; in response to determining that the above-mentioned transportation site information is in the above-mentioned second adjacent forward transportation site information set, generating a bilateral round-trip route for the above-mentioned first adjacent forward transportation site information and the above-mentioned transportation site information.

[0012] Optionally, after generating a bilateral round-trip route for the first adjacent forward transport station information and the transport station information in response to determining that the transport station information is in the second adjacent forward transport station information set, the method includes: in response to determining that the transport station information is not in the second adjacent forward transport station information set, determining at least one first adjacent transport station information corresponding to the first adjacent forward transport station information, wherein a station distance between a station corresponding to the first adjacent transport station information and a station corresponding to the transport station information is less than a target value; for each first adjacent transport station information in the at least one first adjacent transport station information, performing the following second generating step: determining the first adjacent transport station information a third adjacent forward transportation station information set corresponding to the station information; generating determination information indicating whether the above-mentioned transportation station information is located in the above-mentioned third adjacent forward transportation station information set; in response to determining that there is target determination information in at least one of the obtained determination information, determining the first adjacent transportation station information set corresponding to the target determination information set as the first target adjacent transportation station information set, wherein the target determination information indicates that the above-mentioned transportation station information is located in the above-mentioned third adjacent forward transportation station information set; for each first target adjacent transportation station information in the above-mentioned first target adjacent transportation station information set, generating a bilateral round-trip route according to the above-mentioned transportation station information, the above-mentioned first target adjacent transportation station information and the corresponding first adjacent forward transportation station information.

[0013] Optionally, in response to determining that there is target determination information in at least one of the obtained determination information, after determining the first adjacent transportation site information set corresponding to the target determination information set as the first target adjacent transportation site information set, the method includes: in response to determining that there is no target determination information in the at least one determination information, determining at least one second adjacent transportation site information corresponding to the transportation site information, wherein the site distance between the site corresponding to the second adjacent transportation site information and the site corresponding to the transportation site information is less than the target value; for each first adjacent transportation site information in the at least one first adjacent transportation site information, determining whether the first adjacent transportation site information has a transportation relationship with each second adjacent transportation site information in the at least one second adjacent transportation site information. to generate transport relationship determination information; in response to the existence of target transport relationship determination information in the obtained transport relationship determination information set, determine the first adjacent transport station information set and the second adjacent transport station information set corresponding to the obtained target transport relationship determination information set as the second target adjacent transport station information set and the third target adjacent transport station information set, wherein the target transport relationship determination information represents that there is a transport relationship between the station corresponding to the first adjacent transport station information and the station corresponding to the second adjacent transport station information; for each second target adjacent transport station information in the above second target adjacent transport station information set, generate a bilateral round-trip route according to the above transport station information, the corresponding first adjacent forward transport station information, the above second target adjacent transport station information and the corresponding third target adjacent transport station information.

[0014] Optionally, the above-mentioned filtering out the three-side loop route set corresponding to the above-mentioned target starting transport position from the above-mentioned route transportation network diagram after removal includes: determining a fourth adjacent forward transport station information set in the above-mentioned route transportation network diagram after removal corresponding to the transport station information corresponding to the above-mentioned target starting transport position; for each fourth adjacent forward transport station information in the above-mentioned fourth adjacent forward transport station information set, executing the following third generation step: determining a fifth adjacent forward transport station information set in the above-mentioned route transportation network diagram after removal corresponding to the above-mentioned fourth adjacent forward transport station information; for each fourth adjacent forward transport station information in the above-mentioned fifth ... The invention relates to a method for generating a third generation route of a three-sided loop route set according to the present invention. The method comprises the following steps: determining a sixth adjacent forward transport station information set in the route transport network diagram after the removal corresponding to the fifth adjacent forward transport station information; determining the fifth adjacent forward transport station information as subsequent transport station information in response to determining that the transport station information is in the sixth adjacent forward transport station information set; generating a station combination information group for the fourth adjacent forward transport station information and the obtained subsequent transport station information group; and generating a three-sided loop route set according to the obtained station combination information group set and the corresponding fourth adjacent forward transport station information subset.

[0015] Optionally, in response to determining that the transport station information is in the sixth adjacent forward transport station information set, after determining the fifth adjacent forward transport station information as the subsequent transport station information, the method further includes: in response to determining that the transport station information is not in the sixth adjacent forward transport station information set, determining at least one third adjacent transport station information corresponding to the fifth adjacent forward transport station information; determining at least one fourth adjacent transport station information corresponding to the fourth adjacent forward transport station information corresponding to the fifth adjacent forward transport station information; determining at least one second adjacent transport station information corresponding to the transport station information; determining transport connection information between the transport station information, the at least one second adjacent transport station information, the corresponding fifth adjacent forward transport station information, the corresponding fourth adjacent forward transport station information, the at least one third adjacent transport station information and the at least one fourth adjacent transport station information to obtain a connection determination information group.

[0016] Optionally, before generating the three-side loop route set based on the obtained site combination information group set and the corresponding fourth adjacent forward transport site information subset, the method further includes: determining whether there is connection determination information in the obtained connection determination information group set that characterizes the support for cargo transportation between each site corresponding to each site information, as target connection determination information, to obtain a target connection determination information set; determining the transport route corresponding to each target connection determination information in the above target connection determination information set as a three-side loop route, to obtain a three-side loop route set.

[0017] In a second aspect, some embodiments of the present disclosure provide a vehicle scheduling device, including: a construction unit, configured to construct a route transportation network diagram for a historical transportation data set; a determination unit, configured to determine the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the above-mentioned route transportation network diagram; a network diagram simplification unit, configured to simplify the above-mentioned route transportation network diagram according to the node attribute information corresponding to the above-mentioned each graph node and the edge attribute information corresponding to the above-mentioned each edge, so as to obtain a simplified route transportation network diagram; a screening unit, configured to screen out a bilateral round-trip route set and a three-side loop route set corresponding to the target starting transportation position from the above-mentioned simplified route transportation network diagram; an execution unit, configured to execute vehicle scheduling of the corresponding vehicle set at the current time according to the above-mentioned bilateral round-trip route set and the above-mentioned three-side loop route set.

[0018] Optionally, the network diagram simplification unit can be configured to: for each transport route in the transport route set included in the above-mentioned route transport network diagram, perform the following determination steps: determine the transport duration and transport volume information of the above-mentioned transport route within the target time period based on the node attribute information corresponding to the above-mentioned each graph node and the edge attribute information corresponding to the above-mentioned each edge; in response to determining that the above-mentioned transport duration is less than the target duration and / or the above-mentioned transport volume information is less than the target transport volume value, determine the above-mentioned transport route as a route to be clipped; remove the edges corresponding to the obtained set of routes to be clipped from the above-mentioned route transport network diagram, and obtain a clipped route transport network diagram as the above-mentioned simplified route transport network diagram.

[0019] Optionally, the screening unit can be configured to: screen out a set of bilateral round-trip routes corresponding to the above-mentioned target starting transport position from the above-mentioned simplified route transportation network graph; remove each edge corresponding to the above-mentioned bilateral round-trip route set from the above-mentioned simplified route transportation network graph to obtain a route transportation network graph after removal; and screen out a set of three-edge loop routes corresponding to the above-mentioned target starting transport position from the above-mentioned route transportation network graph after removal.

[0020] Optionally, the screening unit can be configured to: determine the first adjacent forward transport site information set in the simplified route transport network diagram corresponding to the transport site information corresponding to the target starting transport position; for each first adjacent forward transport site information in the first adjacent forward transport site information set, perform the following first generation step: determine the second adjacent forward transport site information set corresponding to the first adjacent forward transport site information; in response to determining that the transport site information is in the second adjacent forward transport site information set, generate a bilateral round-trip route for the first adjacent forward transport site information and the transport site information.

[0021] Optionally, the screening unit may be configured to: in response to determining that the transport station information is not in the second adjacent forward transport station information set, determine at least one first adjacent transport station information corresponding to the first adjacent forward transport station information, wherein the station distance between the station corresponding to the first adjacent transport station information and the station corresponding to the transport station information is less than a target value; for each first adjacent transport station information in the at least one first adjacent transport station information, perform the following second generation step: determine a third adjacent forward transport station information set corresponding to the first adjacent transport station information; generate determination information indicating whether the transport station information is located in the third adjacent forward transport station information set; in response to determining that there is target determination information in the at least one determination information obtained, determine the first adjacent transport station information set corresponding to the target determination information set as the first target adjacent transport station information set, wherein the target determination information indicates that the transport station information is in the third adjacent forward transport station information set; for each first target adjacent transport station information in the first target adjacent transport station information set, generate a bilateral round-trip route according to the transport station information, the first target adjacent transport station information and the corresponding first adjacent forward transport station information.

[0022] Optionally, the screening unit may be configured to: in response to determining that there is no target determination information in the at least one determination information, determine at least one second adjacent transportation station information corresponding to the transportation station information, wherein the station distance between the station corresponding to the second adjacent transportation station information and the station corresponding to the transportation station information is less than the target value; for each first adjacent transportation station information in the at least one first adjacent transportation station information, determine whether the first adjacent transportation station information has a transportation relationship with each second adjacent transportation station information in the at least one second adjacent transportation station information, so as to generate transportation relationship determination information; in response to the existence of target transportation relationship determination information in the obtained transportation relationship determination information set, determine the first adjacent transportation station information set and the second adjacent transportation station information set corresponding to the obtained target transportation relationship determination information set as the second target adjacent transportation station information set and the third target adjacent transportation station information set, wherein the target transportation relationship determination information indicates that there is a transportation relationship between the station corresponding to the first adjacent transportation station information and the station corresponding to the second adjacent transportation station information; for each second target adjacent transportation station information in the second target adjacent transportation station information set, generate a bilateral round-trip route according to the transportation station information, the corresponding first adjacent forward transportation station information, the second target adjacent transportation station information and the corresponding third target adjacent transportation station information.

[0023] Optionally, the screening unit may be configured to: determine a fourth adjacent forward transport station information set in the route transport network diagram after removal corresponding to the transport station information corresponding to the target starting transport position; for each fourth adjacent forward transport station information in the fourth adjacent forward transport station information set, perform the following third generation step: determine a fifth adjacent forward transport station information set in the route transport network diagram after removal corresponding to the fourth adjacent forward transport station information; for each fifth adjacent forward transport station information in the fifth adjacent forward transport station information set, perform the following fourth generation step: determine a sixth adjacent forward transport station information set in the route transport network diagram after removal corresponding to the fifth adjacent forward transport station information; in response to determining that the transport station information is in the sixth adjacent forward transport station information set, determine the fifth adjacent forward transport station information as subsequent transport station information; generate a site combination information group for the fourth adjacent forward transport station information and the obtained subsequent transport station information group; and generate a three-side loop route set according to the obtained site combination information group set and the corresponding fourth adjacent forward transport station information subset.

[0024] Optionally, the screening unit can be configured to: in response to determining that the above-mentioned transport station information is not in the sixth adjacent forward transport station information set, determine at least one third adjacent transport station information corresponding to the above-mentioned fifth adjacent forward transport station information; determine at least one fourth adjacent transport station information corresponding to the fourth adjacent forward transport station information corresponding to the above-mentioned fifth adjacent forward transport station information; determine at least one second adjacent transport station information corresponding to the above-mentioned transport station information; determine the transport connection information between the above-mentioned transport station information, the above-mentioned at least one second adjacent transport station information, the corresponding fifth adjacent forward transport station information, the corresponding fourth adjacent forward transport station information, the above-mentioned at least one third adjacent transport station information and the above-mentioned at least one fourth adjacent transport station information, and obtain a connection determination information group.

[0025] Optionally, the screening unit can be configured to: determine whether there is connection determination information in the obtained connection determination information group set that represents the connection determination information corresponding to each site information and supports cargo transportation between each site, as the target connection determination information, to obtain a target connection determination information set; determine the transportation route corresponding to each target connection determination information in the above target connection determination information set, as the three-side loop route, to obtain a three-side loop route set.

[0026] In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any implementation manner in the first aspect.

[0027] In a fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the method described in any implementation manner in the first aspect is implemented.

[0028] In a fifth aspect, some embodiments of the present disclosure provide a computer program product, including a computer program, which implements the method described in any implementation manner in the above-mentioned first aspect when executed by a processor.

[0029] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the vehicle dispatching method of some embodiments of the present disclosure, each vehicle in the vehicle collection can be dispatched accurately and efficiently to achieve efficient transportation of goods. Specifically, the reason for the inaccuracy of the relevant vehicle dispatching is that the manual dispatching of each vehicle not only has low decision-making efficiency, but also has lag in vehicle dispatching. In addition, there is also the problem of inaccurate vehicle dispatching. Based on this, the vehicle dispatching method of some embodiments of the present disclosure first constructs a route transportation network diagram for a historical transportation data set to obtain the current transportation conditions of each route for the accurate dispatching of subsequent vehicles. Then, the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the above-mentioned route transportation network diagram are determined. Here, by determining the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, the network diagram is accurately simplified in the future. Then, according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, the above-mentioned route transportation network diagram is accurately simplified to obtain the simplified route transportation network diagram. Here, by accurately simplifying the network diagram, the routes with unstable cargo transportation can be effectively removed, making the subsequent vehicle scheduling more reasonable and accurate. Furthermore, the bilateral round-trip route set and the three-sided loop route set corresponding to the target starting transportation position are selected from the simplified route transportation network diagram as alternative freight transportation routes, which can improve transportation efficiency. Finally, according to the bilateral round-trip route set and the three-sided loop route set, the vehicle scheduling of the corresponding vehicle set at the current time is accurately performed. In summary, by using the route transportation network diagram, the bilateral round-trip route set and the three-sided loop route set as the subsequent alternative freight transportation routes are selected, which can not only accurately schedule each vehicle, but also reduce the uncertainty of vehicle use. In addition, by using the route transportation network diagram, not only the vehicle scheduling decision efficiency is high, but also there is no lag in vehicle scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that components and elements are not necessarily drawn to scale.

[0031] Figure 1 is a schematic diagram of an application scenario of a vehicle dispatching method according to some embodiments of the present disclosure;

[0032] Figure 2 is a flow chart of some embodiments of the vehicle dispatching method according to the present disclosure;

[0033] Figure 3 is a schematic diagram of a bilateral round-trip route of the first category in some embodiments of the vehicle dispatching method disclosed herein;

[0034] Figure 4 is a schematic diagram of a bilateral round-trip route of the second category in some embodiments of the vehicle dispatching method disclosed herein;

[0035] Figure 5 is a schematic diagram of a bilateral round-trip route of the third category in some embodiments of the vehicle dispatching method disclosed herein;

[0036] Figure 6 is a schematic diagram of a three-side loop route of the fourth category in some embodiments of the vehicle dispatching method disclosed herein;

[0037] Figure 7 is a schematic diagram of a three-sided loop route of the fifth category in some embodiments of the vehicle dispatching method disclosed herein;

[0038] Figure 8 are flow charts of other embodiments of the vehicle dispatching method according to the present disclosure;

[0039] Fig. 9 is a schematic diagram of the structure of some embodiments of the vehicle dispatching device according to the present disclosure;

[0040] Fig.10 It is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION

[0041] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments set forth herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0042] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

[0043] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0044] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0045] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0046] With regard to the collection, storage, and use of data (such as historical transportation data) involved in this disclosure, before performing corresponding operations, the relevant organizations or individuals shall fulfill obligations including conducting data security impact assessments, fulfilling the obligation to inform the data subject, and obtaining the authorization and consent of the data subject in advance.

[0047] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0048] Figure 1 It is a schematic diagram of an application scenario of the vehicle scheduling method according to some embodiments of the present disclosure.

[0049] exist Figure 1In the application scenario, first, the electronic device 101 can construct a route transportation network diagram 103 for the historical transportation data set 102. In this application scenario, for the route transportation network diagram 103, each node includes: A node, B node, C node, D node and E node. Each edge includes: "A->B" edge, "C->A" edge, "E->A" edge, "B->A" edge, "C->E" edge, "D->C" edge. Then, the electronic device 101 can determine the node attribute information corresponding to each graph node in the above-mentioned route transportation network diagram 103 and the edge attribute information corresponding to each edge. In this application scenario, each node attribute information 104 includes: A node attribute information 1041, B node attribute information 1042, C node attribute information 1043 and D node attribute information 1044. Each edge attribute information 105 includes: "A->B" edge attribute information 1051, "C->A" edge attribute information 1052, "E->A" edge attribute information 1053, "B->A" edge attribute information 1054, "C->E" edge attribute information 1056, and "D->C" edge attribute information 1057. Then, the electronic device 101 can simplify the route transportation network graph 103 according to the node attribute information corresponding to each of the above graph nodes and the edge attribute information corresponding to each of the above edges to obtain a simplified route transportation network graph 106. In this application scenario, the "C->E" edge and the "B->C" edge in the route transportation network graph 103 are removed to obtain a simplified route transportation network graph 106. Furthermore, the electronic device 101 can filter out a bilateral round-trip route set 107 and a triangular loop route set 108 corresponding to the target starting transportation position from the simplified route transportation network graph 106. In this application scenario, the bilateral round-trip route set 107 may include: a bilateral round-trip route 1071. The bilateral round-trip route 1071 may be an "A->B->A" route. The three-side loop route set 108 may include: a three-side loop route 1081. The three-side loop route 1081 may be an "A->D->C->A" route. Finally, the electronic device 101 may perform vehicle scheduling of the corresponding vehicle set at the current time according to the above bilateral round-trip route set 107 and the above three-side loop route set 108.

[0050] It should be noted that the electronic device 101 can be hardware or software. When the electronic device is hardware, it can be implemented as a distributed cluster consisting of multiple servers or terminal devices, or it can be implemented as a single server or a single terminal device. When the electronic device is embodied as software, it can be installed in the hardware devices listed above. It can be implemented as multiple software or software modules for providing distributed services, for example, or it can be implemented as a single software or software module. No specific limitation is made here.

[0051] It should be understood that Figure 1The number of electronic devices in the embodiment is only for illustration. Any number of electronic devices may be provided according to implementation requirements.

[0052] Continue to refer Figure 2 , shows a process 200 of some embodiments of the vehicle dispatching method according to the present disclosure. The vehicle dispatching method comprises the following steps:

[0053] Step 201 : construct a route transportation network diagram for a historical transportation dataset.

[0054] In some embodiments, the execution entity of the above vehicle dispatching method (for example Figure 1 The electronic device 101 shown can construct a route transportation network diagram for a historical transportation data set. The historical transportation data set can be a historical transportation record corresponding to each transportation route. In practice, the historical transportation record may include: route transportation departure time, route transportation volume, route transportation duration, route driving distance, and outlets passed by the route. The route transportation network diagram can represent the route map of each route for transporting goods. The nodes in the route transportation network diagram can be outlet information. In practice, the outlet information can be the identification information of the outlet. Specifically, each area (for example, a city) has at least one transportation outlet that can ship / receive goods. For example, Beijing has 4 transportation outlets, namely, Haidian District outlets, Chaoyang District outlets, Dongcheng District outlets, and Xicheng District outlets. The edges in the route transportation network diagram can represent the transportation relationship between the corresponding two outlets. That is, the edges in the route transportation network diagram are directed edges. The direction in the directed edge can represent the direction of cargo transportation. For example, the route transportation network diagram includes: "A outlet->B outlet" corresponding to the edge. The edge corresponding to "A network point -> B network point" represents the existence of a freight transportation task from "A network point" to "B network point".

[0055] As an example, the execution entity may construct a route transportation network diagram for a historical transportation data set through data statistics.

[0056] Step 202: Determine the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the route transportation network graph.

[0057] In some embodiments, the above-mentioned execution entity may determine the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the above-mentioned route transportation network graph. The node attribute information may be an attribute information set corresponding to a node attribute set. There is a one-to-one correspondence between the node attributes in the node attribute set and the node attribute information in the node attribute information set. The node attribute may be a network point attribute corresponding to a network point. The node attribute set may include, but is not limited to, at least one of the following: network point name, network point longitude and latitude, and adjacent network point information set. The edge attribute information may be an attribute information set corresponding to the edge attribute set. Among them, there is a one-to-one correspondence between the edge attributes in the edge attribute set and the attribute information in the attribute information set. The edge attribute may characterize the network point connection attribute between two connected network points. In practice, the edge attribute set may include, but is not limited to, at least one of the following: the distance between connected network points, the transportation time between connected network points, and the longitude and latitude difference between connected network points.

[0058] As an example, the execution subject may determine the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the route transportation network graph by means of information query.

[0059] Step 203, simplifying the route transportation network graph according to the node attribute information corresponding to each of the graph nodes and the edge attribute information corresponding to each of the edges, to obtain a simplified route transportation network graph.

[0060] In some embodiments, the execution entity may simplify the route transportation network diagram according to the node attribute information corresponding to each of the graph nodes and the edge attribute information corresponding to each of the edges to obtain a simplified route transportation network diagram.

[0061] As an example, first, the execution subject may determine the business hours of the outlets corresponding to each graph node according to the node attribute information corresponding to each graph node. Then, the execution subject may determine the distances of adjacent outlets corresponding to each edge according to the edge attribute information corresponding to each edge. Next, the graph nodes and corresponding edges whose corresponding outlet business hours are not in the target time period are removed from the route transportation network graph, and the edges whose adjacent outlet distances are greater than a predetermined value are removed to obtain a simplified route transportation network graph.

[0062] Step 204: Filter out a set of bilateral round-trip routes and a set of trilateral loop routes corresponding to the target starting transport location from the simplified route transport network diagram.

[0063] In some embodiments, the execution subject may filter out a bilateral round-trip route set and a trilateral loop route set corresponding to the target starting transport position from the simplified route transport network diagram. The target starting transport position may be a starting transport position. Specifically, the starting transport position may be a starting transport point. For example, the starting transport point may be a point in Haidian District, Beijing. The bilateral round-trip route set includes at least one bilateral round-trip route. The trilateral loop route set includes at least one trilateral round-trip route. The bilateral round-trip route may be a route that goes back and forth through two regions. Here, each region has at least one corresponding transport point. In practice, each region may be each city or each province. For example, at least one transport point corresponding to Beijing may include: a point in Haidian District, a point in Chaoyang District, a point in Dongcheng District, and a point in Xicheng District. For another example, at least one transport point corresponding to Tianjin may include: a point in Heping District, a point in Jinnan District, a point in Hedong District, and a point in Hexi District. For example, the bilateral round-trip route may be a route between "points corresponding to Beijing -> points corresponding to Tianjin -> points corresponding to Beijing". The trilateral loop route may be a route that goes back and forth through three regions. For example, the three-side loop route may be a route between “a network point corresponding to Beijing -> a network point corresponding to Tianjin -> a network point corresponding to Shijiazhuang -> a network point corresponding to Beijing”.

[0064] As an example, the execution subject may use a breadth-first search (BFS) method to filter out a set of bilateral round-trip routes and a set of three-sided loop routes corresponding to the target starting transportation location from the simplified route transportation network diagram.

[0065] In some optional implementations of some embodiments, the above-mentioned screening out the bilateral round-trip route set and the trilateral loop route set corresponding to the target starting transportation position from the above-mentioned simplified route transportation network diagram may include the following steps:

[0066] In the first step, the execution entity may select a set of bilateral round-trip routes corresponding to the target starting transport location from the simplified route transport network diagram.

[0067] As an example, the execution subject may use a breadth-first traversal method to select a set of bilateral round-trip routes corresponding to the target starting transportation position from the simplified route transportation network diagram.

[0068] In the second step, the execution entity may remove the edges corresponding to the bilateral round-trip route set from the simplified route transportation network graph to obtain a route transportation network graph after removal.

[0069] In the third step, the execution entity may select a set of three-side loop routes corresponding to the target starting transport position from the removed route transport network diagram.

[0070] As an example, the execution subject may use a breadth-first traversal method to filter out a set of three-side loop routes corresponding to the target starting transport position from the removed route transport network graph.

[0071] Optionally, the above-mentioned screening out the bilateral round-trip route set corresponding to the above-mentioned target starting transportation position from the above-mentioned simplified route transportation network diagram may include the following steps:

[0072] In the first step, the execution subject may determine the first adjacent forward transport station information set in the simplified route transport network diagram corresponding to the transport station information corresponding to the target starting transport position, wherein the first adjacent forward transport station information may be the node information of the next connection node connected to the node corresponding to the target starting transport position.

[0073] As an example, the execution subject may determine the first adjacent forward transport station information set in the simplified route transport network graph corresponding to the transport station information corresponding to the target starting transport position by querying the graph node connection relationship.

[0074] In the second step, for each first adjacent forward transportation site information in the first adjacent forward transportation site information set, the execution subject may perform the following first generation step:

[0075] Sub-step 1: determine a second adjacent forward transport station information set corresponding to the first adjacent forward transport station information. The second adjacent forward transport station information in the second adjacent forward transport station information set may be node information of the next node of the node corresponding to the first adjacent forward transport station information.

[0076] Sub-step 2, in response to determining that the above-mentioned transportation station information is in the above-mentioned second adjacent forward transportation station information set, generating a bilateral round-trip route for the above-mentioned first adjacent forward transportation station information and the above-mentioned transportation station information.

[0077] As an example, see Figure 3 , Figure 3 The first category of bilateral round-trip routes is shown. The first category may be a category without empty runs. The node corresponding to the target starting transport position may be Node A, whose corresponding area is Area A. Node B, whose corresponding area is Area B, is the next connection node of Node A. Similarly, Node A is also the next connection node of Node B, and the corresponding routes of "Node A->Node B->Node A" constitute a bilateral round-trip route.

[0078] Optionally, after generating a bilateral round-trip route for the first adjacent forward transportation site information and the transportation site information in response to determining that the transportation site information is in the second adjacent forward transportation site information set, the method comprises the following steps:

[0079] In the first step, in response to determining that the transport station information is not in the second adjacent forward transport station information set, the execution entity may determine at least one first adjacent transport station information corresponding to the first adjacent forward transport station information. The station distance between the station corresponding to the first adjacent transport station information and the station corresponding to the transport station information is less than a target value. In practice, the target value may be a preset value. For example, the target value may be 100 km.

[0080] The station corresponding to the first adjacent forward transport station information and at least one station corresponding to at least one first adjacent transport station information may be in the same area. And there is no cargo transportation task between the station corresponding to the first adjacent forward transport station information and the station corresponding to the first adjacent transport station information. That is, in the simplified route transport network diagram, there is no node connection relationship between the node corresponding to the first adjacent forward transport station information and at least one node corresponding to at least one first adjacent transport station information.

[0081] In the second step, for each piece of first adjacent transport station information in the at least one first adjacent transport station information, the execution subject may perform the following second generation step:

[0082] Sub-step 1: The execution subject may determine a third adjacent forward transport station information set corresponding to the first adjacent transport station information, wherein the third adjacent forward transport station information is node information of the next node of the node corresponding to the first adjacent transport station information.

[0083] In sub-step 2, the execution entity may generate confirmation information indicating whether the transport station information is located in the third adjacent forward transport station information set. The confirmation information includes: information indicating that the transport station information is located in the third adjacent forward transport station information set, and information indicating that the transport station is not located in the third adjacent forward transport station information set.

[0084] As an example, the execution subject may generate the determination information indicating whether the transportation station information is located in the third adjacent forward transportation station information set by simplifying the node connection relationship of each node in the route transportation network diagram.

[0085] In the third step, in response to determining that the at least one determination information obtained contains target determination information, the execution subject may determine the first adjacent transport station information set corresponding to the target determination information set as the first target adjacent transport station information set, wherein the target determination information indicates that the transport station information is in the third adjacent forward transport station information set.

[0086] The fourth step is to generate a bilateral round-trip route for each first target adjacent transport station information in the first target adjacent transport station information set according to the transport station information, the first target adjacent transport station information and the corresponding first adjacent forward transport station information.

[0087] As an example, for each first target adjacent transport station information in the above-mentioned first target adjacent transport station information set, the route of "transport station information->first target adjacent transport station information->corresponding second adjacent forward transport station information->transport station information" is determined as a bilateral round-trip route.

[0088] As an example, see Figure 4 , Figure 4 The second category of bilateral round-trip routes is shown. The second category may be a category with a period of empty driving. The node corresponding to the target starting transport position may be Node A whose corresponding area is Area A. Node B whose corresponding area is Area B is the next connection node of Node A. Node C whose corresponding area is Area B is the next connection node of Node B. Node A is the next connection node of Node C. Then the corresponding routes of "Node A->Node B->Node C->Node A" constitute a bilateral round-trip route.

[0089] Optionally, in response to determining that there is target determination information in the at least one determination information obtained, after determining the first adjacent transport site information set corresponding to the target determination information set as the first target adjacent transport site information set, the method includes the following steps:

[0090] In the first step, in response to determining that the target determination information does not exist in the at least one determination information, the execution subject may determine at least one second adjacent transportation station information corresponding to the transportation station information, wherein the station distance between the station corresponding to the second adjacent transportation station information and the station corresponding to the transportation station information is less than the target value.

[0091] In the second step, for each first adjacent transport station information in the at least one first adjacent transport station information, the execution entity may determine whether the first adjacent transport station information has a transport relationship with each second adjacent transport station information in the at least one second adjacent transport station information to generate transport relationship determination information.

[0092] In the third step, in response to the existence of the target transportation relationship determination information in the obtained transportation relationship determination information set, the above-mentioned execution subject can determine the first adjacent transportation station information set and the second adjacent transportation station information set corresponding to the obtained target transportation relationship determination information set as the second target adjacent transportation station information set and the third target adjacent transportation station information set. Among them, the target transportation relationship determination information represents that there is a transportation relationship between the station corresponding to the first adjacent transportation station information and the station corresponding to the second adjacent transportation station information. Specifically, the target transportation relationship determination information may include that there is a node connection relationship between the station corresponding to the first adjacent transportation station information and the node corresponding to the second adjacent transportation station information in the simplified route transportation network diagram. The target transportation relationship determination information in the target transportation relationship determination information set has corresponding first adjacent transportation station information and corresponding second adjacent transportation station information.

[0093] In the fourth step, for each second target adjacent transportation station information in the above-mentioned second target adjacent transportation station information set, the above-mentioned execution entity can generate a bilateral round-trip route based on the above-mentioned transportation station information, the corresponding first adjacent forward transportation station information, the above-mentioned second target adjacent transportation station information and the corresponding third target adjacent transportation station information.

[0094] As an example, for each second target adjacent transport station information in the above-mentioned second target adjacent transport station information set, the route of "transport station information->first adjacent forward transport station information->second target adjacent transport station information->corresponding third target adjacent transport station information" is determined as a bilateral round-trip route.

[0095] As an example, see Figure 5 , Figure 5 The third category of bilateral round-trip routes is shown. The third category may be a category with two sections of empty driving. The node corresponding to the target starting transport position may be Node A whose corresponding area is Area A. Node B whose corresponding area is Area B is the next connection node of Node A. Node C whose corresponding area is Area B is the next connection node of Node B. Node A is the next connection node of Node C. Node D whose corresponding area is Area A is the next connection node of Node C. Then the corresponding routes of "Node A->Node B->Node C->Node D->Node A" constitute a bilateral round-trip route.

[0096] In some optional implementations of some embodiments, the above-mentioned screening out the three-side loop route set corresponding to the above-mentioned target starting transport position from the above-mentioned route transportation network diagram after removal may include the following steps:

[0097] In the first step, the execution subject may determine the fourth adjacent forward transport station information set in the route transport network diagram after removal, corresponding to the transport station information corresponding to the target starting transport position. The corresponding node of the fourth adjacent forward transport station information in the fourth adjacent forward transport station information set in the route transport network diagram after removal is the next node of the corresponding node of the target starting transport position. That is, the corresponding node of the target starting transport position points to the corresponding node of the fourth adjacent forward transport station information.

[0098] The second step is to execute the following third generation step for each fourth adjacent forward transportation station information in the fourth adjacent forward transportation station information set:

[0099] Sub-step 1: The execution entity may determine a fifth adjacent forward transportation station information set in the removed route transportation network diagram corresponding to the fourth adjacent forward transportation station information.

[0100] Sub-step 2, for each fifth adjacent forward transportation station information in the fifth adjacent forward transportation station information set, execute the following fourth generation step:

[0101] In the first sub-step, the execution subject may determine the sixth adjacent forward transport station information set in the route transport network diagram after removal, corresponding to the fifth adjacent forward transport station information. The corresponding node of the sixth adjacent forward transport station information in the sixth adjacent forward transport station information set in the route transport network diagram after removal is the next node of the corresponding node of the fifth adjacent forward transport station information. That is, the corresponding node of the fifth adjacent forward transport station information points to the corresponding node of the sixth adjacent forward transport station information.

[0102] In the second sub-step, in response to determining that the transport station information is in the sixth adjacent forward transport station information set, the execution subject may determine the fifth adjacent forward transport station information as subsequent transport station information, wherein the subsequent transport station information may be station information subsequently combined into a three-side loop route.

[0103] Sub-step 3: the execution entity may generate a site combination information group for the fourth adjacent forward transport site information and the obtained subsequent transport site information group.

[0104] As an example, the execution entity may combine the fourth adjacent forward transport station information with each subsequent transport station information in the subsequent transport station information group to generate station combination information, thereby obtaining a station combination information group.

[0105] The third step is to generate a three-side loop route set based on the obtained site combination information set and the corresponding fourth adjacent forward transport site information subset, wherein the site combination information set in the site combination information set and the fourth adjacent forward transport site information in the fourth adjacent forward transport site information subset have a one-to-one correspondence.

[0106] As an example, the execution entity may combine each site information group in the site information group set, the corresponding fourth adjacent forward transport site information and the transport site information corresponding to the target starting transport position to obtain combined site information to generate a three-sided loop route.

[0107] As an example, see Figure 6 , Figure 6 The third-side loop route of the fourth category is shown. The fourth category may be a category in which there is no empty driving. The node corresponding to the target starting transport position may be Node A whose corresponding area is Area A. Node B whose corresponding area is Area B is the next connection node of Node A. Node C whose corresponding area is Area C is the next connection node of Node B. Node A is the next connection node of Node C. Then the corresponding routes of "Node A->Node B->Node C->Node A" constitute a bilateral round-trip route.

[0108] Optionally, in response to determining that the transport station information is in the sixth adjacent forward transport station information set, after determining the fifth adjacent forward transport station information as subsequent transport station information, the method further includes the following steps:

[0109] In the first step, in response to determining that the transport station information is not in the sixth adjacent forward transport station information set, the execution entity may determine at least one third adjacent transport station information corresponding to the fifth adjacent forward transport station information.

[0110] In a second step, the execution entity may determine at least one fourth adjacent transport station information corresponding to the fourth adjacent forward transport station information corresponding to the fifth adjacent forward transport station information.

[0111] In a third step, the execution entity may determine at least one second adjacent transport station information corresponding to the transport station information.

[0112] In the fourth step, the above-mentioned execution entity can determine the transportation connection information between the above-mentioned transportation site information, the above-mentioned at least one second adjacent transportation site information, the corresponding fifth adjacent forward transportation site information, the corresponding fourth adjacent forward transportation site information, the above-mentioned at least one third adjacent transportation site information and the above-mentioned at least one fourth adjacent transportation site information, and obtain a connection determination information group.

[0113] As an example, the above-mentioned execution entity can determine the transportation connection information between the above-mentioned transportation station information, the above-mentioned at least one second adjacent transportation station information, the corresponding fifth adjacent forward transportation station information, the corresponding fourth adjacent forward transportation station information, the above-mentioned at least one third adjacent transportation station information and the above-mentioned at least one fourth adjacent transportation station information by querying the node flow direction of the transportation network graph after the route is removed, and obtain a connection determination information group.

[0114] Optionally, before generating the three-side loop route set according to the obtained site combination information group set and the corresponding fourth adjacent forward transportation site information subset, the method further comprises the following steps:

[0115] In the first step, the execution entity can determine whether the obtained connection determination information group set contains connection determination information representing the information of each site corresponding to the connection determination information supporting cargo transportation between each site, and obtain the target connection determination information set as the target connection determination information.

[0116] In a second step, the execution entity may determine the transportation route corresponding to each target connection determination information in the target connection determination information set as a three-side loop route to obtain a three-side loop route set.

[0117] As an example, see Figure 7 , Figure 7 The third-side loop route of the fifth category is shown. The fifth category may be a category in which there are three sections of empty driving. The node corresponding to the target starting transport position may be node A whose corresponding area is area A. Node D is the next node of node A. Among them, node D and node A are nodes in area A. Node B whose corresponding area is area B is the next connection node of node D. Node E is the next node of node B. Among them, node B and node E are nodes in area B. Node C whose corresponding area is area C is the next connection node of node E. Node F is the next node of node C. Among them, node C and node F are nodes in area C. Then the corresponding routes of "node A->node D->node B->node E->node C->node F->node A" constitute a third-side loop route.

[0118] Step 205 , executing vehicle scheduling of the vehicle set corresponding to the current time according to the bilateral round-trip route set and the trilateral loop route set.

[0119] In some embodiments, the execution subject may execute vehicle dispatch of a vehicle set corresponding to the current time according to the bilateral round-trip route set and the trilateral loop route set, wherein the vehicles in the vehicle set may be vehicles to be dispatched.

[0120] As an example, the execution entity may use the bilateral round-trip route set and the trilateral loop route set as the routes to be traveled, and execute vehicle scheduling of the vehicle set at the current time.

[0121] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the vehicle dispatching method of some embodiments of the present disclosure, each vehicle in the vehicle collection can be dispatched accurately and efficiently to achieve efficient transportation of goods. Specifically, the reason for the inaccuracy of the relevant vehicle dispatching is that the manual dispatching of each vehicle not only has low decision-making efficiency, but also has lag in vehicle dispatching. In addition, there is also the problem of inaccurate vehicle dispatching. Based on this, the vehicle dispatching method of some embodiments of the present disclosure first constructs a route transportation network diagram for a historical transportation data set to obtain the current transportation conditions of each route for the accurate dispatching of subsequent vehicles. Then, the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the above-mentioned route transportation network diagram are determined. Here, by determining the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, the network diagram is accurately simplified in the future. Then, according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, the above-mentioned route transportation network diagram is accurately simplified to obtain the simplified route transportation network diagram. Here, by accurately simplifying the network diagram, the routes with unstable cargo transportation can be effectively removed, making the subsequent vehicle scheduling more reasonable and accurate. Furthermore, the bilateral round-trip route set and the three-sided loop route set corresponding to the target starting transportation position are selected from the simplified route transportation network diagram as alternative freight transportation routes, which can improve transportation efficiency. Finally, according to the bilateral round-trip route set and the three-sided loop route set, the vehicle scheduling of the corresponding vehicle set at the current time is accurately performed. In summary, by using the route transportation network diagram, the bilateral round-trip route set and the three-sided loop route set as the subsequent alternative freight transportation routes are selected, which can not only accurately schedule each vehicle, but also reduce the uncertainty of vehicle use. In addition, by using the route transportation network diagram, not only the vehicle scheduling decision efficiency is high, but also there is no lag in vehicle scheduling.

[0122] Further references Figure 8 , shows a process 800 of another embodiment of the vehicle dispatching method according to the present disclosure. The vehicle dispatching method comprises the following steps:

[0123] Step 801, constructing a route transportation network diagram for a historical transportation dataset.

[0124] Step 802: Determine the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the route transportation network graph.

[0125] Step 803: for each transport route in the transport route set included in the route transport network diagram, perform the following determination steps:

[0126] Step 8031, based on the node attribute information corresponding to each of the graph nodes and the edge attribute information corresponding to each of the edges, determine the transportation duration and transportation volume information of the transportation route within the target time period.

[0127] In some embodiments, an execution entity (e.g. Figure 1 The electronic device 101 shown can determine the transportation duration and transportation volume information of the above-mentioned transportation route within the target time period according to the node attribute information corresponding to the above-mentioned each graph node and the edge attribute information corresponding to the above-mentioned each edge. Among them, the target time period can be a pre-set time period. For example, the time period can be a half-year time period. The transportation duration can be the total duration of cargo transportation. The transportation volume information can be the total cargo transportation volume.

[0128] As an example, the above-mentioned execution entity can calculate the total transportation time and total transportation volume of the transportation route within half a year based on the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge.

[0129] Step 8032, in response to determining that the above-mentioned transportation duration is less than the target duration and / or the above-mentioned transportation cargo volume information is less than the target transportation cargo volume value, the above-mentioned transportation route is determined as a route to be cut.

[0130] In some embodiments, in response to determining that the transport duration is less than the target duration and / or the transport volume information is less than the target transport volume value, the execution entity may determine the transport route as a route to be cut. The target duration may be a preset value. For example, the target duration may be 100 hours. The target transport volume value may be a preset value. For example, the target transport volume value may be 45m 3 The route to be clipped may be a route whose corresponding edge is to be deleted.

[0131] Step 804, removing the edges corresponding to the obtained set of routes to be clipped from the above route transportation network graph, and obtaining a clipped route transportation network graph as the above simplified route transportation network graph.

[0132] In some embodiments, the execution entity may remove the edges corresponding to the obtained set of routes to be pruned from the route transportation network graph to obtain a pruned route transportation network graph as the simplified route transportation network graph.

[0133] Step 805: Filter out a set of bilateral round-trip routes and a set of trilateral loop routes corresponding to the target starting transport location from the simplified route transport network diagram.

[0134] Step 806: According to the bilateral round-trip route set and the three-sided loop route set, vehicle scheduling of the vehicle set corresponding to the current time is performed.

[0135] In some embodiments, the specific implementation of steps 801-802, 805-806 and the technical effects thereof can be referred to in Figure 2 The steps 201-202 and 204-205 in the corresponding embodiment are not described in detail here.

[0136] from Figure 8 It can be seen that Figure 2 Compared with the description of some corresponding embodiments, Figure 8 The process 800 of the vehicle scheduling method in some corresponding embodiments further emphasizes deleting each edge corresponding to the route to be clipped based on the transportation duration and transportation volume information within the target time period, so as to obtain a more accurate simplified route transportation network diagram.

[0137] Further references Fig. 9 As an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of a vehicle dispatching device, and these device embodiments are Figure 2 Corresponding to the method embodiments shown, the vehicle dispatching device can be specifically applied to various electronic devices.

[0138] like Fig. 9 As shown, a vehicle dispatching device 900 includes: a construction unit 901, a determination unit 902, a network diagram simplification unit 903, a screening unit 904 and an execution unit 905. The construction unit 901 is configured to construct a route transportation network diagram for a historical transportation data set; the determination unit 902 is configured to determine the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the route transportation network diagram; the network diagram simplification unit 903 is configured to simplify the route transportation network diagram according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, so as to obtain a simplified route transportation network diagram; the screening unit 904 is configured to screen out a bilateral round-trip route set and a trilateral loop route set corresponding to a target starting transportation position from the simplified route transportation network diagram; the execution unit 905 is configured to perform vehicle dispatching of a vehicle set corresponding to the current time according to the bilateral round-trip route set and the trilateral loop route set.

[0139] In some optional implementations of some embodiments, the network diagram simplification unit 903 may be further configured to: for each transport route in the transport route set included in the route transport network diagram, perform the following determination steps: determine the transport duration and transport volume information of the transport route within the target time period based on the node attribute information corresponding to each of the graph nodes and the edge attribute information corresponding to each of the edges; in response to determining that the transport duration is less than the target duration and / or the transport volume information is less than the target transport volume value, determine the transport route as a route to be clipped; remove each edge corresponding to the obtained set of routes to be clipped from the route transport network diagram to obtain a clipped route transport network diagram as the simplified route transport network diagram.

[0140] In some optional implementations of some embodiments, the screening unit 904 may be further configured to: screen out a set of bilateral round-trip routes corresponding to the target starting transport position from the simplified route transport network diagram; remove the edges corresponding to the bilateral round-trip route set from the simplified route transport network diagram to obtain a route transport network diagram after removal; and screen out a set of three-edge loop routes corresponding to the target starting transport position from the route transport network diagram after removal.

[0141] In some optional implementations of some embodiments, the screening unit 904 may be further configured to: determine a first adjacent forward transport station information set in the simplified route transport network diagram corresponding to the transport station information corresponding to the target starting transport position; for each first adjacent forward transport station information in the first adjacent forward transport station information set, perform the following first generation step: determine a second adjacent forward transport station information set corresponding to the first adjacent forward transport station information; in response to determining that the transport station information is in the second adjacent forward transport station information set, generate a bilateral round-trip route for the first adjacent forward transport station information and the transport station information.

[0142] In some optional implementations of some embodiments, the screening unit 904 may be further configured to: in response to determining that the above-mentioned transport station information is not in the above-mentioned second adjacent forward transport station information set, determine at least one first adjacent transport station information corresponding to the first adjacent forward transport station information, wherein the station distance between the station corresponding to the first adjacent transport station information and the station corresponding to the above-mentioned transport station information is less than the target value; for each first adjacent transport station information in the above-mentioned at least one first adjacent transport station information, perform the following second generation step: determine a third adjacent forward transport station information set corresponding to the above-mentioned first adjacent transport station information; generate determination information indicating whether the above-mentioned transport station information is located in the above-mentioned third adjacent forward transport station information set; in response to determining that there is target determination information in the obtained at least one determination information, determine the first adjacent transport station information set corresponding to the target determination information set as the first target adjacent transport station information set, wherein the target determination information indicates that the above-mentioned transport station information is in the above-mentioned third adjacent forward transport station information set; for each first target adjacent transport station information in the above-mentioned first target adjacent transport station information set, generate a bilateral round-trip route according to the above-mentioned transport station information, the above-mentioned first target adjacent transport station information and the corresponding first adjacent forward transport station information.

[0143] In some optional implementations of some embodiments, the screening unit 904 may be further configured to: in response to determining that there is no target determination information in the at least one determination information, determine at least one second adjacent transport station information corresponding to the transport station information, wherein the station distance between the station corresponding to the second adjacent transport station information and the station corresponding to the transport station information is less than the target value; for each first adjacent transport station information in the at least one first adjacent transport station information, determine whether the first adjacent transport station information has a transport relationship with each second adjacent transport station information in the at least one second adjacent transport station information, so as to generate transport relationship determination information; in response to the obtained transport relationship determination information There is target transportation relationship determination information in a certain information set, and the first adjacent transportation station information set and the second adjacent transportation station information set corresponding to the obtained target transportation relationship determination information set are determined as the second target adjacent transportation station information set and the third target adjacent transportation station information set, wherein the target transportation relationship determination information represents that there is a transportation relationship between the station corresponding to the first adjacent transportation station information and the station corresponding to the second adjacent transportation station information; for each second target adjacent transportation station information in the above second target adjacent transportation station information set, a bilateral round-trip route is generated according to the above transportation station information, the corresponding first adjacent forward transportation station information, the above second target adjacent transportation station information and the corresponding third target adjacent transportation station information.

[0144] In some optional implementations of some embodiments, the screening unit 904 may be further configured to: determine a fourth adjacent forward transport station information set in the route transport network diagram after removal corresponding to the transport station information corresponding to the target starting transport position; for each fourth adjacent forward transport station information in the fourth adjacent forward transport station information set, perform the following third generation step: determine a fifth adjacent forward transport station information set in the route transport network diagram after removal corresponding to the fourth adjacent forward transport station information; for each fifth adjacent forward transport station information in the fifth adjacent forward transport station information set, perform the following fourth generation step: determine a sixth adjacent forward transport station information set in the route transport network diagram after removal corresponding to the fifth adjacent forward transport station information; in response to determining that the transport station information is in the sixth adjacent forward transport station information set, determine the fifth adjacent forward transport station information as subsequent transport station information; generate a site combination information group for the fourth adjacent forward transport station information and the obtained subsequent transport station information group; and generate a three-side loop route set according to the obtained site combination information group set and the corresponding fourth adjacent forward transport station information subset.

[0145] In some optional implementations of some embodiments, the screening unit 904 may be further configured to: in response to determining that the above-mentioned transport station information is not in the sixth adjacent forward transport station information set, determine at least one third adjacent transport station information corresponding to the above-mentioned fifth adjacent forward transport station information; determine at least one fourth adjacent transport station information corresponding to the fourth adjacent forward transport station information corresponding to the above-mentioned fifth adjacent forward transport station information; determine at least one second adjacent transport station information corresponding to the above-mentioned transport station information; determine the transport connection information between the above-mentioned transport station information, the above-mentioned at least one second adjacent transport station information, the corresponding fifth adjacent forward transport station information, the corresponding fourth adjacent forward transport station information, the above-mentioned at least one third adjacent transport station information and the above-mentioned at least one fourth adjacent transport station information, and obtain a connection determination information group.

[0146] In some optional implementations of some embodiments, the screening unit 904 may be further configured to: determine whether the connection determination information group set obtained contains connection determination information that represents the information of each site and corresponds to connection determination information that supports cargo transportation between each site, and obtain a target connection determination information set as the target connection determination information; determine the transportation route corresponding to each target connection determination information in the above target connection determination information set as a three-side loop route, and obtain a three-side loop route set.

[0147] It is understandable that the units recorded in the vehicle dispatching device 900 are similar to those in the reference Figure 2Therefore, the operations, features and beneficial effects described above for the method are also applicable to the vehicle dispatching device 900 and the units contained therein, and will not be repeated here.

[0148] Reference below Fig.10 , which shows an electronic device (eg, Figure 1 Schematic diagram of the structure of the electronic device 101)1000. Fig.10 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0149] like Fig.10 As shown, the electronic device 1000 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 1001, which can perform various appropriate actions and processes according to a program stored in a read-only memory 1002 or a program loaded from a storage device 1008 to a random access memory 1003. Various programs and data required for the operation of the electronic device 1000 are also stored in the random access memory 1003. The processing device 1001, the read-only memory 1002, and the random access memory 1003 are connected to each other via a bus 1004. An input / output interface 1005 is also connected to the bus 1004.

[0150] Typically, the following devices may be connected to the input / output interface 1005: an input device 1006 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 1007 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 1008 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 may allow the electronic device 1000 to communicate with other devices wirelessly or by wire to exchange data. Although Fig.10 The electronic device 1000 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead. Fig.10 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0151] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through the communication device 1009, or installed from the storage device 1008, or installed from the read-only memory 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

[0152] It should be noted that the computer-readable medium in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In some embodiments of the present disclosure, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In some embodiments of the present disclosure, the computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0153] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0154] The computer-readable medium may be included in the electronic device; or it may exist independently without being installed in the electronic device. The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: constructs a route transportation network diagram for the historical transportation data set; determines the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge in the route transportation network diagram; simplifies the route transportation network diagram according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, and obtains a simplified route transportation network diagram; selects a bilateral round-trip route set and a three-side loop route set corresponding to the target starting transportation position from the simplified route transportation network diagram; and performs vehicle scheduling of the corresponding vehicle set at the current time according to the bilateral round-trip route set and the three-side loop route set.

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

[0156] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0157] The units described in some embodiments of the present disclosure may be implemented by software or hardware. The units described may also be set in a processor, for example, it may be described as: a processor includes a construction unit, a determination unit, a network diagram simplification unit, a screening unit, and an execution unit. The names of these units do not constitute a limitation on the units themselves in some cases, for example, the construction unit may also be described as a "unit for constructing a route transportation network diagram for a historical transportation data set".

[0158] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0159] Some embodiments of the present disclosure also provide a computer program product, including a computer program, which implements any of the above-mentioned vehicle scheduling methods when executed by a processor.

[0160] The above descriptions are only some preferred embodiments of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by a specific combination of the above-mentioned technical features, but should also cover other technical solutions formed by any combination of the above-mentioned technical features or their equivalent features without departing from the above-mentioned inventive concept. For example, the above-mentioned features are replaced with the technical features with similar functions disclosed in the embodiments of the present disclosure (but not limited to) and the technical solutions formed.

Claims

1. A vehicle dispatching method, comprising: Construct route transportation network graphs for historical transportation datasets; Determine node attribute information corresponding to each graph node and edge attribute information corresponding to each edge in the route transportation network graph; Simplifying the route transportation network graph according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge to obtain a simplified route transportation network graph; Filter out a set of bilateral round-trip routes and a set of trilateral loop routes corresponding to the target starting transport location from the simplified route transport network graph; According to the bilateral round-trip route set and the three-sided loop route set, vehicle scheduling of the vehicle set corresponding to the current time is performed.

2. The method according to claim 1, wherein: The network diagram simplification of the route transportation network diagram is performed according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge to obtain a simplified route transportation network diagram, including: For each transport route in the transport route set included in the route transport network graph, the following determination steps are performed: Determine the transportation duration and transportation volume information of the transportation route within the target time period according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge; In response to determining that the transport duration is less than the target duration and / or the transport volume information is less than the target transport volume value, determining the transport route as a route to be cut; Each edge corresponding to the obtained set of routes to be clipped is removed from the route transportation network graph to obtain a clipped route transportation network graph as the simplified route transportation network graph.

3. The method according to claim 1, wherein: The step of selecting a bilateral round-trip route set and a trilateral loop route set corresponding to the target starting transport position from the simplified route transport network graph comprises: Filter out a bilateral round-trip route set corresponding to the target starting transportation location from the simplified route transportation network graph; Remove each edge corresponding to the bilateral round-trip route set from the simplified route transportation network graph to obtain a route transportation network graph after removal; A set of three-side loop routes corresponding to the target starting transport position is screened out from the removed route transport network graph.

4. The method according to claim 3, wherein: The step of selecting a bilateral round-trip route set corresponding to the target starting transport location from the simplified route transport network graph comprises: Determine the first adjacent forward transport site information set in the simplified route transport network diagram corresponding to the transport site information corresponding to the target starting transport position; For each first adjacent forward transportation station information in the first adjacent forward transportation station information set, the following first generating step is performed: Determine a second adjacent forward transportation site information set corresponding to the first adjacent forward transportation site information; In response to determining that the transport station information is in the second set of proximate forward transport station information, a bilateral round-trip route for the first proximate forward transport station information and the transport station information is generated.

5. The method according to claim 4, wherein: After generating a bilateral round-trip route for the first adjacent forward transportation station information and the transportation station information in response to determining that the transportation station information is in the second adjacent forward transportation station information set, the method includes: In response to determining that the transport station information is not in the second adjacent forward transport station information set, determining at least one first adjacent transport station information corresponding to the first adjacent forward transport station information, wherein a station distance between a station corresponding to the first adjacent transport station information and a station corresponding to the transport station information is less than a target value; For each first adjacent transport station information in the at least one first adjacent transport station information, the following second generating step is performed: Determine a third adjacent forward transport site information set corresponding to the first adjacent transport site information; generating determination information indicating whether the transport station information is located in the third adjacent forward transport station information set; In response to determining that the at least one obtained determination information contains target determination information, determining a first adjacent transport station information set corresponding to the target determination information set as a first target adjacent transport station information set, wherein the target determination information indicates that the transport station information is in the third adjacent forward transport station information set; For each first target adjacent transportation station information in the first target adjacent transportation station information set, a bilateral round-trip route is generated according to the transportation station information, the first target adjacent transportation station information and the corresponding first adjacent forward transportation station information.

6. The method according to claim 5, wherein: After, in response to determining that the at least one determination information obtained contains target determination information, determining the first adjacent transport site information set corresponding to the target determination information set as the first target adjacent transport site information set, the method includes: In response to determining that the target determination information does not exist in the at least one determination information, determining at least one second adjacent transportation station information corresponding to the transportation station information, wherein a station distance between a station corresponding to the second adjacent transportation station information and a station corresponding to the transportation station information is less than the target value; For each first adjacent transport station information in the at least one first adjacent transport station information, determining whether the first adjacent transport station information has a transport relationship with each second adjacent transport station information in the at least one second adjacent transport station information, so as to generate transport relationship determination information; In response to the existence of target transport relationship determination information in the obtained transport relationship determination information set, determining a first adjacent transport station information set and a second adjacent transport station information set corresponding to the obtained target transport relationship determination information set as a second target adjacent transport station information set and a third target adjacent transport station information set, wherein the target transport relationship determination information indicates that a transport relationship exists between a station corresponding to the first adjacent transport station information and a station corresponding to the second adjacent transport station information; For each second target adjacent transport station information in the second target adjacent transport station information set, a bilateral round-trip route is generated according to the transport station information, the corresponding first adjacent forward transport station information, the second target adjacent transport station information and the corresponding third target adjacent transport station information.

7. The method according to claim 3, wherein: The step of selecting a set of three-side loop routes corresponding to the target starting transport position from the removed route transport network graph includes: Determine a fourth adjacent forward transport site information set in the removed route transport network diagram corresponding to the transport site information corresponding to the target starting transport position; For each fourth adjacent forward transportation station information in the fourth adjacent forward transportation station information set, the following third generating step is performed: Determine a fifth adjacent forward transportation site information set in the removed route transportation network graph corresponding to the fourth adjacent forward transportation site information; For each fifth adjacent forward transportation station information in the fifth adjacent forward transportation station information set, the following fourth generating step is performed: Determine a sixth adjacent forward transportation site information set in the removed route transportation network graph corresponding to the fifth adjacent forward transportation site information; In response to determining that the transport station information is in the sixth adjacent forward transport station information set, determining the fifth adjacent forward transport station information as subsequent transport station information; Generate a site combination information group for the fourth adjacent forward transportation site information and the obtained subsequent transportation site information group; A three-side loop route set is generated according to the obtained site combination information group set and the corresponding fourth adjacent forward transportation site information subset.

8. The method according to claim 7, wherein: After determining the fifth proximate forward transport station information as subsequent transport station information in response to determining that the transport station information is in the sixth proximate forward transport station information set, the method further includes: In response to determining that the transport station information is not in the sixth adjacent forward transport station information set, determining at least one third adjacent transport station information corresponding to the fifth adjacent forward transport station information; Determine at least one fourth adjacent transport site information corresponding to the fourth adjacent forward transport site information corresponding to the fifth adjacent forward transport site information; Determine at least one second adjacent transport station information corresponding to the transport station information; Determine the transportation connection information between the transportation site information, the at least one second adjacent transportation site information, the corresponding fifth adjacent forward transportation site information, the corresponding fourth adjacent forward transportation site information, the at least one third adjacent transportation site information and the at least one fourth adjacent transportation site information to obtain a connection determination information group.

9. The method according to claim 8, wherein: Before generating the three-side loop route set according to the obtained site combination information group set and the corresponding fourth adjacent forward transportation site information subset, the method further includes: Determine whether there is connection determination information in the obtained connection determination information group set that represents the connection determination information of each site corresponding to the connection determination information that supports cargo transportation between each site, and use the connection determination information as the target connection determination information to obtain the target connection determination information set; A transportation route corresponding to each target connection determination information in the target connection determination information set is determined as a three-side loop route to obtain a three-side loop route set.

10. A vehicle dispatching device, comprising: A construction unit configured to construct a route transportation network graph for a historical transportation dataset; A determination unit configured to determine node attribute information corresponding to each graph node and edge attribute information corresponding to each edge in the route transportation network graph; A network graph simplification unit is configured to simplify the route transportation network graph according to the node attribute information corresponding to each graph node and the edge attribute information corresponding to each edge, so as to obtain a simplified route transportation network graph; A screening unit is configured to screen out a bilateral round-trip route set and a trilateral loop route set corresponding to a target starting transport position from the simplified route transport network diagram; The execution unit is configured to execute vehicle scheduling of the corresponding vehicle set at the current time according to the bilateral round-trip route set and the three-sided loop route set.

11. An electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 9.

12. A computer readable medium having a computer program stored thereon, wherein: When the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

13. A computer program product, comprising a computer program, which, when executed by a processor, implements the method according to any one of claims 1 to 9.

Images