Railway transfer travel route optimization method and device, equipment and storage medium

Abstract

The embodiment of the invention provides a railway transfer travel route optimization method and device, equipment and a storage medium. The method comprises the steps that the minimum transfer time of railway transfer is estimated; based on the railway transfer minimum transfer time, constructing a multi-level full-road through travel network and a reachable travel network; estimating a full-road reachable OD path data set, a target reachable OD path data set and a turn-round train number data set in the travel based on the travel network; and receiving a remaining ticket query request, obtaining a travel route in the remaining ticket query request, determining a transfer route candidate set corresponding to the travel route, and according to the railway transfer minimum transfer time and the in-travel turn train number data set, determining a transfer route candidate set corresponding to the travel route. And filtering out target transfer routes corresponding to the travel route from the transfer route candidate set, including transfer at the same station and transfer at different stations at the same city, and carrying out sorting display on the target transfer routes, so that passengers can be helped to quickly find the optimal transfer route when querying the direct train number.

Description

Technical Field

[0001] The present application relates to the technical field of route planning, and in particular to a method, device, equipment and storage medium for optimizing a railway transfer travel route. Background Art

[0002] At present, in order to meet the travel needs of passengers who do not have direct trains or who have direct trains but no remaining tickets, the railway ticket purchasing system provides a transfer service that includes two sections of railway journeys. With the continuous expansion of the user scale and the proportion of transfer in railway ticket sales, more users have put forward new demands on the existing railway transfer function, which are mainly reflected in the following two aspects: First, transfer routes with better fares and duration than direct trains have not been discovered quickly by users. In a complex railway operation network, there may be a large number of transfer routes (referred to as "optimal transfer routes") between some boarding and alighting stations, with the same ticket price and better duration than direct trains. In related technologies, direct trains and transfer routes are sorted separately, and direct trains are displayed first. Some passengers who prefer lower fares and shorter durations and are not sensitive to the need for transfers have a poor ticket purchasing experience.

[0003] Second, in the relevant technology, the transfer route algorithm has the probability of "turning back" within the trip under special conditions. According to the railway ticket organization rules, the longer the transportation distance in the same train, the easier it is for passengers to buy tickets. Assuming that there is a transfer station C between the departure station A and the arrival station B, and there is a train that passes through B and C successively, when there are insufficient tickets between stations A and B, but there are tickets between stations A and C, the relevant algorithm may recommend the following route to passengers: passengers first take the train to arrive at station C in the first leg of the journey, and then change to other trains to return to station B, while the first train has stopped at station B before arriving at station C (the train that first passes the destination station and then the transfer station is called a "turning back train within the trip"), causing passengers to spend more time and money to return to the station they have passed.

[0004] At the same time, the existing transfer route algorithm involves the calculation of the optimal transfer station / node under a complex operating network, multiple ticket remaining inquiries and screening and filtering operations. The dynamic changes in train remaining tickets and irregular changes in ticket prices require more comparison, inquiry, filtering, calculation and other processes to be added in this process, which can easily cause the performance of the existing transfer route algorithm to decline and affect the passengers' ticket purchasing experience.

[0005] In the field of railway passenger route planning research, the relevant literature mainly focuses on the study of partial static railway route planning models based on traditional shortest path algorithms, which mainly take the lowest travel cost, shortest travel time, shortest mileage, etc. as single optimization goals, and use specific transfer stations as transfer nodes. There is a lack of consideration of the impact of passengers' transfer time in different stations and between stations on the continuation of the journey, ticket prices and other dynamic factors. Transfer stations and transfer routes are generally calculated based on static train operation data. In the field of route planning research other than railways, related research is mainly aimed at scenarios with small travel networks and user scales, and the system does not have high requirements for high concurrent requests, and establishes optimization models. Among them, various constraints are often relatively fixed, transfer points are relatively determined, and Dijkstra, A Algorithms and Lagrangian relaxation and other basic theories are used as solution methods. However, my country's railway operation network has many stations and wide lines, different stations have different divisions of labor, different connecting line construction, train operation plans and operation diagrams are adjusted in stages, train ticket quotas change dynamically, and large-scale passenger travel needs and preferences vary greatly under high concurrent requests. The superposition of multiple macro-micro, dynamic and static, and subjective and objective factors makes the railway operation network extremely complex. The various constraints in path planning change dynamically, and the range of passenger transfer nodes is vague and uncertain. Directly copying existing theoretical methods is difficult to adapt to the supply and demand coupling relationship of dynamic changes in time and space and the high concurrent request environment.

[0006] In the application field of railway passenger route planning, existing travel platforms provide railway transfer service functions. However, except for the 12306 website, travel platforms cannot timely grasp the traffic status inside and outside the station, changes in train and ticket resources, do not participate in the organization and management of railway transportation, and have unreasonable control over passenger transfer time and inaccurate grasp of passenger travel demand OD, which can easily lead to passengers "missing their rides".

[0007] Among the existing inventions, the patent "Calculation method and system, device and storage medium for railway passenger transfer scheme" (patent application number: CN202210405948.X) proposes an overall calculation method for railway passenger transfer routes, but does not describe the following: (1) Calculation method for transfer stations between different stations in the same city; (2) Optimization and adjustment of transfer station priority according to the minimum transfer time; (3) Estimation of OD and transfer stations that are superior to direct trains in terms of ticket price, duration, etc.; (4) Comparison and mixed sorting display method of transfer and direct travel routes; (5) Method for filtering return trains within the itinerary. The patent "Calculation method, system, device and medium for the minimum transfer time between railway stations in the same city" (patent authorization number: ZL202311003037.5) describes in detail the calculation method for the minimum transfer time between railway stations in the same city. Summary of the invention

[0008] The embodiments of the present application provide a method, device, equipment and storage medium for optimizing a railway transfer travel route.

[0009] A first aspect of the embodiments of the present application provides a method for optimizing a railway transfer travel route, comprising: Estimated minimum transfer time for railway transfer, where the minimum transfer time for railway transfer includes the minimum transfer time for different stations in the same city, the minimum transfer time for the same station and the convenient transfer time; Based on the minimum transfer time of railway transfer, according to the preset train operation plan and the definition of railway stations in the same city, a multi-level full-line direct travel network and a reachable travel network of train number-station-node are constructed; Based on the multi-level all-way direct travel network and accessible travel network of train number, station number and node number, the all-way accessible OD path dataset and the target accessible OD path dataset as well as the return train number dataset within the trip are estimated, where the OD path is the path between the departure point and the destination; A request for remaining ticket query is received, a travel itinerary in the request for remaining ticket query is obtained, a candidate set of transfer routes corresponding to the travel itinerary is determined, a target transfer route corresponding to the travel itinerary is filtered out from the candidate set of transfer routes according to the minimum transfer time for railway transfer and a data set of return trains within the itinerary, and the target transfer route is compared, sorted and displayed with the direct route corresponding to the travel itinerary.

[0010] In an optional embodiment of the present application, determining a candidate set of transfer routes corresponding to the travel itinerary includes: Determine whether the travel itinerary belongs to a travel itinerary in the target reachable OD path data set; In the case where the travel itinerary belongs to a trip in the target reachable OD path data set, extracting a first transfer route candidate set corresponding to the travel itinerary from the target reachable OD path data set; When the travel itinerary does not belong to the itinerary in the target reachable OD path data set, a second transfer route candidate set corresponding to the travel itinerary is extracted from the all-route reachable OD path data set, and the first transfer route candidate set and the second transfer route candidate set both include same-station transfer and same-city different-station transfer route candidate sets.

[0011] In an optional embodiment of the present application, the determining whether the travel itinerary belongs to a target reachable OD path data set concentrated itinerary includes: Convert the departure place and destination in the travel itinerary into a departure station and an arrival station. If the departure place and destination in the travel itinerary are cities, obtain all the corresponding departure station and arrival station information in the city according to a preset same-city station definition table; Determine whether the departure station and the arrival station of the travel itinerary are consistent with the departure station and the arrival station in at least one itinerary record in the target reachable OD path data set; When the departure station and arrival station of the travel itinerary are consistent with the departure station and arrival station in at least one itinerary record in the target reachable OD path data set, it is determined that the travel itinerary belongs to the itinerary in the target reachable OD path data set.

[0012] In an optional embodiment of the present application, filtering out a target transfer route corresponding to the travel itinerary from the transfer route candidate set according to the railway transfer minimum transfer time and the return train number dataset within the itinerary includes: Eliminate the transfer routes that meet any of the following preset conditions in the transfer route candidate set: there is a return trip in the transfer route, there is a return route in the transfer route, and the transfer time is less than the minimum transfer time of railway transfer; The transfer routes in the eliminated transfer route candidate set are used as the target transfer routes corresponding to the travel itinerary.

[0013] In an optional embodiment of the present application, based on the minimum transfer time of railway transfer, according to the preset train operation plan and the definition of railway stations in the same city, a multi-level full-road direct travel network and a reachable travel network of train number-station-node are constructed, including: Perform association calculation on the preset stop station data table in the preset train operation plan to obtain the direct train OD data set; Extract the direct train OD process data set D1 with the shortest duration and the direct train OD process data set D2 with the lowest fare from the direct train OD data set; Perform association calculation on the direct train OD process data set D1 and the direct train OD process data set D2 to obtain the direct station OD data set; Perform association calculation on the direct station OD data set and the preset same-city station definition table to obtain the direct node OD process data set D3; Extract the direct node OD data set with the smallest duration and fare from the direct node OD process data set D3; Perform association calculation on the direct node OD data set to obtain the reachable station OD process data set D4; Based on the accessible station OD process dataset D4, we obtain the accessible station OD process dataset D5 for intra-station transfer and the accessible station OD process dataset D6 for intra-city and inter-station transfer; Merge the reachable station OD process dataset D5 and the reachable station OD process dataset D6 into the reachable station OD process dataset D7; Based on the reachable station OD process dataset D7, obtain the reachable station OD process dataset D8 sorted by duration and the reachable station OD process dataset D9 sorted by fare; Merge the reachable station OD process dataset D8 and the reachable station OD process dataset D9 into the reachable station OD dataset; Extract the reachable station OD process dataset D from the reachable station OD process dataset D4 10 ; For the OD process dataset D of the reachable station 10 The data are grouped and sorted according to the duration or fare to obtain a reachable node OD data set, wherein the sequence number of each data set is the transfer node priority, and the reachable node OD data set is a transfer route set of two trips, and the transfer route set includes a departure node, a transfer node, an arrival node, a duration and a duration priority information.

[0014] In an optional embodiment of the present application, the multi-level all-way direct travel network and the accessible travel network based on train number, station number and node number, the estimated all-way accessible OD path dataset and the target accessible OD path dataset, and the return train number dataset within the trip include: Extract the optimal transfer node process dataset of the entire route from the reachable node OD dataset; According to the definition table of stations in the same city, the departure node, transfer node and arrival node of each record in the optimal transfer node process data set of the entire route are replaced with the corresponding stations, and the departure station, transfer station, arrival station and priority of each record are extracted to obtain the OD path data set of the entire route. Perform association calculation on the direct train OD data set and the all-accessible OD path data set to obtain the return train data set within the itinerary in the all-accessible OD path data set; The records in the reachable station OD dataset and the direct station OD dataset with the same departure and arrival stations and smaller duration or ticket price are collected into the target reachable OD path dataset.

[0015] In an optional embodiment of the present application, the comparing, sorting and displaying the target transfer route and the direct route corresponding to the travel itinerary includes: For each target transfer route, query the number of remaining tickets of each seat type for the direct trains in each segment of the current target transfer route to obtain the target transfer routes with tickets; According to the duration or the ticket price, the target transfer routes with tickets and the direct routes corresponding to the travel itinerary are compared, sorted and displayed.

[0016] A second aspect of the embodiment of the present application provides a railway transfer travel route optimization device, comprising: The first estimation module is used to estimate the minimum transfer time of railway transfer, wherein the minimum transfer time of railway transfer includes the minimum transfer time of different stations in the same city, the minimum transfer time of the same station and the convenient transfer time; A construction module is used to construct a multi-level full-line direct travel network and a reachable travel network of train number-station-node based on the minimum transfer time of the railway transfer, according to the preset train operation plan and the definition of railway stations in the same city; The second estimation module is used to estimate the full-route reachable OD path dataset and the target reachable OD path dataset as well as the return train data set within the trip based on the multi-level all-route direct travel network and reachable travel network of train number-station-node, where the OD path is the path between the departure place and the destination; The determination module is used to receive a remaining ticket query request, obtain the travel itinerary in the remaining ticket query request, determine a candidate set of transfer routes corresponding to the travel itinerary, filter out a target transfer route corresponding to the travel itinerary from the candidate set of transfer routes according to the minimum transfer time for railway transfer and the return train number data set within the itinerary, and compare, sort and display the target transfer route with the direct route corresponding to the travel itinerary.

[0017] According to a third aspect of an embodiment of the present application, a computer device is provided, including: a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of any of the above methods for optimizing a railway transfer travel route are implemented.

[0018] A fourth aspect of an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the computer program implements the steps of any of the above methods for optimizing a railway transfer travel route.

[0019] The above technical solution provided by the embodiment of the present application has at least some or all of the following advantages compared with the prior art: The railway transfer travel route optimization method described in the embodiment of the present application estimates the minimum transfer time of railway transfer, wherein the minimum transfer time of railway transfer includes the minimum transfer time of different stations in the same city, the minimum transfer time of the same station and the convenient transfer time; based on the minimum transfer time of railway transfer, according to the preset train operation plan and the definition of railway stations in the same city, a multi-level full-route direct travel network and a reachable travel network of train number-station-node are constructed; based on the multi-level full-route direct travel network and the reachable travel network of train number-station-node, a full-route reachable OD path dataset and a target reachable OD path dataset as well as a return train number dataset within the itinerary are estimated, wherein the OD path The method comprises the following steps: receiving a remaining ticket query request, obtaining the travel itinerary in the remaining ticket query request, determining a candidate set of transfer routes corresponding to the travel itinerary, filtering out a target transfer route corresponding to the travel itinerary from the candidate set of transfer routes according to the minimum transfer time for railway transfer and a data set of return trains within the itinerary, and comparing, sorting and displaying the target transfer route with the direct route corresponding to the travel itinerary, so as to help passengers quickly find the optimal transfer route when inquiring about direct trains, and minimize the probability of turning back within the itinerary of the transfer route, thereby further improving the scientific rationality of the railway transfer route. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings: Figure 1 A flow chart of a method for optimizing a railway transfer travel route provided in one embodiment of the present application; Figure 2 A detailed flow chart of a method for optimizing a railway transfer travel route provided in one embodiment of the present application; Figure 3 A schematic diagram of the structure of a railway transfer travel route optimization device provided in one embodiment of the present application; Figure 4 A schematic diagram of the computer device structure provided for one embodiment of the present application. DETAILED DESCRIPTION

[0021] In order to make the technical solutions and advantages in the embodiments of the present application more clearly understood, the exemplary embodiments of the present application are further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than an exhaustive list of all the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other without conflict.

[0022] See also Figure 1 and Figure 2 The railway transfer travel route optimization method provided in the embodiment of the present application includes the following steps: Step 100, estimating the minimum transfer time for railway transfer, wherein the minimum transfer time for railway transfer includes the minimum transfer time for different stations in the same city, the minimum transfer time for the same station and the convenient transfer time; Step 200: Based on the minimum transfer time of railway transit, according to the preset train operation plan and the definition of railway stations in the same city, a multi-level full-line direct travel network and a reachable travel network of train number-station-node are constructed; Step 300: Based on the multi-level all-way direct travel network and the accessible travel network of train number-station-node, estimate the all-way accessible OD path dataset and the target accessible OD path dataset and the return train number dataset within the trip, wherein the OD path is the path between the departure place and the destination, wherein the target accessible OD path dataset is the optimal accessible OD path dataset; Step 400: receiving a remaining ticket query request, obtaining the travel itinerary in the remaining ticket query request, determining a candidate set of transfer routes corresponding to the travel itinerary, filtering out a target transfer route corresponding to the travel itinerary from the candidate set of transfer routes according to the minimum transfer time for railway transfer and a data set of return trains within the itinerary, and comparing, sorting and displaying the target transfer route and the direct route corresponding to the travel itinerary.

[0023] In an optional embodiment of the present application, the transfer time refers to the time interval between the departure time of the next journey and the arrival time of the previous journey. In order to avoid the risk of passengers being unable to catch the second train due to too short transfer time, the transfer time of the railway transfer route displayed to the user cannot be lower than a minimum value, which is called the minimum transfer time, which is divided into the minimum transfer time at the same station, the minimum transfer time at different stations in the same city, and the convenient transfer time. Among them, the minimum transfer time at the same station is mainly determined by the average time spent by passengers in entering and exiting the station; the minimum transfer time at different stations in the same city of railway is jointly determined by the average time spent in entering and exiting the relevant stations and the travel time between stations. The convenient transfer time is jointly determined by the specific railway bureau and the station, generally set at 15 minutes, and can also be dynamically and differently defined according to special circumstances such as station construction, emergencies, and passenger preferences.

[0024] In the railway transfer travel route optimization method of the present application, the minimum transfer time between the same railway station and different railway stations in the same city is calculated, which is used as one of the constraints for generating a reasonable transfer route, thereby avoiding passengers missing their trains due to too short transfer time.

[0025] In an optional embodiment of the present application, determining a candidate set of transfer routes corresponding to the travel itinerary includes: Determine whether the travel itinerary belongs to a travel itinerary in the target reachable OD path data set; In the case where the travel itinerary belongs to a travel in the target reachable OD path data set, a first transfer route candidate set corresponding to the travel itinerary is extracted from the target reachable OD path data set, wherein the first transfer route candidate set is Figure 2 The optimal transfer route candidate set in ; When the travel itinerary does not belong to the itinerary in the target reachable OD path data set, a second transfer route candidate set corresponding to the travel itinerary is extracted from the full reachable OD path data set, wherein the second transfer route candidate set is Figure 2 The general transfer route candidate set in the first transfer route candidate set and the second transfer route candidate set both include same-station transfer and same-city different-station transfer route candidate sets.

[0026] In an optional embodiment of the present application, the determining whether the travel itinerary belongs to a target reachable OD path data set concentrated itinerary includes: Convert the departure place and destination in the travel itinerary into a departure station and an arrival station. If the departure place and destination in the travel itinerary are cities, obtain all the corresponding departure station and arrival station information in the city according to a preset same-city station definition table; Determine whether the departure station and the arrival station of the travel itinerary are consistent with the departure station and the arrival station in at least one itinerary record in the target reachable OD path data set; When the departure station and arrival station of the travel itinerary are consistent with the departure station and arrival station in at least one itinerary record in the target reachable OD path data set, it is determined that the travel itinerary belongs to the itinerary in the target reachable OD path data set.

[0027] In the railway transfer travel route optimization method of the present application, after a passenger submits a remaining ticket query request, if the travel itinerary in the request belongs to the itinerary concentrated in the target reachable OD path data, the first transfer route candidate set that needs to be compared with the direct train is calculated according to the target reachable OD path, and the ticket price, duration, etc. of the first transfer route candidate set are compared with the direct trains as the optimal transfer route candidate set, so as to realize a mixed sorting display of transfer routes and direct trains.

[0028] The railway transfer travel route optimization method of the present application requires that the transfer route candidate set be filtered according to the minimum transfer time in the existing transfer algorithm, and detour routes (return routes between trips) be eliminated, that is, the OD trajectories of the previous and next trips overlap, such as passing through the first trip stop station in the second trip. On this basis, the calculation step of filtering the return trains within the trip is added to further improve the scientific rationality of the transfer route.

[0029] In an optional embodiment of the present application, filtering out a target transfer route corresponding to the travel itinerary from the transfer route candidate set according to the railway transfer minimum transfer time and the return train number dataset within the itinerary includes: Eliminate the transfer routes that meet any of the following preset conditions in the transfer route candidate set: there is a return trip in the transfer route, there is a return route in the transfer route, and the transfer time is less than the minimum transfer time of railway transfer; The transfer routes in the eliminated transfer route candidate set are used as the target transfer routes corresponding to the travel itinerary.

[0030] In an optional embodiment of the present application, the transfer route candidate set includes an optimal transfer route candidate set and a general transfer route candidate set, and the target transfer route includes the optimal transfer route candidate set and the general transfer route candidate set after elimination.

[0031] In an optional embodiment of the present application, if the first trip train passes through a certain station and the subsequent train returns to the station, the transfer route is considered to be a return route. In an optional embodiment of the present application, based on the minimum transfer time of the railway transfer, according to the preset train operation plan and the definition of the railway station in the same city, a program is written in SQL language or other general programming language to construct a multi-level full-road direct travel network and a reachable travel network of train number-station-node, including: Perform association calculation on the preset stop station data table in the preset train operation plan to obtain the direct train OD data set; Extract the direct train OD process data set D1 with the shortest duration and the direct train OD process data set D2 with the lowest fare from the direct train OD data set; Perform association calculation on the direct train OD process data set D1 and the direct train OD process data set D2 to obtain the direct station OD data set; Perform association calculation on the direct station OD data set and the preset same-city station definition table to obtain the direct node OD process data set D3; Extract the direct node OD data set with the smallest duration and fare from the direct node OD process data set D3; Perform association calculation on the direct node OD data set to obtain the reachable station OD process data set D4; Based on the accessible station OD process dataset D4, we obtain the accessible station OD process dataset D5 for intra-station transfer and the accessible station OD process dataset D6 for intra-city and inter-station transfer; Merge the reachable station OD process dataset D5 and the reachable station OD process dataset D6 into the reachable station OD process dataset D7; Based on the reachable station OD process dataset D7, obtain the reachable station OD process dataset D8 sorted by duration and the reachable station OD process dataset D9 sorted by fare; Merge the reachable station OD process dataset D8 and the reachable station OD process dataset D9 into the reachable station OD dataset; Extract the reachable station OD process dataset D from the reachable station OD process dataset D4 10 ; For the OD process dataset D of the reachable station 10 The data are grouped and sorted according to the duration or fare to obtain a reachable node OD data set, wherein the sequence number of each data set is the transfer node priority, and the reachable node OD data set is a transfer route set of two trips, and the transfer route set includes a departure node, a transfer node, an arrival node, a duration and a duration priority information.

[0032] In an optional embodiment of the present application, a preset stop station data table in a preset train operation plan is associated with calculation to obtain a direct train OD data set, including: Take two identical stop station data tables t1 and t2, extract train departure information from table t1, extract train arrival information from table t2, and perform association calculation on t1 and t2. If the passing train numbers and effective departure dates in tables t1 and t2 are the same, and the station sequence of t1 is less than that of t2, take the stop station, departure date, departure time and other information from table t1, and take the stop station, arrival date, arrival time and other information from table t2, and get the direct train OD data set, including departure station, arrival station, train number, departure date, departure time, arrival date, arrival time and other information.

[0033] In an optional embodiment of the present application, a direct train OD process data set D1 with the shortest duration and a direct train OD process data set D2 with the lowest fare are respectively extracted from the direct train OD data set, including: The direct train OD data set is grouped according to the departure station and arrival station, and then each group of data is sorted from small to large according to the duration, and the direct train OD process data set D1 with the shortest duration is extracted, including the departure station, arrival station, train number, minimum duration and other information. Among them, each group of data includes all direct trains with the same departure station and arrival station; Since the passenger flow of hard seats in ordinary trains and second-class seats in EMUs and high-speed trains accounts for the largest proportion, the relevant information of hard seats and second-class seats in the railway train OD fare data table can be extracted, the departure station and arrival station are grouped, and then each group of data is sorted from small to large according to the fare, and the direct train OD process data set D2 with the smallest fare is extracted, which includes information such as departure station, arrival station, train number, and minimum fare.

[0034] In an optional embodiment of the present application, a correlation calculation is performed on the direct train OD process data set D1 and the direct train OD process data set D2 to obtain a direct station OD data set, including: The process data sets D1 and D2 are associated and calculated according to the departure station and arrival station to obtain the direct station OD data set, including the departure station, arrival station, train number, minimum duration, minimum fare and other information.

[0035] In an optional embodiment of the present application, a correlation calculation is performed on the direct station OD data set and the preset same-city station definition table to obtain a direct node OD process data set D3, including: Take the direct station OD data set as table t3, take two identical same-city station definition tables t4 and t5, extract the city information of the departure station from t4, and extract the city information of the arrival station from t5; Perform association calculation on t3, t4, and t5. If the departure station of t3 is the same as the station of t4, extract the corresponding city from t4 as the departure node, otherwise use the departure station of t3 as the departure node; if the arrival station of t3 is the same as the station in table t5, extract the corresponding city from t5 as the arrival node, otherwise use the arrival station of t3 as the arrival node. Finally, the direct node OD process data set D3 is obtained, which mainly includes information such as departure node, departure station, arrival node, arrival station, minimum duration, and minimum fare. Among them, the departure node and arrival node may be a station or a city.

[0036] In an optional embodiment of the present application, a direct node OD data set with the minimum duration and fare is extracted from the direct node OD process data set D3, including: The direct node OD data set is grouped according to the departure node and arrival node, and then each group of data is sorted from small to large according to the duration and fare. The direct node OD data set with the smallest duration and fare is extracted, including the departure node, departure station, arrival node, arrival station, minimum duration, minimum fare and other information.

[0037] In an optional embodiment of the present application, each station can be fully accessible through one or more transfers. Taking the transfer route calculation method including two railway journeys as an example, the direct node OD data set is associated with the data set to obtain the reachable station OD process data set D4, including: Take two identical direct node OD data sets, namely tables t1 and t2, and use table t1 as the first segment of the journey route table and table t2 as the second segment of the journey route table. Under the condition that the arrival node of table t1 and the departure node of table t2 are the same, extract the departure station, departure node, and arrival station from t1 as transfer station 1; extract the arrival station, arrival node, and departure station from t2 as transfer station 2; extract the minimum duration from t1 and t2 and add them together to get the duration, and extract the minimum fare and add them together to get the fare; extract the arrival node from t1 or the departure node from t2 as the transfer node to obtain the reachable station OD process data set D4, including the departure station, departure node, transfer node, transfer station 1, transfer station 2, arrival station, arrival node, duration, fare and other information.

[0038] In an optional embodiment of the present application, based on the accessible station OD process data set D4, an accessible station OD process data set D5 for same-station transfer and an accessible station OD process data set D6 for same-city different-station transfer are obtained, including: Extract the same data of transfer station 1 and transfer station 2 from process data set D4, then query the minimum transfer time corresponding to transfer station 1 in the minimum transfer time data of the same station, add the minimum transfer time of the same station to the duration of the record containing transfer station 1, and obtain the OD data set D5 of reachable stations for transfers at the same station; extract the data of transfer station 1 that is different from transfer station 2 from process data set D4, then query the minimum transfer time from transfer station 1 to transfer station 2 in the minimum transfer time data of different stations in the same city, add the minimum transfer time of different stations in the same city to the duration of the record containing transfer station 1 to transfer station 2, and obtain the OD data set D6 of reachable stations for transfers at different stations in the same city.

[0039] In an optional embodiment of the present application, based on the reachable station OD process data set D7, a reachable station OD process data set D8 sorted by duration and a reachable station OD process data set D9 sorted by fare are obtained, including: Merge data sets D5 and D6 to obtain the reachable station OD process data set D7. Group process data set D7 according to departure station and arrival station, and then sort each group of data from small to large duration, and use the sorting number as the duration priority of transfer station 1 and transfer station 2 (the smaller the number, the higher the priority), and obtain the reachable station OD process data set D8, including departure station, transfer station 1, transfer station 2, arrival station, duration, duration priority and other information; According to the calculation method of process data set D8, the accessible station OD process data set D9 from the fare perspective is obtained, including departure node, departure station, transfer node, transfer station 1, transfer station 2, arrival node, arrival station, fare, fare priority and other information.

[0040] In an optional embodiment of the present application, the reachable station OD process data set D8 and the reachable station OD process data set D9 are merged into a reachable station OD data set, including: Datasets D8 and D9 are merged and deduplicated, and information such as departure station, transfer station 1, transfer station 2, arrival station, duration, duration priority, fare, and fare priority are extracted to obtain the accessible station OD data set.

[0041] In an optional embodiment of the present application, the reachable station OD process dataset D4 is extracted from the reachable station OD process dataset D 10 ,include: Extract the departure node, transfer node, arrival node, duration, fare and other information in each record from the reachable station OD process dataset D4 to obtain the reachable node OD process dataset D 10 .

[0042] In an optional embodiment of the present application, the OD process data set D of the reachable station 10 Group and sort each group of data by duration or fare to obtain the reachable node OD data set, including: According to the departure node and arrival node, the process data set D 10 The data are grouped and sorted from small to large according to the duration. The sorting number of each group of data is recorded as the transfer node priority (the smaller the number, the higher the priority). The reachable node OD data set is obtained, including departure node, transfer node, arrival node, duration, duration priority and other information.

[0043] In an optional embodiment of the present application, the method further includes: If you want to calculate a transfer route that includes three sections of railway journeys, you can use the reachable node OD datasets of the two sections of the journey to associate and calculate the direct node OD dataset, and then group them according to the departure node and arrival node and sort them according to the duration to obtain the reachable node OD dataset that includes three sections of railway journeys. Similarly, you can use multiple iterative calculation methods to obtain the reachable node OD dataset that includes more than three sections of railway journeys. Similarly, based on the full route reachable and direct station OD datasets, you can do an association calculation to obtain the reachable station OD dataset that includes three or more sections of railway journeys.

[0044] In an optional embodiment of the present application, the priority of transfer stations and transfer nodes can be calculated from the perspectives of duration, ticket price, etc., or the priority of transfer stations and transfer nodes can be calculated from the perspectives of distance, number of train runs, etc. according to the actual data distribution, or from multiple perspectives at the same time.

[0045] This application comprehensively considers uncertain factors such as temporary adjustments to train operation plans and passenger travel needs, and uses stations or cities as transfer nodes to calculate the reachable node OD data set. It can fuzzily match passengers' transfer needs in real time according to the railway same-city station definition table, and then passengers can choose the corresponding transfer plan based on actual needs, specific locations, preferences, etc.

[0046] In an optional embodiment of the present application, the railway stop station data table generally includes information such as the stop station, station sequence, passing train number, departure date, departure time, arrival date, arrival time, station sequence in the train number, valid departure date range, and distance from the train departure station to the stop station.

[0047] This application expands the concept of transfer stations, taking transfer stations or transfer cities as transfer nodes, and provides data support for calculating transfer stations / nodes in different cities, comparing transfers and direct travel routes, and filtering return trips and routes.

[0048] In the railway transfer travel route optimization method of the present application, the uncertainty of the user's travel OD position is taken into account, the transfer demand between different stations in the same city is taken into account, and the goal of further improving the rationality of the transfer route is achieved. According to the latest train operation plan (stop station data table), railway station definition in the same city and other data, combined with the pre-filtering operation of the minimum transfer time, a multi-level full-route direct travel and accessible travel network of "train number-station-node" is constructed in sequence to support the estimated calculation of the full-route accessible OD path, the return train number within the trip and the optimal accessible OD path.

[0049] In an optional embodiment of the present application, the multi-level all-way direct travel network and the accessible travel network based on train number, station number and node number are used to write a program in SQL language or other general programming languages ​​to estimate the all-way accessible OD path dataset and the target accessible OD path dataset and the return train number dataset within the trip, including: Extract the optimal transfer node process dataset of the entire route from the reachable node OD dataset; According to the definition table of stations in the same city, the departure node, transfer node and arrival node of each record in the optimal transfer node process data set of the entire route are replaced with any corresponding station, and the departure station, transfer station, arrival station and priority of each record are extracted to obtain the OD path data set of the entire route. Perform association calculation on the direct train OD data set and the all-accessible OD path data set to obtain the return train data set within the itinerary in the all-accessible OD path data set; The records in the reachable station OD dataset and the direct station OD dataset with the same departure and arrival stations and smaller duration or ticket price are collected into the target reachable OD path dataset.

[0050] In an optional embodiment of the present application, the fully accessible OD path is used to calculate all potential and reasonable transfer routes. The return train within the itinerary is a direct train that is inconsistent with the forward direction of the fully accessible OD path. The optimally accessible OD path is used to determine the range of transfer routes that need to be compared with the direct train. The railway station definition table usually includes the station and the city to which it belongs. There are some stations that are not within the definition of the railway station in the same city. Railway train OD fare data includes information such as train number, departure station, arrival station, and fare.

[0051] In an optional embodiment of the present application, extracting the optimal transfer node process data set of the entire route from the reachable node OD data set includes: Taking the time priority as the basis for selecting the optimal transfer station, the optimal number of transfer nodes between the OD nodes with the highest priority is selected. A value can be determined based on business experience. For example, the top 10 transfer nodes may be selected to meet all transfer needs of a pair of ODs. The optimal number of transfer nodes between ODs can also be dynamically adjusted based on the differentiated distribution of passenger flow. According to the determined number of transfer nodes, the departure node, transfer node, arrival node, duration priority and other information of each record are extracted from the reachable node OD data set. The duration priority is used as the transfer node priority to obtain the optimal transfer node process data set of the entire route.

[0052] In an optional embodiment of the present application, the records in the reachable station OD data set and the records in the direct station OD data set with the same departure station and arrival station and a smaller duration or ticket price are collected as a target reachable OD path data set, including: The direct station OD data set is table t6, and the reachable station OD data set is table t7. By comparing the station OD transfer and the minimum direct bus fare / duration, the optimal reachable OD path can be estimated. The steps are as follows: Set the association conditions between t6 and t7: t6 and t7 have the same departure station and the same arrival station; Under the above-mentioned association conditions, extract the data set corresponding to the duration or fare with the first priority from t7, compare it with the minimum duration or fare under the corresponding conditions in t6, extract the data with the fare or duration better than t6 from t7, and obtain the optimal OD path, which mainly includes the information of departure station, transfer station, arrival station, etc. As long as one of the following two conditions is met, the reachable OD path is considered to be the optimal reachable OD path: The accessible OD fare is better than the minimum direct OD fare; The duration of reaching OD is better than the minimum duration of reaching OD directly.

[0053] In an optional embodiment of the present application, a correlation calculation is performed on the direct train OD data set and the all-accessible OD path data set to obtain a return train data set within the itinerary in the all-accessible OD path data set, including: Take the direct train OD data set as table t6 and the all-way OD path data set as t8. Perform association calculation according to one of the following conditions, extract the train information from t6, extract the departure station, transfer station, arrival station and other information from t8, and obtain the return train data set within the trip: a) The departure station of t6 is the same as the transfer station of t8, and the arrival station of t6 is the same as the departure station of t8; b) The departure station of t6 is the same as the arrival station of t8, and the arrival station of t6 is the same as the departure station of t8; c) The departure station of t6 and the arrival station of t8 are the same, and the arrival station of t6 and the transfer station of t8 are the same.

[0054] In this application, in order to ensure that a reasonable railway transfer route always moves towards the target station / city, the transfer plan is calculated based on the optimal transfer station / node results in the fully accessible OD path in the complex railway operation network, combined with multiple factors such as train operation plan and remaining tickets. In the case of a possible backtracking, by comparing the direct train OD data set and the fully accessible OD path, the backtracking trains in the transfer route are estimated, that is, the trains that first pass the destination station and then arrive at the transfer station, thereby reducing passengers' travel time and cost.

[0055] In this application, in the reachable node OD data set, there may be multiple transfer nodes of different priorities between a pair of ODs, and multiple transfer routes can be calculated based on this. In busy areas, routes or time periods, too many transfer nodes and connection plans may cause inconvenience to passengers' travel choices. According to the statistical analysis of passengers' historical transfer travel data, it is found that the transfer passenger flow between any OD is concentrated in a few transfer nodes. Based on the above objective data distribution law, the reachable OD node data set is estimated according to the duration of the entire road reachable OD path, and the optimal transfer node set between any node OD can be obtained.

[0056] This application calculates the priority of transfer nodes in each reachable OD path and the optimal number of transfer nodes according to the rules of fare, duration, etc., estimates the reachable OD path of the entire route, including the departure station, arrival station, transfer station, priority, etc., compares the direct trains and the reachable OD path of the entire route, extracts the trains whose walking paths and the reachable OD path of the entire route are in the opposite direction, obtains the return train data within the itinerary, mainly including the departure station, transfer station, arrival station, train number, etc., which can avoid the trains and routes that go "back the way", compares the fare / duration of the station OD transfer and the direct train, extracts the OD of the transfer route that is better than the direct train in terms of fare or duration, estimates the target reachable OD path as the optimal reachable OD path, including the departure station, transfer station, arrival station, etc., which can minimize the generation time of the railway travel route and the comparison space of the transfer route and the direct train.

[0057] In an optional embodiment of the present application, the comparing, sorting and displaying the target transfer route and the direct route corresponding to the travel itinerary includes: For each target transfer route, query the number of remaining tickets of each seat type for the direct trains in each segment of the current target transfer route to obtain the target transfer routes with tickets; According to the duration or the ticket price, the target transfer routes with tickets and the direct routes corresponding to the travel itinerary are compared, sorted and displayed.

[0058] In an optional embodiment of the present application, the target transfer route includes a set of optimal transfer route candidates after elimination and a set of general transfer route candidates. When comparing, sorting and displaying the target transfer route, the set of optimal transfer route candidates and the direct route corresponding to the travel itinerary are compared, sorted and displayed, and the general transfer route is sorted and displayed according to certain default rules.

[0059] In an optional embodiment of the present application, when querying the number of remaining tickets of each seat type for direct trains in each segment of the current target transfer route, it is necessary to query whether there are other stations in the same city for the departure station, transfer station and arrival station according to the definition of railway stations in the same city, and query all relevant direct trains to stations in the same city, and splice the transfer schemes for the same station transfer and the transfer schemes for different stations in the same city, including all stations in the same city of the city where the transfer station is located. Take an OD path "departure station A→transfer station B→arrival station C" that meets the user's travel needs as an example. Stations A, B and C have stations A1 and A2, B1 and, C1 and C2 in the same city respectively. When splicing the transfer schemes, one is to query the same station transfer scheme passing through B1 or B2, and the other is to splice the transfer schemes for arriving at B1 and then departing from B2, or arriving at B2 and then departing from B1 for the next segment of the journey.

[0060] In an optional embodiment of the present application, if there are too many target transfer routes with tickets, the routes are filtered and sorted in real time considering the travel preferences of groups or users. For example, taking the departure time of the first trip as the anchor point, the second trip will be prioritized to arrive faster, ensuring that there are better transfer options at different departure times; priority will be given to transfer routes that can accurately determine the purpose of the passenger's travel. For example, if the passenger's destination is an airport, priority will be given to transfer routes with the airport as the destination.

[0061] The railway transfer travel route optimization of the present application first estimates the minimum transfer time for railway transfers at the same station and transfers at different stations in the same city; then, based on the minimum transfer time result, estimates the OD path that can be reached on the entire route, the number of return trains within the itinerary, and the optimal OD path that can be reached, laying the foundation for reducing the real-time calculation time and space complexity of the railway transfer route; finally, according to the real-time request of the passengers, the railway transfer route is calculated, compared, filtered and sorted and displayed in combination with the above-mentioned estimated calculation results, so as to realize the calculation of railway transfer routes at different stations in the same city, and the rapid mixed sorting and display of transfer and direct travel routes, and avoid recommending transfer routes that include return trains. At the same time, the calculation process of each link of the method is simple, independent of each other, and highly scalable. It can quickly calculate the railway transfer route in a high-concurrency environment, and complete the calculation processes such as comparing transfer routes and direct trains, filtering return trains and routes, etc., to provide technical support for meeting the differentiated ticket purchase preferences and needs of passengers and further improving the rationality of railway transfer routes.

[0062] In an optional embodiment of the present application, the railway transfer travel route optimization method further includes: After a passenger selects a target transfer route for which a ticket is available, if during the passenger's journey, among the multiple railway journeys on the target transfer route, the train corresponding to the first of two adjacent railway journeys is delayed, making it impossible for the passenger to take the train corresponding to the second railway journey in time, the passenger will be automatically rebooked on the train corresponding to the second railway journey and the rebooking information will be sent to the passenger.

[0063] It should be understood that, although the various steps in the flow chart are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the figure may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

[0064] See also Figure 3 An embodiment of the present application provides a railway transfer travel route optimization device 300, comprising: The first estimation module 310 is used to estimate the minimum transfer time of railway transfer, wherein the minimum transfer time of railway transfer includes the minimum transfer time of different stations in the same city, the minimum transfer time of the same station and the convenient transfer time; A construction module 320 is used to construct a multi-level full-line direct travel network and a reachable travel network of train number-station-node based on the minimum transfer time of the railway transfer, according to the preset train operation plan and the definition of railway stations in the same city; The second estimation module 330 is used to estimate the full-route reachable OD path dataset and the target reachable OD path dataset and the return train number dataset within the trip based on the multi-level all-route direct travel network and the reachable travel network of the train number-station-node, wherein the OD path is the path between the departure place and the destination; The determination module 340 is used to receive a remaining ticket query request, obtain the travel itinerary in the remaining ticket query request, determine a candidate set of transfer routes corresponding to the travel itinerary, filter out a target transfer route corresponding to the travel itinerary from the candidate set of transfer routes according to the minimum transfer time for railway transfer and the return train number data set within the itinerary, and compare, sort and display the target transfer route with the direct route corresponding to the travel itinerary.

[0065] For the specific definition of the above-mentioned device 300, please refer to the definition of the railway transfer travel route optimization method above, which will not be repeated here. Each module in the above-mentioned device 300 can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0066] In one embodiment, a computer device is provided, the internal structure diagram of which can be as follows: Figure 4As shown. The computer device includes a processor, a memory, a network interface and a database connected via a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a method for optimizing a railway transfer travel route as described above is implemented. It includes: a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, any step in the method for optimizing a railway transfer travel route as described above is implemented.

[0067] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, any step in the above method for optimizing a transfer travel route in a railway can be implemented.

[0068] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

[0069] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0070] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0071] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0072] Although the preferred embodiments of the present application have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the present application.

[0073] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A method for optimizing a railway transfer travel route, characterized in that: include: Estimated minimum transfer time for railway transfer, where the minimum transfer time for railway transfer includes the minimum transfer time for different stations in the same city, the minimum transfer time for the same station and the convenient transfer time; Based on the minimum transfer time of railway transfer, according to the preset train operation plan and the definition of railway stations in the same city, a multi-level full-line direct travel network and a reachable travel network of train number-station-node are constructed; Based on the multi-level all-way direct travel network and accessible travel network of train number, station number and node number, the all-way accessible OD path dataset and the target accessible OD path dataset as well as the return train number dataset within the trip are estimated, where the OD path is the path between the departure point and the destination; A request for remaining ticket query is received, a travel itinerary in the request for remaining ticket query is obtained, a candidate set of transfer routes corresponding to the travel itinerary is determined, a target transfer route corresponding to the travel itinerary is filtered out from the candidate set of transfer routes according to the minimum transfer time for railway transfer and a data set of return trains within the itinerary, and the target transfer route is compared, sorted and displayed with the direct route corresponding to the travel itinerary.

2. The method according to claim 1, characterized in that The determining of a candidate set of transfer routes corresponding to the travel itinerary includes: Determine whether the travel itinerary belongs to a travel itinerary in the target reachable OD path data set; In the case where the travel itinerary belongs to a trip in the target reachable OD path data set, extracting a first transfer route candidate set corresponding to the travel itinerary from the target reachable OD path data set; When the travel itinerary does not belong to the itinerary in the target reachable OD path data set, a second transfer route candidate set corresponding to the travel itinerary is extracted from the all-route reachable OD path data set, and the first transfer route candidate set and the second transfer route candidate set both include same-station transfer and same-city different-station transfer route candidate sets.

3. The method according to claim 1, characterized in that Determining whether the travel itinerary belongs to a travel itinerary in the target reachable OD path data set includes: Convert the departure place and destination in the travel itinerary into a departure station and an arrival station. If the departure place and destination in the travel itinerary are cities, obtain all the corresponding departure station and arrival station information in the city according to a preset same-city station definition table; Determine whether the departure station and arrival station of the travel itinerary are consistent with the departure station and arrival station in at least one itinerary record in the target reachable OD path data set; When the departure station and arrival station of the travel itinerary are consistent with the departure station and arrival station in at least one itinerary record in the target reachable OD path data set, it is determined that the travel itinerary belongs to the itinerary in the target reachable OD path data set.

4. The method according to claim 1, characterized in that The step of filtering out a target transfer route corresponding to the travel itinerary from the transfer route candidate set according to the railway transfer minimum transfer time and the return train number dataset within the itinerary includes: Eliminate the transfer routes that meet any of the following preset conditions in the transfer route candidate set: there is a return trip in the transfer route, there is a return route in the transfer route, and the transfer time is less than the minimum transfer time of railway transfer; The transfer routes in the eliminated transfer route candidate set are used as the target transfer routes corresponding to the travel itinerary.

5. The method according to claim 1, characterized in that Based on the minimum transfer time of railway transfer, according to the preset train operation plan and the definition of railway stations in the same city, a multi-level full-road direct travel network and a reachable travel network of train number-station-node are constructed, including: Perform association calculation on the preset stop station data table in the preset train operation plan to obtain the direct train OD data set; Extract the direct train OD process data set D1 with the shortest duration and the direct train OD process data set D2 with the lowest fare from the direct train OD data set; Perform association calculation on the direct train OD process data set D1 and the direct train OD process data set D2 to obtain the direct station OD data set; Perform association calculation on the direct station OD data set and the preset same-city station definition table to obtain the direct node OD process data set D3; Extract the direct node OD data set with the smallest duration and fare from the direct node OD process data set D3; Perform association calculation on the direct node OD data set to obtain the reachable station OD process data set D4; Based on the accessible station OD process dataset D4, we obtain the accessible station OD process dataset D5 for intra-station transfer and the accessible station OD process dataset D6 for intra-city and inter-station transfer; Merge the reachable station OD process dataset D5 and the reachable station OD process dataset D6 into the reachable station OD process dataset D7; Based on the reachable station OD process dataset D7, obtain the reachable station OD process dataset D8 sorted by duration and the reachable station OD process dataset D9 sorted by fare; Merge the reachable station OD process dataset D8 and the reachable station OD process dataset D9 into the reachable station OD dataset; Extract the reachable station OD process dataset D from the reachable station OD process dataset D4 10 ; For the OD process dataset D of the reachable station 10 The data are grouped and sorted according to the duration or fare to obtain a reachable node OD data set, wherein the sequence number of each data set is the transfer node priority, and the reachable node OD data set is a transfer route set of two trips, and the transfer route set includes a departure node, a transfer node, an arrival node, a duration and a duration priority information.

6. The method according to claim 5, characterized in that The multi-level all-way direct travel network and accessible travel network based on train number, station and node, estimated all-way accessible OD path dataset and target accessible OD path dataset, and return train number dataset within the trip include: Extract the optimal transfer node process dataset of the entire route from the reachable node OD dataset; According to the definition table of stations in the same city, the departure node, transfer node and arrival node of each record in the optimal transfer node process data set of the entire route are replaced with the corresponding stations, and the departure station, transfer station, arrival station and priority of each record are extracted to obtain the OD path data set of the entire route. Perform association calculation on the direct train OD data set and the all-accessible OD path data set to obtain the return train data set within the itinerary in the all-accessible OD path data set; The records in the reachable station OD dataset and the direct station OD dataset with the same departure and arrival stations and smaller duration or ticket price are collected into the target reachable OD path dataset.

7. The method according to claim 1, characterized in that The comparing, sorting and displaying the target transfer route and the direct route corresponding to the travel itinerary includes: For each target transfer route, query the number of remaining tickets of each seat type for the direct trains in each segment of the current target transfer route to obtain the target transfer routes with tickets; According to the duration or the ticket price, the target transfer routes with tickets and the direct routes corresponding to the travel itinerary are compared, sorted and displayed.

8. A railway transfer travel route optimization device, characterized in that: include: The first estimation module is used to estimate the minimum transfer time of railway transfer, wherein the minimum transfer time of railway transfer includes the minimum transfer time of different stations in the same city, the minimum transfer time of the same station and the convenient transfer time; A construction module is used to construct a multi-level full-line direct travel network and a reachable travel network of train number-station-node based on the minimum transfer time of the railway transfer, according to the preset train operation plan and the definition of railway stations in the same city; The second estimation module is used to estimate the full-route reachable OD path dataset and the target reachable OD path dataset as well as the return train data set within the trip based on the multi-level all-route direct travel network and reachable travel network of train number-station-node, where the OD path is the path between the departure place and the destination; The determination module is used to receive a remaining ticket query request, obtain the travel itinerary in the remaining ticket query request, determine a candidate set of transfer routes corresponding to the travel itinerary, filter out a target transfer route corresponding to the travel itinerary from the candidate set of transfer routes according to the minimum transfer time for railway transfer and the return train number data set within the itinerary, and compare, sort and display the target transfer route with the direct route corresponding to the travel itinerary.

9. A computer device comprising: A memory and a processor, wherein the memory stores a computer program, and wherein the processor implements the steps of the method for optimizing a transfer travel route in a railway as described in any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method for optimizing the transfer travel route in a railway as described in any one of claims 1 to 7 are implemented.

Images