Shared vehicle scheduling method and device, electronic equipment and storage medium
By constructing a relationship table with the self-associating historical scheduling records, selecting the scheduling path with the minimum distance for shared vehicle scheduling, the problem of inefficient scheduling in the prior art is solved and efficient shared vehicle scheduling is achieved.
Patent Information
- Application Number
- CN202411125979.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-16
- Publication Date
- 2024-12-20
AI Technical Summary
In the prior art, the time complexity of shared vehicle scheduling is high, making it difficult to efficiently realize scheduling, especially when there are many sites, resulting in low scheduling efficiency.
By constructing the first site relationship table of historical scheduling records, performing self-correlation and filtering, generating candidate scheduling site pairs related to the current start and terminate scheduling site of the target shared vehicle, selecting the target scheduling site pair with the smallest relative distance to schedule, avoiding Multi-loop search to reduce the computational complexity and time complexity.
It significantly improves the efficiency of shared vehicle scheduling, reduces map service costs and calculation complexity, and enables efficient scheduling at multiple sites.
Smart Images
Figure CN119168259A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of vehicle management, and in particular to a shared vehicle scheduling method, device, electronic equipment and storage medium. Background Art
[0002] In the operation and management of shared vehicles, the intelligent scheduling of shared vehicles plays a vital role, which is directly related to user experience, operational efficiency and cost control. Therefore, how to efficiently schedule shared vehicles is an important issue that needs to be urgently solved in the industry.
[0003] In the related art, shared vehicle scheduling is achieved through the Floyd algorithm, which requires multiple loops to traverse all nodes as potential transfer points and check for each pair of nodes whether there is a shorter path passing through the potential transfer points. The time complexity is high, making it difficult to achieve shared vehicle scheduling efficiently. Summary of the invention
[0004] The present invention provides a shared vehicle scheduling method, device, electronic device and storage medium, which are used to solve the defects in the prior art that multiple loops are required to traverse all nodes as potential transfer points, and each pair of nodes is checked to see whether there is a shorter path passing through the potential transfer point, which has high time complexity and is difficult to efficiently implement shared vehicle scheduling, thereby reducing the time complexity of path optimization selection, thereby improving the efficiency of shared vehicle scheduling.
[0005] The present invention provides a shared vehicle scheduling method, comprising: According to the historical dispatch records of each shared vehicle at each dispatch station pair, a first station relationship table is obtained; the first station relationship table includes first dispatch relationship information of a plurality of dispatch station pairs, and the dispatch station pairs include a starting dispatch station and an ending dispatch station; The first station relationship table is self-associated to obtain a Cartesian product, and a second station relationship table associated with a current starting scheduling station and a current terminating scheduling station of a target shared vehicle is obtained according to the Cartesian product and the first scheduling relationship information; the second station relationship table includes second scheduling relationship information of a plurality of candidate scheduling station pairs, and the candidate scheduling station pairs are obtained by fusing at least one scheduling station pair associated with the current starting scheduling station and the current terminating scheduling station; According to the second scheduling relationship information, a first target scheduling site pair with the smallest relative distance is selected from the multiple candidate scheduling site pairs, and a target dispatching service is issued according to the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current ending scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
[0006] According to a shared vehicle scheduling method provided by the present invention, the first station relationship table is obtained according to the historical scheduling records of each shared vehicle at each scheduling station pair, including: According to the historical dispatch records, obtaining the vehicle dispatch distance of each dispatch station pair in each historical time period; Calculating the average value of the vehicle dispatch distances of each dispatch station pair in a plurality of historical time periods to obtain the relative distances of each dispatch station pair; Acquire first scheduling relationship information of each scheduling site pair according to the location information of the starting scheduling site, the location information of the ending scheduling site and the relative distance of each scheduling site pair; The first site relationship table is constructed according to the first scheduling relationship information of each scheduling site.
[0007] According to a shared vehicle scheduling method provided by the present invention, the second station relationship table associated with the current starting scheduling station and the current ending scheduling station of the target shared vehicle is obtained according to the Cartesian product and the first scheduling relationship information, including: According to the Cartesian product, every two of the scheduling site pairs are combined to obtain a plurality of first combined scheduling site pairs; Among the plurality of first combined scheduling site pairs, screening a second combined scheduling site pair in which a starting scheduling site of one scheduling site pair is the same as a terminating scheduling site of another scheduling site pair; Among the plurality of the second combined scheduling site pairs, a third combined scheduling site pair is selected, in which a starting scheduling site of one scheduling site pair is the same as the current starting scheduling site, and a terminating scheduling site of another scheduling site pair is the same as the current terminating scheduling site; Merging the two scheduling site pairs in each of the third combined scheduling site pairs to obtain each of the candidate scheduling site pairs, and merging the first scheduling relationship information of the two scheduling site pairs in each of the third combined scheduling site pairs to obtain the second scheduling relationship information of each of the candidate scheduling site pairs; The second site relationship table is acquired according to the second scheduling relationship information of each candidate scheduling site pair.
[0008] According to a shared vehicle dispatching method provided by the present invention, the step of issuing a target dispatching service according to the corresponding path of the first target dispatching station includes: In the case where the relative distance of the first target scheduling site pair is greater than or equal to the first target distance, the first target scheduling site pair is deleted from the second site relationship table, and the process returns to the step of obtaining the first site relationship table according to the historical scheduling records of each shared vehicle at each scheduling site pair, and the first target scheduling site pair is obtained iteratively until a first target scheduling site pair with a relative distance less than the first target distance is obtained; The target dispatching service is issued according to the path corresponding to the first target scheduling site pair whose relative distance is smaller than the first target distance.
[0009] According to a shared vehicle scheduling method provided by the present invention, the method further includes: When it is determined that the target shared vehicle is successfully dispatched from the current starting dispatching site to the current terminating dispatching site, obtaining a vehicle dispatching distance of the first target dispatching site within the current time period; updating the historical dispatch record according to the vehicle dispatch distance of the first target dispatch site in the current time period; The first site relationship table is updated according to the updated historical scheduling record.
[0010] According to a shared vehicle scheduling method provided by the present invention, the method further includes: When it is determined that the target shared vehicle is successfully dispatched from the current starting dispatching site to the current terminating dispatching site, obtaining a second target dispatching site pair whose relative distance is less than a second target distance from the plurality of candidate dispatching site pairs; The first site relationship table is updated according to the scheduling relationship information of the second target scheduling site pair.
[0011] The present invention also provides a shared vehicle dispatching device, comprising: A first acquisition module is used to acquire a first station relationship table according to the historical dispatch records of each shared vehicle at each dispatch station pair; the first station relationship table includes first dispatch relationship information of a plurality of dispatch station pairs, and the dispatch station pairs include a start dispatch station and an end dispatch station; a second acquisition module, configured to perform self-association on the first station relationship table to obtain a Cartesian product, and obtain a second station relationship table associated with a current starting scheduling station and a current terminating scheduling station of a target shared vehicle according to the Cartesian product and the first scheduling relationship information; the second station relationship table includes second scheduling relationship information of a plurality of candidate scheduling station pairs, wherein the candidate scheduling station pairs are obtained by merging at least one scheduling station pair associated with the current starting scheduling station and the current terminating scheduling station; A scheduling module is used to select a first target scheduling site pair with the smallest relative distance from multiple candidate scheduling site pairs according to the second scheduling relationship information, and issue a target dispatching service according to the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current ending scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
[0012] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, any of the above-described shared vehicle scheduling methods is implemented.
[0013] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the shared vehicle scheduling method as described in any one of the above is implemented.
[0014] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the shared vehicle scheduling method as described above is implemented.
[0015] The shared vehicle scheduling method, device, electronic device and storage medium provided by the present invention directly generate candidate scheduling site pairs related to the current starting and ending scheduling sites of the target shared vehicle by using the first site relationship table constructed by historical scheduling records through self-association, filtering and fusion, so as to obtain the path corresponding to the first target scheduling site pair with the smallest relative distance among the candidate scheduling site pairs for scheduling the shared vehicle, thereby avoiding redundant searches caused by multiple cyclic searches among a large number of sites, and focusing on locally associated site pairs to perform targeted optimization searches for the scheduling site pairs with the smallest distance, thereby significantly reducing map service costs, computational complexity and time complexity, and improving scheduling efficiency, so that the scheduling of shared vehicles can be efficiently achieved even when the number of sites is large. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0017] Figure 1 This is one of the flow charts of the shared vehicle scheduling method provided by the present invention.
[0018] Figure 2This is the second flow chart of the shared vehicle scheduling method provided by the present invention.
[0019] Figure 3 It is a structural schematic diagram of the shared vehicle dispatching device provided by the present invention.
[0020] Figure 4 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION
[0021] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0022] When sharing vehicles are intelligently dispatched, the dispatching decision needs to be made based on the distance between any two stations. However, considering the time cost and fuel and vehicle damage cost of vehicle dispatching, a shorter dispatching distance is usually chosen for shared vehicle dispatching, otherwise the dispatching time and cost will be very high. Therefore, how to effectively realize the efficient dispatching of shared vehicles based on a shorter dispatching distance is an important issue that needs to be solved in the industry.
[0023] In some related technologies, data from map service providers are usually used to identify shorter dispatch distances and realize shared vehicle dispatch. On the one hand, using data from map service providers may involve fees, which increases costs; on the other hand, stations may be in charge of different areas, and cross-area traffic should be avoided as little as possible. In addition, since map data may be updated with lags or errors (especially in special areas such as small roads and scenic spots), inaccurate dispatch decisions may be made. Shared vehicles can only be dispatched to stations within a limited distance.
[0024] In this regard, some other related technologies propose to implement shared vehicle scheduling through the Floyd-Warshall algorithm. The implementation process of the algorithm includes the following steps: Initialize the distance matrix: Create a two-dimensional array dist to store the shortest path length between any two nodes. Usually, if there is a direct connection between node i and node j, dist[i][j] is the weight of the edge; otherwise, dist[i][j] is set to infinity (indicating that the two points are unreachable). At the same time, dist[i][i] (i.e., the elements on the diagonal) is initialized to 0, indicating that the distance from the node to itself is 0.
[0025] Dynamic programming updates the distance matrix: For each node k (from 1 to n), traverse all node pairs (i, j) (i and j also from 1 to n), and check whether there is a path from node i through node k to node j that is shorter than the known path. If such a path exists, update dist[i][j] to the shorter path length dist[i][k] + dist[k][j].
[0026] Repeat the steps of dynamic programming to update the distance matrix until the shortest path lengths between all node pairs have been determined.
[0027] In summary, the Floyd algorithm requires multiple loops to traverse all nodes as potential transfer points, and check for each pair of nodes whether there is a shorter path passing through the potential transfer point. It has a high time complexity and poor performance when there are many stations, making it difficult to efficiently implement shared vehicle scheduling.
[0028] In view of the above problems, this embodiment provides a shared vehicle scheduling method to reduce the time complexity of path optimization selection, thereby improving the efficiency of shared vehicle scheduling.
[0029] Figure 1 It is one of the flow charts of the shared vehicle scheduling method provided by the present invention; the method can be applied to shared vehicle scheduling scenarios such as shared bicycles and shared electric motorcycles, and can also be extrapolated to other scenarios of calculating the shortest path between all node pairs in the graph, such as friend recommendation based on the shortest distance in social networks, the shortest distance transportation in the travel field, the shortest distance logistics optimization, etc., which are not specifically limited in this embodiment.
[0030] like Figure 1 As shown, the method includes step 110 , step 120 and step 130 .
[0031] Step 110, obtaining a first station relationship table according to the historical scheduling records of each shared vehicle at each scheduling station pair; the first station relationship table includes first scheduling relationship information of a plurality of the scheduling station pairs, and the scheduling station pairs include a starting scheduling station and an ending scheduling station.
[0032] The scheduling site pair includes two sites, one is the starting scheduling site and the other is the ending scheduling site.
[0033] Optionally, it may be to collect historical dispatch records formed by the operation and maintenance personnel dispatching each shared vehicle from the starting dispatching station of each dispatching station pair to the ending dispatching station in each historical period. The historical dispatch records here include but are not limited to dispatch time information and dispatch relationship information; the dispatch time information includes but is not limited to the dispatch start time, dispatch end time and dispatch duration; the dispatch relationship information includes but is not limited to the location information of the starting dispatching station, the location information of the ending dispatching station and the vehicle dispatch distance; the vehicle dispatch distance here is the actual vehicle moving distance formed by dispatching each shared vehicle from the starting dispatching station of each dispatching station pair to the ending dispatching station in each historical period.
[0034] After the historical dispatch records of each dispatch station pair are obtained, the dispatch relationship information of each dispatch station pair may be directly extracted from the historical dispatch records as the first dispatch relationship information to form the first station relationship table, or the dispatch relationship information of each dispatch station pair may be subjected to data cleaning processing as the first dispatch relationship information to form the first station relationship table. The data cleaning processing here includes but is not limited to deduplication processing, averaging processing, etc., which is not specifically limited in this embodiment.
[0035] Step 120, self-associate the first site relationship table to obtain a Cartesian product, and obtain a second site relationship table associated with the current starting scheduling site and the current terminating scheduling site of the target shared vehicle based on the Cartesian product and the first scheduling relationship information; the second site relationship table includes second scheduling relationship information of multiple candidate scheduling site pairs, and the candidate scheduling site pairs are obtained by merging at least one scheduling site pair associated with the current starting scheduling site and the current terminating scheduling site.
[0036] Optionally, after obtaining the first site relationship table X1, the first site relationship table may be copied to obtain the first site relationship table X2; and each scheduling site pair in the first site relationship table X1 is associated and combined with each scheduling site pair in the first site relationship table X2 to obtain the combination result between the first site relationship table X1 and all scheduling site pairs in the first site relationship table X2, thereby obtaining a Cartesian product; then, from all the combined scheduling site pairs corresponding to the Cartesian product, the scheduling sites associated with the current starting scheduling site A and the current terminating scheduling site C of the target shared vehicle are selected for fusion to form a candidate scheduling site pair in which the starting scheduling site and the terminating scheduling site correspond to the same as the current starting scheduling site and the current terminating scheduling site, respectively, and a second site relationship table is formed based on the scheduling relationship information of each candidate scheduling site pair, that is, the second scheduling relationship information. The second scheduling relationship information here is formed by fusion of the first scheduling relationship information of one or more scheduling site pairs required for the fusion of the candidate scheduling site pairs.
[0037] Step 130, based on the second scheduling relationship information, select the first target scheduling site pair with the smallest relative distance from the multiple candidate scheduling site pairs, and issue a target dispatching service based on the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current ending scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
[0038] Optionally, after obtaining the second site relationship table, the relative distance of each candidate scheduling site pair can be obtained from the second scheduling relationship information of each candidate scheduling site pair, and the relative distances of each candidate scheduling site pair can be sorted in order from large to small or from small to large to select the candidate scheduling site pair with the smallest relative distance as the first target scheduling site pair.
[0039] After obtaining the first target dispatching site pair, the target dispatching service can be issued directly according to the path corresponding to the first target dispatching site pair; or the first target dispatching site pair can be logically judged and updated until the first target dispatching site pair that meets the logical judgment conditions is obtained, and then the target dispatching service is issued according to the path corresponding to the first target dispatching site pair that meets the logical judgment conditions. The target dispatching service here is used to instruct the operation and maintenance personnel to dispatch the target shared vehicle from the current starting dispatching site to the current ending dispatching site according to the path corresponding to the first target dispatching site pair in the target dispatching service, thereby realizing efficient dispatching of the target shared vehicle.
[0040] The method provided in this embodiment directly generates candidate scheduling site pairs related to the current starting and ending scheduling sites of the target shared vehicle by utilizing the first site relationship table constructed by utilizing historical scheduling records, through self-association, filtering and fusion, so as to obtain the path corresponding to the first target scheduling site pair with the smallest relative distance among the candidate scheduling site pairs for scheduling the shared vehicle, thereby avoiding redundant searches caused by multiple cyclic searches among a large number of sites, and focusing on locally associated site pairs to perform targeted optimization searches for scheduling site pairs with the smallest distance, thereby significantly reducing map service costs, computational complexity and time complexity, and improving scheduling efficiency, so that the scheduling of shared vehicles can be efficiently achieved even when the number of sites is large.
[0041] In some embodiments, obtaining a first station relationship table according to the historical dispatch records of each shared vehicle at each dispatch station pair includes: According to the historical dispatch records, obtaining the vehicle dispatch distance of each dispatch station pair in each historical time period; Calculating the average value of the vehicle dispatch distances of each dispatch station pair in a plurality of historical time periods to obtain the relative distances of each dispatch station pair; Acquire first scheduling relationship information of each scheduling site pair according to the location information of the starting scheduling site, the location information of the ending scheduling site and the relative distance of each scheduling site pair; The first site relationship table is constructed according to the first scheduling relationship information of each scheduling site.
[0042] Optionally, the vehicle dispatch distance of each dispatch station pair in each historical period is parsed and obtained from the historical dispatch records. The vehicle dispatch distance of each dispatch station pair in multiple historical periods is averaged to obtain the relative distance of each dispatch station pair, thereby reducing repeated dispatch station pairs and eliminating the influence of data fluctuations in individual time periods, thereby obtaining a more stable and reliable relative distance value; the so-called multiple historical time periods may be the time periods of the most recent ten vehicle dispatches, etc., which is not specifically limited in this embodiment.
[0043] Subsequently, the location information of the starting scheduling site, the location information of the ending scheduling site, and the relative distance of each scheduling site pair are integrated to form the first scheduling relationship information of each scheduling site pair; and the first scheduling relationship information of multiple scheduling site pairs are integrated into the relationship table to form a first site relationship table. Each row of the first site relationship table here can be used to store the location information of the starting scheduling site, the location information of the ending scheduling site, and the relative distance of each scheduling site pair.
[0044] The method provided in this embodiment can accurately calculate the average vehicle dispatch distance of each dispatch station in different historical time periods based on rich historical dispatch records, thereby obtaining a more stable and reliable relative distance that reflects the actual dispatch cost between stations, and then constructing a first station relationship table that comprehensively reflects the dispatch relationship between stations, so as to optimize the shared vehicle dispatch based on the first station relationship table in the future, which not only improves the scientificity and accuracy of dispatch decisions, but also optimizes the allocation of vehicle resources and the planning of dispatch paths, ultimately improving the overall dispatch efficiency and enhancing the user experience.
[0045] In some embodiments, obtaining a second station relationship table associated with a current starting scheduling station and a current ending scheduling station of the target shared vehicle according to the Cartesian product and the first scheduling relationship information includes: According to the Cartesian product, every two of the scheduling site pairs are combined to obtain a plurality of first combined scheduling site pairs; Among the plurality of first combined scheduling site pairs, screening a second combined scheduling site pair in which a starting scheduling site of one scheduling site pair is the same as a terminating scheduling site of another scheduling site pair; Among the plurality of the second combined scheduling site pairs, a third combined scheduling site pair is selected, in which a starting scheduling site of one scheduling site pair is the same as the current starting scheduling site, and a terminating scheduling site of another scheduling site pair is the same as the current terminating scheduling site; Merging the two scheduling site pairs in each of the third combined scheduling site pairs to obtain each of the candidate scheduling site pairs, and merging the first scheduling relationship information of the two scheduling site pairs in each of the third combined scheduling site pairs to obtain the second scheduling relationship information of each of the candidate scheduling site pairs; The second site relationship table is acquired according to the second scheduling relationship information of each candidate scheduling site pair.
[0046] Optionally, when constructing the second site relationship table, all possible scheduling site pair combinations are first generated through Cartesian product, i.e., first combined scheduling site pairs. Subsequently, combinations with common sites (the starting site of one site pair is the same as the ending site of another site pair) are screened out as second combined scheduling site pairs. For example, it can be implemented by the instruction "first site relationship table X1 self-associates with first site relationship table X2, inner join on filter condition: end point of X1, = start point of X2".
[0047] Next, in the second combined scheduling site pairs, a third combined scheduling site pair is further screened out, in which the starting scheduling site of one scheduling site pair is the same as the current starting scheduling site, and the terminating scheduling site of another scheduling site pair is the same as the current terminating scheduling site.
[0048] Afterwards, the two scheduling site pairs in each third combined scheduling site pair are respectively merged to form a candidate scheduling site pair, and the first scheduling relationship information of the two scheduling site pairs in each third combined scheduling site pair is correspondingly merged into the second scheduling relationship information. Finally, based on the second scheduling relationship information of each candidate scheduling site pair, a second site relationship table is constructed.
[0049] For example, the current starting scheduling site is A and the current terminating scheduling site is C, then the third combined scheduling site pair selected from the first combined scheduling site pair can be a first scheduling site pair including a starting scheduling site A and a terminating scheduling site B, and a second scheduling site pair including two scheduling site pairs with a starting scheduling site B and a terminating scheduling site C; accordingly, the starting scheduling site of the candidate scheduling site pair formed by the fusion of the first scheduling site pair and the second scheduling site pair is A, the transfer site is B, and the terminating scheduling site is C; the second scheduling relationship information of the candidate scheduling site pair formed by the fusion of the first scheduling relationship information of the first scheduling site pair and the second scheduling site pair includes: the location information of the starting scheduling site of the candidate scheduling site pair is A location information, the location information of the terminating scheduling site of the candidate scheduling site pair is C location information, the relative distance of the first scheduling site pair, the relative distance of the second scheduling site pair, and the relative distance of the candidate scheduling site pair, specifically the sum of the relative distance of the first scheduling site pair and the relative distance of the second scheduling site pair.
[0050] The method provided in this embodiment generates and screens the combination of dispatching site pairs through Cartesian products, and performs multiple screenings, which effectively narrows the search range of potential dispatching paths and improves processing efficiency. It also intelligently combines two optimized routes through fusion, realizes the high aggregation of data in geographic space, so that the route data that were originally independent but belonged to the same area still maintains its regional concentration after combination, which not only simplifies the complexity of data processing, but also enhances the regional pertinence of the dispatching strategy. In addition, these combined routes are constructed based on the familiar paths formed in the actual dispatching process of the operation and maintenance personnel, and fully consider the special restrictions in the actual offline scenes, such as the traffic restrictions on small roads, scenic spots, campuses and parks, so that the generated dispatching scheme is more refined and humanized. Therefore, the site information obtained thereby is not only more accurate, but also closely fits the actual road conditions and needs, so that the constructed second site relationship table can more comprehensively reflect the actual dispatching relevance and cost-effectiveness between sites, and provide a more accurate and reliable basis for subsequent dispatching optimization and path planning.
[0051] In some embodiments, the issuing of a target dispatch service according to the path corresponding to the first target scheduling site pair includes: In the case where the relative distance of the first target scheduling site pair is greater than or equal to the first target distance, the first target scheduling site pair is deleted from the second site relationship table, and the process returns to the step of obtaining the first site relationship table according to the historical scheduling records of each shared vehicle at each scheduling site pair, and the first target scheduling site pair is obtained iteratively until a first target scheduling site pair with a relative distance less than the first target distance is obtained; The target dispatching service is issued according to the path corresponding to the first target scheduling site pair whose relative distance is smaller than the first target distance.
[0052] Optionally, after obtaining multiple candidate scheduling site pairs with the same starting scheduling site and ending scheduling site, and obtaining the first target scheduling site pair with the smallest relative distance from the multiple candidate scheduling site pairs, the relative distance of the first target scheduling site pair can be further compared with the first target distance to determine whether the relative distance of the first target scheduling site pair is less than the first target distance.
[0053] If the relative distance of the first target scheduling site pair is less than the first target distance, it indicates that the distance between the first target scheduling site pair is relatively close, which meets the current dispatching requirements. At this time, the path of the first target scheduling site pair can be directly dispatched to the operation and maintenance personnel as a target dispatching service, so that the operation and maintenance personnel can perform vehicle movement dispatching between the two sites based on the path of the first target scheduling site pair.
[0054] If the relative distance of the first target scheduling site pair is greater than or equal to the first target distance, it indicates that the distance of the first target scheduling site pair is far and does not meet the current dispatching demand. At this time, the first target scheduling site pair and its scheduling relationship information will be deleted in the second site relationship table, and the process will return to the step of obtaining the first site relationship table based on the historical scheduling records of each shared vehicle at each scheduling site pair, so as to rebuild the first site relationship table based on the new historical scheduling records generated by each shared vehicle at each scheduling site pair, and continue to iteratively select new first target scheduling site pairs for evaluation until a first target scheduling site pair with a relative distance less than the first target distance that meets the distance requirements of the current dispatching business is found. Once a first target scheduling site pair with a relative distance less than the first target distance that meets the distance requirements of the current dispatching business is found, a target dispatching business will be immediately issued according to the path of the first target scheduling site pair, so that the operation and maintenance personnel can perform vehicle movement dispatch between the two sites according to the path of the first target scheduling site pair.
[0055] The first target distance here can be set according to the vehicle dispatching requirements, such as 5KM, etc., and this embodiment does not make any specific limitation on this.
[0056] The method provided in this embodiment introduces the first target distance as a screening condition to automatically exclude scheduling site pairs that are too far away, uneconomical or unfeasible, thereby ensuring that each dispatch is based on a reasonable and efficient path. This not only improves the success rate and efficiency of shared vehicle dispatch, but also significantly optimizes the utilization rate of shared vehicles, ultimately improving user satisfaction and overall service quality.
[0057] In some embodiments, the method further comprises: When it is determined that the target shared vehicle is successfully dispatched from the current starting dispatching site to the current terminating dispatching site, obtaining a vehicle dispatching distance of the first target dispatching site within the current time period; updating the historical dispatch record according to the vehicle dispatch distance of the first target dispatch site in the current time period; The first site relationship table is updated according to the updated historical scheduling record.
[0058] Optionally, when it is determined that the target shared vehicle is successfully dispatched from the current starting scheduling site to the current terminating scheduling site, that is, the target dispatching business is completed, the operation and maintenance personnel can collect the target shared vehicle according to the path of the first target scheduling site pair, and dispatch the target shared vehicle from the current starting scheduling site to the current terminating scheduling site to form a new credible vehicle dispatching distance as the vehicle dispatching distance of the first target scheduling site pair in the current time period.
[0059] Subsequently, the historical scheduling records are updated according to the scheduling time of the first target scheduling site pair, the vehicle scheduling distance of the first target scheduling site pair in the current period, and the starting scheduling site and the ending scheduling site of the first target scheduling site pair, so as to update the first site relationship table based on the new historical scheduling records, so as to subsequently execute the shared vehicle scheduling method of steps 120-130 based on the new first site relationship table, so as to enhance the intelligence and dynamic adaptability of shared vehicle scheduling.
[0060] The method provided in this embodiment can not only enrich the site information in the site relationship table and ensure the real-time nature of the site information in the site relationship table by updating the historical scheduling records and the site relationship table in real time, so as to be able to more accurately predict and respond to scheduling needs, optimize resource allocation, and reduce operating costs, but also can more efficiently perform shared vehicle scheduling to provide a better user experience.
[0061] In some embodiments, the method further comprises: When it is determined that the target shared vehicle is successfully dispatched from the current starting dispatching site to the current terminating dispatching site, obtaining a second target dispatching site pair whose relative distance is less than a second target distance from the plurality of candidate dispatching site pairs; The first site relationship table is updated according to the scheduling relationship information of the second target scheduling site pair.
[0062] Optionally, after confirming that the target shared vehicle has successfully completed the scheduling task from the current starting scheduling site to the current ending scheduling site, a site pair whose relative distance is less than the preset second target distance is selected from the multiple candidate scheduling site pairs in the second site relationship table, i.e., the second target scheduling site pair, so as to be able to more effectively plan the scheduling path, reduce the phenomenon of empty driving and detours, and reduce operating costs. Subsequently, the starting scheduling site and the ending scheduling site of the second target scheduling site pair, as well as the relative distance, are used to update the first site relationship table, so that the shared vehicle scheduling method of steps 120-130 is subsequently executed based on the new first site relationship table, so as to enhance the intelligence and dynamic adaptability of shared vehicle scheduling.
[0063] The method provided in this embodiment can effectively enrich the site information in the site relationship table by accurately screening and dynamically updating the site relationship table, thereby significantly improving the intelligence level and efficiency of vehicle scheduling.
[0064] The shared vehicle scheduling method provided in this embodiment is described below with specific examples.
[0065] Figure 2 FIG. 2 is a flow chart of the shared vehicle scheduling method provided by the present invention; Figure 2 As shown, the complete process of this method includes: Step 210, collect historical dispatch records, including but not limited to dispatch time information, location information of the start dispatch site, location information of the end dispatch site, and vehicle dispatch distance.
[0066] Step 220, data cleaning processing; specifically, the average value of the vehicle dispatching distance formed by each dispatching station pair in the most recent ten dispatches is calculated to obtain the relative distance of each dispatching station pair, and the first station relationship table is constructed based on the position information of the starting dispatching station of each dispatching station pair, the position information of the ending dispatching station and the relative distance.
[0067] Step 230, screening the self-associated Cartesian product of the scheduling site pairs; specifically, copying the first site relationship table X1 to obtain the first site relationship table X2, self-associating the first site relationship table X1 and the first site relationship table X2 to obtain the Cartesian product, so as to generate all possible scheduling site pair combinations, and screening out combinations with common sites (the starting site of one site pair is the same as the ending site of another site pair) as the second combined scheduling site pairs; among the second combined scheduling site pairs, further screening out a third combined scheduling site pair in which the starting scheduling site of one scheduling site pair is the same as the current starting scheduling site, and the ending scheduling site of the other scheduling site pair is the same as the current ending scheduling site.
[0068] Step 240, constructing a second site relationship table; if the current starting scheduling site is A and the current terminating scheduling site is C, then the third combined scheduling site pair selected from the first combined scheduling site pair may be a first scheduling site pair including a starting scheduling site A and a terminating scheduling site B, and a second scheduling site pair including two scheduling site pairs with a starting scheduling site B and a terminating scheduling site C; accordingly, the starting scheduling site of the candidate scheduling site pair formed by the fusion of the first scheduling site pair and the second scheduling site pair is A, the transfer site is B, and the terminating scheduling site is C; the second scheduling relationship information of the candidate scheduling site pair formed by the fusion of the first scheduling relationship information of the first scheduling site pair and the second scheduling site pair specifically includes the location information of the starting scheduling site of the candidate scheduling site pair as A location information, the location information of the terminating scheduling site of the candidate scheduling site pair as C location information, the relative distance of the first scheduling site pair, the relative distance of the second scheduling site pair, and the relative distance of the candidate scheduling site pair, specifically the sum of the relative distance of the first scheduling site pair and the relative distance of the second scheduling site pair; based on the second scheduling relationship information of each candidate scheduling site pair, constructing a second site relationship table.
[0069] Step 250, predicted distance acquisition; specifically, when the second site relationship table contains multiple candidate scheduling site pairs with the same starting scheduling site and ending scheduling site, the first target scheduling site pair with the smallest relative distance is selected from the multiple candidate scheduling site pairs, and the relative distance of the first target scheduling site pair is used as the predicted distance.
[0070] Step 260 , clean the first target scheduling site pairs whose relative distance is greater than 5 km, and return to step 230 .
[0071] Step 270, when vehicle dispatch is required, the predicted distance is sent to the operation and maintenance personnel in the form of dispatch service.
[0072] In step 280, the operation and maintenance personnel dispatch the target shared vehicle between the current starting dispatching station and the current ending dispatching station according to the path of the first target dispatching station pair in the dispatching business. If the dispatching business is completed, new confirmed vehicle moving distance information is formed according to the actual dispatching information of the target shared vehicle, that is, new vehicle dispatching information. Based on the new vehicle dispatching information, the operation and maintenance personnel return to step 210 and iterate the shared vehicle dispatch until the vehicle dispatch termination condition is met, such as the number of candidate dispatching station pairs with shorter dispatching paths in the second station relationship table is sufficient. This embodiment does not specifically limit this.
[0073] The shared vehicle scheduling device provided by the present invention is described below. The shared vehicle scheduling device described below and the shared vehicle scheduling method described above can be referred to each other.
[0074] Figure 3 Schematic diagram of the structure of the shared vehicle dispatching device provided by the present invention; Figure 3 As shown, the device comprises: The first acquisition module 310 is used to acquire a first station relationship table according to the historical scheduling records of each shared vehicle at each scheduling station pair; the first station relationship table includes first scheduling relationship information of a plurality of scheduling station pairs, and the scheduling station pair includes a starting scheduling station and an ending scheduling station; The second acquisition module 320 is used to perform self-association on the first station relationship table to obtain a Cartesian product, and obtain a second station relationship table associated with the current starting scheduling station and the current terminating scheduling station of the target shared vehicle according to the Cartesian product and the first scheduling relationship information; the second station relationship table includes second scheduling relationship information of a plurality of candidate scheduling station pairs, and the candidate scheduling station pairs are obtained by merging at least one scheduling station pair associated with the current starting scheduling station and the current terminating scheduling station; The scheduling module 330 is used to select a first target scheduling site pair with the smallest relative distance from multiple candidate scheduling site pairs according to the second scheduling relationship information, and issue a target dispatching service according to the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current ending scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
[0075] The device provided in this embodiment uses the first site relationship table constructed by historical scheduling records to directly generate candidate scheduling site pairs related to the current starting and ending scheduling sites of the target shared vehicle through self-association, filtering and fusion, so as to obtain the path corresponding to the first target scheduling site pair with the smallest relative distance among the candidate scheduling site pairs for scheduling the shared vehicle, thereby avoiding redundant searches caused by multiple loop searches among a large number of sites, and focusing on locally associated site pairs to perform targeted optimization searches for scheduling site pairs with the smallest distance, thereby significantly reducing map service costs, computational complexity and time complexity, and improving scheduling efficiency, so that shared vehicles can be efficiently scheduled even when the number of sites is large.
[0076] Figure 4 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 4As shown, the electronic device may include: a processor (processor) 410 , a communication interface (Communications Interface) 420 , a memory (memory) 430 and a communication bus 440 , wherein the processor 410 , the communication interface 420 , and the memory 430 communicate with each other through the communication bus 440 . The processor 410 can call the logic instructions in the memory 430 to execute the shared vehicle scheduling method, which includes: obtaining a first site relationship table according to the historical scheduling records of each shared vehicle at each scheduling site pair; the first site relationship table includes first scheduling relationship information of multiple scheduling site pairs, and the scheduling site pair includes a starting scheduling site and a terminating scheduling site; self-correlating the first site relationship table to obtain a Cartesian product, and obtaining a second site relationship table associated with the current starting scheduling site and the current terminating scheduling site of the target shared vehicle according to the Cartesian product and the first scheduling relationship information; the second site relationship table includes second scheduling relationship information of multiple candidate scheduling site pairs, and the candidate scheduling site pair is obtained by merging at least one scheduling site pair associated with the current starting scheduling site and the current terminating scheduling site; according to the second scheduling relationship information, selecting a first target scheduling site pair with the smallest relative distance from the multiple candidate scheduling site pairs, and issuing a target dispatching service according to the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current terminating scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
[0077] In addition, the logic instructions in the above-mentioned memory 430 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.
[0078] On the other hand, the present invention also provides a computer program product, which includes a computer program. The computer program can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the shared vehicle scheduling method provided by the above-mentioned methods, the method comprising: obtaining a first station relationship table according to the historical scheduling records of each shared vehicle at each scheduling station pair; the first station relationship table includes first scheduling relationship information of multiple scheduling station pairs, and the scheduling station pair includes a starting scheduling station and an ending scheduling station; performing self-association on the first station relationship table to obtain a Cartesian product, and obtaining the current starting and ending scheduling stations with the target shared vehicle according to the Cartesian product and the first scheduling relationship information. a second station relationship table associated with the starting scheduling station and the current terminating scheduling station; the second station relationship table includes second scheduling relationship information of multiple candidate scheduling station pairs, and the candidate scheduling station pairs are obtained by integrating at least one scheduling station pair associated with the current starting scheduling station and the current terminating scheduling station; according to the second scheduling relationship information, a first target scheduling station pair with the smallest relative distance is selected from the multiple candidate scheduling station pairs, and a target dispatching service is issued according to the path corresponding to the first target scheduling station pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling station to the current terminating scheduling station according to the path corresponding to the first target scheduling station pair in the target dispatching service.
[0079] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the processor executes the shared vehicle scheduling method provided by the above-mentioned methods, the method comprising: obtaining a first station relationship table according to the historical scheduling records of each shared vehicle at each scheduling station pair; the first station relationship table includes first scheduling relationship information of multiple scheduling station pairs, and the scheduling station pair includes a starting scheduling station and an ending scheduling station; performing self-association on the first station relationship table to obtain a Cartesian product, and obtaining a current starting scheduling station and a current ending scheduling station with a target shared vehicle according to the Cartesian product and the first scheduling relationship information. an associated second site relationship table; the second site relationship table includes second scheduling relationship information of multiple candidate scheduling site pairs, and the candidate scheduling site pairs are obtained by merging at least one scheduling site pair associated with the current starting scheduling site and the current terminating scheduling site; according to the second scheduling relationship information, a first target scheduling site pair with the smallest relative distance is selected from the multiple candidate scheduling site pairs, and a target dispatching service is issued according to the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current terminating scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
[0080] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.
[0081] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.
[0082] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A shared vehicle dispatching method, characterized in that: include: Obtaining a first station relationship table according to the historical dispatch records of each shared vehicle at each dispatch station pair; The first site relationship table includes first scheduling relationship information of a plurality of scheduling site pairs, wherein the scheduling site pairs include a starting scheduling site and an ending scheduling site; The first station relationship table is self-associated to obtain a Cartesian product, and a second station relationship table associated with a current starting scheduling station and a current terminating scheduling station of a target shared vehicle is obtained according to the Cartesian product and the first scheduling relationship information; the second station relationship table includes second scheduling relationship information of a plurality of candidate scheduling station pairs, and the candidate scheduling station pairs are obtained by fusing at least one scheduling station pair associated with the current starting scheduling station and the current terminating scheduling station; According to the second scheduling relationship information, a first target scheduling site pair with the smallest relative distance is selected from the multiple candidate scheduling site pairs, and a target dispatching service is issued according to the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current ending scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
2. The shared vehicle dispatching method according to claim 1, characterized in that: The step of obtaining the first station relationship table according to the historical dispatch records of each shared vehicle at each dispatch station pair includes: According to the historical dispatch records, obtaining the vehicle dispatch distance of each dispatch station pair in each historical time period; Calculating the average value of the vehicle dispatch distances of each dispatch station pair in a plurality of historical time periods to obtain the relative distances of each dispatch station pair; Acquire first scheduling relationship information of each scheduling site pair according to the location information of the starting scheduling site, the location information of the ending scheduling site and the relative distance of each scheduling site pair; The first site relationship table is constructed according to the first scheduling relationship information of each scheduling site.
3. The shared vehicle dispatching method according to claim 1, characterized in that: The step of acquiring, according to the Cartesian product and the first scheduling relationship information, a second station relationship table associated with a current starting scheduling station and a current ending scheduling station of the target shared vehicle comprises: According to the Cartesian product, every two of the scheduling site pairs are combined to obtain a plurality of first combined scheduling site pairs; Among the plurality of first combined scheduling site pairs, screening a second combined scheduling site pair in which a starting scheduling site of one scheduling site pair is the same as a terminating scheduling site of another scheduling site pair; Among the plurality of the second combined scheduling site pairs, a third combined scheduling site pair is selected, in which a starting scheduling site of one scheduling site pair is the same as the current starting scheduling site, and a terminating scheduling site of another scheduling site pair is the same as the current terminating scheduling site; Merging the two scheduling site pairs in each of the third combined scheduling site pairs to obtain each of the candidate scheduling site pairs, and merging the first scheduling relationship information of the two scheduling site pairs in each of the third combined scheduling site pairs to obtain the second scheduling relationship information of each of the candidate scheduling site pairs; The second site relationship table is acquired according to the second scheduling relationship information of each candidate scheduling site pair.
4. The shared vehicle dispatching method according to any one of claims 1 to 3, characterized in that: The issuing of a target dispatching service according to the path corresponding to the first target dispatching site includes: In the case where the relative distance of the first target scheduling site pair is greater than or equal to the first target distance, the first target scheduling site pair is deleted from the second site relationship table, and the process returns to the step of obtaining the first site relationship table according to the historical scheduling records of each shared vehicle at each scheduling site pair, and the first target scheduling site pair is obtained iteratively until a first target scheduling site pair with a relative distance less than the first target distance is obtained; The target dispatching service is issued according to the path corresponding to the first target scheduling site pair whose relative distance is smaller than the first target distance.
5. The shared vehicle dispatching method according to any one of claims 1 to 3, characterized in that: The method further comprises: When it is determined that the target shared vehicle is successfully dispatched from the current starting dispatching site to the current terminating dispatching site, obtaining a vehicle dispatching distance of the first target dispatching site within the current time period; updating the historical dispatch record according to the vehicle dispatch distance of the first target dispatch site in the current time period; The first site relationship table is updated according to the updated historical scheduling record.
6. The shared vehicle dispatching method according to any one of claims 1 to 3, characterized in that: The method further comprises: When it is determined that the target shared vehicle is successfully dispatched from the current starting dispatching site to the current terminating dispatching site, obtaining a second target dispatching site pair whose relative distance is less than a second target distance from the plurality of candidate dispatching site pairs; The first site relationship table is updated according to the scheduling relationship information of the second target scheduling site pair.
7. A shared vehicle dispatching device, characterized in that: include: A first acquisition module, configured to acquire a first station relationship table according to the historical dispatch records of each shared vehicle at each dispatch station pair; The first site relationship table includes first scheduling relationship information of a plurality of scheduling site pairs, wherein the scheduling site pairs include a starting scheduling site and an ending scheduling site; a second acquisition module, configured to perform self-association on the first station relationship table to obtain a Cartesian product, and obtain a second station relationship table associated with a current starting scheduling station and a current terminating scheduling station of a target shared vehicle according to the Cartesian product and the first scheduling relationship information; the second station relationship table includes second scheduling relationship information of a plurality of candidate scheduling station pairs, wherein the candidate scheduling station pairs are obtained by merging at least one scheduling station pair associated with the current starting scheduling station and the current terminating scheduling station; A scheduling module is used to select a first target scheduling site pair with the smallest relative distance from multiple candidate scheduling site pairs according to the second scheduling relationship information, and issue a target dispatching service according to the path corresponding to the first target scheduling site pair, so that the operation and maintenance personnel can dispatch the target shared vehicle from the current starting scheduling site to the current ending scheduling site according to the path corresponding to the first target scheduling site pair in the target dispatching service.
8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the shared vehicle scheduling method as described in any one of claims 1 to 6 is implemented.
9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the shared vehicle scheduling method according to any one of claims 1 to 6 is implemented.
10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the shared vehicle scheduling method according to any one of claims 1 to 6 is implemented.