Method and device for determining transportation scheme of rail transit line
By studying the passenger flow of rail transit lines and train full load rate, determining the preliminary transfer, and optimizing the stopping plan using genetic algorithms, the problem of ignoring train capacity and retracement conditions in the existing technology is solved, and the calculation accuracy and results are improved. accuracy.
Patent Information
- Application Number
- CN202410989643.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-23
- Publication Date
- 2024-11-19
AI Technical Summary
When determining the transportation plan for rail transit lines, the prior art only considers passenger flow, ignores train capacity constraints and station retracement conditions, resulting in large errors in the calculation results and difficult to converge.
By studying the passenger flow of rail transit lines and the train full load rate of the retracement station, preliminary transfers are determined, and genetic algorithms are used to optimize the stopping plan of intermediate stations to minimize the total travel time of passengers.
Combining train scheduling factors and passenger flow, the calculation accuracy is improved, the convergence difficulty of the genetic algorithm and the error of the calculation results are reduced, and more accurate initial values and optimization solutions are obtained.
Smart Images

Figure CN118982126A_ABST
Abstract
Description
Technical Field
[0001] This document relates to the field of urban rail transit, and in particular to a method and device for determining a transportation plan for a rail transit line. Background Art
[0002] Due to the separation of work and residence, passenger flow on suburban lines in large cities often presents the characteristics of long travel distances and uneven temporal and spatial distribution. Especially during peak hours, some stations have extremely low passenger flow, while other stations face abnormal congestion and long waiting times due to high train load rates.
[0003] Existing technology determines stopping and non-stopping stations based on passenger flow and takes minimizing passenger travel time as the goal, so as to reduce the frequency of train stops and thus alleviate congestion.
[0004] However, passenger flow is only the main factor affecting congestion, not all factors. Therefore, the existing technology only considers the passenger flow factor, resulting in large errors in the final result and the calculation process is not easy to converge. Summary of the invention
[0005] In view of the above technical problems, the present application aims to propose a method and device for determining a transportation plan for a rail transit line, so as to solve at least one of the above technical problems.
[0006] In a first aspect, one or more embodiments of this specification provide a method for determining a transportation plan for a rail transit line, wherein the rail transit line includes at least one departure station, one terminal station, and multiple turnaround stations, including:
[0007] Determine a plurality of preliminary intersections of the rail transit line based on the passenger flow of the rail transit line during the study period and the train load factor of each of the plurality of turnaround stations, wherein the starting point and the end point of each of the plurality of preliminary intersections are respectively a starting station, a terminal station and one and another of the plurality of turnaround stations in the rail transit line;
[0008] Determining a plurality of target routes from the plurality of preliminary routes according to the number of trains, train load factor, and train interval of the rail transit line; and
[0009] For each of the plurality of target routes, a stop plan of an intermediate station of each of the plurality of target routes is determined based on a genetic algorithm to minimize a total travel time of passengers.
[0010] Further, determining a plurality of preliminary intersections of the rail transit line includes:
[0011] Determine a section imbalance coefficient according to the passenger flow; determine a first turnaround station along the direction from the departure station to the terminal station according to the section imbalance coefficient, the full load rate of each train, a preset imbalance coefficient threshold and a preset full load rate threshold;
[0012] Determine a second turnaround station along the direction from the terminal station to the starting station according to the section imbalance coefficient, the full load factor of each train, the imbalance coefficient threshold and the full load factor threshold;
[0013] According to the first turn-around station and the second turn-around station, a preliminary small route of the line to be processed is determined.
[0014] Further, determining the first turnaround station includes: for each station, determining whether the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold;
[0015] Determine that the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold, and determine whether the current station is the turnaround station;
[0016] When determining that the current station is the turnaround station, determining whether the train full load rate of the current station is less than the full load rate threshold;
[0017] When it is determined that the train load rate of the current station is less than the full load rate threshold, the current station is determined to be the first turnaround station.
[0018] Further, determining the second turnaround station includes: for each station, determining whether the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold;
[0019] Determine that the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold, and determine whether the current station is the turnaround station;
[0020] When determining that the current station is the turnaround station, determining whether the train full load rate of the current station is less than the full load rate threshold;
[0021] When it is determined that the train load rate of the current station is less than the full load rate threshold, the current station is determined to be the second turnaround station.
[0022] Further, determining a plurality of target intersections from the plurality of preliminary intersections comprises:
[0023] Determining a train interval for each of the plurality of preliminary intersections according to the train load factor and the train interval;
[0024] Determining the operation ratio of the rail transit line according to the driving interval of each of the plurality of preliminary intersections; and
[0025] The multiple target routes are determined according to the number of trains and the operation ratio of the rail transit lines.
[0026] Further, determining a stop plan of each intermediate station in the plurality of target routes based on a genetic algorithm includes:
[0027] Determining the iteration order of individuals in the genetic algorithm according to the multiple target intersections;
[0028] generating an initial population of the genetic algorithm according to the plurality of target intersections and the rail transit line; and
[0029] Based on the genetic algorithm, the stop plan is obtained according to the iteration order and the initial population.
[0030] Furthermore, the constraints of the genetic algorithm include: special station stop constraints, tracking interval constraints, train continuous cross-station number constraints, station continuous skipping train number constraints, station accessibility constraints and station stop mode constraints.
[0031] In a second aspect, one or more embodiments of this specification provide a device for determining a transportation plan for a rail transit line, including:
[0032] A first determination module is used to determine a plurality of preliminary intersections of the rail transit line based on the passenger flow of the rail transit line during the study period and the train load rate of each of the plurality of turnaround stations, wherein the starting point and the end point of each of the plurality of preliminary intersections are respectively a starting station, a terminal station and one and another of the plurality of turnaround stations in the rail transit line;
[0033] A second determination module is used to determine a plurality of target routes from a plurality of preliminary routes according to the number of trains, train load factor and train interval of the rail transit line; and
[0034] The third determination module is used to determine, for each of the multiple target routes, a stop plan of an intermediate station of each of the multiple target routes based on a genetic algorithm to minimize the total travel time of passengers.
[0035] The first determination module is used to determine the section imbalance coefficient according to the passenger flow; determine the first turning station along the direction from the starting station to the terminal station according to the section imbalance coefficient, the full load factor of each train, the preset imbalance coefficient threshold and the preset full load factor threshold; determine the second turning station along the direction from the terminal station to the starting station according to the section imbalance coefficient, the full load factor of each train, the preset imbalance coefficient threshold and the preset full load factor threshold; determine the preliminary small route of the line to be processed according to the first turning station and the second turning station.
[0036] In a third aspect, one or more embodiments of this specification provide a storage medium, including:
[0037] Used to store computer executable instructions, which implement the method described in any one of the first aspects when executed.
[0038] Compared with the prior art, this application can at least achieve the following technical effects:
[0039] This application first determines the scheme of large and small routes, and then determines the stop scheme based on the scheme of large and small routes, thereby combining the scheduling factors of the train and the passenger flow to improve the accuracy of subsequent calculations. The initial value of the genetic algorithm will affect its convergence difficulty and the accuracy of the results. After obtaining the scheme of large and small routes, it is easier to obtain a more accurate initial value, thereby reducing the convergence difficulty of the genetic algorithm and improving the accuracy of the calculation results. BRIEF DESCRIPTION OF THE DRAWINGS
[0040] In order to more clearly illustrate one or more embodiments of this specification or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in this specification. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0041] Figure 1 A flowchart of a method for determining a transportation plan for a rail transit line provided for one or more embodiments of this specification;
[0042] Figure 2 A schematic diagram of the structure of a device for determining a transportation plan for a rail transit line provided in one or more embodiments of this specification. DETAILED DESCRIPTION
[0043] In order to enable those skilled in the art to better understand the technical solutions in one or more embodiments of this specification, the following will be combined with the drawings in one or more embodiments of this specification to clearly and completely describe the technical solutions in one or more embodiments of this specification. Obviously, the described embodiments are only part of the embodiments of this specification, not all of the embodiments. Based on one or more embodiments of this specification, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this document.
[0044] The following factors exist when calculating the stop plan in the prior art:
[0045] 1. Only consider passenger flow
[0046] In fact, the line congestion problem caused by large passenger flow can be effectively alleviated by adopting scientific and reasonable train scheduling strategies. However, when calculating, the existing technology mostly simply controls the passenger flow to a certain extent from the dimension of passenger flow, while ignoring realistic factors such as train capacity constraints, station return conditions, and the number of available vehicles. The scheduling scheme obtained in this way is highly theoretical, but it is likely to be inconsistent with reality.
[0047] 2. The calculation process is difficult to converge
[0048] When determining the stop plan, multiple constraints are generally set, such as waiting time, travel time, full load rate, etc. When there are too many constraints, it will make the calculation process more difficult to converge.
[0049] In view of the above-mentioned defects, the present application embodiment provides a method for determining a transportation plan for a rail transit line, such as Figure 1 As shown, the following steps are included:
[0050] Step 1: Based on the passenger flow of the rail transit line during a research period and the train load factor of each of a plurality of turnaround stations, a plurality of preliminary intersections of the rail transit line are determined.
[0051] In an embodiment of the present application, the rail transit line includes at least one departure station, one terminal station, and multiple turnaround stations; the starting point and the end point of each of the multiple preliminary intersections are respectively one departure station, one terminal station, and one and another of the multiple turnaround stations in the rail transit line. A turnaround station refers to a station that has the conditions for turning around and can complete the turnaround operation at the station with a full load of trains. For example, after train A arrives at Station A, it can complete the turnaround operation at Station A, then Station A is a turnaround station. Therefore, a turnaround station is a prerequisite for becoming a departure station or a terminal station.
[0052] In the embodiment of the present application, the model is divided into two parts, the first part is recorded as the upper model for calculating the route plan, and the second part is recorded as the lower model for calculating the stop plan based on the calculation result of the upper model.
[0053] The upper model is as follows:
[0054] The model objectives are:
[0055]
[0056] In the formula, Z 上层 is the optimization target of the upper model; C is the train capacity; L t N is the required full load factor of the train in the tth period; t is the number of trains in the tth period; is the maximum cross-sectional passenger flow in the tth period in direction s.
[0057] The constraints are:
[0058] If the research period is the peak period, the tracking interval must meet the following requirements:
[0059]
[0060] In the formula, h t is the tracking interval of the tth period; T is the research period; h max and h min are the maximum and minimum tracking intervals respectively.
[0061] Train load factor constraints:
[0062]
[0063] Where, L max It is the upper limit of the full load factor constraint.
[0064] The total number of trains running on all routes is not greater than the number of available vehicles:
[0065]
[0066] Where r is the rth type of intersection, and R is the set of intersection types; is the number of trains running on route r in the tth period, is the total number of trains running in the tth period, is the number of available vehicles. r is a 0-1 variable indicating whether the intersection r is selected, X r =1, then the intersection r is selected; otherwise, it is not selected.
[0067] Constraints on the total number of routes opened:
[0068]
[0069] Where M is the upper limit of the number of routes that can be opened.
[0070] The calculation process based on the above model is:
[0071] Step S1: Determine the section imbalance coefficient according to the passenger flow.
[0072] In the embodiment of the present application, the section imbalance coefficient refers to the ratio of the throughput of a section to the average throughput of other sections of the entire journey at the same time. The tracking interval is the minimum interval time between tracking running trains.
[0073] Step S2: along the direction from the departure station to the terminal station, according to the section imbalance coefficient, the full load rate of each train, the preset imbalance coefficient threshold and the preset full load rate threshold, determine the first turning station as the starting point of the small route.
[0074] In the embodiment of the present application, the specific process of step S2 is:
[0075] A1. For each station, determine whether the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold. If so, execute A2; otherwise, select the next station and execute A1.
[0076] A2. Determine whether the current station is a turnaround station. If so, execute A3. Otherwise, select the next station and execute A1.
[0077] A3. Determine whether the train load rate of the current station is less than the load rate threshold. If so, determine that the current station is the first turnaround station. Otherwise, select the next station and execute A2.
[0078] Step S3: along the direction from the terminal station to the starting station, according to the section imbalance coefficient, the full load rate of each train, the preset imbalance coefficient threshold and the full load rate threshold, determine the second turning station as the end point of the small route.
[0079] In the embodiment of the present application, the specific process of step S3 is:
[0080] B1. For each station, determine whether the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold. If so, execute B2; otherwise, select the next station and execute B1.
[0081] B2. Determine whether the current station is a turnaround station. If so, execute B3. Otherwise, select the next station and execute B1.
[0082] B3. Determine whether the train load rate of the current station is less than the load rate threshold. If so, determine that the current station is the second turnaround station. Otherwise, select the next station and execute B2.
[0083] Step S4: Determine a preliminary small route of the route to be processed according to the first turnaround station and the second turnaround station.
[0084] In the embodiment of the present application, if the first turnaround station is the starting station of the route to be processed, and the second turnaround station is the terminal station of the route to be processed, then this situation is a large route, not a small route. In addition, all others can be regarded as small routes.
[0085] Step 2: According to the number of trains, train load factor and running interval of the rail transit line, multiple target routes are determined from multiple preliminary routes.
[0086] In this application, the preliminary small routes cover all possible small routes, but in practice, many small routes are unreasonable, such as small routes that do not stop at transfer stations. Therefore, based on the upper model, this application re-screens the preliminary small routes to obtain the target small routes:
[0087] Determine the headway of each of multiple preliminary routes according to the train full load rate and the headway between train trips; determine the operation ratio of the rail transit line according to the headway of each of the multiple preliminary routes; determine multiple target routes according to the number of trains and the operation ratio of the rail transit line.
[0088] Specifically,
[0089] Step 1: Initialization. Input the number of available trains Thresholds such as the minimum tracking interval h, the upper limit of the number of routes, etc., and all the obtained preliminary short routes and long routes (routes to be processed) form a set R.
[0090] Step 2: Calculate the headway of each route in the set:
[0091] Step 2.1: Sort the routes in set R from smallest to largest, and let the route index r = 1; here, from smallest to largest means the number of stations included in each route in the set is from smallest to largest.
[0092] Step 2.2: If r ≤ |R|, go to Step 2.3; otherwise, go to Step 3;
[0093] Step 2.3: Find the maximum sectional passenger flow and calculate the tracking interval h of route r at time t r,t ;
[0094] Step 2.4: If h r,t < h, let h r,t = h; otherwise, let r = r + 1, and go to Step 2.2.
[0095] Step 3: Calculate the operation ratio of the trains on each preliminary route.
[0096] In the embodiment of the present application, the operation ratio is specifically the ratio of the departure frequency of the long route to the departure frequency of the short route. For example, when the long route departs once and the short route departs once, the operation ratio is 1:1. When the long route departs twice and the short route departs once, the operation ratio is 2:1.
[0097] Step 3.1: Let the route index r = |R|, and the sum of the route ratios M sum = 0. Find the least common multiple Mlcm of all routes;
[0098] Step 3.2: If r ≥ 1, go to Step 3.3; otherwise, go to Step 4;
[0099] Step 3.3: Calculate the train operation ratio ω of route r r , ωr =M lcm / h r,t -M sum Let M sum =M sum +ω r , r=r-1, go to Step 3.2.
[0100] Step 4: Calculate the number of trains required for this route plan:
[0101] Step 4.1: Calculate the equivalent turnaround time t turnover , t turnover =∑h r,t ·ω r / ∑ω r ;
[0102] Step 4.2: Calculate the total number of trains required
[0103] Step 5. If Go to Step 6; otherwise, based on actual operation experience, add another small intersection to the preliminary intersection plan and go to Step 2.
[0104] Step 6. Determine the corresponding preliminary small intersection as the target small intersection.
[0105] Step 3: for each of the multiple target routes, determine a stop plan for the intermediate site of each of the multiple target routes based on a genetic algorithm.
[0106] In the embodiment of the present application, the lower model is used to calculate the stop plan.
[0107] The lower model is as follows:
[0108] The model objectives are:
[0109]
[0110] In the formula, Z 下层 Optimize the target for the underlying model; is the waiting time for passengers who want to take train k at station i, is the running time of passengers in train k at station i and section i, K is the set of train k, and Ω is the set of station i and section i.
[0111] Passenger flow calculation
[0112] 1) Number of passengers getting on and off the bus
[0113]
[0114] In the formula, and are the number of passengers getting on and off train k at station i; x i,k is a 0-1 variable indicating whether train k stops at station i, x i,k =1, then train k stops at station i, otherwise, the train skips the station; is the passenger capacity of train k arriving at station i, The number of passengers that train k leaves station i And is the number of waiting passengers who plan to take train k from station i; q m,i is the passenger flow demand from station m to station i.
[0115] 2) Number of passengers remaining on board
[0116]
[0117] Considering that there are no stranded passengers at the departure station and the final destination station,
[0118] 3) Number of passengers entering and transferring
[0119]
[0120] In the formula, For incoming / transfer passengers, h i,k is the departure interval between train k and train k-1 at station i.
[0121] 4) Number of waiting passengers
[0122]
[0123] 5) Passenger waiting time
[0124] When train k arrives at station i, the waiting time of the remaining passengers is h i,k ; If the passengers arrive at the station in a uniform distribution, the waiting time for incoming / transfer passengers is h i,k / 2. Therefore, the passenger waiting time for:
[0125]
[0126] If there are no passengers waiting at the final stop,
[0127] 6) Passenger travel time
[0128] The running time includes the time that passengers who arrive at the station but do not get off the train, the running time of passengers in the train after leaving the station, and the additional time for starting and stopping. for:
[0129]
[0130] In the formula, and is the additional time for train k to start and stop at station i, and is the running time of the train in section i and the stop time at station i.
[0131] Constraints:
[0132] 1) Special station stop restrictions
[0133] All trains need to stop at their departure and arrival stations, as well as some key stations with large passenger flow.
[0134]
[0135] In the formula, Ω * It is a collection of key stations with large passenger flow.
[0136] 2) Tracking interval constraints
[0137] Since there is a technical speed difference between fast and slow trains, the departure interval between train k-1 and train k should satisfy:
[0138]
[0139] Among them, a i,k and d i,k are the arrival and departure times of train k at station i, respectively, and the calculation formula is:
[0140]
[0141] 3) Constraints on the number of trains crossing stations
[0142]
[0143] Where M t,max It is the upper limit of the maximum number of consecutive stations a train can cross.
[0144] 4) Constraints on the number of trains that can stop continuously at a station
[0145]
[0146] Where M s,max It is the upper limit of the maximum number of trains allowed to skip consecutive stops at a station.
[0147] 5) Station accessibility constraints
[0148]
[0149] Where M num is the number of stop modes, and M num >M s,max ;M access is the lower limit of accessibility. Considering that too many station stops are not conducive to the station transportation organization work, and also affect the correct and fast boarding of passengers, the number of station stops is restricted, and the subsequent trains are repeated using trains k~k+M num Station stop mode.
[0150] 6) Stop mode constraints
[0151]
[0152] K′|=M num
[0153] Where Ψ(k) is the order of the stop signs of train k at all stations, Ψ(k) = (x 1,k ,x 2,k ,...); K′ is a set of trains that stop at different stations.
[0154] Preferably, in order to further improve the calculation accuracy, a short-route train stop constraint may be added.
[0155] Specifically, the short-distance train stop constraints are:
[0156]
[0157] Where R′ is the set of all small routes; Θ(r) is the function to obtain the number of stations on route r; X k,r is a 0-1 variable indicating whether route r is selected by train k, X k,r =1, then the intersection r is selected; otherwise, it is not selected.
[0158] Based on the above lower-level model, the iteration order of individuals in the genetic algorithm is determined according to multiple target intersections; the initial population of the genetic algorithm is generated according to the multiple target intersections and rail transit lines; based on the genetic algorithm, a stop plan is obtained according to the iteration order and the initial population.
[0159] Specifically, Step 1: Initialization.
[0160] Let the station ordered number set Ω = {1,...i,...j,...,N}; the train ordered departure number set K = {1,2,...,k,...} in the study period T; the travel demand between stations Q = {q i,j |i,j∈Ω}; let the stop plan Scheme index m=1, m≤m max ; The best individual Evolution iteration index ω=1,ω≤ω max ; Inner loop index ω′=1, ω′≤ω max′ ; Triggering catastrophe index ω″=1,ω″≤ω max ″.
[0161] Step 2: According to the obtained intersection ratio, arrange them in a circular manner from large intersection to small intersection.
[0162] Step 3: Generate initial solution:
[0163] Step 3.1: If m <m max , under the condition that the special station stop constraint is met, the first M num The train is encoded and the individual X is generated by cyclic combination m , go to Step 3.2; otherwise, the initial solution Γ has been generated, find the optimal fitness value Z + and the corresponding individual X + , Z + =f(X + )=min(f(X1),...,f(X 2M )), go to Step 4;
[0164] Step 3.2: Initialize the departure time of each train at the first station according to the principle of equal departure intervals at the first station; calculate the arrival time and departure time of all trains at each station according to the departure time of the first station and the train running time parameters;
[0165] Step 3.3: Determine whether the solution is feasible based on the tracking interval, the number of trains that continuously cross stations, and the number of trains that continuously skip stops at stations. If the constraints are met, calculate the objective function as the fitness value f(X m ), let Γ (0) =Γ (0) ∪{X m}, m=m+1, go to Step 3.1; otherwise, go directly to Step 3.1.
[0166] After obtaining the iteration sequence and the initial population, the genetic algorithm is used to determine the stop plan. Specifically,
[0167] Step 4: Genetic algorithm iterative optimization:
[0168] Step 4.1: If ω<ω max , go to Step 4.2; otherwise, the iterative optimization has been completed, go to Step 6;
[0169] Step 4.2: If ω′<ω max′ , use the roulette method to select two individuals X a,X b , and X a ≠X b , go to Step 4.3; otherwise, find the optimal fitness value of the ωth generation Let ω=ω+1, ω′=1, and go to Step 5;
[0170] Step 4.3: In 1~|N·M num |Range random generation p a,1 ,p a,2 , respectively as the starting and ending positions of the first group of train crossover operators, where N is the number of stations. Find the corresponding positions of the subsequent γ groups of trains γ·|N·M in sequence num |+p a,1 and γ·|N·M num |+p a,2 , and use them as the start and end positions respectively. The corresponding positions are synchronized by using crossover operation to generate X a ′,X b ′;
[0171] Step 4.4: In 1~|N· nnum |Range randomly generates p1, if p1∈Θ({1,N}∪Ω * ), the position of p1 is invalid, and p1 is regenerated, where Θ({1,N}∪Ω * ) is the position mark of the train at the departure station, the final station and the key station; otherwise, the p1 position is valid. Find the corresponding positions of the subsequent γ groups of trains γ·|N·M in sequence num |+p1. The corresponding position is synchronously generated by mutation operation X a ″,X b ″;
[0172] Step 4.5: Determine X based on the constraints a ″,X b Is it feasible? If it is feasible, calculate the objective function and let Γ (ω) =Γ (ω) ∪{X a ″,X b ″}, let ω′=ω′+1, and go to Step 4.2; otherwise, go directly to Step 4.2.
[0173] Step 5: Catastrophic operation:
[0174] Step 5.1: If Will As the optimal fitness value, Go to Step 4.1; if, Go directly to Step 4.1; otherwise, set ω″=ω″+1 and go to Step 5.2;
[0175] Step 5.2: If ω″<ω max ″, go to Step 4.1; otherwise, let Γ + =Γ + ∪{X +}, ω″=1, go to Step 3.
[0176] Step 6: The loop ends and the optimal solution Z is output * =min(Z + , Γ + ).
[0177] In the embodiment of the present application, there is no right or wrong in train scheduling, only relative advantages and disadvantages. The genetic algorithm starts searching from a string set of problem solutions, so it is more suitable for the application scenario of the present application. However, the calculation accuracy and convergence difficulty of the genetic algorithm are related to the initial quantity. Therefore, a more accurate initial quantity can be obtained through the upper model, which is conducive to the subsequent improvement of the accuracy of the genetic algorithm and the reduction of the convergence difficulty.
[0178] The embodiment of the present application provides a device for determining a transportation plan of a rail transit line, including:
[0179] The first determination module 201 is used to determine a plurality of preliminary intersections of the rail transit line based on the passenger flow of the rail transit line during the study period and the train load rate of each of the plurality of turnaround stations, wherein the starting point and the end point of each of the plurality of preliminary intersections are respectively a starting station, a terminal station and one and another of the plurality of turnaround stations in the rail transit line;
[0180] The second determination module 202 is used to determine multiple target routes from multiple preliminary routes according to the number of trains, train load factor and train interval of the rail transit line;
[0181] The third determination module 203 is used to determine, for each of the multiple target routes, a stop plan for the intermediate stations of each of the multiple target routes based on a genetic algorithm to minimize the total travel time of passengers.
[0182] In an embodiment of the present application, the first determination module is used to determine the cross-sectional imbalance coefficient based on the passenger flow; determine the first turning station along the direction from the starting station to the terminal station based on the cross-sectional imbalance coefficient, the full load factor of each train, a preset imbalance coefficient threshold and a preset full load factor threshold; determine the second turning station along the direction from the starting station to the terminal station based on the cross-sectional imbalance coefficient, the full load factor of each train, a preset imbalance coefficient threshold and a preset full load factor threshold; determine the preliminary small route of the line to be processed based on the first turning station and the second turning station.
[0183] The present application provides a storage medium, including:
[0184] Used to store computer executable instructions, which implement the method described in any of the above embodiments when executed.
[0185] The above is a description of a specific embodiment of the specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the embodiments and still achieve the desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
[0186] In the 1930s, improvements to a technology could be clearly distinguished as hardware improvements (for example, improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the method flow). However, with the development of technology, many improvements to the method flow today can be regarded as direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that an improvement in a method flow cannot be implemented using a hardware entity module. For example, a programmable logic device (PLD) (such as a field programmable gate array (FPGA)) is such an integrated circuit whose logical function is determined by the user's programming of the device. Designers can "integrate" a digital method on a PLD by programming it themselves, without having to ask a chip manufacturer to design and produce a dedicated integrated circuit chip. Moreover, nowadays, instead of manually making integrated circuit chips, this kind of programming is mostly implemented by "logic compiler" software, which is similar to the software compiler used when developing and writing programs, and the original code before compilation must also be written in a specific programming language, which is called hardware description language (HDL). There is not only one HDL, but many kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used ones are VHDL (Very-High-Speed Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should also know that it is only necessary to program the method flow slightly in the above-mentioned hardware description languages and program it into the integrated circuit, and then it is easy to obtain the hardware circuit that implements the logic method flow.
[0187] The controller can be implemented in any appropriate manner, for example, the controller can take the form of a microprocessor or processor and a computer-readable medium storing a computer-readable program code (such as software or firmware) that can be executed by the (micro)processor, a logic gate, a switch, an application-specific integrated circuit (ASIC), a programmable logic controller, and an embedded microcontroller. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320. The memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art also know that in addition to implementing the controller in a purely computer-readable program code manner, the controller can be implemented in the form of a logic gate, a switch, a dedicated integrated programmable logic controller, and an embedded microcontroller by logically programming the method steps. Therefore, this controller can be considered as a hardware component, and the devices included therein for implementing various functions can also be regarded as structures within the hardware component. Or even, the devices for implementing various functions can be regarded as both software modules for implementing the method and structures within the hardware component.
[0188] The methods, devices, modules or units described in the above embodiments may be implemented by a computer chip or entity, or by a product having a certain function. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
[0189] For the convenience of description, the above devices are described in terms of functions and are divided into various units. Of course, when implementing the embodiments of this specification, the functions of each unit can be implemented in the same or multiple software and / or hardware.
[0190] It will be appreciated by those skilled in the art that one or more embodiments of this specification may be provided as methods, methods or computer program products. Therefore, one or more embodiments of this specification may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0191] This specification is described with reference to the flowcharts and / or block diagrams of the methods, devices (methods), and computer program products according to the embodiments of this specification. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0192] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0193] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0194] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0195] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.
[0196] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0197] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0198] One or more embodiments of the present specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. One or more embodiments of the present specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.
[0199] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the method embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.
[0200] The above description is only an embodiment of this document and is not intended to limit this document. For those skilled in the art, this document may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this document should be included in the scope of the claims of this document.
Claims
1. A method for determining a transportation plan for a rail transit line, wherein the rail transit line comprises at least one departure station, one terminal station and a plurality of turnaround stations, Features The method comprises: Determine a plurality of preliminary intersections of the rail transit line based on the passenger flow of the rail transit line during the study period and the train load factor of each of the plurality of turnaround stations, wherein the starting point and the end point of each of the plurality of preliminary intersections are respectively a starting station, a terminal station and one and another of the plurality of turnaround stations in the rail transit line; Determining a plurality of target routes from the plurality of preliminary routes according to the number of trains, train load factor, and train interval of the rail transit line; and For each of the plurality of target routes, a stop plan of an intermediate station of each of the plurality of target routes is determined based on a genetic algorithm to minimize a total travel time of passengers.
2. The method according to claim 1, It is characterized in that Determine a plurality of preliminary intersections of the rail transit line, including: Determine a section imbalance coefficient according to the passenger flow; determine a first turnaround station along the direction from the departure station to the terminal station according to the section imbalance coefficient, the full load rate of each train, a preset imbalance coefficient threshold and a preset full load rate threshold; Determine a second turnaround station along the direction from the terminal station to the starting station according to the section imbalance coefficient, the full load factor of each train, the imbalance coefficient threshold and the full load factor threshold; A preliminary small route of the rail transit line is determined according to the first turn-around station and the second turn-around station.
3. The method according to claim 2, It is characterized in that Determining the first turnaround station includes: for each station, determining whether the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold; Determine that the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold, and determine whether the current station is the turnaround station; When determining that the current station is the turnaround station, determining whether the train full load rate of the current station is less than the full load rate threshold; When it is determined that the train load rate of the current station is less than the full load rate threshold, the current station is determined to be the first turnaround station.
4. The method according to claim 2, It is characterized in that Determining the second turnaround station includes: for each station, determining whether the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold; Determine that the section imbalance coefficient of the current station is greater than the imbalance coefficient threshold, and determine whether the current station is the turnaround station; When determining that the current station is the turnaround station, determining whether the train full load rate of the current station is less than the full load rate threshold; When it is determined that the train load rate of the current station is less than the full load rate threshold, the current station is determined to be the second turnaround station.
5. The method according to claim 1, It is characterized in that Determining a plurality of target intersections from the plurality of preliminary intersections comprises: Determining a train interval for each of the plurality of preliminary intersections according to the train load factor and the train interval; Determining the operation ratio of the rail transit line according to the driving interval of each of the plurality of preliminary intersections; and The multiple target routes are determined according to the number of trains and the operation ratio of the rail transit lines.
6. The method according to claim 5, It is characterized in that Determining a stop plan of each of the intermediate stops in the plurality of target routes based on a genetic algorithm includes: Determining the iteration order of individuals in the genetic algorithm according to the multiple target intersections; generating an initial population of the genetic algorithm according to the plurality of target intersections and the rail transit line; and Based on the genetic algorithm, the stop plan is obtained according to the iteration order and the initial population.
7. The method according to claim 6, It is characterized in that The constraints of the genetic algorithm include: special station stop constraints, tracking interval constraints, the number of trains that continuously cross stations, the number of trains that continuously skip stations, station accessibility constraints and station stop mode constraints.
8. A device for determining a transportation plan for a rail transit line, wherein the rail transit line comprises at least one starting station, one terminal station and a plurality of turnaround stations, Features include: A first determination module is used to determine a plurality of preliminary intersections of the rail transit line based on the passenger flow of the rail transit line during a research period and the train load rate of each of the plurality of turnaround stations, wherein the starting point and the end point of each of the plurality of preliminary intersections are respectively a starting station, a terminal station and one and another of the plurality of turnaround stations in the rail transit line; A second determination module is used to determine a plurality of target routes from the plurality of preliminary routes according to the number of trains, train load factor and train interval of the rail transit line; and; The third determination module is used to determine, for each of the plurality of target routes, a stop plan of the intermediate sites of the plurality of target routes based on a genetic algorithm so as to minimize the total travel time of the passengers.
9. The device according to claim 8, It is characterized in that The first determination module is used to determine the section imbalance coefficient according to the passenger flow; determine the first turnaround station along the direction from the departure station to the terminal station according to the section imbalance coefficient, the full load rate of each train, a preset imbalance coefficient threshold and a preset full load rate threshold; Determine a second turnaround station along the direction from the terminal station to the starting station according to the section imbalance coefficient, the full load rate of each train, a preset imbalance coefficient threshold and a preset full load rate threshold; A preliminary small route of the rail transit line is determined according to the first turn-around station and the second turn-around station.
10. A storage medium for storing computer executable instructions, Its characteristics are, When the computer executable instructions are executed, the method according to any one of claims 1 to 7 is implemented.
