Method, device and equipment for determining route of train station and storage medium
By identifying target platforms and selecting optimal entry and exit routes at train stations, the problem of platform and time interval conflicts in train route allocation was resolved, achieving efficient and safe train route allocation.
Patent Information
- Application Number
- CN202211421898.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-11-14
- Publication Date
- 2025-12-09
- Estimated Expiration
- 2042-11-14
AI Technical Summary
Existing technologies are unable to efficiently allocate routes to passing train stations, leading to platform conflicts and conflicts in route safety time intervals.
By identifying the target platform, candidate entry and exit routes, and using time constraints based on train information, arrival and departure times, the optimal entry and exit routes are selected to ensure the safe and efficient allocation of trains at the station.
It enables efficient and safe allocation of routes for trains in large stations, avoiding platform conflicts and route safety time interval conflicts, shortening calculation time and improving calculation efficiency.
Smart Images

Figure CN115675582B_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present disclosure relates to the field of computer technology, in particular to the fields of intelligent transportation and cloud computing. BACKGROUND
[0002] Train station is the window of organizing passenger and freight transport, serving the society, and is the center of passenger flow distribution. Route is a route that a train, a shunting locomotive or a train set runs from one place to another in a station. Train route is a section of line that a train passes through when entering, leaving and passing through a station, and is a route that the train must run through when passing through a train station. Therefore, it is very important to allocate a route for each train service that passes through a train station. SUMMARY
[0003] The present disclosure provides a train station route determination method, device, equipment and storage medium.
[0004] According to an aspect of the present disclosure, a train station route determination method is provided, comprising:
[0005] determining a target platform from a target station according to train information of a target train;
[0006] determining a candidate set of inbound routes and a candidate set of outbound routes corresponding to the target platform;
[0007] determining a preferred inbound route from the candidate set of inbound routes according to arrival time of the target train at the target station and inbound route allocation information corresponding to the candidate set of inbound routes;
[0008] determining a preferred outbound route from the candidate set of outbound routes according to departure time of the target train at the target station and outbound route allocation information corresponding to the candidate set of outbound routes;
[0009] determining a route for the target train at the target station according to the target platform, the preferred inbound route and the preferred outbound route.
[0010] According to another aspect of the present disclosure, a train station route determination device is provided, comprising:
[0011] a first determination module configured to determine a target platform from a target station according to train information of a target train;
[0012] a second determination module configured to determine a candidate set of inbound routes and a candidate set of outbound routes corresponding to the target platform;
[0013] a third determination module configured to determine a preferred inbound route from the candidate set of inbound routes according to arrival time of the target train at the target station and inbound route allocation information corresponding to the candidate set of inbound routes;
[0014] The fourth determining module is configured to determine a preferred outbound route from the set of candidate outbound routes according to the departure time of the target train at the target station and outbound route allocated information corresponding to the set of candidate outbound routes;
[0015] The fifth determining module is configured to determine an approach route of the target train at the target station according to the target platform, the preferred inbound route and the preferred outbound route.
[0016] According to another aspect of the present disclosure, an electronic device is provided, comprising:
[0017] at least one processor; and
[0018] a memory connected with the at least one processor in communication; wherein
[0019] The memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method of any of the embodiments of the present disclosure.
[0020] According to another aspect of the present disclosure, a non-transitory computer readable storage medium storing computer instructions is provided, wherein the computer instructions are used to make the computer perform the method according to any of the embodiments of the present disclosure.
[0021] According to another aspect of the present disclosure, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the method according to any of the embodiments of the present disclosure.
[0022] According to the present disclosure, the approach route of the train passing through the target station can be efficiently allocated.
[0023] It should be understood that the contents described in this part are not intended to identify the key or important features of the embodiments of the present disclosure, nor to limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description. BRIEF DESCRIPTION OF DRAWINGS
[0024] The accompanying drawings are used to better understand the present disclosure, and do not constitute a limitation on the present disclosure. Among them:
[0025] Figure 1 is a flowchart of a train station approach route determination method according to an embodiment of the present disclosure;
[0026] Figure 2 is a topological route diagram of a target station according to an embodiment of the present disclosure;
[0027] Figure 3 is an application scenario diagram of a train station approach route determination method according to an embodiment of the present disclosure;
[0028] Figure 4 is a flowchart of a route determination method of a train station according to another embodiment of the disclosure;
[0029] Figure 5 is a structural diagram of a route determination device of a train station according to an embodiment of the disclosure;
[0030] Figure 6 is a block diagram of an electronic device for implementing a route determination method of a train station according to an embodiment of the disclosure. DETAILED DESCRIPTION
[0031] Exemplary embodiments of the disclosure are described herein with reference to the accompanying drawings, which are included to provide a thorough understanding of embodiments of the disclosure by a person of ordinary skill in the art, and should not be construed as limiting the scope of the disclosure. It will be understood that those of ordinary skill in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the disclosure and, as such, have been contemplated within the scope of the disclosure. Furthermore, in the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present disclosure. It will be evident, however, to those of ordinary skill in the art that embodiments of the present disclosure can be practiced without these specific details. In other instances, well-known structures and functions are not described in detail in order to avoid obscuring the description of the present disclosure.
[0032] As shown in Figure 1 , an embodiment of the disclosure provides a route determination method of a train station, comprising:
[0033] Step S101: determining a target platform from a target station according to train information of a target train.
[0034] Step S102: determining a set of candidate inbound routes and a set of candidate outbound routes corresponding to the target platform.
[0035] Step S103: determining a preferred inbound route from the set of candidate inbound routes according to arrival time of the target train at the target station and inbound route assignment information corresponding to the set of candidate inbound routes.
[0036] Step S104: determining a preferred outbound route from the set of candidate outbound routes according to departure time of the target train at the target station and outbound route assignment information corresponding to the set of candidate outbound routes.
[0037] Step S105: determining a route of the target train at the target station according to the target platform, the preferred inbound route and the preferred outbound route.
[0038] According to an embodiment of the disclosure, it should be noted that:
[0039] The target train can be understood as any one of all train numbers passing through the target station. That is to say, each train number that needs to pass through the target station can determine the route of the corresponding target station by using the method of the embodiment of the disclosure.
[0040] The train information can include one or more of train model information, train size information, train passenger capacity information, and platform demand information of the train at the target station. Through the train information, one or more target platforms that are suitable for the target train can be determined from the target station. For example, the target train is a motor train, and only some platforms in the target station can meet the requirements of the target train. For another example, the target train has a large number of passengers at the target station, and only some platforms in the target station can meet the demand of the target train.
[0041] The candidate entry route set can be understood as a set composed of a plurality of entry routes connected to the target platform. It should be noted that the entry route is defined with respect to the driving direction of the target train, and is a relative concept, that is, for a train driving in the opposite direction of the target train, the entry route of the target train is the exit route of the train driving in the opposite direction of the target train.
[0042] The candidate exit route set can be understood as a set composed of a plurality of exit routes connected to the target platform. It should be noted that the exit route is defined with respect to the driving direction of the target train, and is a relative concept, that is, for a train driving in the opposite direction of the target train, the exit route of the target train is the entry route of the train driving in the opposite direction of the target train.
[0043] In the case of multiple target platforms, the candidate entry route set and the candidate exit route set corresponding to each target platform need to be determined. That is, the target train can determine whether there is a required route (entry route and exit route) of the target station from the candidate entry route set and the candidate exit route set of each target platform.
[0044] The entry route allocation information records the relevant information of the currently allocated train of each candidate entry route in the candidate entry route set. For example, according to the entry route allocation information, the time when each allocated train passes through the corresponding candidate entry route can be determined.
[0045] The arrival time of the target train at the target station can be understood as the time when the target train arrives at the entry route of the target station from the route outside the target station.
[0046] According to the arrival time of the target train at the target station and the entry route allocation information corresponding to the candidate entry route set, the preferred entry route can be determined from the candidate entry route set, that is, the entry route whose time when the allocated train passes through the corresponding candidate entry route does not conflict with the time when the target train passes through the candidate entry route is screened out from the candidate entry route set.
[0047] The outbound route assigned information records the relevant information of the currently assigned train for each candidate outbound route in the candidate outbound route set. For example, according to the outbound route assigned information, the time when each assigned train passes through the corresponding candidate outbound route can be determined.
[0048] The departure time of the target train at the target station can be understood as the starting time of the target train driving from the platform of the target station to the route outside the target station.
[0049] According to the target platform, the preferred inbound route and the preferred outbound route, the approach of the target train at the target station can be understood as that the target train will pass through the preferred inbound route to enter the target station and stop at the target platform in turn, and then drive out of the target station through the preferred outbound route when passing through the target station.
[0050] As shown in Figure 2 , the preferred inbound route of the embodiment of the present disclosure can include the route before driving into the inbound port of the target platform and the route between the outbound port and the inbound port of the target platform. The preferred outbound route includes the route after the outbound port.
[0051] According to the embodiment of the present disclosure, since the candidate inbound route set and the candidate outbound route set of the target station are considered simultaneously when assigning the approach of the target train, the optimal solution of the target train can be determined from the global perspective of the target station based on all trains passing through the target station. The approach of the target train passing through the target station can be efficiently assigned, and a reasonable train approach assignment scheme for the target station can be generated. In a station with a large flow, the approach assignment scheme directly affects the upper limit of the capacity of the station. The method of the embodiment of the present disclosure can flexibly and efficiently maximize the assignment of the approach of each train passing through the same station by using a computer according to market demand, avoid the problem of platform conflict and approach safety time interval conflict of the target train at the target station, and maximize the allocation of the approach of all trains. The method of the embodiment of the present disclosure can determine the approach of the target train at the target station based on only the train number passing through the target station, the inbound route and the outbound route. Compared with the traditional approach determination method, the number of decision variables is greatly reduced, the calculation efficiency is improved, and the calculation time is shortened. Compared with the traditional scheme, the method of the embodiment of the present disclosure can shorten the solution time of the mesoscopic approach compilation problem by 20%. For a station with 300 train numbers departing per day and 24 approaches, the solution time of the traditional method is more than 5 hours, and the solution time of the technical scheme is about 4 hours.
[0052] In one embodiment, the train station approach determination method provided by the embodiment of the present disclosure can be applied to the scenario framework as shown in Figure 3 Figure 3 In the figure, 10 represents a terminal device, 20 represents a server, and 30 represents a distributed computer system. The route determination method of the train station of the embodiment of the present disclosure can be executed by the server 20 or the distributed computer system 30, and the terminal device 10 is used to report / send the required data to the server 20 or the distributed computer system 30. After the server 20 or the distributed computer system 30 completes the route determination method of the train station of the embodiment of the present disclosure, the terminal device 10 can be fed back to the result.
[0053] In an embodiment, the route determination method of the train station of the embodiment of the present disclosure comprises steps S101 to S105, wherein step S101: determining a target platform from a target station according to train information of a target train, comprising:
[0054] According to the train information of the target train, the train type of the target train is determined.
[0055] According to the train type of the target train and the train type adapted by each platform of the target station, the target platform is determined from each platform.
[0056] According to the embodiment of the present disclosure, it should be noted that:
[0057] The train type can be understood as the type of train, the size type, the passenger capacity type, etc. Among them, the type of train, for example, high-speed rail, motor train, freight train. The size type can be determined according to the number of train nodes. The passenger capacity type can be determined according to the passenger capacity.
[0058] According to the embodiment of the present disclosure, the train type is used to quickly find the target platform matched with the target train, so as to exclude other platforms not adapted in the target station, which can effectively improve the overall calculation efficiency of the route determination method of the train station of the embodiment of the present disclosure.
[0059] In an embodiment, the route determination method of the train station of the embodiment of the present disclosure comprises steps S101 to S105, wherein step S102: determining a target platform corresponding to a candidate set of inbound routes and a candidate set of outbound routes, comprising:
[0060] According to the train information of the target train, the driving direction of the target train and / or the platform stop attribute of the target train are determined. Among them, the platform stop attribute can include: near platform, far platform, and other platform stop location attributes.
[0061] According to the driving direction of the target train and / or the platform stop attribute of the target train, the candidate set of inbound routes and the candidate set of outbound routes corresponding to the target platform are determined.
[0062] According to the embodiment of the present disclosure, it should be noted that:
[0063] According to the driving direction of the target train, the inbound route that does not meet the driving direction requirement can be filtered out from the multiple inbound routes connected to the target platform, and the outbound route that does not meet the driving direction requirement can be filtered out from the multiple outbound routes connected to the target platform.
[0064] According to the platform stop attribute of the target train, the inbound route that does not meet the platform stop attribute requirement can be filtered out from the multiple inbound routes connected to the target platform, and the outbound route that does not meet the platform stop attribute requirement can be filtered out from the multiple outbound routes connected to the target platform.
[0065] According to the driving direction of the target train and / or the platform stop attribute of the target train, the inbound route and the outbound route connected to the target platform that do not meet the requirement can be quickly filtered out, and the overall calculation efficiency of the route determination method of the train station of the embodiment of the present disclosure can be effectively improved.
[0066] In one example, the selected inbound route and the outbound route of the target train need to match the driving direction requirement and the platform stop attribute requirement, and the formula is:
[0067]
[0068]
[0069] Wherein, i represents the target train. s represents the route. x[i,s] represents that the target train i selects the route s as the inbound route. y[i,s] represents that the target train i selects the route s as the outbound route. Accept In[i] is the candidate inbound route set of the target station that the target train i can select. Accept Out[i] is the candidate outbound route set of the target station that the target train i can select.
[0070] In one example, when determining the preferred inbound route and the preferred outbound route for the target train, it is required to ensure that the target train is allocated at most one preferred inbound route and one preferred outbound route, and the target platform connected by the preferred inbound route and the preferred outbound route is the same. If the above requirements cannot be met, the preferred inbound route and the preferred outbound route are not allocated at the same time. That is to say, the preferred inbound route cannot be determined for the target train without determining the preferred outbound route for it, and vice versa.
[0071] Wherein, the target train is simultaneously allocated one preferred inbound route and one preferred outbound route, which can be represented by the formula:
[0072]
[0073]
[0074] wherein x[i, s] represents that the target train i selects the route s as the preferred inbound route. y[i, s] represents that the target train i selects the route s as the preferred outbound route. x[i, s] = 1 represents that the route s is selected as the preferred inbound route for the target train i.
[0075] wherein the preferred inbound route and the preferred outbound route are connected to the same platform, which can be expressed by the formula:
[0076]
[0077] wherein x[i, s] represents that the target train i selects the route s as the preferred inbound route. y[i, s] represents that the target train i selects the route s as the preferred outbound route. p[k] represents the candidate inbound route set and the candidate outbound route set corresponding to the target platform. k represents the platform.
[0078] In one example, in the daily operation of the train, when the train is an up train, the arrival time of the train at the station is usually fixed. When the train is a down train, the departure time of the train from the station is usually fixed. When the train is a through train at the station, the arrival time of the train at the station and the departure time of the train from the same station are usually fixed. This can be expressed by the formula:
[0079]
[0080]
[0081] wherein i represents the train number of the target train. A[i] represents the arrival time of the target train as an up train. D[i] represents the departure time of the target train as a down train. T[i] represents the running time set of the target train, which can include the departure time, arrival time, running time, and stop time of the target train at each station.
[0082] In one embodiment, the route determination method of the train station of the present disclosure comprises steps S101 to S105, wherein step S103: determining the preferred inbound route from the candidate inbound route set according to the arrival time of the target train at the target station and the inbound route allocation information corresponding to the candidate inbound route set, comprising:
[0083] Step S1031: in the case that the target train is an up train or a through train, determining the preset arrival time of the target train at the target station.
[0084] Step S1032: determining the allocated train of each candidate inbound route in the candidate inbound route set according to the inbound route allocation information corresponding to the candidate inbound route set.
[0085] Step S1033: determining the preferred inbound route from the set of candidate inbound routes according to a time constraint condition, based on the preset arrival time and the passing time of the assigned train of each candidate inbound route.
[0086] According to the embodiments of the present disclosure, it should be noted that:
[0087] The preset arrival time can be understood as the time when the target train travels from the route outside the target station to the inbound route of the target station.
[0088] The candidate inbound route can be assigned to multiple assigned trains, or there can be no assigned train.
[0089] The time constraint condition is used to constrain the relationship between the preset arrival time of the target train and the passing time of the assigned train passing the candidate inbound route, so as to ensure that the two times do not conflict. That is to say, it is ensured that the target train and the assigned train can travel on the same candidate inbound route, and there is no travel interference or travel safety problem (such as collision).
[0090] The direction of the candidate inbound route is relative to the target vehicle. For the assigned train of the candidate inbound route, it can be the inbound route or the outbound route of the assigned train. That is to say, the passing time of the assigned train passing the candidate inbound route can be understood as the departure time of the assigned train from the target station, or the arrival time of the assigned train at the target station. Therefore, the time constraint condition can constrain the conflict between the preset arrival time of the target train and the arrival time (passing time) of the assigned train, or the conflict between the preset arrival time of the target train and the departure time (passing time) of the assigned train.
[0091] In the case of multiple target platforms, the preferred inbound route can be determined based on the set of candidate inbound routes corresponding to multiple target platforms. When the preferred outbound route is determined, the preferred inbound route and the preferred outbound route connecting the same target platform can be found.
[0092] According to the embodiments of the present disclosure, the preferred inbound route can be quickly and accurately determined from the set of candidate inbound routes according to the time constraint condition. By using the time constraint condition, the problem of platform conflict and route safety time interval conflict of the preferred inbound route selected by the target train at the target station can be avoided, and the allocation of routes to all trains can be maximized.
[0093] In one example, the time constraint condition can be understood as determining whether there is a collision conflict between the jth train and the ith train at the target station according to the arrival-to-arrival (arrival-to-arrival route) safety time interval of the target station, and determining whether there is a route operation conflict between the two trains according to the collision conflict, which can be expressed by the following constraint condition formula:
[0094]
[0095]
[0096]
[0097]
[0098]
[0099]
[0100] wherein x[j,s'] represents the arrival route s' of the jth train. x[i,s] represents the arrival route s of the target ith train. s' and s have overlapping routes. A[i] represents the arrival time of the target ith train. A[j] represents the arrival time of the jth train. t aa represents the travel time interval. M represents a coefficient. ZAA[i,j] represents that the ith train and the jth train have an arrival-to-arrival time conflict. ZAA1[i,j] represents that the ith train arrives at the arrival route later and the jth train arrives at the arrival route earlier. ZAA2[i,j] represents that the ith train arrives at the arrival route earlier and the jth train arrives at the arrival route later.
[0101] In one example, the time constraint condition can be understood as determining whether there is a collision conflict between the jth train and the ith train at the target station according to the arrival-to-arrival (arrival-to-arrival route) safety time interval of the target station, and determining whether there is a route operation conflict between the two trains according to the collision conflict, which can be expressed by the following constraint condition formula:
[0102]
[0103]
[0104]
[0105]
[0106]
[0107]
[0108] wherein x[j, s'] represents the incoming route s' of train j. y[i, s] represents the outgoing route s of target train i. s' and s have overlapping sections. A[j] represents the arrival time of train j. D[i] represents the departure time of target train i. t ad and t da represent the travel time interval. M represents the coefficient. ZDA1[i, j] represents that train i departs from the outgoing route and train j arrives at the incoming route first. ZDA2[i, j] represents that train i departs from the outgoing route first and train j arrives at the incoming route later. ZDA[i, j] represents that train i and train j have a conflict in arrival and departure times.
[0109] It should be noted that the incoming route and the outgoing route are relative concepts. The outgoing route of target train i and the incoming route of train j can be the same route, depending on the travel direction of the two trains.
[0110] In an embodiment, the method for determining the route of a train station according to the present disclosure comprises steps S101 to S105 and steps S1031 to S1033, wherein step S1033 comprises:
[0111] determining the travel time of the assigned train of each candidate incoming route.
[0112] According to a first constraint condition in the time constraint condition, based on the travel time of the assigned train of each candidate incoming route and the preset arrival time, a first assigned train having a time overlap with the preset arrival time is determined.
[0113] According to a second constraint condition in the time constraint condition, based on the travel time of the assigned train of each candidate incoming route and the preset arrival time, a second assigned train having a time interval less than a threshold time from the preset arrival time is determined.
[0114] The candidate incoming route corresponding to the first assigned train and the candidate incoming route corresponding to the second assigned train are eliminated from the candidate incoming route set to obtain a first preliminary incoming route set.
[0115] The preferred incoming route is determined from the first preliminary incoming route set.
[0116] According to the embodiments of the present disclosure, it should be noted that:
[0117] The first constraint condition is used to ensure that the passing time of the allocated train and the preset arrival time of the target train do not coincide in time on the same candidate entry route. If the times coincide, it means that the allocated train and the target train will inevitably collide when running on the same candidate entry route.
[0118] The second constraint condition is used to ensure that the running time interval of the passing time of the allocated train and the preset arrival time of the target train on the same candidate entry route reaches a threshold requirement. If the threshold requirement is less than the threshold requirement, it means that there may be a running safety hazard (such as collision) when the allocated train and the target train run on the same candidate entry route.
[0119] According to the first constraint condition and the second constraint condition in the time constraint condition, the selected entry route of the conflict train can be quickly eliminated, and the overall calculation efficiency of the train station entry determination method of the embodiment of the present disclosure can be effectively improved. At the same time, by using the time constraint condition, the problem of platform conflict and entry safety time interval conflict of the target train on the target station can be avoided, and the allocation of entry routes for all trains can be maximized.
[0120] In an embodiment, the train station entry determination method of the embodiment of the present disclosure includes steps S101 to S105, wherein step S103: determining a preferred entry route from a candidate entry route set according to the arrival time of the target train at the target station and the allocated information of the entry route corresponding to the candidate entry route set, including:
[0121] Step S1034: In the case that the target train is a down train, determining the preset departure time of the target train at the target station.
[0122] Step S1035: determining the arrival time interval of the target train at the target station according to the preset departure time and the stop station time condition.
[0123] Step S1036: determining the allocated train of each candidate entry route in the candidate entry route set according to the allocated information of the entry route corresponding to the candidate entry route set.
[0124] Step S1037: determining a preferred entry route from a candidate entry route set according to a time constraint condition based on the arrival time interval and the passing time of the allocated train on the corresponding candidate entry route.
[0125] According to the embodiment of the present disclosure, it should be noted that:
[0126] The preset departure time can be understood as the departure time of the target train from the target platform of the target station to the starting time of the route outside the target station. The preset arrival time can be understood as the arrival time of the target train at the target station.
[0127] The stopping time condition can be understood as a time range interval in which the target train can stop at the target station. That is to say, the time difference between the arrival time and the departure time of the target train at the target station needs to satisfy the constraint of the stopping time condition. The specific stopping time interval range can be selected and adjusted as needed, and is not specifically limited here.
[0128] After the preferred entry route is determined, the arrival time of the target train at the target station can be determined based on the arrival time interval.
[0129] The candidate entry route can be assigned to multiple allocated trains, or there can be no allocated train.
[0130] The time constraint condition is used to constrain the relationship between the arrival time interval of the target train and the passing time of the allocated train passing through the candidate entry route, to ensure that there is no time conflict. That is to say, it is ensured that the target train and the allocated train can travel on the same candidate entry route without travel interference or travel safety problems. Therefore, the time constraint condition can constrain the conflict between the arrival time interval of the target train and the arrival time (passing time) of the allocated train, or the conflict between the arrival time interval of the target train and the departure time (passing time) of the allocated train.
[0131] The direction of the candidate entry route is relative to the target vehicle. For the allocated train of the candidate entry route, it can be the entry route or the exit route of the allocated train. That is to say, the passing time of the allocated train passing through the candidate entry route can be understood as the departure time of the allocated train from the target station, or the arrival time of the allocated train at the target station.
[0132] Since the arrival time interval is a range value, any time within the range can be taken as the arrival time of the target train. On this basis, based on the time constraint condition, as long as an allocated train is found that does not conflict with any time node in the arrival time interval, the corresponding candidate entry route can be considered as the preferred entry route. In the case of multiple target platforms, the preferred entry route can be determined based on the candidate entry route set corresponding to each target platform. When the preferred exit route is determined, the preferred entry route and the preferred exit route connecting the same target platform can be found.
[0133] According to the embodiments of the present disclosure, according to the time constraint condition, the preferred entry route can be quickly and accurately determined from the candidate entry route set. By using the time constraint condition, the problem of platform conflict and route safety time interval conflict of the preferred entry route selected by the target train at the target station can be avoided, and the allocation of routes to all trains can be maximized.
[0134] In one example, the dwell time condition is that the departure time minus the arrival time of the target train at the target station is greater than T min = 20 minutes and less than T max = 30 minutes, which can be expressed by the formula:
[0135] D[i] - A[i] ≤ T max
[0136] D[i] - A[i] ≥ T min
[0137] wherein i represents the train number of the target train. A[i] represents the arrival time of the target train. D[i] represents the departure time of the target train. T represents the dwell time.
[0138] In one embodiment, the method for determining the route of the train station according to the embodiments of the present disclosure comprises steps S101 to S105 and steps S1034 to S1037, wherein step S1037: determining the preferred arrival route from the set of candidate arrival routes based on the arrival time interval and the passing time of the allocated train on the corresponding candidate arrival route according to the time constraint condition, comprising:
[0139] determining the passing time of the allocated train on each candidate arrival route.
[0140] determining the third allocated train having time overlap with the arrival time interval based on the passing time of the allocated train on each candidate arrival route and the arrival time interval according to the first constraint condition in the time constraint condition.
[0141] determining the fourth allocated train having a time interval less than a threshold time from any one of the arrival time nodes in the arrival time interval based on the passing time of the allocated train on each candidate arrival route and the arrival time interval according to the second constraint condition in the time constraint condition.
[0142] eliminating the candidate arrival route corresponding to the third allocated train and the candidate arrival route corresponding to the fourth allocated train from the set of candidate arrival routes to obtain a second set of preliminary arrival routes.
[0143] determining the preferred arrival route from the second set of preliminary arrival routes.
[0144] According to the embodiments of the present disclosure, it should be noted that:
[0145] The first constraint condition is used to ensure that the time node selected from the arrival time interval and the passing time of the allocated train on the same candidate inbound route do not have time conflicts. If the time is overlapped, it means that the allocated train and the target train will inevitably collide when driving on the same candidate inbound route.
[0146] The second constraint condition is used to ensure that the driving time interval of the time node selected from the arrival time interval and the passing time of the allocated train on the same candidate inbound route reaches a threshold requirement. If it is less than the threshold requirement, it means that there may be a driving safety hazard when the allocated train and the target train drive on the same candidate inbound route.
[0147] According to the first constraint condition and the second constraint condition in the time constraint condition, the selected route of the conflict train can be quickly eliminated, and the overall calculation efficiency of the route determination method of the train station of the embodiment of the present disclosure can be effectively improved. At the same time, by using the time constraint condition, the problem of platform conflict and route safety time interval conflict of the selected preferred inbound route of the target train in the target station can be avoided, and the allocation of routes to all trains can be maximized.
[0148] In an embodiment, the route determination method of the train station of the present disclosure comprises steps S101-S105, wherein step S104 comprises:
[0149] Step S1041: In the case that the target train is a down train or a connecting train, the preset departure time of the target train at the target station is determined.
[0150] Step S1042: According to the outbound route allocated information corresponding to the candidate outbound route set, the allocated train of each candidate outbound route in the candidate outbound route set is determined.
[0151] Step S1043: According to the time constraint condition, the preferred outbound route is determined from the candidate outbound route set based on the preset departure time and the passing time of the allocated train of each candidate outbound route.
[0152] According to the embodiment of the present disclosure, it should be noted that:
[0153] The preset departure time can be understood as the departure time of the target train from the target platform of the target station to the starting route outside the target station.
[0154] The candidate outbound route may be allocated with multiple allocated trains, or there may be no allocated train.
[0155] The time constraint condition is used to constrain the relationship between the preset departure time of the target train and the passing time of the assigned train passing through the candidate outbound route, so as to ensure that there is no conflict between the two times. That is to say, it is ensured that the target train and the assigned train can run on the same candidate outbound route, and there is no running interference or running safety problem. Therefore, the time constraint condition may constrain the conflict between the preset departure time of the target train and the departure time (passing time) of the assigned train, or the conflict between the preset departure time of the target train and the arrival time (passing time) of the assigned train.
[0156] The direction of the candidate outbound route is relative to the target vehicle. For the assigned train of the candidate outbound route, it can be the inbound route or the outbound route of the assigned train. That is to say, the passing time of the assigned train passing through the candidate outbound route can be understood as the departure time of the assigned train departing from the target station, or the arrival time of the assigned train arriving at the target station.
[0157] In the case of multiple target platforms, the preferred outbound route can be determined based on the candidate outbound route set corresponding to each of the multiple target platforms. When the preferred inbound route is determined, the preferred inbound route and the preferred outbound route connected to the same target platform can be found.
[0158] According to the embodiments of the present disclosure, the preferred outbound route can be quickly and accurately determined from the candidate outbound route set according to the time constraint condition. By using the time constraint condition, the problem of platform conflict and route safety time interval conflict of the preferred outbound route selected by the target train at the target station can be avoided, and the allocation of routes to all trains can be maximized.
[0159] In an embodiment, the route determination method of the train station according to the embodiments of the present disclosure includes steps S101 to S105 and steps S1041 to S1043, wherein step S1043: determining the preferred outbound route from the candidate outbound route set based on the preset departure time and the passing time of the assigned train of each candidate outbound route according to the time constraint condition, including:
[0160] Determine the passing time of the assigned train of each candidate outbound route.
[0161] According to the first constraint condition in the time constraint condition, the fifth assigned train with time overlap with the preset departure time is determined based on the passing time of the assigned train of each candidate outbound route and the preset departure time.
[0162] According to the second constraint condition in the time constraint condition, a sixth allocated train with a time interval less than a threshold time from the preset departure time is determined based on the passing time of the allocated train of each candidate outbound route and the preset departure time.
[0163] The candidate outbound route corresponding to the fifth allocated train and the candidate outbound route corresponding to the sixth allocated train are removed from the candidate outbound route set, and a first preliminary selected outbound route set is obtained.
[0164] The preferred outbound route is determined from the first preliminary selected outbound route set.
[0165] According to the embodiments of the present disclosure, it should be noted that:
[0166] The first constraint condition is used to ensure that the passing time of the allocated train and the preset arrival time of the target train do not overlap in time on the same candidate outbound route, and if they overlap, it means that the allocated train and the target train will inevitably collide when driving on the same candidate outbound route.
[0167] The second constraint condition is used to ensure that the driving time interval of the allocated train and the preset arrival time of the target train on the same candidate outbound route reaches a threshold requirement. If it is less than the threshold requirement, it means that there may be a driving safety hazard when the allocated train and the target train drive on the same candidate outbound route.
[0168] According to the first constraint condition and the second constraint condition in the time constraint condition, the outbound route selected by the conflicting train can be quickly removed, and the overall calculation efficiency of the train station route determination method of the embodiments of the present disclosure can be effectively improved. At the same time, by using the time constraint condition, the problem of platform conflict and route safety time interval conflict of the preferred outbound route selected by the target train at the target station can be avoided, and the allocation of routes to all trains can be maximized.
[0169] In one embodiment, the train station route determination method of the embodiments of the present disclosure includes steps S101-S105, wherein step S104: determining the preferred outbound route from the candidate outbound route set according to the departure time of the target train at the target station and the outbound route allocated information corresponding to the candidate outbound route set, includes:
[0170] Step S1044: In the case that the target train is an up train, the preset arrival time of the target train at the target station is determined.
[0171] Step S1045: The departure time interval of the target train at the target station is determined according to the preset arrival time and the stop station time condition.
[0172] Step S1046: According to the assigned train information corresponding to the out-bound route of the candidate out-bound route set, determine the assigned train of each candidate out-bound route in the candidate out-bound route set.
[0173] Step S1047: According to the time constraint condition, determine the preferred out-bound route from the candidate out-bound route set based on the departure time interval and the passing time of the assigned train of each candidate out-bound route.
[0174] According to the embodiments of the present disclosure, it should be noted that:
[0175] The preset arrival time can be understood as the time when the target train travels from the route outside the target station to the arrival route of the target station.
[0176] The stop time condition can be understood as the time range interval in which the target train can stop at the target station. That is to say, the time difference between the arrival time and the departure time of the target train at the target station needs to meet the constraint of the stop time condition. The specific stop time interval range can be selected and adjusted as needed, and is not limited here.
[0177] After the preferred out-bound route is determined, the departure time of the target train at the target station can be determined based on the departure time interval.
[0178] The candidate out-bound route may be assigned to multiple assigned trains, or there may be no assigned train.
[0179] The time constraint condition is used to constrain the relationship between the departure time interval of the target train and the passing time of the assigned train passing through the candidate out-bound route, to ensure that there is no time conflict. That is to say, it is ensured that the target train and the assigned train can travel on the same candidate in-bound route without interference or safety problems. Therefore, the time constraint condition may constrain the conflict between the departure time interval of the target train and the departure time (passing time) of the assigned train, or the conflict between the departure time interval of the target train and the arrival time (passing time) of the assigned train.
[0180] The direction of the candidate out-bound route is relative to the target vehicle. For the assigned train of the candidate out-bound route, it can be the in-bound route or the out-bound route of the assigned train. That is to say, the passing time of the assigned train passing through the candidate out-bound route can be understood as the departure time of the assigned train from the target station, or the arrival time of the assigned train at the target station.
[0181] Since the departure time interval is a range value, any time within the range can be taken as the departure time of the target train. On this basis, based on the time constraint condition, as long as an allocated train is found which does not have a conflict with any time node in the arrival time interval and the approach time interval, the corresponding candidate outbound route can be considered as the preferred outbound route. In the case of multiple target platforms, the preferred outbound route can be determined based on the candidate outbound route set corresponding to each target platform. When the preferred outbound route is determined, the preferred inbound route and the preferred outbound route connecting the same target platform can be found.
[0182] According to the embodiments of the present disclosure, the preferred outbound route can be quickly and accurately determined from the candidate outbound route set according to the time constraint condition. By using the time constraint condition, the problem of platform conflict and route safety time interval conflict of the preferred outbound route selected by the target train at the target station can be avoided, and the allocation of routes for all trains can be maximized.
[0183] In one example, the time constraint condition can be understood as determining whether there is a collision conflict between the jth train and the ith train according to the departure-departure (from the outbound route-from the outbound route) safety time interval of the trains at the target station; according to the collision conflict, it is determined whether there is a route operation conflict between the two trains, which can be expressed by the following constraint condition formula:
[0184]
[0185]
[0186]
[0187]
[0188]
[0189]
[0190] wherein y[j,s'] represents the outbound route s' of the train j. y[i,s] represents the outbound route s of the target train i. s' and s have overlapping sections. D[i] represents the departure time of the target train i. D[j] represents the departure time of the train j. t dd represents the travel time interval. M represents a coefficient. ZDD[i,j] represents that the train i and the train j have a departure-departure time conflict. ZDD1[i,j] represents that the train i departs from the outbound route after the train j departs from the outbound route. ZDD2[i,j] represents that the train i departs from the outbound route before the train j departs from the outbound route.
[0191] In one example, the time constraint condition can be understood as determining whether there is a collision conflict between the two train services according to the arrival-departure (arrival-inbound route-departure-outbound route) safety time interval of the target station of the jth train service and the ith train service; according to the collision conflict, it is determined whether there is a route operation conflict between the two train services, which can be expressed by the following constraint condition formula:
[0192]
[0193]
[0194]
[0195]
[0196]
[0197]
[0198] wherein y[j,s'] represents the outbound route s' of the jth train. x[i,s] represents the inbound route s of the target ith train. s' and s have overlapping sections. D[j] represents the departure time of the jth train. A[i] represents the arrival time of the target ith train. ZAD1[i,j] represents that the ith train arrives at the inbound route later and the jth train departs from the outbound route earlier. ZAD2[i,j] represents that the ith train arrives at the inbound route earlier and the jth train departs from the outbound route later. ZAD[i,j] represents that there is a conflict between the ith train and the jth train in terms of arrival-departure time.
[0199] It should be noted that the inbound route and the outbound route are relative concepts. The outbound route of the target ith train and the inbound route of the jth train can be the same route, depending on the running direction of the two trains.
[0200] In one embodiment, the route determination method of the train station of the embodiment of the present disclosure includes steps S101 to S105 and steps S1044 to S1047, wherein step S1047: determining the preferred outbound route from the set of candidate outbound routes according to the time constraint condition, based on the departure time interval and the passing time of the assigned train of each candidate outbound route, comprising:
[0201] Determine the passing time of the assigned train of each candidate outbound route.
[0202] According to the first constraint condition in the time constraint condition, based on the passing time of the assigned train of each candidate outbound route and the departure time interval, a seventh assigned train that has time overlap with the departure time interval is determined.
[0203] According to the second constraint condition in the time constraint condition, an eighth allocated train with a time interval less than a threshold time from any departure time node in the departure time interval is determined based on the allocated train's passing time and the departure time interval of each candidate outbound route.
[0204] The candidate outbound route corresponding to the seventh allocated train and the candidate outbound route corresponding to the eighth allocated train are removed from the candidate outbound route set, and a second preliminary outbound route set is obtained.
[0205] A preferred outbound route is determined from the second preliminary outbound route set.
[0206] According to the embodiments of the present disclosure, it should be noted that:
[0207] The first constraint condition is used to ensure that the time node selected from the departure time interval and the passing time of the allocated train do not have time conflicts on the same candidate outbound route. If there is a time overlap, it means that the allocated train and the target train will inevitably collide when driving on the same candidate outbound route.
[0208] The second constraint condition is used to ensure that the time interval of the time node selected from the departure time interval and the passing time of the allocated train on the same candidate outbound route meets the threshold requirement. If it is less than the threshold requirement, it means that there may be a driving safety hazard when the allocated train and the target train drive on the same candidate outbound route.
[0209] According to the first constraint condition and the second constraint condition in the time constraint condition, the outbound route selected by the conflicting train can be quickly removed, and the overall calculation efficiency of the train station route determination method of the embodiments of the present disclosure can be effectively improved. At the same time, by using the time constraint condition, the problem of platform conflict and route safety time interval conflict of the preferred outbound route selected by the target train at the target station can be avoided, and the allocation of routes for all trains can be maximized.
[0210] In one embodiment, the train station route determination method of the embodiments of the present disclosure includes steps S101 to S105, wherein step S104: determining a preferred outbound route from a candidate outbound route set according to the departure time of the target train at the target station and the outbound route allocated information corresponding to the candidate outbound route set, includes:
[0211] In the case of a target train as a benchmark train, a short-distance outbound route set is determined from the candidate outbound route set.
[0212] According to the departure time of the target train at the target station and the outbound route allocated information corresponding to the short-distance outbound route set, a preferred outbound route is determined from the short-distance outbound route set.
[0213] According to the embodiments of the present disclosure, it should be noted that:
[0214] The landmark car can be understood as a train that only stops at large stations and departs at the hour.
[0215] According to the embodiments of the present disclosure, the target train as the landmark car can be preferentially assigned a short-distance route.
[0216] In one example, the landmark car must arrange a short-distance outbound route, which can be expressed by the formula:
[0217]
[0218] Wherein, SR is the set of short-distance outbound routes of the target station, S is the set of landmark cars of the target station, and y[i,s] represents the preferred outbound route s of the target train i.
[0219] In one example, when there are too many train services passing through the target station in a day, and it is impossible to assign a route to each train service using the method of the present disclosure, the target train as a connecting car at the target station can be ensured to determine a route using the method of the present disclosure.
[0220] In one example, if it is determined that the target train is a connecting car, a route must be arranged for the target train at the target station, which can be expressed by the formula:
[0221]
[0222] Wherein, x[i,s] represents the preferred inbound route s of the target train i, and p[k] represents the set of candidate inbound routes and the set of candidate outbound routes corresponding to the target platform.
[0223] In one embodiment, the passing time of the assigned train of each candidate inbound route includes the time of the assigned train stopping at the target platform. Therefore, the time constraint condition of the present disclosure is also used to constrain the time difference between the departure time and the arrival time of the target train, which cannot conflict with the time of the assigned train passing through the target platform of the candidate inbound route. That is, when the assigned train stops at the target platform through the candidate inbound route, the target train selects the candidate route to ensure that other trains do not stop at the target platform at the same time.
[0224] In one example, the stopping constraint of the target platform can be expressed by the formula:
[0225]
[0226]
[0227] Where p[k] represents the set of candidate inbound routes and candidate outbound routes corresponding to the target platform. x[j,s′] represents the preferred inbound route s′ of train j. y[j,s′] represents the preferred outbound route s′ of train j. M is a coefficient. x[i,s] represents the preferred inbound route s of target train i. ZAA1[i,j] indicates that train i arrives at the inbound route after train i, and train j arrives at the inbound route first. ZDA1[i,j] indicates that train i departs from the outbound route after train i, and train j arrives at the inbound route first. ZDD2[i,j] indicates that train i departs from the inbound route first, and train j departs from the inbound route after train i. ZAD2[i,j] indicates that train i arrives at the inbound route first, and train j departs from the outbound route after train i. k represents the platform.
[0228] In one example, when there are too many trains passing through the target station in a day, and it is impossible to obtain the optimal solution for allocating routes to each train using the method of this embodiment, the departure time of the up-line target train with an undetermined route and the arrival time of the down-line target train with an undetermined route can be adjusted, and then the method of this embodiment can be used to re-determine the routes for the up-line target train and the down-line target train with an undetermined route.
[0229] like Figure 4 As shown, in one application example, the train station route determination method of this disclosure embodiment includes:
[0230] For a high-speed rail line, after inputting a given number of trains and their arrival or departure times, the route scheme and platform stopping time of each train can be calculated through the constructed mathematical model and the solution. If the optimal solution obtained by the mathematical model covers a small number of trains, the arrival or departure times of the trains are adjusted and the solution is recalculated.
[0231] Among them, the objective function of the mathematical model is to consider the allocation of the most inbound and outbound routes.
[0232]
[0233] Where i represents the target train, s represents the route, x[i,s] represents the route i chooses as its entry route, and y[i,s] represents the route i chooses as its exit route.
[0234] The mathematical model consists of the following constraints, including:
[0235] Constraint 1: The selected route of the train needs to match the direction and platform stopping attributes. Let AcceptIn[i] and AcceptOut[i] be the sets of routes that the target train i can choose as its entry and exit points.
[0236]
[0237]
[0238] where i represents the target train. s represents the route. x[i, s] represents that the target train i selects the route s as the inbound route. y[i, s] represents that the target train i selects the route s as the outbound route. Accept In[i] is the candidate inbound route set of the target station that the target train i can select. Accept Out[i] is the candidate outbound route set of the target station that the target train i can select.
[0239] Constraint 2: Assigning a preferred inbound route and a preferred outbound route to the target train at the same time, which can be represented by the formula:
[0240]
[0241]
[0242] where x[i, s] represents that the target train i selects the route s as the preferred inbound route. y[i, s] represents that the target train i selects the route s as the preferred outbound route. x[i, s] = 1 represents that the route s is selected as the preferred inbound route for the target train i.
[0243] Constraint 3: The platform connected by the preferred inbound route and the preferred outbound route should be the same, which can be represented by the formula:
[0244]
[0245] where x[i, s] represents that the target train i selects the route s as the preferred inbound route. y[i, s] represents that the target train i selects the route s as the preferred outbound route. p[k] represents the candidate inbound route set and the candidate outbound route set corresponding to the target platform. k represents the platform.
[0246] Constraint 4: In the daily operation of the train, when the train is an up train, the arrival time of the train at the arrival station is usually fixed. When the train is a down train, the departure time of the train from the station is usually fixed. When the train is a connecting train at the station, the arrival time of the train at the station and the departure time of the train from the same station are usually fixed. It can be represented as:
[0247]
[0248]
[0249] Wherein, i represents the train number of the target train. A[i] represents the arrival time of the target train as an up train. D[i] represents the departure time of the target train as a down train. T[i] represents the running time set of the target train, which can include the departure time, arrival time, running time, stopping time, etc. of the target train at each station.
[0250] Constraint 5: The stopping time condition is that the departure time minus the arrival time is greater than T min (= 20) minutes and less than T max (= 30) minutes, which can be written as the formula:
[0251] D[i]-A[i]≤T max
[0252] D[i]-A[i]≥T min
[0253] Wherein, i represents the train number of the target train. A[i] represents the arrival time of the target train as an up train. D[i] represents the departure time of the target train as a down train. T represents the stopping time.
[0254] Constraint 6: The benchmark train must be arranged a short-distance outbound route, which can be expressed by the formula:
[0255]
[0256] Wherein, SR is a set of short-distance outbound routes, S is a set of benchmark trains, and y[i,s] represents the preferred outbound route s of the target train i.
[0257] Constraint 7: If it is determined that the target train is a through train, the target train must be arranged a route at the target station, which can be expressed by the formula:
[0258]
[0259] Wherein, x[i,s] represents the preferred inbound route s of the target train i, and p[k] represents the candidate inbound route set and candidate outbound route set corresponding to the target platform.
[0260] Constraint 8: Time constraint condition:
[0261] According to the arrival-to-arrival safety time interval of the j train and the i train at the target station, it is determined whether the two trains exist a collision conflict; according to the collision conflict, it is determined whether the two trains exist a route running conflict;
[0262]
[0263]
[0264]
[0265]
[0266]
[0267]
[0268] wherein x[j, s'] represents the inbound route s' of the train j. x[i, s] represents the inbound route s of the target train i. s' and s have overlapping sections. A[i] represents the arrival time of the target train i. A[j] represents the arrival time of the train j. t aa represents the running time interval. M represents a coefficient. ZAA[i, j] represents that the train i and the train j have arrival time conflicts. ZAA1[i, j] represents that the train i arrives at the inbound route later and the train j arrives at the inbound route earlier. ZAA2[i, j] represents that the train i arrives at the inbound route earlier and the train j arrives at the inbound route later.
[0269] According to the departure safety time interval of the j train and the i train at the target station, it is determined whether the two trains have collision conflicts; according to the collision conflicts, it is determined whether the two trains have route operation conflicts;
[0270]
[0271]
[0272]
[0273]
[0274]
[0275]
[0276] wherein y[j, s'] represents the outbound route s' of the train j. y[i, s] represents the outbound route s of the target train i. s' and s have overlapping sections. D[i] represents the departure time of the target train i. D[j] represents the departure time of the train j. t dd represents the running time interval. M represents a coefficient. ZDD[i, j] represents that the train i and the train j have departure time conflicts. ZDD1[i, j] represents that the train i departs from the outbound route later and the train j departs from the outbound route earlier. ZDD2[i, j] represents that the train i departs from the outbound route earlier and the train j departs from the outbound route later.
[0277] It should be noted that if the departure times of the train i and the train j satisfy D[i]-D[j]≤t ddIf ZDD[i, j] = 1, if x[i, s] = 1, i.e., train i selects route s, then train j cannot select route s' which is spatially conflicted with route s, i.e., ZDD[i, j] = 1, if x[i, s] = 1, i.e., train i selects route s, then train j cannot select route s' which is spatially conflicted with route s, i.e.,
[0278]
[0279] According to the arrival-departure safety time interval of the j train and the i train at the target station, it is determined whether the two trains exist collision conflict; according to the collision conflict, it is determined whether the two trains exist route operation conflict;
[0280]
[0281]
[0282]
[0283]
[0284]
[0285]
[0286] Wherein, x[j, s'] represents the route s' of the train j. y[i, s] represents the route s of the target train i. s' and s have overlapping sections. A[j] represents the arrival time of the train j. D[i] represents the departure time of the target train i. t ad and t da represent the running time interval. M represents a coefficient. ZDA1[i, j] represents that the train i departs from the route after the train j arrives at the route. ZDA2[i, j] represents that the train i departs from the route before the train j arrives at the route. ZDA[i, j] represents that the train i and the train j exist departure-arrival time conflict.
[0287] According to the arrival-departure safety time interval of the j train and the i train at the target station, it is determined whether the two trains exist collision conflict; according to the collision conflict, it is determined whether the two trains exist route operation conflict;
[0288]
[0289]
[0290]
[0291]
[0292]
[0293]
[0294] wherein y[j, s'] represents the outbound route s' of the train j. x[i, s] represents the inbound route s of the target train i. s' and s have overlapping sections. D[j] represents the departure time of the train j. A[i] represents the arrival time of the target train i. ZAD1[i, j] represents that the train i arrives at the inbound route later and the train j departs from the outbound route earlier. ZAD2[i, j] represents that the train i arrives at the inbound route earlier and the train j departs from the outbound route later. ZAD[i, j] represents that the train i and the train j have a conflict in the arrival and departure times.
[0295] Constraint 9: For each target train i stopping at the current station and optional platform k, other trains j cannot select a route with the platform k as the starting point or the ending point when the target train i occupies the platform k. P[k] is the set of routes using the platform k:
[0296]
[0297]
[0298] wherein p[k] represents the set of candidate inbound routes and the set of candidate outbound routes corresponding to the target platform. x[j, s'] represents the preferred inbound route s' of the train j. y[j, s'] represents the preferred outbound route s' of the train j. M is a coefficient. x[i, s] represents the preferred inbound route s of the target train i. ZAA1[i, j] represents that the train i arrives at the inbound route later and the train j arrives at the inbound route earlier. ZDA1[i, j] represents that the train i departs from the outbound route later and the train j arrives at the inbound route earlier. ZDD2[i, j] represents that the train i departs from the inbound route earlier and the train j departs from the inbound route later. ZAD2[i, j] represents that the train i arrives at the inbound route earlier and the train j departs from the outbound route later. k represents the platform.
[0299] As shown in FIG. 10, the embodiment of the present disclosure provides a route determination device for a train station, which comprises: Figure 5
[0300] The first determination module 510 is configured to determine a target platform from a target station according to train information of a target train.
[0301] The second determination module 520 is configured to determine a set of candidate inbound routes and a set of candidate outbound routes corresponding to the target platform.
[0302] The third determination module 530 is configured to determine a preferred inbound route from the set of candidate inbound routes according to arrival time of the target train at the target station and inbound route allocation information corresponding to the set of candidate inbound routes.
[0303] The fourth determining module 540 is configured to determine a preferred outbound route from the candidate outbound route set according to the departure time of the target train at the target station and the outbound route allocated information corresponding to the candidate outbound route set.
[0304] The fifth determining module 550 is configured to determine an approach route of the target train at the target station according to the target platform, the preferred inbound route and the preferred outbound route.
[0305] In an embodiment, the first determining module 510 comprises:
[0306] The train type determining module is configured to determine a train type of the target train according to the train information of the target train.
[0307] The platform determining module is configured to determine a target platform from the platforms according to the train type of the target train and the train types adapted to the platforms of the target station.
[0308] In an embodiment, the third determining module 530 comprises:
[0309] The first determining sub-module is configured to determine a preset arrival time of the target train at the target station in a case where the target train is an up train or a through train.
[0310] The second determining sub-module is configured to determine an allocated train of each candidate inbound route in the candidate inbound route set according to the inbound route allocated information corresponding to the candidate inbound route set.
[0311] The third determining sub-module is configured to determine the preferred inbound route from the candidate inbound route set according to the time constraint condition, based on the preset arrival time and the passing time of the allocated train of each candidate inbound route.
[0312] In an embodiment, the third determining sub-module is configured to:
[0313] determine the passing time of the allocated train of each candidate inbound route.
[0314] determine, according to a first constraint condition in the time constraint condition, a first allocated train having a time overlap with the preset arrival time based on the passing time of the allocated train of each candidate inbound route and the preset arrival time.
[0315] determine, according to a second constraint condition in the time constraint condition, a second allocated train having a time interval less than a threshold time with the preset arrival time based on the passing time of the allocated train of each candidate inbound route and the preset arrival time.
[0316] The candidate inbound route corresponding to the first allocated train is removed from the candidate inbound route set, and the candidate inbound route corresponding to the second allocated train is removed, to obtain a first preliminary inbound route set.
[0317] The preferred inbound route is determined from the first preliminary inbound route set.
[0318] In an embodiment, the third determining module 530 comprises:
[0319] The fourth determining sub-module is configured to determine a preset departure time of the target train at the target station when the target train is a down train.
[0320] The fifth determining sub-module is configured to determine an arrival time interval of the target train at the target station according to the preset departure time and the stop station time condition.
[0321] The sixth determining sub-module is configured to determine the allocated train of each candidate inbound route in the candidate inbound route set according to the inbound route allocated information corresponding to the candidate inbound route set.
[0322] The seventh determining sub-module is configured to determine the preferred inbound route from the candidate inbound route set according to the time constraint condition, based on the arrival time interval and the passing time of the allocated train on the corresponding candidate inbound route.
[0323] In an embodiment, the seventh determining sub-module is configured to:
[0324] Determine the passing time of the allocated train of each candidate inbound route.
[0325] According to a first constraint condition in the time constraint condition, determine a third allocated train having time overlap with the arrival time interval based on the passing time of the allocated train of each candidate inbound route and the arrival time interval.
[0326] According to a second constraint condition in the time constraint condition, determine a fourth allocated train having a time interval less than a threshold time with any one of the arrival time nodes in the arrival time interval based on the passing time of the allocated train of each candidate inbound route and the arrival time interval.
[0327] The candidate inbound route corresponding to the third allocated train is removed from the candidate inbound route set, and the candidate inbound route corresponding to the fourth allocated train is removed, to obtain a second preliminary inbound route set.
[0328] The preferred inbound route is determined from the second preliminary inbound route set.
[0329] In an embodiment, the fourth determining module 540 comprises:
[0330] The eighth determining sub-module is configured to determine the preset departure time of the target train at the target station in a case where the target train is a down train or a through train.
[0331] The ninth determining sub-module is configured to determine, according to the assigned train information corresponding to the out-bound route in the candidate out-bound route set, the assigned train of each candidate out-bound route in the candidate out-bound route set.
[0332] The tenth determining sub-module is configured to determine, according to the time constraint condition, the preferred out-bound route from the candidate out-bound route set based on the preset departure time and the passing time of the assigned train of each candidate out-bound route.
[0333] In an embodiment, the tenth determining sub-module is configured to:
[0334] determine the passing time of the assigned train of each candidate out-bound route.
[0335] determine, according to a first constraint condition in the time constraint condition, a fifth assigned train having a time overlap with the preset departure time based on the passing time of the assigned train of each candidate out-bound route and the preset departure time.
[0336] determine, according to a second constraint condition in the time constraint condition, a sixth assigned train having a time interval less than a threshold time with the preset departure time based on the passing time of the assigned train of each candidate out-bound route and the preset departure time.
[0337] eliminate the candidate out-bound route corresponding to the fifth assigned train and the candidate out-bound route corresponding to the sixth assigned train from the candidate out-bound route set, to obtain a first preliminary out-bound route set.
[0338] determine the preferred out-bound route from the first preliminary out-bound route set.
[0339] In an embodiment, the fourth determining module 540 includes:
[0340] The eleventh determining sub-module is configured to determine the preset arrival time of the target train at the target station in a case where the target train is an up train.
[0341] The twelfth determining sub-module is configured to determine, according to the preset arrival time and the stop station time condition, the departure time interval of the target train at the target station.
[0342] The thirteenth determining sub-module is configured to determine, according to the assigned train information corresponding to the out-bound route in the candidate out-bound route set, the assigned train of each candidate out-bound route in the candidate out-bound route set.
[0343] The fourteenth determining sub-module is configured to determine a preferred outbound route from the set of candidate outbound routes according to a time constraint condition, based on the departure time interval and a passing time of the assigned train of each candidate outbound route.
[0344] In an implementation, the fourteenth determining sub-module is configured to:
[0345] determine the passing time of the assigned train of each candidate outbound route.
[0346] determine, according to a first constraint condition in the time constraint condition, a seventh assigned train having a time overlap with the departure time interval, based on the passing time of the assigned train of each candidate outbound route and the departure time interval.
[0347] determine, according to a second constraint condition in the time constraint condition, an eighth assigned train having a time interval less than a threshold time with any departure time node in the departure time interval, based on the passing time of the assigned train of each candidate outbound route and the departure time interval.
[0348] eliminate the candidate outbound route corresponding to the seventh assigned train and the candidate outbound route corresponding to the eighth assigned train from the set of candidate outbound routes, to obtain a second set of preliminary selected outbound routes.
[0349] determine the preferred outbound route from the second set of preliminary selected outbound routes.
[0350] In an implementation, the fourth determining module 540 includes:
[0351] The fifteenth determining sub-module is configured to determine a short-distance outbound route set from the set of candidate outbound routes in a case where the target train is a benchmark train.
[0352] The sixteenth determining sub-module is configured to determine the preferred outbound route from the short-distance outbound route set according to the departure time of the target train at the target station and outbound route assigned information corresponding to the short-distance outbound route set.
[0353] In an implementation, the preferred inbound route includes a route before entering the inbound portal of the target platform and a route between the outbound portal and the inbound portal of the target platform. The preferred outbound route includes a route after the outbound portal.
[0354] The specific functions and examples of the modules and sub-modules of the apparatuses in the embodiments of the present disclosure are described above in the corresponding steps of the method embodiments, which will not be described here.
[0355] In the technical solutions of the present disclosure, the acquisition, storage, and application of user personal information comply with relevant laws and regulations and do not violate public order and good customs.
[0356] According to embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.
[0357] Figure 6 A schematic block diagram of an example electronic device 600 that can be used to implement embodiments of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptops, desktops, tablets, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device can also represent various forms of mobile devices, such as personal digital assistants, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown here, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present disclosure described and / or claimed in this document.
[0358] As shown in Figure 6 The device 600 includes a computing unit 601 that can perform various appropriate actions and processes in accordance with a computer program stored in a read-only memory (ROM) 602 or a computer program loaded into a random access memory (RAM) 603 from a storage unit 608. Various programs and data required for the operation of the device 600 can also be stored in the RAM 603. The computing unit 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.
[0359] Various components in the device 600 are connected to the I / O interface 605, including an input unit 606, such as a keyboard, a mouse, etc.; an output unit 607, such as various types of displays, speakers, etc.; a storage unit 608, such as a magnetic disk, an optical disk, etc.; and a communication unit 609, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 609 allows the device 600 to exchange information / data with other devices through a computer network, such as the Internet, and / or various telecommunication networks.
[0360] The computing unit 601 can be various general and / or special purpose processing components with processing and computing capabilities. Some examples of the computing unit 601 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 601 performs various methods and processes described above, such as the route determination method for a train station. For example, in some embodiments, the route determination method for a train station can be implemented as a computer software program tangibly embodied in a machine-readable medium, such as the storage unit 608. In some embodiments, part or all of the computer program can be loaded and / or installed onto the device 600 via the ROM 602 and / or the communication unit 609. When the computer program is loaded onto the RAM 603 and executed by the computing unit 601, one or more steps of the route determination method for a train station described above can be performed. Alternatively, in other embodiments, the computing unit 601 can be configured to perform the route determination method for a train station by other any suitable means, such as by means of firmware.
[0361] Various implementations of the systems and techniques described above can be realized in digital electronic circuitry, integrated circuitry, a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on a chip (SOC), a programmable logic device (PLD), a computer hardware, firmware, software, and / or combinations thereof. These various implementations can include implementation in one or more computer programs that are executable and / or interpretable on a programmable system including at least one programmable processor, which can be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.
[0362] Program code for carrying out methods of the present disclosure can be written in any combination of one or more programming languages. The program code can be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the program code, when executed by the processor or controller, produces a means for implementing the functions / acts specified in the flowcharts and / or block diagrams. The program code can be executed entirely on a machine, partially on a machine, partially on a machine as a stand-alone software package, partially on a machine and partially on a remote machine or entirely on a remote machine or server.
[0363] In the context of this disclosure, a machine-readable medium can be a tangible medium that contains or stores a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include but is not limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0364] To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user and a keyboard and a pointing device (e.g., a mouse or a trackball) by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form, including acoustic, speech, or tactile input.
[0365] The systems and techniques described here can be implemented in a computing system that includes a back end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front end component (e.g., a user computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back end, middleware, or front end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (LAN), a wide area network (WAN), and the Internet.
[0366] The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, a server of a distributed system, or a server combined with a blockchain.
[0367] It should be understood that the various forms of flow shown above can be re-ordered, steps added or removed, etc. For example, the steps recited in the present disclosure can be performed in parallel, in series, in a different order, etc., so long as the desired results of the technology disclosed in the present disclosure are achieved, which is not limited herein.
[0368] The specific embodiments discussed above do not constrain the scope of the present disclosure. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and alternatives can be made to the specific embodiments without departing from the principles of the present disclosure. Any such modifications, alternatives, equivalents, and / or alternatives are intended to fall within the scope of the present disclosure.
Claims
1. A method for determining a route of a train station, comprising: determining a target platform from a target station according to train information of a target train; determining a candidate set of inbound routes and a candidate set of outbound routes corresponding to the target platform; determining a preferred inbound route from the candidate set of inbound routes according to an arrival time of the target train at the target station and inbound route allocation information corresponding to the candidate set of inbound routes; determining a preferred outbound route from the candidate set of outbound routes according to a departure time of the target train at the target station and outbound route allocation information corresponding to the candidate set of outbound routes; determining a route of the target train at the target station according to the target platform, the preferred inbound route and the preferred outbound route; wherein the determining of the candidate set of inbound routes and the candidate set of outbound routes corresponding to the target platform comprises: determining a traveling direction of the target train and / or determining a platform stop attribute of the target train according to train information of the target train; determining the candidate set of inbound routes and the candidate set of outbound routes corresponding to the target platform according to the traveling direction of the target train and / or the platform stop attribute of the target train; wherein the determining of the preferred inbound route and the preferred outbound route needs to satisfy a constraint condition, comprising: wherein i represents the target train, s represents a route, k represents a platform, x[i, s] represents that the target train i selects a route s as a preferred inbound route, y[i, s] represents that the target train i selects a route s as a preferred outbound route, x[i, s] = 1 represents that a route s is selected as a preferred inbound route for the target train i, and p[k] represents the candidate set of inbound routes and the candidate set of outbound routes corresponding to the target platform.
2. The method of claim 1, wherein, The determining of the target platform from the target station according to the train information of the target train comprises: determining a train type of the target train according to the train information of the target train; determining the target platform from the platforms according to the train type of the target train and train types adapted to the platforms of the target station.
3. The method of claim 1, wherein, The determining of the preferred inbound route from the candidate set of inbound routes according to the arrival time of the target train at the target station and the inbound route allocation information corresponding to the candidate set of inbound routes comprises: determining a preset arrival time of the target train at the target station in a case that the target train is an up train or a consecutive train; determining allocated trains of each candidate inbound route in the candidate set of inbound routes according to the inbound route allocation information corresponding to the candidate set of inbound routes; determining the preferred inbound route from the candidate set of inbound routes according to a time constraint condition based on the preset arrival time and a passing time of the allocated trains of each candidate inbound route.
4. The method of claim 3, wherein, The determining of the preferred inbound route from the candidate set of inbound routes according to the time constraint condition based on the preset arrival time and the passing time of the allocated trains of each candidate inbound route comprises: determining the passing time of the allocated trains of each candidate inbound route; According to a first constraint condition in the time constraint condition, a first allocated train that has time overlap with the preset arrival time is determined based on a passing time of the allocated train of each candidate inbound route and the preset arrival time; According to a second constraint condition in the time constraint condition, a second allocated train that has a time interval less than a threshold time from the preset arrival time is determined based on a passing time of the allocated train of each candidate inbound route and the preset arrival time; The candidate inbound route corresponding to the first allocated train and the candidate inbound route corresponding to the second allocated train are eliminated from the candidate inbound route set, to obtain a first preliminary inbound route set; A preferred inbound route is determined from the first preliminary inbound route set.
5. The method of claim 1, wherein, The method for determining the preferred inbound route from the candidate inbound route set according to the arrival time of the target train at the target station and the inbound route allocated information corresponding to the candidate inbound route set comprises: In the case that the target train is a down train, a preset departure time of the target train at the target station is determined; An arrival time interval of the target train at the target station is determined according to the preset departure time and a stop station time condition; Allocated trains of each candidate inbound route in the candidate inbound route set are determined according to the inbound route allocated information corresponding to the candidate inbound route set; The preferred inbound route is determined from the candidate inbound route set according to a time constraint condition based on the arrival time interval and the passing time of the allocated train on the corresponding candidate inbound route.
6. The method of claim 5, wherein, The method for determining the preferred inbound route from the candidate inbound route set according to a time constraint condition based on the arrival time interval and the passing time of the allocated train on the corresponding candidate inbound route comprises: A passing time of the allocated train of each candidate inbound route is determined; According to a first constraint condition in the time constraint condition, a third allocated train that has time overlap with the arrival time interval is determined based on the passing time of the allocated train of each candidate inbound route and the arrival time interval; According to a second constraint condition in the time constraint condition, a fourth allocated train that has a time interval less than a threshold time from any one of the arrival time nodes in the arrival time interval is determined based on the passing time of the allocated train of each candidate inbound route and the arrival time interval; The candidate inbound route corresponding to the third allocated train and the candidate inbound route corresponding to the fourth allocated train are eliminated from the candidate inbound route set, to obtain a second preliminary inbound route set; A preferred inbound route is determined from the second preliminary inbound route set.
7. The method of claim 1, wherein, The method for determining the preferred outbound route from the candidate outbound route set according to the departure time of the target train at the target station and the outbound route allocated information corresponding to the candidate outbound route set comprises: In the case that the target train is a down train or a subsequent train, a preset departure time of the target train at the target station is determined; determine, according to the time constraint condition, the preferred outbound route from the candidate outbound route set based on the preset departure time and the passing time of the assigned train of each candidate outbound route. determine, according to the time constraint condition, the preferred outbound route from the candidate outbound route set based on the preset departure time and the passing time of the assigned train of each candidate outbound route.
8. The method of claim 7, wherein, The method according to the time constraint condition, the preferred outbound route from the candidate outbound route set based on the preset departure time and the passing time of the assigned train of each candidate outbound route. determine the passing time of the assigned train of each candidate outbound route; determine, according to the first constraint condition in the time constraint condition, the fifth assigned train that has a time overlap with the preset departure time based on the passing time of the assigned train of each candidate outbound route and the preset departure time; determine, according to the second constraint condition in the time constraint condition, the sixth assigned train that has a time interval less than a threshold time with the preset departure time based on the passing time of the assigned train of each candidate outbound route and the preset departure time; eliminate the candidate outbound route corresponding to the fifth assigned train and the candidate outbound route corresponding to the sixth assigned train from the candidate outbound route set to obtain a first preliminary selected outbound route set; determine the preferred outbound route from the first preliminary selected outbound route set.
9. The method of claim 1, wherein, The method according to the time constraint condition, the preferred outbound route from the candidate outbound route set based on the preset departure time and the passing time of the assigned train of each candidate outbound route. determine the preset arrival time of the target train at the target station in the case that the target train is an up train; determine the departure time interval of the target train at the target station according to the preset arrival time and the stop station time condition; determine, according to the time constraint condition, the preferred outbound route from the candidate outbound route set based on the preset departure time and the passing time of the assigned train of each candidate outbound route. The method according to the time constraint condition, the preferred outbound route from the candidate outbound route set based on the preset departure time and the passing time of the assigned train of each candidate outbound route.
10. The method of claim 9, wherein, determine the passing time of the assigned train of each candidate outbound route; determine, according to the first constraint condition in the time constraint condition, the seventh assigned train that has a time overlap with the departure time interval based on the passing time of the assigned train of each candidate outbound route and the departure time interval; determine, according to the second constraint condition in the time constraint condition, the eighth assigned train that has a time interval less than a threshold time with any departure time node in the departure time interval based on the passing time of the assigned train of each candidate outbound route and the departure time interval; eliminate the candidate outbound route corresponding to the seventh allocated train and the candidate outbound route corresponding to the eighth allocated train from the candidate outbound route set to obtain a second preliminary outbound route set; determine a preferred outbound route from the second preliminary outbound route set.
11. The method of claim 1, wherein, The determining of the preferred outbound route from the candidate outbound route set according to the departure time of the target train at the target station and the outbound route allocation information corresponding to the candidate outbound route set comprises: in the case that the target train is a benchmark train, determining a short-distance outbound route set from the candidate outbound route set; determining a preferred outbound route from the short-distance outbound route set according to the departure time of the target train at the target station and the outbound route allocation information corresponding to the short-distance outbound route set.
12. The method according to any one of claims 1 to 11, wherein, The preferred inbound route comprises a route before entering an inbound portal of the target platform and a route between an outbound portal and the inbound portal of the target platform, and the preferred outbound route comprises a route after the outbound portal.
13. A route determination device for a train station, comprising: a first determination module configured to determine a target platform from a target station according to train information of a target train; a second determination module configured to determine a candidate inbound route set and a candidate outbound route set corresponding to the target platform; a third determination module configured to determine a preferred inbound route from the candidate inbound route set according to an arrival time of the target train at the target station and inbound route allocation information corresponding to the candidate inbound route set; a fourth determination module configured to determine a preferred outbound route from the candidate outbound route set according to a departure time of the target train at the target station and outbound route allocation information corresponding to the candidate outbound route set; a fifth determination module configured to determine a route of the target train at the target station according to the target platform, the preferred inbound route and the preferred outbound route; wherein the second determination module is further configured to: determine a travel direction of the target train and / or determine a platform stop attribute of the target train according to the train information of the target train; determine the candidate inbound route set and the candidate outbound route set corresponding to the target platform according to the travel direction of the target train and / or the platform stop attribute of the target train; wherein the constraint condition to be met when determining the preferred inbound route and the preferred outbound route comprises: wherein i represents the target train, s represents a route, k represents a platform, x[i, s] represents that the target train i selects the route s as the preferred inbound route, y[i, s] represents that the target train i selects the route s as the preferred outbound route, x[i, s]=1 represents that the target train i selects the route s as the preferred inbound route, and p[k] represents the candidate inbound route set and the candidate outbound route set corresponding to the target platform.
14. The apparatus of claim 13, wherein, The first determination module comprises: a train type determination module configured to determine a train type of the target train according to the train information of the target train; The station determining module is configured to determine a target station from the stations according to a train type of the target train and train types adapted by the stations of the target station.
15. The apparatus of claim 13, wherein, The third determining module comprises: A first determining sub-module configured to determine a preset arrival time of the target train at the target station in a case that the target train is an up-train or a successive train; A second determining sub-module configured to determine an assigned train of each candidate inbound route in the candidate inbound route set according to inbound route assigned information corresponding to the candidate inbound route set; A third determining sub-module configured to determine a preferred inbound route from the candidate inbound route set according to a time constraint condition based on the preset arrival time and a passing time of the assigned train of each candidate inbound route.
16. The apparatus of claim 15, wherein, The third determining sub-module is configured to: determine the passing time of the assigned train of each candidate inbound route; determine a first assigned train having a time overlap with the preset arrival time based on the passing time of the assigned train of each candidate inbound route and the preset arrival time according to a first constraint condition in the time constraint condition; determine a second assigned train having a time interval less than a threshold time with the preset arrival time based on the passing time of the assigned train of each candidate inbound route and the preset arrival time according to a second constraint condition in the time constraint condition; eliminate the candidate inbound route corresponding to the first assigned train and the candidate inbound route corresponding to the second assigned train from the candidate inbound route set to obtain a first preliminary inbound route set; determine a preferred inbound route from the first preliminary inbound route set.
17. The apparatus of claim 13, wherein, The third determining module comprises: A fourth determining sub-module configured to determine a preset departure time of the target train at the target station in a case that the target train is a down-train; A fifth determining sub-module configured to determine an arrival time interval of the target train at the target station according to the preset departure time and a stop station time condition; A sixth determining sub-module configured to determine an assigned train of each candidate inbound route in the candidate inbound route set according to inbound route assigned information corresponding to the candidate inbound route set; A seventh determining sub-module configured to determine a preferred inbound route from the candidate inbound route set according to a time constraint condition based on the arrival time interval and a passing time of the assigned train on a corresponding candidate inbound route.
18. The apparatus of claim 17, wherein, The seventh determining sub-module is configured to: determine the passing time of the assigned train of each candidate inbound route; determine a third assigned train having a time overlap with the arrival time interval based on the passing time of the assigned train of each candidate inbound route and the arrival time interval according to a first constraint condition in the time constraint condition; determine, based on the arrival time interval and the passing time of the allocated train of each candidate inbound route, a fourth allocated train having a time interval less than a threshold time from any one of the arrival time nodes in the arrival time interval according to a second constraint in the time constraints; remove the candidate inbound route corresponding to the third allocated train and the candidate inbound route corresponding to the fourth allocated train from the candidate inbound route set to obtain a second preliminary inbound route set; determine a preferred outbound route from the second preliminary outbound route set.
19. The apparatus of claim 13, wherein, The fourth determination module comprises: an eighth determination submodule configured to determine a preset departure time of the target train at the target station in a case where the target train is a down train or a through train; a ninth determination submodule configured to determine an allocated train of each candidate outbound route in the candidate outbound route set according to outbound route allocated information corresponding to the candidate outbound route set; a tenth determination submodule configured to determine a preferred outbound route from the candidate outbound route set according to a time constraint, based on the preset departure time and the passing time of the allocated train of each candidate outbound route.
20. The apparatus of claim 19, wherein, The tenth determination submodule is configured to: determine the passing time of the allocated train of each candidate outbound route; determine, based on the passing time of the allocated train of each candidate outbound route and the preset departure time, a fifth allocated train having a time overlap with the preset departure time according to a first constraint in the time constraints; determine, based on the passing time of the allocated train of each candidate outbound route and the preset departure time, a sixth allocated train having a time interval less than a threshold time from the preset departure time according to a second constraint in the time constraints; remove the candidate outbound route corresponding to the fifth allocated train and the candidate outbound route corresponding to the sixth allocated train from the candidate outbound route set to obtain a first preliminary outbound route set; determine a preferred outbound route from the first preliminary outbound route set.
21. The apparatus of claim 13, wherein, The fourth determination module comprises: an eleventh determination submodule configured to determine a preset arrival time of the target train at the target station in a case where the target train is an up train; a twelfth determination submodule configured to determine a departure time interval of the target train at the target station according to the preset arrival time and a stop station time condition; a thirteenth determination submodule configured to determine an allocated train of each candidate outbound route in the candidate outbound route set according to outbound route allocated information corresponding to the candidate outbound route set; a fourteenth determination submodule configured to determine a preferred outbound route from the candidate outbound route set according to a time constraint, based on the departure time interval and the passing time of the allocated train of each candidate outbound route.
22. The apparatus of claim 21, wherein, The fourteenth determination submodule is configured to: determine the passing time of the allocated train of each candidate outbound route; According to a first constraint condition in the time constraint condition, a seventh allocated train that has a time overlap with the departure time interval is determined based on a passing time of an allocated train of each candidate outbound route and the departure time interval; According to a second constraint condition in the time constraint condition, an eighth allocated train that has a time interval less than a threshold time with any departure time node in the departure time interval is determined based on a passing time of an allocated train of each candidate outbound route and the departure time interval; The candidate outbound route corresponding to the seventh allocated train and the candidate outbound route corresponding to the eighth allocated train are eliminated from the candidate outbound route set, to obtain a second preliminary outbound route set; A preferred outbound route is determined from the second preliminary outbound route set.
23. The apparatus of claim 13, wherein, The fourth determination module comprises: A fifteenth determination sub-module configured to determine a short-distance outbound route set from the candidate outbound route set when the target train is a benchmark train; A sixteenth determination sub-module configured to determine a preferred outbound route from the short-distance outbound route set according to a departure time of the target train at the target station and outbound route allocated information corresponding to the short-distance outbound route set.
24. The apparatus of claims 13-23, wherein, The preferred inbound route comprises a route before entering an inbound port of the target platform and a route between an outbound port and the inbound port of the target platform; and the preferred outbound route comprises a route after the outbound port. 25.An electronic device comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 12.
26. A non-transitory computer readable storage medium having stored thereon computer instructions, wherein, The computer instructions are used to enable the computer to perform the method of any one of claims 1 to 12. 27.A computer program product comprising a computer program which, when executed by a processor, implements the method of any one of claims 1 to 12.
Citation Information
Patent Citations
Arrival and departure line distribution method for connecting multiple lines in different directions of high-speed railway junction station
CN112381277A