Responsive bus route processing method, device and equipment

Abstract

The invention provides a response type bus route processing method, device and processing equipment, which are used for solving a shortest route between all station pairs for direct connection routes of all station pairs generated by an existing route planning product by taking a Floyd algorithm as an algorithm implementation way so as to achieve an effect of effectively compressing the routes. According to the compressed path obtained in this way, connectivity between the station pairs can be guaranteed, passenger experience, bus operation cost and system resource consumption can be comprehensively considered, the problems in the aspects of path number and path reasonability in the prior art are solved, and the application value of the response type bus can be remarkably improved.

Description

Technical Field

[0001] The present application relates to the field of transportation services, and specifically to a method, device and processing equipment for responsive bus routes. Background Art

[0002] Responsive buses have the characteristics of no fixed schedule and no fixed path (route). Compared with traditional bus operations, they have better flexibility, which can better meet the needs of more personalized bus services. At the same time, they can also achieve higher bus resource utilization and avoid waste of public resources. Therefore, they have better application prospects.

[0003] In a responsive bus system, in order to support intelligent dispatching of orders, it is necessary to establish connectivity between bus stops, that is, to ensure that there is at least one path from each stop to any other stop in the system. The current common approach to building the station connectivity for intelligent dispatching, i.e., the path network, based on the road network in the responsive bus system area is: 1) Sequentially number all sites in the system, assuming there are N sites in total; 2) From site 1 to site N, select a site o in sequence and set it as the departure point; 3) For each site o, from site 1 to site N, except site o, take a site d in sequence and set it as the destination; 4) Call the navigation system to generate a driving route, obtain the driving route from station o to station d, and save it.

[0004] In order to improve the travel efficiency of passengers, when calling the navigation system in step 4 above, the "shortest time" strategy is generally used to plan the route. Of course, in order to reduce the operating costs of public transportation, the "shortest distance" strategy is also used to plan the route.

[0005] However, the above general approach has two major flaws: (1) There are too many paths. When storing paths in pairs of sites, the data of paths grows exponentially as the number of sites increases. If the system has N sites, the number of paths that need to be stored is N(N-1). (2) Unreasonable routes. Unreasonable routes will lead to a decrease in system capacity, which in turn affects the passenger experience. Whether the "shortest time" or "shortest distance" strategy is used to plan routes, there are corresponding natural defects: the "shortest time" strategy can easily make the route include urban expressways. Such a route will make it difficult for many passengers to be assigned to the bus, which means that the system throughput capacity will be reduced; the "shortest distance" strategy can easily guide buses to travel on some narrow sections, which usually have restrictions on travel and height, resulting in chaos in system operations.

[0006] In other words, the existing responsive bus route planning strategies have problems in terms of the number of routes and the rationality of routes, which will further affect the passenger experience and practical application value of responsive buses. Summary of the invention

[0007] The present application provides a method, apparatus and processing equipment for processing a responsive bus path, which is used to use the Floyd algorithm as an algorithm implementation approach to solve the shortest path between all station pairs for the direct connection paths of all station pairs generated by existing path planning products, so as to achieve the effect of effectively compressing the path. The compressed path obtained in this way can not only ensure the connectivity between station pairs, but also comprehensively consider passenger experience, bus operating costs and system resource consumption, overcome the problems of the existing technology in terms of the number of paths and path rationality, and help to significantly improve the application value of responsive buses.

[0008] In a first aspect, the present application provides a method for processing a responsive bus route, the method comprising: Determine the target area for responsive transit routing; For the target area, obtain the direct connection paths of all station pairs generated by the existing route planning products, where a station pair refers to a pair of stations formed by the destination station and the departure station to which the responsive bus will go from the departure station. The departure station and the destination station are both included in different preset bus stations in the target area. The direct connection path refers to the path of the responsive bus from the departure station to the destination station; On the basis of the direct connection paths of all station pairs, the Floyd algorithm is used to solve the shortest paths between all station pairs to form corresponding compressed paths, wherein the compressed paths are used to update the paths used by the responsive bus during the responsive bus service in the target area.

[0009] In conjunction with the first aspect of the present application, in a first possible implementation of the first aspect of the present application, for a target area, obtaining direct connection paths of all site pairs generated by an existing path planning product includes: For the target area, call the API of the map navigation application service to generate direct connection paths for all site pairs in real time.

[0010] In combination with the first possible implementation of the first aspect of the present application, in the second possible implementation of the first aspect of the present application, for the target area, calling the API of the navigation application service to generate direct connection paths of all site pairs in real time, including: Assume that there are N Stops at different preset bus stops in the target area. Traverse all stops and mark them as Stops. o , 1≤o≤N; Stop for each site o , traverse other sites outside itself and mark them as site Stop d , 1≤d≤N, and d≠o; Stop for each site o , call the API of the map navigation application service to Stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance.

[0011] In combination with the second possible implementation of the first aspect of the present application, in a third possible implementation of the first aspect of the present application, for each site Stop o , call the API of the map navigation application service to Stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance, including: Stop for each site o , call the API of the map navigation application service, and in time priority mode, stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance.

[0012] In combination with the first aspect of the present application, in a fourth possible implementation method of the first aspect of the present application, the shortest path between all site pairs is specifically configured by the shortest path distance and / or the number of sites covered by the maximum combined path, wherein the combined path is a new direct path obtained by combining the direct paths of other site pairs.

[0013] In combination with the fourth possible implementation manner of the first aspect of the present application, in a fifth possible implementation manner of the first aspect of the present application, based on the direct connection paths of all site pairs, the Floyd algorithm is used to solve the shortest paths between all site pairs to form corresponding compressed paths, including the following processing contents: Construct the corresponding distance matrix distMatrix and initialize it to positive infinity to indicate that there is no direct path between the sites in the initial state; Construct the next site matrix next and initialize it to -1 to indicate that the path is undefined; Based on the direct paths of all site pairs generated by the existing path planning products, the distance of the direct path of each site pair is used to update the corresponding element in the distance matrix distMatrix to represent the direct path distance between sites; For the distance matrix distMatrix, set the self-loop distance to 0 to indicate that the distance from the site to itself is 0; For the distance matrix distMatrix, traverse each site (i, j), and for each intermediate site k, determine whether the intermediate site k forms a shorter path or covers more sites; If so, the next site matrix next is used to recursively construct a shortest path list according to the site IDs of the corresponding departure site and destination site to represent the compressed path, and the final actual path distance is calculated.

[0014] In combination with the fifth possible implementation method of the first aspect of the present application, in the sixth possible implementation method of the first aspect of the present application, the shortest path between all site pairs is specifically configured by the shortest path distance and / or the maximum number of sites covered by the combined path, and when the distance of the combined path is equal to the distance of the original direct path, the combined path is preferentially selected.

[0015] In a second aspect, the present application provides a responsive bus route processing device, the device comprising: A determination unit, used for determining a target area of ​​a responsive bus route to be processed; An acquisition unit is used to acquire, for a target area, direct paths of all station pairs generated by an existing path planning product, wherein a station pair refers to a pair of stations formed by a destination station and a departure station to which a responsive bus will go from a departure station, and both the departure station and the destination station are included in different preset bus stations in the target area, and a direct path refers to a path of the responsive bus from the departure station to the destination station; The solving unit is used to solve the shortest paths between all the station pairs based on the direct paths of all the station pairs by using the Floyd algorithm to form corresponding compressed paths, wherein the compressed paths are used to update the paths used by the responsive bus in the responsive bus service process in the target area.

[0016] In conjunction with the second aspect of the present application, in a first possible implementation manner of the second aspect of the present application, the acquiring unit is specifically configured to: For the target area, call the API of the map navigation application service to generate direct connection paths for all site pairs in real time.

[0017] In combination with the first possible implementation of the second aspect of the present application, in a second possible implementation of the second aspect of the present application, the acquiring unit is specifically configured to: Assume that there are N Stops at different preset bus stops in the target area. Traverse all stops and mark them as Stops. o , 1≤o≤N; Stop for each site o , traverse other sites outside itself and mark them as site Stop d , 1≤d≤N, and d≠o; Stop for each site o , call the API of the map navigation application service to Stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance.

[0018] In combination with the second possible implementation of the second aspect of the present application, in a third possible implementation of the second aspect of the present application, the acquiring unit is specifically configured to: Stop for each site o , call the API of the map navigation application service, and in time priority mode, stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance.

[0019] In combination with the second aspect of the present application, in a fourth possible implementation method of the second aspect of the present application, the shortest path between all site pairs is specifically configured by the shortest path distance and / or the maximum number of sites covered by the combined path, wherein the combined path is a new direct path obtained by combining the direct paths of other site pairs.

[0020] In combination with the fourth possible implementation manner of the second aspect of the present application, in a fifth possible implementation manner of the second aspect of the present application, based on the direct connection paths of all site pairs, the Floyd algorithm is used to solve the shortest paths between all site pairs to form the corresponding compressed paths, including the following processing contents: Construct the corresponding distance matrix distMatrix and initialize it to positive infinity to indicate that there is no direct path between the sites in the initial state; Construct the next site matrix next and initialize it to -1 to indicate that the path is undefined; Based on the direct paths of all site pairs generated by the existing path planning products, the distance of the direct path of each site pair is used to update the corresponding element in the distance matrix distMatrix to represent the direct path distance between sites; For the distance matrix distMatrix, set the self-loop distance to 0 to indicate that the distance from the site to itself is 0; For the distance matrix distMatrix, traverse each site (i, j), and for each intermediate site k, determine whether the intermediate site k forms a shorter path or covers more sites; If so, the next site matrix next is used to recursively construct a shortest path list according to the site IDs of the corresponding departure site and destination site to represent the compressed path, and the final actual path distance is calculated.

[0021] In combination with the fifth possible implementation method of the second aspect of the present application, in the sixth possible implementation method of the second aspect of the present application, the shortest path between all site pairs is specifically configured by the shortest path distance and / or the maximum number of sites covered by the combined path, and when the distance of the combined path is equal to the distance of the original direct path, the combined path is preferentially selected.

[0022] In a third aspect, the present application provides a processing device, including a processor and a memory, wherein a computer program is stored in the memory, and when the processor calls the computer program in the memory, the method provided in the first aspect of the present application or any possible implementation method of the first aspect of the present application is executed.

[0023] In a fourth aspect, the present application provides a computer-readable storage medium, which stores multiple instructions, and the instructions are suitable for a processor to load to execute the method provided by the first aspect of the present application or any possible implementation of the first aspect of the present application.

[0024] From the above content, it can be concluded that the present application has the following beneficial effects: Aiming at the optimization goal of responsive bus routes, this application uses the Floyd algorithm as the algorithm implementation approach, and solves the shortest path between all station pairs for the direct connection paths of all station pairs generated by existing path planning products, so as to achieve the effect of effectively compressing the path. The compressed path obtained in this way can not only ensure the connectivity between station pairs, but also comprehensively consider passenger experience, bus operating costs and system resource consumption, overcome the problems of existing technologies in terms of the number of paths and path rationality, and help to significantly improve the application value of responsive buses. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0026] Figure 1 A flowchart of a method for processing a responsive bus route for this application is provided; Figure 2 This is a schematic diagram of an example of the comparison results before and after the path optimization of this application; Figure 3 A schematic diagram of a structure of a processing device for a responsive bus route of the present application; Figure 4 A schematic diagram of the structure of the processing equipment of this application. DETAILED DESCRIPTION

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

[0028] The terms "first", "second", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments described here can be implemented in an order other than that illustrated or described here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or modules is not necessarily limited to those steps or modules clearly listed, but may include other steps or modules that are not clearly listed or inherent to these processes, methods, products or devices. The naming or numbering of steps in this application does not mean that the steps in the method flow must be executed in the time / logical sequence indicated by the naming or numbering. The process steps that have been named or numbered can change the execution order according to the technical purpose to be achieved, as long as the same or similar technical effects can be achieved.

[0029] The division of modules in this application is a logical division. There may be other division methods when it is implemented in actual applications. For example, multiple modules can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, and the indirect coupling or communication connection between modules can be electrical or other similar forms, which are not limited in this application. In addition, the modules or submodules described as separate components may or may not be physically separated, may or may not be physical modules, or may be distributed in multiple circuit modules, and some or all of the modules may be selected according to actual needs to achieve the purpose of the present application.

[0030] Before introducing the processing method of the responsive bus route provided by the present application, the background content involved in the present application is first introduced.

[0031] The processing method, device and computer-readable storage medium of the responsive bus path provided in the present application can be applied to a processing device, and is used to use the Floyd algorithm as an algorithm implementation approach to solve the shortest path between all station pairs for the direct connection paths of all station pairs generated by the existing path planning products, so as to achieve the effect of effectively compressing the path. The compressed path obtained in this way can not only ensure the connectivity between the station pairs, but also comprehensively consider the passenger experience, bus operating costs and system resource consumption, overcome the problems of the existing technology in terms of the number of paths and path rationality, and help to significantly improve the application value of responsive buses.

[0032] The processing method of the responsive bus route mentioned in the present application can be executed by a processing device of the responsive bus route, or a server, a physical host, or a user equipment (UE) or other different types of processing equipment that integrates the processing device of the responsive bus route. The processing device of the responsive bus route can be implemented in hardware or software, and the UE can be a terminal device such as a smart phone, a tablet computer, a laptop computer, a desktop computer, or a personal digital assistant (PDA), and the processing device can be set in a device cluster.

[0033] Next, we will introduce the processing method of the responsive bus route provided by this application.

[0034] First, see Figure 1 , Figure 1 A flowchart of a method for processing a responsive bus route of the present application is shown. The method for processing a responsive bus route provided by the present application may specifically include the following steps S101 to S103: Step S101, determining a target area of ​​a responsive bus route to be processed; In actual operation, responsive buses have the characteristics of no fixed routes and no fixed schedules for passengers. However, it is also easy to understand that responsive buses provide bus services within a specific range. Therefore, when facing the optimization goal of responsive bus routes, this application will determine the current target area to be processed, that is, the preset responsive bus service range.

[0035] Among them, the operation of responsive buses involves numerous potential bus stops. Based on these bus stops, the corresponding routes are adjusted in real time to achieve flexible operation service characteristics and meet the personalized service needs of passengers. At the same time, it can also effectively improve the utilization rate of bus resources.

[0036] In this regard, the target area determined in step S101 here may describe a corresponding bus stop. Of course, it may also be unknown at this time and can be confirmed later.

[0037] Among them, the bus stops involved in the target area are usually entered / determined manually. Of course, in some bus operation plans, the bus stops can also be determined by the corresponding determination strategies. In this way, in actual applications, the determination of the bus stops involved in the target area in the present application scheme may involve the retrieval of existing data or real-time processing of data (an adaptive real-time processing method can be set according to the different data sources of the bus stops).

[0038] In actual situations, the route optimization processing of responsive public transportation in the target area is usually initiated in the form of a task. The route optimization task of responsive public transportation in the target area can be initiated by manual entry, or it can be initiated autonomously according to a preset strategy, such as autonomously initiating at a time interval of a month, or it can also be a task forwarded by other devices. These are all possible in actual situations, and can be adaptively adjusted according to the actual situation.

[0039] Step S102, for the target area, obtaining direct paths of all station pairs generated by the existing path planning product, wherein a station pair refers to a pair of stations formed by a destination station and a departure station to which the responsive bus will go from the departure station, and the departure station and the destination station are both included in different preset bus stations in the target area, and a direct path refers to a path of the responsive bus from the departure station to the destination station; It can be understood that this application specifically performs further path optimization work based on the application of existing path planning products, so as to achieve the optimization goal of responsive bus paths.

[0040] In this regard, after determining the target area and all the bus stops involved, the direct connection paths of all station pairs in the target area can be obtained through existing path planning products.

[0041] Among them, the existing path planning product can flexibly adjust the specific products used under actual circumstances, and can be an independent application (Application, APP), a web service, a mini-program service, or a background application programming interface (Application Programming Interface, API) call service, which is usually included in the overall map navigation application service. Of course, it is not ruled out that it is a simplified product that only involves path planning functions. These are all possible.

[0042] As an example, the Amap navigation product can be used.

[0043] For the station pair, it can be understood that it involves the absolute path relationship between bus stations. For example, when a passenger departs from bus station 1, he must go from bus station 1 to another bus station 2. For bus station 1 (departure station), it can be recorded as Stop. O , for bus stop 2 (destination stop), record it as Stop D Two bus stops with such a relationship are called a stop pair, and the direct path corresponding to the stop pair is the path obtained by sequentially connecting all the road sections that the responsive bus needs to take to transport passengers from bus stop 1 (departure stop) to bus stop 2 (destination stop) generated by the existing path planning product.

[0044] It should be noted that, compared with the normally understood responsive bus that takes passengers from bus stop 1 (departure stop) to bus stop 2 (destination stop), the path obtained by sequentially connecting all the road sections that need to be traversed, the direct path referred to here is determined by the existing path planning product. From this, it can be seen that the path optimization work done in this application is to carry out specific optimization work based on the direct path generated by the existing path planning product used here.

[0045] Step S103, based on the direct paths of all station pairs, the Floyd algorithm is used to solve the shortest paths between all station pairs to form corresponding compressed paths, wherein the compressed paths are used for updating the adopted paths during the responsive bus service in the target area.

[0046] It can be understood that the path optimization work promoted by this application is carried out based on the Floyd algorithm as the algorithm implementation path or algorithm implementation basis, but the algorithm processing logic based on the Floyd algorithm requires further configuration of this application, that is, the Floyd algorithm can be used as a specific implementation tool to implement the path optimization strategy of this application.

[0047] Among them, the Floyd algorithm, which can also be called the Floyd-Warshall algorithm, the Floyd algorithm or the insertion point method, can be understood as an algorithm that uses the idea of ​​dynamic programming to find the shortest path between multiple source points in a given weighted graph.

[0048] Based on the direct connection paths of all site pairs obtained by the existing path planning products, the present application can use the Floyd algorithm as a carrier, and under the definition of the preset shortest path, further analyze the original direct connection paths of all site pairs to solve the shortest path between all site pairs, so as to achieve the effect of compressing or simplifying the direct connection paths.

[0049] In this way, when the direct connection path is further simplified, the direct connection path between the station pairs can be re-planned based on the road path with a smaller granularity than the direct connection path of the existing path planning products. Under the condition of ensuring the connectivity between the station pairs, for the fixed station pairs, the definition of the preset shortest path is effectively reduced, and the number of direct connection paths that need to be stored is effectively reduced. Taking into account the passenger experience, bus operating costs and system resource consumption, the path with the best overall benefit (i.e., the new direct connection path) is planned.

[0050] For the road paths involved, which are smaller in granularity than the direct paths of existing path planning products, this application can record the new direct connection composed of them as a combined path. Specifically, it is a path calculated by the solution of this application and generated by combining the direct paths of other site pairs. For example, in some cases, the direct path from "site x to site y" can be replaced by a combination of the direct path from "site x to site z" and the direct path from "site z to site y".

[0051] Among them, for the new direct connection path finally determined in the target area, that is, the combined path, compared with the original direct connection path, the direct connection paths of many site pairs will be replaced by the combined path, and the retained original direct connection paths are the following two types: 1) There is no direct connection path that has been replaced; 2) Direct paths used to form combined paths.

[0052] As an application example, you can have: 1) Create a table PathTable to record the necessary direct paths of the target area, and initialize it to empty; 2) Traverse all sites to Stop od , where the site is for Stop od In the example, the departure station is recorded as Stop o , the destination site is recorded as Stop d ; 3) For each site, click Stop od , traverse the corresponding path list Path ij , i.e., compression path; 4) Search Path in PathTable ij If it does not exist, record the Path in the PathTable ij ; 5) Finally, the PathTable records all necessary new direct paths (compressed paths), and each path is recorded only once.

[0053] Subsequently, when a new direct path, i.e., a compressed path, is generated, it can be put into actual use. That is to say, when the responsive bus service is launched in the target area, the path can be adjusted in real time according to the compressed path to meet the personalized bus service needs of many passengers.

[0054] from Figure 1 It can be seen from the illustrated embodiments that, in order to optimize the responsive bus route, the present application uses the Floyd algorithm as an algorithm implementation approach, and solves the shortest path between all station pairs for the direct connection paths of all station pairs generated by the existing path planning products, so as to achieve the effect of effectively compressing the path. The compressed path obtained in this way can not only ensure the connectivity between the station pairs, but also comprehensively consider the passenger experience, bus operating costs and system resource consumption, overcome the problems of the prior art in terms of the number of paths and path rationality, and help to significantly improve the application value of responsive buses.

[0055] Continue to the above Figure 1 Each step of the illustrated embodiment and possible embodiments thereof in practical application are explained in detail.

[0056] As described above, the existing path planning product used in the present application may specifically be an API call service. As an exemplary embodiment, step S102 obtains the direct connection paths of all site pairs generated by the existing path planning product for the target area, which may specifically include: For the target area, call the API of the map navigation application service to generate direct connection paths for all site pairs in real time.

[0057] As an example, the API of the AutoNavi application service may be called to complete the generation of direct connection paths for all site pairs initially in the target area of ​​the present application.

[0058] As another exemplary embodiment, based on the existing path planning products, how to better generate the direct connection paths of all site pairs initially in the target area of ​​this application, this application also provides a more specific implementation scheme. Specifically, taking the API of the navigation application service mentioned above as an example, for the target area, calling the API of the navigation application service to generate the direct connection paths of all site pairs in real time, specifically may include: 1) Assume that there are N Stops at different preset bus stops in the target area, traverse all stops and mark them as Stops o , 1≤o≤N; 2) Stop each site o , traverse other sites outside itself and mark them as site Stop d , 1≤d≤N, and d≠o; 3) Stop each site o , call the API of the map navigation application service to Stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance and other information.

[0059] Obtained the Stop of each site in the target area o Direct path Path od After obtaining information such as the distance between the two objects, it can be stored for subsequent data processing.

[0060] It is easy to understand that when there are N stop sites in the target area, the direct path Path generated here is od The number of paths is N(N-1) as mentioned above, which is the main reason why too much path data occupies too many system resources for storage, reading and management.

[0061] Furthermore, the path optimization work performed by the present application can specifically only target the paths generated by existing path planning products in the time priority mode. The time priority mode is easy to understand, and the direct path between the determined site pairs is the path with the shortest driving time. Compared with the shortest distance mode (the mode principle is similar), the present application believes that the direct path in the time priority mode can obtain better path planning effect when the path is optimized through the present application scheme. In more popular terms, it can bring better path optimization space / prospects for the path optimization work of the present application scheme, and the compressed path after the final processing can obtain a path with more comprehensive benefits compared to the shortest distance mode.

[0062] Correspondingly, as another exemplary embodiment, the above-mentioned Stop o , call the API of the map navigation application service to Stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od The distance and other information may include: Stop for each site o , call the API of the map navigation application service, and in time priority mode, stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance and other information.

[0063] At the same time, in the process of solving the shortest path between all site pairs based on the Floyd algorithm, as introduced earlier, it involves the definition of a preset shortest path, and based on this, further analysis is performed on the original direct paths of all site pairs to solve the shortest path between all site pairs, thereby achieving the effect of compressing or simplifying the direct paths.

[0064] In this regard, the present application also provides a specific implementation plan for the definition of the preset shortest path. As another exemplary embodiment, the shortest path between all site pairs involved in the present application can be configured by the shortest path distance and / or the maximum number of sites covered by the combined path.

[0065] The combined path is a new direct connection path obtained by combining the direct connection paths of other site pairs, which has been introduced above.

[0066] Further, the data processing based on the Floyd algorithm, that is, based on the direct paths of all site pairs, using the Floyd algorithm to solve the shortest paths between all site pairs to form corresponding compressed paths, as another exemplary embodiment, may specifically include the following processing contents: 1) Construct the corresponding distance matrix distMatrix and initialize it to positive infinity to indicate that there is no direct path between the sites in the initial state; 2) Construct the next site matrix next and initialize it to -1 to indicate that the path is undefined; 3) Based on the direct paths of all site pairs generated by the existing path planning products, the distance of the direct path of each site pair is used to update the corresponding element in the distance matrix distMatrix to represent the direct path distance between sites; 4) For the distance matrix distMatrix, set the self-loop distance to 0 to indicate that the distance from the site to itself is 0; 5) For the distance matrix distMatrix, traverse each site (i, j), and for each intermediate site k, determine whether the intermediate site k forms a shorter path or covers more sites; It is easy to see that step 5) here corresponds to the previous definition setting of the shortest path, that is, the shortest path can be specifically configured by the shortest path distance and / or the maximum number of sites covered by the combined path.

[0067] 6) If yes, then according to the corresponding station IDs of the departure station and the destination station, the next station matrix next is used to recursively construct the shortest path list to represent the compressed path, and the final actual path distance is calculated.

[0068] Among them, ID means identification.

[0069] Specifically, in step 6 here, when it is determined that the current intermediate site k constitutes a shorter path or covers more sites, the distMatrix[i][j] and next[i][j] corresponding to the current site (i, j) can be updated, and the new shortest path information can be recorded. Then, according to the corresponding starting site ID and end site ID, the next matrix is ​​used to recursively construct the shortest path list.

[0070] For example, the site has Stop i With Stop l A list of paths, which can be [Path ij ,Path jk ,...,Path kl ] in the form of such a combined path.

[0071] After the new shortest path is determined, its corresponding path distance and other information can also be recorded for use in subsequent responsive bus services, and correspond to the processing of the direct path generated by the previous existing path planning products.

[0072] It can be seen that in the embodiment here, the present application explores the original direct path based on the two matrices, the distance matrix distMatrix and the next site matrix next, to effectively solve a new direct path that better meets the definition of the shortest path.

[0073] In addition, for the definition setting of the shortest path that needs to be substituted or followed in the path optimization process of this application, the present application can also consider a special case, that is, there may be a situation where the distance of the combined path is equal to the distance of the original direct path (equal, or very close, that is, within a similar range). In this regard, the present application can be set to give priority to the combined path, that is, select the new path solved.

[0074] That is, as another exemplary embodiment, the shortest path between all site pairs involved in the present application is specifically configured by the shortest path distance and / or the maximum number of sites covered by the combined path, and when the distance of the combined path is equal to the distance of the original direct path, the combined path is preferentially selected.

[0075] To facilitate understanding of the above solution, you can also use the following set of examples to gain a more vivid understanding.

[0076] Figure 2 An example schematic diagram showing the comparison results before and after the path optimization of this application is shown. Figure 2 It can be clearly seen that for the site pair of the departure site (site 5306) and the destination site (site 5523), the direct path Path generated by the existing path planning product before the path optimization is performed through the application solution is 5306-5523 , which is located in the sparsely populated area on the left side of the dotted line and does not pass through any station, once the responsive bus enters, it means that there is no possibility of picking up other passengers in the middle. The combined path after the path optimization by this application solution [Path 5306-5310 ,Path 5310-5523 ], it is in a densely populated area on the right side of the dotted line, and there is also an intermediate station, namely station 5510. In this way, the optimized combined path not only optimizes the path distance to 52% of the original, but also covers more stations, and is more likely to fall in densely populated areas. It is more likely to continue to pick up other passengers during the journey, and the new route can be adjusted conveniently, which is more in line with the characteristics of responsive personalized bus services.

[0077] In short, in actual situations, this application scheme not only effectively avoids responsive buses from driving into sections of road without station coverage for a long time, improves transportation capacity, and greatly reduces the original repeated direct connection paths, but also reduces the system's consumption of computer memory by more than 85%. This comprehensively considers passenger experience, bus operating costs and system resource consumption, and can achieve the best overall benefit.

[0078] The above is an introduction to the processing method of the responsive bus path provided by the present application. In order to facilitate better implementation of the processing method of the responsive bus path provided by the present application, the present application also provides a processing device of a responsive bus path from the perspective of a functional module.

[0079] See also Figure 3 , Figure 3 This is a schematic diagram of a structure of a responsive bus path processing device of the present application. In the present application, the responsive bus path processing device 300 may specifically include the following structure: A determination unit 301 is used to determine a target area of ​​a responsive bus route to be processed; The acquisition unit 302 is used to acquire, for the target area, direct paths of all station pairs generated by the existing path planning product, wherein a station pair refers to a pair of stations formed by a destination station and a departure station to which the responsive bus will go from the departure station, and the departure station and the destination station are both included in different preset bus stations in the target area, and the direct path refers to a path of the responsive bus from the departure station to the destination station; The solving unit 303 is used to solve the shortest paths between all the station pairs based on the direct paths of all the station pairs by using the Floyd algorithm to form corresponding compressed paths, wherein the compressed paths are used for updating the adopted paths during the responsive bus service in the target area.

[0080] In an exemplary embodiment, the acquiring unit 302 is specifically configured to: For the target area, call the API of the map navigation application service to generate direct connection paths for all site pairs in real time.

[0081] In another exemplary embodiment, the acquiring unit 302 is specifically configured to: Assume that there are N Stops at different preset bus stops in the target area. Traverse all stops and mark them as Stops. o , 1≤o≤N; Stop for each site o , traverse other sites outside itself and mark them as site Stop d , 1≤d≤N, and d≠o; Stop for each siteo , call the API of the map navigation application service to Stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance.

[0082] In another exemplary embodiment, the acquiring unit 302 is specifically configured to: Stop for each site o , call the API of the map navigation application service, and in time priority mode, stop the site o Set as starting point and stop the site o Corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance.

[0083] In another exemplary embodiment, the shortest paths between all site pairs are specifically configured by the shortest path distance and / or the number of sites covered by the maximum combined path, wherein the combined path is a new direct path obtained by combining the direct paths of other site pairs.

[0084] In another exemplary embodiment, based on the direct connection paths of all site pairs, the shortest paths between all site pairs are solved by using the Floyd algorithm to form corresponding compressed paths, including the following processing contents: Construct the corresponding distance matrix distMatrix and initialize it to positive infinity to indicate that there is no direct path between the sites in the initial state; Construct the next site matrix next and initialize it to -1 to indicate that the path is undefined; Based on the direct paths of all site pairs generated by the existing path planning products, the distance of the direct path of each site pair is used to update the corresponding element in the distance matrix distMatrix to represent the direct path distance between sites; For the distance matrix distMatrix, set the self-loop distance to 0 to indicate that the distance from the site to itself is 0; For the distance matrix distMatrix, traverse each site (i, j), and for each intermediate site k, determine whether the intermediate site k forms a shorter path or covers more sites; If so, the next site matrix next is used to recursively construct a shortest path list according to the site IDs of the corresponding departure site and destination site to represent the compressed path, and the final actual path distance is calculated.

[0085] In another exemplary embodiment, the shortest path between all site pairs is specifically configured by the shortest path distance and / or the maximum number of sites covered by the combined path, and when the distance of the combined path is equal to the distance of the original direct path, the combined path is preferentially selected.

[0086] This application also provides a processing device from the perspective of hardware structure, see Figure 4 , Figure 4 401, a computer program stored in the memory 402, and an input / output device 403. The processor 401 is used to execute the computer program stored in the memory 402. Figure 1 The steps of the method for processing a responsive bus path in the corresponding embodiment; or, the processor 401 is used to execute the computer program stored in the memory 402 to implement the following Figure 3 Corresponding to the functions of each unit in the embodiment, the memory 402 is used to store the processor 401 executing the above Figure 1 The computer program required for the method for processing responsive bus routes in the corresponding embodiment.

[0087] Exemplarily, the computer program may be divided into one or more modules / units, one or more modules / units are stored in the memory 402, and executed by the processor 401 to complete the present application. One or more modules / units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program in the computer device.

[0088] The processing device may include, but is not limited to, a processor 401, a memory 402, and an input / output device 403. Those skilled in the art will appreciate that the illustration is merely an example of a processing device and does not constitute a limitation on the processing device, and may include more or fewer components than shown in the illustration, or a combination of certain components, or different components. For example, the processing device may also include a network access device, a bus, etc., and the processor 401, the memory 402, the input / output device 403, etc. are connected via a bus.

[0089] The processor 401 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the processing device, and uses various interfaces and lines to connect various parts of the entire device.

[0090] The memory 402 can be used to store computer programs and / or modules. The processor 401 implements various functions of the computer device by running or executing the computer programs and / or modules stored in the memory 402 and calling the data stored in the memory 402. The memory 402 can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application required for a function, etc.; the data storage area can store data created according to the use of the processing device, etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (SecureDigital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0091] When the processor 401 is used to execute the computer program stored in the memory 402, the following functions can be implemented: Determine the target area for responsive transit routing; For the target area, obtain the direct connection paths of all station pairs generated by the existing route planning products, where a station pair refers to a pair of stations formed by the destination station and the departure station to which the responsive bus will go from the departure station. The departure station and the destination station are both included in different preset bus stations in the target area. The direct connection path refers to the path of the responsive bus from the departure station to the destination station; On the basis of the direct connection paths of all station pairs, the Floyd algorithm is used to solve the shortest paths between all station pairs to form corresponding compressed paths, wherein the compressed paths are used to update the paths used by the responsive bus during the responsive bus service in the target area.

[0092] Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the processing device, processing equipment and corresponding units of the responsive bus path described above can refer to the following. Figure 1 The description of the processing method of the responsive bus route in the corresponding embodiment will not be repeated here in detail.

[0093] A person of ordinary skill in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by instructions, or by controlling related hardware through instructions. The instructions may be stored in a computer-readable storage medium and loaded and executed by a processor.

[0094] To this end, the present application provides a computer-readable storage medium, in which a plurality of instructions are stored, and the instructions can be loaded by a processor to execute the present application as follows: Figure 1 The steps of the processing method of the responsive bus path in the corresponding embodiment, the specific operation can refer to the following Figure 1 The description of the processing method of the responsive bus route in the corresponding embodiment will not be repeated here.

[0095] The computer-readable storage medium may include: a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0096] Due to the instructions stored in the computer-readable storage medium, the present application can be executed. Figure 1 The steps of the processing method of the responsive bus path in the corresponding embodiment, therefore, the present application can be implemented as follows Figure 1 The beneficial effects that can be achieved by the processing method of the responsive bus path in the corresponding embodiment are detailed in the previous description and will not be repeated here.

[0097] The above is a detailed introduction to the processing method, device, processing equipment and computer-readable storage medium for the responsive bus path provided by the present application. Specific examples are used in this article to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method and core idea of ​​the present application; at the same time, for technical personnel in this field, according to the idea of ​​the present application, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.

Claims

1. A method for processing a responsive bus route, characterized in that: The method comprises: Determine the target area for responsive transit routing; For the target area, the direct connection paths of all station pairs generated by the existing path planning product are obtained, wherein the station pair refers to a pair of stations formed by the destination station that the responsive bus will go to from the departure station and the departure station, the departure station and the destination station are both included in different preset bus stations in the target area, and the direct connection path refers to the path of the responsive bus from the departure station to the destination station; Based on the direct paths of all the site pairs, the shortest paths between all the site pairs are solved using the Floyd algorithm to form corresponding compressed paths, wherein the compressed paths are used for updating the adopted paths of the responsive bus during the responsive bus service in the target area.

2. The method according to claim 1, characterized in that The step of acquiring, for the target area, direct connection paths of all site pairs generated by an existing path planning product includes: For the target area, the API of the map navigation application service is called to generate direct connection paths of all the site pairs in real time.

3. The method according to claim 2, characterized in that The calling of the API of the navigation application service for the target area to generate direct connection paths of all site pairs in real time includes: Assuming that there are N different preset bus stops in the target area, traverse all stops and mark them as Stop. o , 1≤o≤N; Stop for each of the above sites o , traverse other sites outside itself and mark them as site Stop d , 1≤d≤N, and d≠o; Stop for each of the above sites o , call the API of the map navigation application service to Stop the site o Set as the starting point, and stop the site o The corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od distance.

4. The method according to claim 3, characterized in that The Stop command for each of the sites o , call the API of the map navigation application service to Stop the site o Set as the starting point, and stop the site o The corresponding site Stop d Set as the end point to generate a direct path Path od , and write down the direct path Path od Distances include: Stop for each of the above sites o , call the API of the map navigation application service, and in time priority mode, stop the site o Set as the starting point, and stop the site o The corresponding site Stop d Set as the end point to generate the direct path Path od , and write down the direct path Path od distance.

5. The method according to claim 1, characterized in that The shortest paths between all site pairs are specifically configured by the shortest path distance and / or the number of sites covered by the maximum combined path, wherein the combined path is a new direct path obtained by combining the direct paths of the other site pairs.

6. The method according to claim 5, characterized in that The process of solving the shortest paths between all the site pairs by using the Floyd algorithm on the basis of the direct connection paths of all the site pairs to form the corresponding compressed paths includes the following processing contents: Construct the corresponding distance matrix distMatrix and initialize it to positive infinity to indicate that there is no direct path between the sites in the initial state; Construct the next site matrix next and initialize it to -1 to indicate that the path is undefined; Based on the direct paths of all site pairs generated by the existing path planning product, the corresponding elements in the distance matrix distMatrix are updated with the distance of the direct path of each site pair to represent the direct path distance between sites; For the distance matrix distMatrix, the self-loop distance is set to 0, so as to indicate that the distance from the station to itself is 0; For the distance matrix distMatrix, traverse each site (i, j), and for each intermediate site k, determine whether a shorter path is formed or more sites are covered through the intermediate site k; If so, a shortest path list is recursively constructed using the next site matrix next according to the site IDs of the corresponding departure site and destination site to represent the compressed path, and the final actual path distance is calculated.

7. The method according to claim 6, characterized in that The shortest paths between all site pairs are specifically configured by the shortest path distance and / or the number of sites covered by the maximum combined path, and when the distance of the combined path is equal to the distance of the original direct path, the combined path is preferentially selected.

8. A responsive bus route processing device, characterized in that: The device comprises: A determination unit, used for determining a target area of ​​a responsive bus route to be processed; an acquisition unit, configured to acquire, for the target area, direct paths of all station pairs generated by an existing path planning product, wherein the station pair refers to a pair of stations formed by a destination station to which the responsive bus will be fixedly directed from the departure station and the departure station, the departure station and the destination station are both included in different preset bus stations in the target area, and the direct path refers to a path of the responsive bus from the departure station to the destination station; A solving unit is used to solve the shortest paths between all the station pairs by using the Floyd algorithm based on the direct paths of all the station pairs to form corresponding compressed paths, wherein the compressed paths are used for the responsive bus to update the adopted paths during the responsive bus service in the target area.

9. A processing device, characterized in that: The method comprises a processor and a memory, wherein the memory stores a computer program, and the processor executes the method according to any one of claims 1 to 7 when calling the computer program in the memory.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a plurality of instructions, and the instructions are suitable for being loaded by a processor to execute the method according to any one of claims 1 to 7.

Images