Point-to-point route planning method and system, medium and electronic equipment

Abstract

The invention belongs to the technical field of traffic, and relates to a point-to-point route planning method and system, a medium and electronic equipment, and the method comprises the steps: obtaining a departure place, a destination and a departure date inputted by a user; querying a first group of route planning schemes and a second group of route planning schemes in parallel based on the departure place and the destination; combining the first group of route planning schemes and the second group of route planning schemes to obtain an initial route planning scheme set; filtering and sorting the initial route planning scheme set to obtain a route planning scheme filtering set; and querying a route stock product corresponding to the route planning scheme filtering set based on the departure date or delaying the departure date for one day, and carrying out traffic scheme splicing based on the route stock product to output a point-to-point route planning scheme set to the user. According to the invention, route planning between two specific points can be realized, the practicability is high, and the route planning efficiency is effectively improved.

Description

Technical Field

[0001] This application belongs to the field of transportation technology, and in particular relates to a point-to-point route planning method, system, medium and electronic equipment. Background Technology

[0002] In today's rapidly developing urbanization and motorization, individual travel and social logistics face unprecedented complexity. Whether it's daily commuting, emergency delivery, or intercity travel, finding the optimal route from origin to destination within a vast road network has become a key technological challenge for improving traffic efficiency and reducing social costs. Point-to-point route planning can significantly lower the threshold and uncertainty of travel decisions, effectively saving time and costs by providing accurate navigation services. Therefore, how to efficiently implement point-to-point route planning is a technical problem that urgently needs to be solved by those skilled in the art. Summary of the Invention

[0003] This application provides a point-to-point route planning method, system, medium, and electronic device, which can efficiently realize point-to-point route planning and is highly practical.

[0004] In a first aspect, this application provides a point-to-point route planning method, the method comprising: obtaining the departure point, destination and departure date input by the user; Based on the origin and the destination, a first set of route planning schemes and a second set of route planning schemes are queried in parallel; the first set of route planning schemes is obtained by querying the map cache database; the second set of route planning schemes is obtained by querying the route planning experience database. The first group of route planning schemes and the second group of route planning schemes are merged to obtain an initial set of route planning schemes; The initial set of route planning schemes is filtered and sorted to obtain a filtered set of route planning schemes; Based on the departure date or by extending the departure date by one day, query the route inventory products corresponding to the route planning scheme filter set, and perform transportation scheme splicing based on the route inventory products to output a point-to-point route planning scheme set to the user.

[0005] In one implementation of the first aspect, the method further includes: When the first set of route planning schemes cannot be obtained from the map cache database, the map interface is called to obtain a map route planning scheme in real time based on the origin and the destination. The map route planning scheme is cached in the map cache database so that the first set of route planning schemes can be retrieved again based on the map cache database.

[0006] In one implementation of the first aspect, the method further includes: If the second set of route planning schemes cannot be obtained from the route planning experience base, the route planning model is invoked to obtain the model route planning scheme in real time based on the origin and the destination; The model route planning scheme is cached in the route planning experience base so that the second set of route planning schemes can be obtained again by querying the route planning experience base.

[0007] In one implementation of the first aspect, invoking the route planning model to obtain a model route planning scheme in real time based on the origin and the destination includes: The route planning model obtains the planned route between the origin and the destination based on graph theory algorithms; The route planning model obtains the weights of the edges in the planned route based on the flight or train duration and transfer time; The route planning model obtains the transfer time based on flight or train schedules; The route planning model obtains the travel time based on the distance from the departure point and the destination to the airport or train station; The route planning model obtains the model route planning scheme based on the planned route, the edge weights, the transfer time, and the vehicle usage time.

[0008] In one implementation of the first aspect, filtering and sorting the initial set of route planning schemes to obtain a filtered set of route planning schemes includes: Each initial route planning scheme in the initial route planning scheme set is sorted according to the route time, and several initial route planning schemes are selected from the smallest to the largest as the first group of filtering schemes; Determine whether there is a bypass scheme in the first group of filtering schemes. If so, filter the bypass scheme and use the remaining schemes in the first group of filtering schemes as the second group of filtering schemes. If not, use the first group of filtering schemes as the second group of filtering schemes. Determine whether any transit schemes in the second group of filtering schemes meet the transit time requirements. If so, use the transit schemes and direct schemes that meet the transit time requirements as the third group of filtering schemes. If not, use the direct schemes as the third group of filtering schemes. The third set of filtering schemes is used as the filtering set for the route planning schemes.

[0009] In one implementation of the first aspect, querying the route inventory products corresponding to the route planning scheme filter set based on the departure date or by extending the departure date by one day includes: Based on the direct routes in the route planning scheme filter set and the departure date, query the inventory of direct flights and / or direct trains; Based on the transit options in the route planning scheme filter set and the departure date, query the inventory of transit flights and / or transit trains; and determine whether the route inventory is abundant. If not, postpone the departure date by one day to expand the query of the route inventory corresponding to the route planning scheme filter set after the postponement.

[0010] In one implementation of the first aspect, splicing traffic plans based on the route inventory products includes: Determine the departure airport, departure train station, arrival airport, and / or arrival train station based on the inventory products along the route; Determine connecting traffic segments to add connecting traffic schemes to each scheme in the set of route planning schemes; the connecting traffic segments start at the departure point and end at the departure airport and / or the departure train station, or start at the arrival airport and / or the arrival train station and end at the destination.

[0011] Secondly, this application provides a point-to-point route planning system, the system comprising: The input module is used to obtain the user's input of departure point, destination, and departure date; The route query module is used to query a first set of route planning schemes and a second set of route planning schemes in parallel based on the origin and the destination; the first set of route planning schemes is obtained by querying the map cache database; the second set of route planning schemes is obtained by querying the route planning experience database. The initial planning module is used to merge the first group of route planning schemes and the second group of route planning schemes to obtain an initial set of route planning schemes; The filtering module is used to filter and sort the initial route planning scheme set to obtain a filtered route planning scheme set; The point-to-point planning module is used to query the route inventory products corresponding to the route planning scheme filter set based on the departure date or by postponing the departure date by one day, and to perform transportation scheme splicing based on the route inventory products to output a point-to-point route planning scheme set to the user.

[0012] Thirdly, this application provides an electronic device, which includes a processor and a memory.

[0013] The memory is used to store computer programs; The processor is used to execute the computer program stored in the memory to cause the electronic device to perform the above-described method.

[0014] Fourthly, this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by an electronic device, implements the above-described method.

[0015] As described above, the point-to-point route planning method, system, medium, and electronic device described in this application have the following beneficial effects: This application can dynamically integrate diverse real-time traffic data to quickly and accurately obtain point-to-point route planning solutions, solving the problems of low accuracy, low efficiency, and poor flexibility in traditional route planning. This application supports parallel querying and self-learning, and stores previously approved route plans in a database, further reducing planning costs and improving planning efficiency, ensuring the high efficiency and adaptability of point-to-point route planning. Attached Figure Description

[0016] Figure 1 The diagram shown is an application scenario illustration of the point-to-point route planning method of this application in one embodiment.

[0017] Figure 2 The diagram shown is a flowchart of one embodiment of the point-to-point route planning method of this application.

[0018] Figure 3 The diagram shown is a flowchart of one embodiment of the point-to-point route planning method of this application.

[0019] Figure 4 The diagram shown is a structural schematic of the point-to-point route planning system of this application in one embodiment.

[0020] Figure 5 The diagram shown is a structural schematic of the electronic device of this application in one embodiment. Detailed Implementation

[0021] The following specific examples illustrate the implementation of this application. Those skilled in the art can easily understand other advantages and effects of this application from the content disclosed in this specification. This application can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of this application. It should be noted that, unless otherwise specified, the following embodiments and features in the embodiments can be combined with each other.

[0022] It should be noted that the illustrations provided in the following embodiments are only schematic representations of the basic concept of this application. Therefore, the drawings only show the components related to this application and are not drawn according to the actual number, shape and size of the components in the actual implementation. In the actual implementation, the form, quantity and proportion of each component can be arbitrarily changed, and the layout of the components may also be more complex.

[0023] The following embodiments of this application provide a point-to-point route planning method, which can be applied to, for example... Figure 1 The point-to-point route planning platform 10 is shown. (For example...) Figure 1 As shown, the point-to-point route planning platform 10 includes an interaction layer 101, a data access layer 102, and a computing engine layer 103. The point-to-point route planning platform 10 accesses flight schedule data, train schedule data, flight station data, train station data, public transportation data, OTA (Online Travel Agency) product inventory data, map cache database data, and route planning experience database data through the data access layer 102. When the point-to-point route planning platform 10 receives the user's input of departure point, destination, and departure date through the interaction layer 101, the computing engine layer 103 calls the data accessed by the data access layer 102 to perform route queries, route planning, and route inventory product queries, and performs traffic stitching to obtain a set of point-to-point route planning schemes, which are then provided to the user through the interaction layer 101.

[0024] It should be noted that the external data accessed by the data access layer 102 can be different data according to actual planning needs, and this application does not impose any restrictions on this.

[0025] The technical solutions in the embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0026] like Figure 2 As shown, in one embodiment, the point-to-point route planning method of this application includes the following steps: Step S1: Obtain the departure point, destination, and departure date input by the user.

[0027] Specifically, the departure point refers to the user's detailed address, such as the user's home address or company address, while the destination is the detailed address the user needs to reach, such as a hotel.

[0028] Step S2: Based on the origin and destination, query the first group of route planning schemes and the second group of route planning schemes in parallel.

[0029] The first set of route planning schemes is obtained by querying the map cache database, and the second set of route planning schemes is obtained by querying the route planning experience database.

[0030] In some embodiments, the map cache database caches map route planning data provided by existing map providers such as G-Map and B-Map. For example, when a user needs to reach point B from point A, and has already planned the route between the two points using G-Map or similar tools, the user can directly query the map cache database to obtain the route plan from point A to point B as the first set of route planning options.

[0031] In some other embodiments, when the first set of route planning schemes cannot be retrieved from the map cache database, a map interface is invoked to obtain a map route planning scheme in real time based on the origin and destination; the map route planning scheme is then cached in the map cache database, so that the first set of route planning schemes can be retrieved again based on the map cache database. For example, when a user starts from point B and needs to reach point C, if a route plan from point B to point C cannot be retrieved from the map cache database, i.e., the first set of route planning schemes cannot be retrieved, then a map interface is invoked to obtain at least one map route planning scheme from point B to point C in real time through G-map or similar means. Then, at least one map route planning scheme is cached in the map cache database, and the first set of route planning schemes from point B to point C is retrieved again based on the map cache database.

[0032] It should be noted that the first set of route planning schemes obtained through the map cache database includes at least one route planning scheme. Furthermore, the first set of route planning schemes is actually provided directly by existing map providers.

[0033] In some embodiments, the route planning experience base caches historical route planning data obtained through the route planning model. For example, when a user starts from point A and needs to reach point B, if the route between the two points has already been planned using the route planning model, the user can directly query the route plan from point A to point B in the route planning experience base to obtain the first set of route planning options.

[0034] In some other embodiments, when the second set of route planning schemes cannot be retrieved from the route planning experience base, the route planning model is invoked to obtain a model route planning scheme in real time based on the origin and destination. The model route planning scheme is then cached in the route planning experience base for further retrieval of the second set of route planning schemes based on the experience base. For example, when a user starts from point B and needs to reach point C, if a route from point B to point C cannot be retrieved from the route planning experience base (i.e., the second set of route planning schemes cannot be retrieved), the route planning model is invoked to obtain at least one model route planning scheme in real time based on the origin and destination. Then, at least one model route planning scheme is cached in the route planning experience base, and the second set of route planning schemes from point B to point C is retrieved again based on the map cache database.

[0035] It should be noted that the second set of route planning schemes obtained through the route planning experience database includes at least one route planning scheme.

[0036] Furthermore, calling the route planning model to obtain a model route planning scheme in real time based on the origin and the destination includes: the route planning model obtaining a planned route between the origin and the destination using a graph theory algorithm; the route planning model obtaining the time consumption of edges in the planned route based on flight or train duration and transfer time; the route planning model obtaining the transfer time based on flight or train schedules; the route planning model obtaining the travel time based on the distance from the origin and the destination to the airport or train station; and the route planning model obtaining the model route planning scheme based on the planned route, the time consumption of edges, the transfer time, and the travel time.

[0037] In the above embodiments, the route planning model provided in this application can obtain the coordinates of points B and C (such as railway station coordinates or airport coordinates) in real time using the basic station data interface, and accelerate the retrieval of nearby stations (within a radius of 400KM) through Redis-Geo, and then obtain K planned routes between all stations through graph theory algorithms. Specifically, the K-shortest path algorithm (KSP algorithm) is used to calculate the K planned routes. The A* algorithm (A-star algorithm) is used to calculate the shortest path between two points, significantly improving the efficiency of each shortest path calculation, thereby optimizing the overall solution speed of the K paths.

[0038] Then, the route planning model obtains the time consumption of the edges in the K planned routes according to equation (1).

[0039] Equation (1): ;

[0040] Where W is the time consumed by the edge. This indicates the travel duration of the flight or train represented by the side, in minutes; 100000 is the transit time in minutes; 100000 is a preset fixed time penalty value in minutes, which is used to significantly increase the total cost of paths containing such edges, thereby excluding routes containing such edges.

[0041] Equation (1) can be used to calculate the time consumption of each edge in the K planned routes. In this case, the edge with the shorter time consumption is selected first. For example, there are two planned routes, ABC and ADC. In this case, the time consumption of AB is higher than that of AD, so the edge AD is selected first.

[0042] The transit time can be calculated using equation (2).

[0043] Equation (2): ;

[0044] Here, 24x60 represents a total of 1440 minutes in an operating day; Q represents the number of flights or trains, which can be obtained through existing transportation systems (such as airline ticket purchase systems, train ticket purchase systems, etc.).

[0045] In practice, to reasonably estimate transfer times in route planning, this application uses an average departure interval model based on service frequency to calculate the estimated transfer time. A higher Q indicates more frequent service, resulting in shorter estimated transfer times and more convenient transfers. In this case, a smaller Time2 corresponds to a smaller W obtained according to Equation 1, meaning this edge will be prioritized.

[0046] For example, for a transportation route that provides Q evenly distributed train services within an operating day (24 hours, 24 × 60 minutes), assuming a passenger arrives at a transfer station, the longest transfer time for waiting for the next train is the average departure interval. For example, if a train has Q = 8 daily services, its average departure interval is 180 minutes. Therefore, the estimated transfer time using equation (2) is 180 minutes. When Q = 2, the estimated transfer time using equation (2) is 720 minutes. In this case, the larger W is, the longer the route takes, and the less likely it will be chosen.

[0047] It should be noted that Equation (2) estimates the transfer time based on the total number of minutes in a day, and then obtains W according to Equation (1) for sorting and filtering routes. In some other embodiments, the transfer time can also be estimated based on the number of minutes in a week (24x60x7), and then W can be obtained according to Equation (1) for sorting and filtering. In other words, the transfer time in Equation (2) actually represents the convenience of the transfer. The smaller the estimated Time2, the more convenient the transfer is, and the smaller the obtained W is, and the edge is selected first.

[0048] Furthermore, when paths have similar durations, prioritize nodes with denser connections, i.e., nodes with higher traffic density. For example, AB and AC have similar durations, but node B has denser connections (i.e., more edges originating from B). In this case, node B can be considered to have higher traffic density, and AB should be prioritized.

[0049] In some embodiments, the user inputs a detailed address for the origin and destination, which is a certain distance from the train station or airport. When planning routes, the travel time from the origin / destination to the station should also be considered to eliminate unreasonable planned routes. Therefore, in some embodiments, when the distance from the origin / destination to the airport or train station is within 10 kilometers, the estimated speed is 25 km / h based on urban congestion conditions. For distances exceeding 10 kilometers, the speed is calculated based on 65 km / h for elevated roads / highways, and the travel time is obtained based on the total distance. Then, the route planning model eliminates time-conflicting or unreasonable routes from the K planned routes based on edge time, transfer time, and travel time, prioritizing routes with shorter travel time and higher traffic density to obtain at least one filtered model route planning scheme and its travel time. The route planning model can be a rule engine / AI machine learning model to obtain the model route planning scheme.

[0050] It should be noted that the route planning model can obtain flight or train timetables, as well as corresponding route and schedule data, from existing transportation systems to obtain the model's route planning scheme.

[0051] Step S3: Merge the first group of route planning schemes and the second group of route planning schemes to obtain an initial set of route planning schemes.

[0052] In some embodiments, the first set of route planning schemes obtained through a map cache database query and the second set of route planning schemes obtained through a route planning experience base cache query may overlap. In this case, merging the first and second set of route planning schemes to remove duplicates yields the initial set of route planning schemes. In practice, the initial set of route planning schemes is obtained by prioritizing queries to two existing historical databases. If no historical data is found, the map interface and route planning model are invoked in real time to obtain route plans and store them in the corresponding databases for further querying. This application's mechanism of prioritizing cache queries enables rapid response to point-to-point route planning, effectively reducing computational costs and resources, improving computational efficiency, and expanding the coverage of planning. Furthermore, this application's synchronous parallel querying of the map cache database and the route planning experience base effectively verifies the validity of planned routes and improves the accuracy of point-to-point route planning.

[0053] Step S4: Filter and sort the initial route planning scheme set to obtain a filtered route planning scheme set.

[0054] like Figure 3 As shown, in one embodiment, obtaining the route planning scheme filter set of this application includes the following steps: Step S41: Sort each initial route planning scheme in the initial route planning scheme set according to the route time, and select several initial route planning schemes from smallest to largest as the first group of filtering schemes.

[0055] In some embodiments, if the initial route planning scheme set contains M initial route planning schemes, then the M schemes are sorted according to the total time taken, and m initial route planning schemes are selected from smallest to largest as the first set of filtering schemes. For example, the schemes can be sorted according to the total time taken, and 20 initial route planning schemes can be selected from smallest to largest.

[0056] In some embodiments, when sorting by total time, grouping can be performed. This involves dividing the initial route planning schemes into two groups: one containing flight routes and the other containing only train routes. Specifically, for the flight route group, m1 routes are obtained in ascending order of total time; for the train route group, m2 routes are obtained in ascending order of total time, resulting in the final m initial route planning schemes. This grouping process ensures that users without flight needs can also access train-only routes.

[0057] Step S42: Determine whether there is a bypass scheme in the first group of filtering schemes. If so, filter the bypass scheme and use the remaining schemes in the first group of filtering schemes as the second group of filtering schemes. If not, use the first group of filtering schemes as the second group of filtering schemes.

[0058] In some embodiments, a maximum detour ratio is calculated for each scheme in the first group of filtering schemes. When the calculated maximum detour ratio exceeds a preset threshold, the scheme is considered a detour scheme and is filtered out, thereby using the remaining non-detour schemes as the second group of filtering schemes. If there are no detour schemes in the first group of filtering schemes, the first group of filtering schemes is directly used as the second group of filtering schemes.

[0059] In some embodiments, the maximum bypass ratio for each scheme can be calculated using equation (3).

[0060] Equation (3): ;

[0061] Where distance is the maximum detour ratio, and R is the Earth's radius (average is 6371.0 km).

[0062] Step S43: Determine whether any transit schemes in the second group of filtering schemes meet the transit time requirements. If so, use the transit schemes and direct schemes that meet the transit time requirements as the third group of filtering schemes. If not, use the direct schemes as the third group of filtering schemes.

[0063] In some embodiments, the second set of filtering schemes includes either transit or direct routes. For transit routes, it's necessary to determine whether they meet the transit time requirement and filter out routes that cannot be actually used. Then, transit routes and direct routes that meet the transit failure requirement are used as the third set of filtering schemes. If no transit route in the second set of filtering schemes meets the transit time requirement, only direct routes are used as the third set of filtering schemes. The transit time requirement refers to whether the actual transit time meets the transfer time requirement. For example, if a user travels from point A to point C, they first need to fly from point A to point B, and then take a train from point B to point C. In this case, a transfer is required in point B. The user's actual transit time in point B must be less than the transfer time to meet the transit time requirement. For example, if the transfer time is 1 hour, and the user's actual transit time is 1.5 hours, then the transit time requirement is not met, and the route should be filtered. The transfer time can be obtained from the accessed flight or train timetable data, and the actual transfer time can be obtained from historical data or by calling map APIs, etc. This application does not impose any restrictions.

[0064] Step S44: Use the third set of filtering schemes as the route planning scheme filtering set.

[0065] By sorting by total travel time, filtering by detour options, and filtering by transfer options, a final set of route planning options is obtained, in which each option meets the actual travel requirements.

[0066] Step S5: Based on the departure date or by postponing the departure date by one day, query the route planning scheme filter set corresponding to the route inventory products, and combine the transportation schemes based on the route inventory products to output a point-to-point route planning scheme set to the user.

[0067] In some embodiments, querying the route inventory products corresponding to the route planning scheme filter set based on the departure date or by postponing the departure date by one day includes: querying direct flight inventory products and / or direct train inventory products based on the direct routes in the route planning scheme filter set and the departure date; and querying connecting flight inventory products and / or connecting train inventory products based on the connecting routes in the route planning scheme filter set and the departure date.

[0068] Furthermore, after querying the route inventory products based on the departure date, it is further determined whether the route inventory products obtained from the query are abundant. If not, the departure date is postponed by one day to expand the query of the route inventory products corresponding to the route planning scheme filter set after the postponement.

[0069] In some embodiments, this application can obtain route inventory products through existing transportation provision systems (such as airline ticket purchase systems, train ticket purchase systems, etc.). When the availability of route inventory products for the departure date is insufficient, thus affecting user selection, the query can be expanded to include route inventory products for the day following the departure date. For example, if a user departs on August 13th and the route inventory products obtained by the route planning scheme filter set are insufficient, the query can be automatically expanded to include route inventory products for August 14th to provide the user with more route options. Furthermore, a threshold number of inventory products can be set to determine whether the obtained route inventory products are abundant; that is, when the obtained route inventory products are greater than the inventory product threshold, it is considered that the obtained route inventory products are abundant, and there is no need to expand the query.

[0070] Furthermore, after retrieving a rich set of route inventory products, it is necessary to further perform traffic plan stitching based on these products to output a final set of point-to-point route planning solutions to the user. In some embodiments, performing traffic plan stitching based on the route inventory products includes: Determine the departure airport, departure train station, arrival airport, and / or arrival train station based on the inventory products along the route; Determine connecting traffic segments to add connecting traffic schemes to each scheme in the set of route planning schemes; the connecting traffic segments start at the departure point and end at the departure airport and / or the departure train station, or start at the arrival airport and / or the arrival train station and end at the destination.

[0071] For example, when a user needs to travel from the Peace Hotel in Shanghai to Peking University, the system can filter the route planning options and departure date to find available direct flights, direct trains, connecting flights, and / or connecting trains from Shanghai to Beijing. At this point, it's also necessary to further determine the connecting transportation routes from the Peace Hotel to the Shanghai departure airport / train station, and from the Beijing arrival airport / train station to Peking University, in order to provide alternative transportation options that utilize these routes, such as taking the subway or a taxi to the departure airport.

[0072] When inter-station transfers are required, the spliced ​​transportation segment further includes the transportation segment between the transfer departure point and the transfer destination. For example, when a user travels from the Peace Hotel in Shanghai to Peking University, first by train from Shanghai to Nanjing and then by flight from Nanjing to Beijing, the spliced ​​transportation segment includes the spliced ​​transportation segment from the Peace Hotel in Shanghai to Shanghai Railway Station (departure railway station), the spliced ​​transportation segment from Nanjing Railway Station (transfer departure point) to Nanjing Airport (transfer destination), and the spliced ​​transportation segment from Beijing Airport (arrival airport) to Peking University.

[0073] Furthermore, for sections of road with overlapping traffic routes, one can choose to travel through these sections using other modes of transportation. These modes of transportation include subways, taxis, electric scooters, bicycles, and so on.

[0074] After the transportation plan is stitched together for each plan in the route planning scheme filter set, a point-to-point route planning scheme set is obtained and provided to the user, thereby quickly and efficiently obtaining the planned route from one detailed address to another.

[0075] The scope of protection for the point-to-point route planning method described in this application is not limited to the execution order of the steps listed in this embodiment. Any solution implemented by adding, subtracting, or replacing steps in the prior art based on the principles of this application is included within the scope of protection of this application.

[0076] This application also provides a point-to-point route planning system, which can implement the point-to-point route planning method described in this application. However, the implementation device of the point-to-point route planning system described in this application includes, but is not limited to, the structure of the point-to-point route planning system listed in this embodiment. All structural modifications and substitutions of the prior art made based on the principles of this application are included within the protection scope of this application.

[0077] like Figure 4 As shown, in one embodiment, the point-to-point route planning system of this application includes an input module 31, a route query module 32, an initial planning module 33, a filtering module 34, and a point-to-point planning module 35.

[0078] Input module 31 is used to obtain the departure point, destination and departure date input by the user; The route query module 32 is used to query a first set of route planning schemes and a second set of route planning schemes in parallel based on the origin and the destination; the first set of route planning schemes is obtained by querying the map cache database; the second set of route planning schemes is obtained by querying the route planning experience database. The initial planning module 33 is used to merge the first group of route planning schemes and the second group of route planning schemes to obtain an initial set of route planning schemes; Filtering module 34 is used to filter and sort the initial route planning scheme set to obtain a route planning scheme filter set; The point-to-point planning module 35 is used to query the route inventory products corresponding to the route planning scheme filter set based on the departure date or by postponing the departure date by one day, and to perform transportation scheme splicing based on the route inventory products to output the point-to-point route planning scheme set to the user.

[0079] The structure and principle of the input module 31, the scheme query module 32, the initial planning module 33, the filtering module 34, and the point-to-point planning module 35 correspond one-to-one with the steps in the point-to-point route planning method described above, so they will not be repeated here.

[0080] In the embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, or methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules / units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or units may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection of apparatuses or modules or units may be electrical, mechanical, or other forms.

[0081] The modules / units described as separate components may or may not be physically separate. The components shown as modules / units may or may not be physical modules; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules / units can be selected to achieve the objectives of the embodiments of this application, depending on actual needs. For example, the functional modules / units in the various embodiments of this application may be integrated into one processing module, or each module / unit may exist physically separately, or two or more modules / units may be integrated into one module / unit.

[0082] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0083] This application also provides a computer-readable storage medium. Those skilled in the art will understand that all or part of the steps in the methods of the above embodiments can be implemented by a program instructing a processor. The program can be stored in a computer-readable storage medium, which is a non-transitory medium, such as random access memory, read-only memory, flash memory, hard disk, solid-state drive, magnetic tape, floppy disk, optical disk, and any combination thereof. The storage medium can be any available medium accessible to a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., digital video disc (DVD)), or a semiconductor medium (e.g., solid-state drive (SSD)).

[0084] This application also provides an electronic device. The electronic device includes a processor and a memory.

[0085] The memory is used to store computer programs.

[0086] The memory includes various media capable of storing program code, such as ROM, RAM, magnetic disk, USB flash drive, memory card, or optical disk.

[0087] The processor is connected to the memory and is used to execute the computer program stored in the memory so that the electronic device performs the point-to-point route planning method described above.

[0088] Preferably, the processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0089] like Figure 5As shown, the electronic device of this application is embodied in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: one or more processors or processing units 41, memory 42, and bus 43 connecting different system components (including memory 42 and processing unit 41).

[0090] Bus 43 represents one or more of several bus architectures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any of the various bus architectures. For example, these architectures include, but are not limited to, the Industry Standard Architecture (ISA) bus, the Micro Channel Architecture (MAC) bus, the Enhanced ISA bus, the Video Electronics Standards Association (VESA) local bus, and the Peripheral Component Interconnect (PCI) bus.

[0091] Electronic devices typically include a variety of computer-readable media. These media can be any available media that can be accessed by the electronic device, including volatile and non-volatile media, and removable and non-removable media.

[0092] Memory 42 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 421 and / or cache memory 422. The electronic device may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, storage system 423 may be used to read and write non-removable, non-volatile magnetic media (…). Figure 5 Not shown; usually referred to as a "hard drive"). Although Figure 5 As not shown, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk") and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to bus 43 via one or more data media interfaces. Memory 42 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the embodiments of this application.

[0093] A program / utility 424 having a set (at least one) of program modules 4241 may be stored, for example, in memory 42. Such program modules 4241 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include an implementation of a network environment. Program modules 4241 typically perform the functions and / or methods described in the embodiments of this application.

[0094] The electronic device can also communicate with one or more external devices (e.g., keyboard, pointing device, display, etc.), one or more devices that enable a user to interact with the electronic device, and / or any device that enables the electronic device to communicate with one or more other computing devices (e.g., network interface card, modem, etc.). This communication can be performed through input / output (I / O) interface 44. Furthermore, the electronic device can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) through network adapter 45. Figure 5 As shown, network adapter 45 communicates with other modules of the electronic device via bus 43. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0095] The above embodiments are merely illustrative of the principles and effects of this application and are not intended to limit this application. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of this application. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in this application should still be covered by the claims of this application.

Claims

1. A point-to-point routing method, characterized in that, The method comprises: acquiring a departure location, a destination and a departure date input by a user; querying a first set of route planning schemes and a second set of route planning schemes based on the departure location and the destination; the first set of route planning schemes is acquired based on a map cache database; the second set of route planning schemes is acquired based on a route planning experience library; merging the first set of route planning schemes and the second set of route planning schemes to obtain an initial set of route planning schemes; filtering and sorting the initial set of route planning schemes to obtain a filtered set of route planning schemes; querying a route inventory product corresponding to the filtered set of route planning schemes based on the departure date or a date one day later than the departure date, and splicing a traffic scheme based on the route inventory product to output a set of point-to-point route planning schemes to the user.

2. The point-to-point routing method according to claim 1, characterized in that, The method further comprises: when the first set of route planning schemes cannot be acquired from the map cache database, calling a map interface to acquire a map route planning scheme in real time based on the departure location and the destination; caching the map route planning scheme in the map cache database to acquire the first set of route planning schemes based on the map cache database again.

3. The point-to-point routing method according to claim 1, characterized in that, The method further comprises: when the second set of route planning schemes cannot be acquired from the route planning experience library, calling a route planning model to acquire a model route planning scheme in real time based on the departure location and the destination; caching the model route planning scheme in the route planning experience library to acquire the second set of route planning schemes based on the route planning experience library again.

4. The point-to-point routing method according to claim 3, characterized in that, Calling a route planning model to acquire a model route planning scheme in real time based on the departure location and the destination comprises: the route planning model acquires a planning route between the departure location and the destination according to a graph theory algorithm; the route planning model acquires a time consumption of an edge in the planning route according to a flight or train duration and a transfer duration; the route planning model acquires the transfer duration according to a flight or train schedule; the route planning model acquires a driving duration according to a distance from the departure location and the destination to an airport or a train station; the route planning model acquires the model route planning scheme according to the planning route, the time consumption of the edge, the transfer duration and the driving duration.

5. The point-to-point routing method of claim 1, wherein, Filtering and sorting the initial set of route planning schemes to obtain a filtered set of route planning schemes comprises: sorting each initial route planning scheme in the initial set of route planning schemes according to a route time, and selecting a number of the initial route planning schemes as a first set of filtered schemes from small to large; determining whether there is a detour scheme in the first set of filtered schemes, if yes, filtering the detour scheme and taking the remaining schemes in the first set of filtered schemes as a second set of filtered schemes, if not, taking the first set of filtered schemes as the second set of filtered schemes; determining whether a transit scheme in the second set of filtered schemes meets the transit time requirement, and if so, taking the transit scheme and the direct scheme that meet the transit time requirement as a third set of filtered schemes, or if not, taking the direct scheme as the third set of filtered schemes; taking the third set of filtered schemes as the route planning scheme filtered set.

6. The point-to-point routing method of claim 1, wherein, querying a route inventory product corresponding to the route planning scheme filtered set based on the departure date or the departure date being delayed by one day includes: querying a direct flight inventory product and / or a direct train inventory product based on a direct scheme in the route planning scheme filtered set and the departure date; querying a transit flight inventory product and / or a transit train inventory product based on a transit scheme in the route planning scheme filtered set and the departure date; and determining whether the route inventory product is abundant, and if not, delaying the departure date by one day to expand the route inventory product corresponding to the route planning scheme filtered set after the delay.

7. The point-to-point routing method of claim 1, wherein, traffic scheme splicing based on the route inventory product includes: determining a departure airport, a departure train station, an arrival airport, and / or an arrival train station according to the route inventory product; determining a spliced traffic section to add a spliced traffic scheme for each scheme in the route planning scheme set; the spliced traffic section starts at the departure location and ends at the departure airport and / or the departure train station, or starts at the arrival airport and / or the arrival train station and ends at the destination.

8. A point-to-point routing system characterized in that, The system includes: an input module configured to obtain a departure location, a destination, and a departure date input by a user; a scheme query module configured to query a first set of route planning schemes and a second set of route planning schemes in parallel based on the departure location and the destination; the first set of route planning schemes is obtained based on a map cache database; the second set of route planning schemes is obtained based on a route planning experience library; an initial planning module configured to merge the first set of route planning schemes and the second set of route planning schemes to obtain an initial route planning scheme set; a filtering module configured to filter and sort the initial route planning scheme set to obtain a route planning scheme filtered set; a point-to-point planning module configured to query a route inventory product corresponding to the route planning scheme filtered set based on the departure date or the departure date being delayed by one day, and to perform traffic scheme splicing based on the route inventory product, so as to output a point-to-point route planning scheme set to the user.

9. An electronic device, comprising: The electronic device includes a processor and a memory; the memory is configured to store a computer program; the processor is configured to execute the computer program stored in the memory, so that the electronic device performs the method of any one of claims 1 to 7.

10. A computer-readable storage medium having stored thereon a computer program, characterized in that, The program is executed by the electronic device to implement the method of any one of claims 1 to 7. The program is executed by the electronic device to implement the method of any one of claims 1 to 7.

Images