CN115817588A - Automatic urban rail train running chart compiling method and system for large and small traffic mode - Google Patents
Automatic urban rail train running chart compiling method and system for large and small traffic mode Download PDFInfo
- Publication number
- CN115817588A CN115817588A CN202211695820.8A CN202211695820A CN115817588A CN 115817588 A CN115817588 A CN 115817588A CN 202211695820 A CN202211695820 A CN 202211695820A CN 115817588 A CN115817588 A CN 115817588A
- Authority
- CN
- China
- Prior art keywords
- time
- train
- line
- running
- station
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention discloses a method and a system for automatically compiling an urban rail train running chart facing a large-small traffic mode. The invention comprises the following steps: basic parameters compiled by the train working diagram are configured, the peak leveling transition time period is divided again based on the basic parameters, the peak leveling time period is adjusted, and the train working diagram at each time period is drawn; the method aims at few pairs of train hooking connection in adjacent time periods and even train entering and exiting sections to sequentially compile running line connection schemes in different time periods; compiling an entrance and exit section scheme aiming at the operation line needing an entrance and exit section; checking the operation diagram conflict and establishing a mediation network to mediate the conflict; and obtaining a train operation diagram which can be applied to actual operation. The invention improves the train operation diagram compiling efficiency under the complex operation environment, effectively solves the problem of sudden change of departure time caused by unreasonable transition of a flat peak, and can effectively relieve the conflict of operation lines at a return station or an entrance station.
Description
Technical Field
The invention relates to the technical field of rail transit, in particular to a method and a system for automatically compiling an urban rail train running chart facing a large and small traffic road mode.
Background
The urban rail transit (such as subway) has the advantages of large passenger capacity, high punctuality, short departure interval, reasonable fare and the like, the method becomes a preferred scheme for people to go out in public transport means. Therefore, the urban rail transit bears important operation tasks in the city, and the reasonability of the arrangement of the operation scheme directly relates to the urban trip efficiency.
Along with the continuous expansion of urban rail transit road network scale, resident's trip demand presents the trend of growing day by day, because the land utilization condition along the route is different, resident's trip distribution is more dispersed, and the passenger flow demand of peak period presents the characteristics of obvious time-space distribution inequality. For lines with unbalanced passenger flow space-time distribution, the operation organization method adopting a large and small traffic mode can balance the spatial distribution difference of the passenger flow of the lines and improve the transport capacity of small passenger flow sections.
The train operation diagram is used as an organization scheme of train operation, and the detailed operation scheme of each train of each shift is planned, wherein the detailed operation scheme comprises operation cross roads, inbound and outbound time (and station stopping time), departure frequency, operation line vehicle sections and the like.
Document CN2022101348011 discloses a method and system for automatically compiling a multi-intersection multi-time-period all-day train running chart, which determines a running scheme of a train according to basic parameters, obtains the train running chart according to the running scheme, fixes a running line in a downlink direction, and adjusts the running line in the uplink direction to generate a train bottom connection relationship in a single time period; a linear programming model for solving the hooking relation of different time periods is constructed by taking the maximum number of connected trains as a target, a linear programming model for a train entering and exiting section scheme is constructed by taking the shortest entering and exiting section traveling distance as a target, and a branch-and-bound algorithm is adopted for solving.
The document 'optimization and compilation of urban rail transit collinear road crossing running diagrams', zhang Xiaoqian, cui Bingmou 'computer application and software', 2016,33 (03): 248-251 discloses an optimization and compilation scheme of urban rail transit collinear road crossing running diagrams, which adopts a sequential push point method to determine a train running line, establishes an underbody road crossing optimization model taking the minimum number of used cars as a target based on the train running diagram, considers constraints such as retrace station capacity constraint, retrace time constraint and the like, and designs a solving method.
Similar prior art also discloses a method and a system for generating an urban rail Train Operation diagram facing complex Operation Routes, or "Optimization of Train Operation Planning with Full-Length and Short-Turn Routes of Virtual Coupling Trains", ZHOU X, LU F, WANG L.applied Sciences,2022,12 (15): 7935, for example, in the document CN 2021114348119.
In the prior art, only the plan scheme of the operation line in the peak leveling or peak time period is considered, and the rule of the operation line between peak leveling and peak time is suddenly changed, so that the train is frequently delivered into and out of a warehouse, or the train is less in operation line after the train is delivered out of the warehouse at the bottom of the train. In addition, if conflict occurs between operation lines, the prior art carries out conflict mediation through manual scheduling, which can solve the conflict problem at one time, but can cause new influence on the subsequent operation lines.
Disclosure of Invention
The invention aims to: aiming at the existing problems, the automatic urban rail train running chart compiling method facing the large and small traffic modes is provided, so that the problems of frequent trip and loose running of a running line caused by unreasonable transition of a flat peak are effectively solved.
The technical scheme adopted by the invention is as follows:
an automatic urban rail train running chart compiling method facing a large and small traffic pattern comprises the following steps:
s1, configuring basic parameters compiled by a train operation diagram, wherein the basic parameters comprise a flat peak time period and an departure interval of the flat peak time period;
s2, dividing a flat peak transition period based on the basic parameters, calculating a departure interval of the flat peak transition period, continuing the flat peak period and the flat peak transition period, and drawing a train operation diagram at each period;
s3, fixing one side of the operation line based on the train operation chart of each time interval, adjusting the other side of the operation line, and compiling an operation line connection scheme in each time interval by taking the shortest connection time as a target;
s4, based on the train operation diagrams in each time interval and the operation line connection schemes in each time interval, sequentially compiling operation line connection schemes in different time intervals according to time by taking the minimum number of train connection logarithms and the uniformity of train operation lines in adjacent time intervals as targets;
s5, on the basis of the train operation chart of each time period, aiming at the train operation line needing to enter and exit the section, a section entering and exiting scheme of the train operation line is compiled;
and S6, judging whether conflicts exist among the operation lines or not based on the train operation diagrams and the entering and exiting section schemes at all time intervals, and if yes, resolving the conflicts.
Preferably, the basic parameters further include station set, minimum and maximum retrace times of a retrace station, stop times of each station, and section operation time.
Preferably, the dividing of the flat peak transition period based on the basic parameters and the calculating of the departure interval of the flat peak transition period comprise:
and generating transition periods from the peak periods to the flat periods forwards and backwards respectively at preset time intervals, wherein the departure intervals of the transition periods are gradually increased from the departure intervals of the peak periods to the departure intervals of the flat periods until the departure intervals of the flat periods are equal.
Preferably, in step S2, the step of drawing the train operation diagram at each time interval includes:
calculating departure time and arrival time of the train at the starting station based on each time period and the corresponding departure interval;
sequentially calculating the arrival time and departure time of the train at other trains based on the arrival time and departure time of the train at the starting station;
and drawing a train operation diagram in each time interval according to the arrival time and departure time of the train at each station.
Preferably, the step S3 includes:
s301: traversing each time interval, fixing the running line of one side without the train section sending out the train, and continuously translating the time of the running line of the other side backwards in a preset time unit to generate the connection relation of the train bottom;
s302: and in the generated connection relation of the train bottom, finding the running line with the minimum number of turn-back conflicts and the minimum turn-back time, connecting the fixed running line, and generating the train running chart in the period.
Preferably, in step S301, the time of continuously translating the running line in the other direction backwards by a predetermined time unit is a predetermined time.
Preferably, the step S4 includes:
sequencing all time intervals of the whole day according to time, and forming a set by every two adjacent time intervals to obtain a pairwise time interval set;
traversing the time period set, respectively judging the number of the running lines of the two elements which are on-line in the time period, and taking the set element with smaller number of the running lines in the two elements as a reference element;
and traversing the running line in the reference element, searching the running line meeting the minimum turn-back time and the maximum turn-back time in the basic parameters in another element in the same set according to the last/first stop station track and the time of the current running line, and selecting the running line with the minimum connection time to connect the current running line.
Preferably, the step S5 includes:
traversing the all-antenna operation line, and aiming at the operation line without a preamble, obtaining the exit scheme of the operation line according to the first stop station and arrival time of the operation line, the position of the vehicle section and the form of the switching track, wherein the exit schemes of all the operation lines form an exit scheme set of the operation line;
traversing all-antenna operation lines, and aiming at the operation lines without subsequent sequences, obtaining the entry schemes of the operation lines according to the last stop station and arrival time of the operation lines, the positions of the vehicle sections and the form of a switching track, wherein the entry schemes of all the operation lines form an entry scheme set of the operation lines;
and aiming at all the entry and exit section operation lines, selecting an entry and exit section scheme of the operation line from the corresponding exit section scheme set and entry section scheme set by taking the minimum conflict with the return operation as a target.
Preferably, the step S6 includes:
on the basis of the compiled train operation diagram and the entering and exiting section scheme of each time period, the all-day operation line is traversed, the feasible entering time and exiting time of the operation line at each turn-back station are listed, and then the arrival time and departure time of the operation line at each turn-back station are determined by taking the fact that the operation line does not conflict with the train operation line passing through the turn-back station as a target.
The invention also provides a system for automatically compiling the urban rail train working diagram facing the large and small traffic route modes, which comprises a processor and a computer readable storage medium, wherein the computer readable storage medium is configured with a computer program, and the processor runs the computer program to execute the method for automatically compiling the urban rail train working diagram facing the large and small traffic route modes.
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
1. the invention adds the peak leveling transition time and the departure interval between the peak leveling time and the peak time, realizes the stable transition between the peak leveling time, avoids the sudden change of the operation line during the peak leveling time, increases the train hooking quantity in the adjacent time, makes the train bottom entering and exiting sections more uniform, and greatly improves the utilization rate of the train bottom.
2. The invention can effectively relieve the conflict of the train operation lines at the turn-back station or the entrance and exit station and ensure the uniform distribution of the train operation lines at intervals.
3. Compared with a manual compiling mode, the method can improve the drawing efficiency of the operation diagram; compared with the prior art, the train operation diagram generation scheme provided by the invention has the advantages of lower calculation complexity, fast solving time and better solving quality.
Drawings
The invention will now be described, by way of example, with reference to the accompanying drawings, in which:
fig. 1 is a preferred embodiment of the execution flow of the urban rail train operation diagram automatic compilation method facing the large and small traffic patterns.
Fig. 2 is a schematic illustration of an initial train operating map after a repartitioning period.
Fig. 3 is one embodiment of run line splicing during the early flat period.
Fig. 4 is one embodiment of a run line splice between adjacent time periods.
Fig. 5 is one embodiment of an access ramp travel line.
Fig. 6 is one embodiment of a collision mitigation result.
Detailed Description
All of the features disclosed in this specification, or all of the steps in any method or process so disclosed, may be combined in any combination, except combinations of features and/or steps that are mutually exclusive.
Any feature disclosed in this specification (including any accompanying claims, abstract) may be replaced by alternative features serving equivalent or similar purposes, unless expressly stated otherwise. That is, unless expressly stated otherwise, each feature is only an example of a generic series of equivalent or similar features.
The invention provides a method for automatically compiling an urban rail train operation diagram by comprehensively utilizing a uniform point distribution method, a transition time period increasing method, a connection scheme generation method in a time period with the shortest connection time as a target, a connection scheme generation method with the maximum train connection number in adjacent time periods and uniform train bottom access and exit sections as a target, a conflict relief method with a space-time network as a tool and the like.
Example one
As shown in fig. 1, the method for automatically compiling the urban rail train running chart facing the large and small traffic mode comprises the following steps:
s1, configuring basic parameters for compiling a train operation diagram.
The train operation diagram is for a specific time period, and the train operation diagram is compiled by considering departure time and arrival time of an operation line at each station, and the two times need to be calculated according to parameters such as departure interval, station (interval) operation time, station stopping time and the like. The departure intervals are different in different periods, for example, the departure interval in the peak period is necessarily shorter than the flat peak period, so the basic parameters of the configuration at least comprise the definition of the flat peak period and the departure interval in the flat peak period.
The step of configuring the basic parameters comprises:
s101: setting station set S = {1,2, … … n, n +1, n +2, … … n } in line, ascending station set S up = {1,2, … … n }, descending station set S down ＝{n+1,n+2,……2n}。
S102: the departure intervals of the trains in the peak time period and the flat time period are respectively set to be H high And H low (Or train departure frequency F in peak time and flat time can be set high And F low ) The minimum and maximum retrace times at the retrace station are respectively
And
s103: setting the start and end times of each time interval, setting the early peak-off time interval as
The early peak period is
The time interval of noon-Ping peak is
The late peak period is
The late peak period is
S104: setting the stop time of the train at each station as d n N belongs to S, and the running time of the interval is set as r n ，n∈S。
And S2, dividing Ping Gaofeng transition time periods based on the basic parameters, calculating departure intervals of the flat peak transition time periods, and continuing the flat peak time periods and the flat peak transition time periods. The train operation diagram for each time slot is plotted according to the departure interval of each time slot (based on the basic parameters, the divided flat peak transition time slot and the adjusted flat peak time slot), as shown in fig. 2.
The basic parameters of the configuration only include flat peak periods, while the flat peak periods are not directly connected, for example, there are multiple time periods between the early flat peak and the early peak, which are called transition periods between the flat peaks, and the parameters of the time periods need to be configured progressively.
The method for dividing the average peak transition period and calculating the departure interval in each period comprises the following steps: generating transition time periods from peak time periods to the front and the back respectively at preset time intervals, and the departure interval of each transition time period is from H high To H low Increasing time interval by time interval (forward transition time interval direction forward, backward transition time interval direction backward) until and low and are equal. The specific process comprises the following steps:
s201: based on early peak-off period
Early peak hours
And departure interval H of high peak-off period high And H low Starting from the early peak by 30min (configurable, same applies later)
Generating forward transition periods, each transition period having departure intervals from H (forward, backward, same principle) high To H low Increment by period until sum H low Equal, in chronological order, the time intervals are obtained in sequence
And departure interval H of each time period 1 tp1 ……H 1 tpi . Obtaining parameters of other transition periods in the same way: early peak based period
Time interval of noon-mean peak
And a departure interval H of Gao Pingfeng high And H low From the early peak to the end of the 30min unit
Generating transition time periods backwards, wherein the departure interval of each transition time period is from H high To H low Increment by period until sum H low Equal, in chronological order, the time intervals are obtained in sequence
And departure interval H of each time period 2 tp1 ……H 2 tpi . Time period based on noon and average peak
Late peak hours
And departure interval H of high peak-off period high And H low Starting from late peak by 30min
Generating transition periods forwards, wherein the departure interval of each transition period is from H high To H low Increment by period until sum H low Equal, in chronological order, the time intervals are obtained in sequence
And departure interval H of each time period 3 tp1 ……H 3 tpi . Late peak based period
Time interval of late peak
And departure interval H of high peak-off period high And H low 30min as unit, from late peak ending time
Generating transition time periods backwards, wherein the departure interval of each transition time period is from H high To H low Increment up to and H low Equal, in chronological order, the time intervals are obtained in sequence
And departure interval H of each time period 4 tp1 ……H 4 tpi . Generally, the time periods between the flat peaks are the same in length, so the number of the divided time periods of each time period is also the same, if there is a difference between the flat peaks, the divided time periods are correspondingly increased, and the departure intervals of the time periods in the time period are correspondingly adjusted.
The method for continuing the flat peak period comprises the following steps:
s202: the start time and/or end time of each flat peak period is modified such that the start time of the flat peak period is subsequent to the end time of the newly generated latest transition period after the end of the preceding peak period (if any) and such that the end time of the flat peak period is subsequent to the start time of the earliest transition period generated forward of the following peak period (if any). Namely, the front and the back of the peak-flattening time interval in the middle are continued to the peak-flattening transition time interval, the front peak-flattening time interval is continued to the peak-flattening transition time interval backwards, and the back peak-flattening time interval is continued to the peak-flattening transition time interval forwards.
The method also comprises the following steps of sequentially calculating departure time and arrival time of the train (running line) at each station from the starting station:
s203: and calculating departure time and arrival time of the train at the departure station based on each time period and the corresponding departure interval.
The arrival time of the train at the origin station 1 is recorded
Departure time is recorded as
And satisfies the following conditions:
wherein
The arrival time of the previous train at the starting station 1, H is the departure interval of the departure time period of the train, d 1 The stop time of the train at the station 1.
According to the data and the basic parameters configured in the step S1, the departure time and arrival time of the train at each station can be sequentially calculated, that is, the following steps are performed:
s204: sequentially calculating the arrival time of the train at other stations i, i ∈ S (recorded as the time of arrival and departure of the train at the starting station) based on the arrival time and departure time of the train at the starting station
) And departure time (note as
) And satisfy
Wherein
Indicating departure time, r, of the train at the previous stop i Denotes the operating time of the interval i, d i Indicating the stop time for station i.
With the parameters, the train operation diagram in each time interval can be drawn.
And S3, based on the train operation diagram of each time interval, fixing the downlink (or uplink) operation line, adjusting the uplink (or downlink) operation line, and compiling an operation line connection scheme in each time interval by taking the shortest connection time as a target.
Taking the operation line of the side which is not fixed with the train sending out the train section as an example, the method for compiling the train operation line connection scheme comprises the following steps:
s301: and traversing each time interval, fixing the running line of one side without the train section sending the train, and continuously translating the time of the running line in the other direction backwards in a preset time unit to generate an alternative train bottom connection relation. For example, with 5s (adjustable) as a unit, the time of the running line in the other direction is continuously translated backwards for 30min (adjustable time), and 360 running line connection schemes containing the connection relation of the vehicle bottom are generated. So-called translation, i.e. moving all the time of the travel line (e.g. arrival time, departure time, etc.) backwards for a certain time (e.g. 5s as described above).
S302: in the generated train bottom connection relation, the running line of the optimal translation scheme is found by taking the minimum number of turn-back conflicts and the minimum turn-back time as targets, and the fixed running line is connected to generate a train running chart in the time period.
The minimum number of foldback conflicts and the minimum foldback time are understood as follows: firstly, selecting the running line connection scheme with the minimum number of turn-back conflicts from alternative vehicle bottom connection relations, and on the basis, selecting the running line connection scheme with the minimum turn-back time.
By the method, the connection scheme of the uplink and downlink operation lines in each time interval can be obtained, and the result is shown in fig. 3.
And S4, based on the train operation diagram in each time interval and the operation line connection scheme in each time interval, sequentially compiling the operation line connection schemes in different time intervals according to time by taking the train connection with the least number of pairs and uniform train operation lines in adjacent time intervals as targets.
The method comprises the following steps:
s401: based on the train operation diagram and the connection relation/scheme thereof in each time interval, all the time intervals of the whole day are sorted according to time, every two adjacent time intervals form a set, and a pairwise time interval set is obtained
S402: and traversing the time period set, respectively judging the number of the running lines of the set element 0 and the set element 1 which are on-line or off-line at the time period connection position (namely the number of the final running lines of the set element 0 and the number of the initial running lines of the set element 1), and taking the set element with smaller number of the running lines in the two elements as a reference element.
S403: traversing the running line in the reference element, according to the last (or first, set element 0 is the reference element and is the last, or vice versa, set element 1 is the reference element and is the first) stop station track and time of the running line i (the current running line, namely the currently traversed running line, each running line traverses, the same will be described later), searching for the stop station track and the stop station track which meet the minimum turn-back time and the maximum turn-back time of another element in the same set respectively
And
(i.e., minimum and maximum turnaround times configured in the basic parameters) and (from there) selecting the run with the minimum turnaround time (which is in another element) to continue the run line i.
Through the steps, the connection scheme of the minimum connection time between the adjacent time periods can be obtained, and further, the train operation diagram of the whole operation time period is obtained, and the result is shown in fig. 4.
The steps are used for compiling an inter-station passing scheme, a turn-back connection scheme and an inter-period connection scheme of the train running lines in each period. The method also the method comprises the following steps:
and S5, based on the train operation diagram of each time interval, aiming at the train operation line needing to enter and exit the section, a section entering and exiting scheme of the train operation line is compiled.
The method comprises the following steps:
s501: traversing the whole-antenna operation line, aiming at the operation line i (referring to the operation line without the preamble) (i.e. the operation line without the connection in the front, such as the operation line started by a part of the initial station or the intermediate station), obtaining the outbound scheme of the operation line i according to the form of the operation line, the position of the vehicle section and the switching track at the first stop station and the arrival time, and all the outbound schemes of the operation line i form the outbound scheme set O of the operation line i i As an alternative. The method is characterized in that a plurality of alternative segmentation schemes need to be generated, and the segmentation schemes, particularly the segmentation schemes, are generated according to the parametersIs not particularly limited.
S502: similar to S501, traversing the all-day operation line, and for the operation lines j without the subsequent sequence (refer to those operation lines without the subsequent sequence), obtaining the entering schemes of the operation lines j according to the time of the operation lines at the last stop station and arrival time, the position of the vehicle segment, and the form of the transfer track, where the entering schemes of all the operation lines j form the entering scheme set I of the operation lines j j And (4) alternative.
S503: aiming at all the in-out section operation lines, aiming at minimizing the conflict with the return operation, and corresponding out-section scheme set O i And section scheme set I j The entrance and exit section scheme of the operation line is selected.
The entering and exiting section scheme of each operation line of the whole day can be obtained through the steps, and the result of part of the operation time period is shown in fig. 5.
In the above-described programmed operation line plan, some operation line conflicts may occur, and for this reason, a plan for resolving conflicts needs to be programmed. The method further comprises the following steps:
and S6, judging whether conflicts exist among the operation lines or not based on the train operation diagrams and the entering and exiting section schemes at all time intervals, and if yes, resolving the conflicts.
The method comprises the steps of firstly traversing all-day operation lines on the basis of a compiled train operation diagram and an in-out section scheme in each time period, listing feasible inbound time and outbound time of the operation lines at each turn-back station (according to basic parameters), and then determining the arrival time and departure time of the operation lines at each turn-back station by taking the fact that the operation lines do not conflict with the train operation lines passing through the turn-back station as a target.
Specifically, the step of determining whether or not there is a collision at the return station based on the train diagram, the route connection relationship, and the entering/exiting pattern, and if so, correcting the collision includes:
s601: based on the train operation diagram, the connection relation c between the station of the turn-back entering section and the operation line ij Establishing a mediation network for all the operation lines passing through the station, and the concrete steps comprise:
s602: if the vehicle bottom l is used as a descending running line i (traversed)At present, each operation line will traverse to the operation line j (the operation line for finger connection) connected to the up-line at the station k (k belongs to S), and then the connection relationship between the operation lines can be expressed as
The arrival time of the operation line i at the station k is
The departure time of the operation line i at the station k is
The arrival time of the operation line j at the station k is
The departure time of the operation line j at the station k is
If the car bottom l is used as the exit or entrance section to connect the running line i at the station k, the connection relationship between the running lines can be expressed as
S603: for the relation of turn-back connection
The minimum station-stopping time and the maximum station-stopping time of the operation line i at the station k are respectively
And
wherein
For parameter setting, and
satisfy the requirement of
Stop time at station k for operation line i
At the time of arrival
On the basis, 1s (adjustable, the same below) is taken as a unit, feasible departure time of the operation line i at the station k is respectively calculated, and a departure time set of the operation line i at the station k is established
The arrival time of the operation line i at the station k
And set of departure times
Each element in (a) establishes a connection relationship.
Stop time at station k for travel line j is
At the departure time
On the basis, the feasible arrival time of the operation line j at the station k is respectively calculated by taking 1s as a unit, and the arrival time set of the operation line j at the station k is established
Collecting the arrival time of the operation line j at the station k
In (1)Each element and departure time
And establishing a connection relation.
The departure time of the operation line i at the station k is collected
The arrival time set of each element and the operation line j at the station k
Each element in the system establishes a connection relation according to the turn-back time requirement.
S604: for out-of-segment or in-segment continuation relation
The stop time of the operation line i at the station k is
Wherein
And
for parameter specification, departure time of fixed operating line i at station k
Time of stopping according to running line
Departure time on the line of travel
On the basis, 1s is taken as a unit, feasible arrival time of the operation line i at the station k is respectively calculated, and an arrival time set of the operation line i at the station k is established
And establish a set of arrival times
Each element in and departure time
The connection relationship of (1). Traversal of a set of arrival times
Calculating the departure time of the vehicle section according to the travel time of the operation line i between the station k and the vehicle section, and establishing a departure time set of the operation line i in the vehicle section
And establish a set of departure times
Each element in (1) and arrival time set
The connection relationship of each element in (1).
S605: and establishing a connection relation between the arrival time and the departure time of the operation line i at the station k according to the arrival time and the departure time of the operation line i for the operation line i passing through the station k.
S606: and based on the time sets and the connection relations of the various operation lines, occupying the arrival time and the departure time of the operation line passing through the station k at the station k (if the station-stopping time is also determined), sequencing the operation lines according to the arrival time in the train operation diagram, and sequentially calculating the arrival time and the departure time (or the station-stopping time) of each operation line at the station k by taking the station-stopping time (or other targets) as a target, namely determining a connection relation from the connection relations established in the previous steps. The partial time collision resolution results are shown in fig. 6.
Example two
The embodiment discloses an automatic urban rail train working diagram compiling system facing a large-small traffic mode, wherein related parameters are defined or explained in the same way as the first embodiment. The system comprises a processor and a computer-readable storage medium, wherein a computer program is configured in the computer-readable storage medium, and the processor runs the computer program to execute the automatic urban rail train working diagram compiling method facing the large-small traffic route mode.
Specifically, the system comprises a parameter configuration unit, a transition period planning unit, an intra-segment continuous planning unit, an inter-segment continuous planning unit, an in-out segment planning unit and a conflict relief unit, wherein:
the parameter configuration unit is configured to: basic parameters of the configuration are received, wherein the basic parameters comprise flat peak time and departure intervals of the flat peak time. Further, the basic parameters also include station set, minimum and maximum retrace times of the retrace station, stop time of each station, and section operation time. The unit receives the configuration of the basic parameters according to one embodiment, steps S101-S104.
A transition period planning unit connected to the parameter configuration unit configured to: dividing a flat peak transition time period based on the basic parameters, calculating the departure interval of the flat peak transition time period, continuing the flat peak time period and the flat peak transition time period, and drawing a train operation diagram of each time period. In some embodiments, the unit generates transition periods from peak periods forward and backward, respectively, based on the configured time interval, the departure interval of each transition period being from H high To H low Increment by period (forward transition period direction forward, backward transition period direction backward) until sum H low Are equal. The unit performs steps S201-S204 in the first embodiment to complete the configuration task.
The intra-segment continuation planning unit is connected with the transition period planning unit and is configured to: and fixing one operation line and adjusting the other operation line based on the train operation diagram of each time interval, and compiling an operation line connection scheme in each time interval by taking the shortest connection time as a target. An embodiment of the intra-segment continuation plan unit operation is, for example, the actions of steps S301-S302 in embodiment one.
An inter-segment continuation planning unit connects intra-segment continuation planning units configured to: based on the train operation diagram in each time interval and the operation line connection scheme in each time interval, the operation line connection schemes in different time intervals are sequentially compiled according to time by taking the train connection with the least number of pairs and the uniform train operation lines in the adjacent time intervals as targets. The implementation of the operation is the actions of steps S401-S403 in embodiment one.
An entrance/exit section planning unit connects the inter-section continuation planning units, and is configured to: and based on the train operation diagram of each time interval, aiming at the train operation line needing to enter and exit the section, a section entering and exiting scheme of the train operation line is compiled. The embodiment in which the unit operates is the actions of steps S501-S503 of one embodiment.
The conflict relief unit is connected with the access planning unit and is configured to: and judging whether conflicts exist between the operation lines or not based on the train operation diagrams and the entering and exiting section schemes at all time intervals, and if yes, resolving the conflicts.
The unit traverses the whole-antenna operation line on the basis of the compiled train operation diagram and the entering and exiting scheme of each time period, and lists the feasible entering time and exiting time of the operation line at each station (according to basic parameters); the arrival time and departure time of the operation line at each station are determined by taking the non-conflict with the train operation line passing through the station as a target. Specifically, the unit performs the actions of steps S601 to S606 in the first embodiment to complete the above configured task.
The invention is not limited to the foregoing embodiments. The invention extends to any novel feature or any novel combination of features disclosed in this specification, and to any novel method or process steps or any novel combination of steps disclosed.
Claims (10)
1. An automatic urban rail train running chart compiling method facing a large and small road crossing mode is characterized by comprising the following steps:
s1, configuring basic parameters compiled by a train operation diagram, wherein the basic parameters comprise a flat peak time period and an departure interval of the flat peak time period;
s2, dividing a flat peak transition period based on the basic parameters, calculating departure intervals of the flat peak transition period, continuing the flat peak transition period and the flat peak transition period, and drawing a train operation diagram of each period;
s3, fixing one running line based on the train running chart of each time interval, adjusting the other running line, and compiling a running line connection scheme in each time interval by taking the shortest connection time as a target;
s4, based on the train operation diagram in each time interval and the operation line connection scheme in each time interval, sequentially compiling operation line connection schemes in different time intervals according to time by taking the train connection with the least number of pairs and uniform train operation lines in adjacent time intervals as targets;
s5, based on the train operation diagram of each time period, aiming at the train operation line needing to enter and exit the section, a section entering and exiting scheme of the train operation line is compiled;
and S6, judging whether conflicts exist among the operation lines or not based on the train operation diagrams and the entering and exiting section schemes at all time intervals, and if yes, resolving the conflicts.
2. The method of automatically constructing an urban rail train running chart oriented to large-small traffic patterns according to claim 1, wherein said basic parameters further include station set, minimum and maximum turn-back times of turn-back stations, stop times of each station, and section running time.
3. The method for automatically compiling an urban rail train running chart facing a large-small traffic pattern according to claim 1, wherein the dividing of the flat peak transition period based on the basic parameters and the calculation of the departure interval of the flat peak transition period comprise:
transition time intervals are generated from the peak time intervals forwards and backwards respectively at preset time intervals, and the departure intervals of the transition time intervals are increased from the departure intervals of the peak time intervals to the departure intervals of the peak-balancing time intervals in a time-sharing mode until the departure intervals of the peak-balancing time intervals are equal.
4. The method for automatically compiling an urban rail train working diagram facing a large-small traffic pattern as claimed in claim 3, wherein in the step S2, the step of drawing the train working diagram of each time period comprises the following steps:
calculating departure time and arrival time of the train at the starting station based on each time period and the corresponding departure interval;
sequentially calculating the arrival time and departure time of the train at other trains based on the arrival time and departure time of the train at the starting station;
and drawing a train operation diagram in each time interval according to the arrival time and departure time of the train at each station.
5. The method for automatically compiling an urban rail train working diagram facing a large-small traffic pattern according to claim 1, wherein the step S3 comprises:
s301: traversing each time interval, fixing the running line of one side without the train section sending out the train, and continuously translating the time of the running line of the other side backwards in a preset time unit to generate the connection relation of the train bottom;
s302: and finding the running line with the minimum number of turn-back conflicts and the minimum turn-back time in the generated train bottom connection relation, connecting the running line with a fixed running line, and generating a train running chart in the period.
6. The method as claimed in claim 5, wherein in step S301, the time of moving the moving line in the other direction is continuously translated backwards in a predetermined time unit, and the total time of the translation is a predetermined time.
7. The method for automatically compiling an urban rail train working diagram facing a large-small traffic pattern according to claim 3, wherein the step S4 comprises:
sequencing all time periods of the whole day according to time, and forming a set by every two adjacent time periods to obtain a time period set of every two time periods;
traversing the time period set, respectively judging the number of the running lines of the two elements which are on-line in the time period, and taking the set element with smaller number of the running lines in the two elements as a reference element;
and traversing the running line in the reference element, searching the running line meeting the minimum turn-back time and the maximum turn-back time in the basic parameters in another element in the same set according to the last/first stop station track and the time of the current running line, and selecting the running line with the minimum connection time to connect the current running line.
8. The method for automatically compiling an urban rail train working diagram facing a large-small traffic pattern according to claim 1, wherein the step S5 comprises:
traversing the all-antenna operation line, and aiming at the operation line without a preamble, obtaining the exit scheme of the operation line according to the first stop station and arrival time of the operation line, the position of the vehicle section and the form of the switching track, wherein the exit schemes of all the operation lines form an exit scheme set of the operation line;
traversing the all-antenna operation line, and aiming at the operation line without the subsequent sequence, obtaining the entering scheme of the operation line according to the last stop station and the arrival time of the operation line, the position of the vehicle section and the form of the switching track, wherein the entering schemes of all the operation lines form the entering scheme set of the operation line;
and aiming at all the entry and exit section operation lines, selecting an entry and exit section scheme of the operation line from the corresponding exit section scheme set and entry section scheme set by taking the minimum conflict with the return operation as a target.
9. The method for automatically compiling an urban rail train working diagram facing a large-small traffic pattern according to claim 2, wherein the step S6 comprises:
on the basis of the compiled train operation diagram and the entering and exiting section scheme of each time period, the all-day operation line is traversed, the feasible entering time and exiting time of the operation line at each turn-back station are listed, and then the arrival time and departure time of the operation line at each turn-back station are determined by taking the fact that the operation line does not conflict with the train operation line passing through the turn-back station as a target.
10. An automatic urban rail train working diagram compiling system facing a large-small traffic route mode is characterized by comprising a processor and a computer readable storage medium, wherein a computer program is configured in the computer readable storage medium, and the processor runs the computer program to execute the automatic urban rail train working diagram compiling method facing the large-small traffic route mode according to any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211695820.8A CN115817588A (en) | 2022-12-28 | 2022-12-28 | Automatic urban rail train running chart compiling method and system for large and small traffic mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211695820.8A CN115817588A (en) | 2022-12-28 | 2022-12-28 | Automatic urban rail train running chart compiling method and system for large and small traffic mode |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115817588A true CN115817588A (en) | 2023-03-21 |
Family
ID=85518872
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211695820.8A Pending CN115817588A (en) | 2022-12-28 | 2022-12-28 | Automatic urban rail train running chart compiling method and system for large and small traffic mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115817588A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117273393A (en) * | 2023-11-16 | 2023-12-22 | 北京城建智控科技股份有限公司 | Dynamic adjustment method and device for vehicle running chart and electronic equipment |
-
2022
- 2022-12-28 CN CN202211695820.8A patent/CN115817588A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117273393A (en) * | 2023-11-16 | 2023-12-22 | 北京城建智控科技股份有限公司 | Dynamic adjustment method and device for vehicle running chart and electronic equipment |
| CN117273393B (en) * | 2023-11-16 | 2024-04-26 | 北京城建智控科技股份有限公司 | Dynamic adjustment method and device for vehicle running chart and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kang et al. | A case study on the coordination of last trains for the Beijing subway network | |
| AU2003300354B2 (en) | Dynamic optimizing traffic planning method and system | |
| CN109447340B (en) | Method for optimizing customized bus route with shortest reliability | |
| CN114312926B (en) | Method and system for optimizing operation adjustment scheme of urban rail transit train | |
| CN112977555B (en) | Ad-hoc network-based train group high-efficiency dispatching system and method | |
| CN105678425B (en) | Inter-city railway train operation optimization method based on multi-beat combination | |
| CN114179873B (en) | Multi-road multi-time-interval all-day train operation diagram automatic compilation method and system | |
| CN113919650A (en) | Train operation scheme optimization compilation method and system | |
| CN115817588A (en) | Automatic urban rail train running chart compiling method and system for large and small traffic mode | |
| Badia et al. | Feeder transit services in different development stages of automated buses: Comparing fixed routes versus door-to-door trips | |
| CN110738364A (en) | electric automobile charging navigation information interaction platform | |
| CN112373521A (en) | Automatic compiling, detecting and adjusting system and method for multi-line and multi-intersection train timetable | |
| Yang et al. | Train scheduling for minimizing the total travel time with a skip-stop operation in urban rail transit | |
| Malucelli et al. | Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study | |
| Peng et al. | A dynamic rescheduling and speed management approach for high-speed trains with uncertain time-delay | |
| Estrada et al. | Operation of transit corridors served by two routes: Physical design, synchronization, and control strategies | |
| KR101214567B1 (en) | Method and apparatus for establishing an operation schedule of trains | |
| CN112541265A (en) | Periodic and non-periodic combined high-speed rail operation diagram modeling method considering station stop adjustment | |
| CN117022398A (en) | Urban rail transit train schedule optimization method and system considering passenger flow distribution | |
| CN114655282B (en) | Train operation scheme optimization method and system | |
| CN116562538A (en) | Microcirculation public transportation scheduling optimization method and device considering rail transit connection | |
| CN113619655B (en) | Method and system for controlling train late point to propagate in road network based on operation diagram | |
| CN112781610B (en) | Unmanned bus route planning method in multi-passenger mode | |
| CN114537479A (en) | Motor train unit operation plan compiling method considering fluctuation within week of train running scheme | |
| CN113954926B (en) | Urban rail train operation diagram generation method and system for complex operation intersection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |