CN114611871A - Automatic compilation method and system for railway operation diagram - Google Patents
Automatic compilation method and system for railway operation diagram Download PDFInfo
- Publication number
- CN114611871A CN114611871A CN202210109930.5A CN202210109930A CN114611871A CN 114611871 A CN114611871 A CN 114611871A CN 202210109930 A CN202210109930 A CN 202210109930A CN 114611871 A CN114611871 A CN 114611871A
- Authority
- CN
- China
- Prior art keywords
- station
- time
- running
- calculating
- line
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000010586 diagram Methods 0.000 title claims abstract description 23
- 238000010276 construction Methods 0.000 claims description 33
- 238000009941 weaving Methods 0.000 claims description 6
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000009191 jumping Effects 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 230000000903 blocking effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06314—Calendaring for a resource
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biodiversity & Conservation Biology (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention relates to a railway operation diagram automatic compilation method and a system, wherein the method comprises the steps of obtaining and inputting target contents required by laying operation lines; sorting the running lines to be laid according to the priority; loading the running lines of different types of vehicles; circularly compiling the running line to be laid and drawn to finish the automatic compilation of the running chart; the system comprises an input unit, a display unit and a display unit, wherein the input unit is used for acquiring and inputting target contents required by paving a running line; the sorting unit is used for sorting the running lines to be laid according to the priority; the loading unit is used for loading running lines of different types of vehicles; and the compiling unit is used for circularly compiling the running line to be laid and drawn to finish the automatic compiling of the running chart. By adopting the scheme of the invention to compile the railway operation diagram, the rule is more and more complete, the applicability is stronger, and the conflict relief is more accurate.
Description
Technical Field
The invention belongs to the technical field of railway train operation, and particularly relates to an automatic compilation method and system of a railway operation diagram.
Background
The railway operation diagram specifies the arrival and departure time, the occupied station track and the occupied section of each station along the train, is the basis of the work of each department of the railway system, and is the important guarantee for the safe operation of the train. The operation diagram is compiled mainly in two modes, namely manual compilation and computer automatic compilation.
The existing railway operation diagram compiling method mainly has the following defects:
and (5) manual programming. When the scheduling is carried out manually, the content needing to be consulted/memorized by a dispatcher is more, the operation is complicated, and the workload is large. Risks are easily created due to problems with dispatcher competency levels. And (4) automatically programming. At present, an automatic working chart is mainly used for single section, and the working support of the working chart under the condition of a network type line is not good; the integrity and the accuracy of the compiled parameters are not enough, for example, the train departure and route conflict in the throat area of a station cannot be modeled; the automatic conflict detection and conflict dismissal functions are not perfect, for example, subsequent conflicts caused by conflict dismissal cannot be dismissed; the method has the advantages of poor universality and more limiting conditions, such as poor effect of a single-track railway operation diagram, incapability of automatically compiling when a section and a station are blocked, incapability of automatically compiling the limitation of the overrun condition, and the like.
In combination with the above-mentioned related technologies, it is necessary to provide a railway operation line compilation method with more and more complete compilation rules, stronger compilation method applicability, and more accurate conflict relief.
Disclosure of Invention
Aiming at the problems, the invention discloses a method and a system for automatically compiling a railway operation diagram.
In a first aspect, the invention discloses a method for automatically compiling a railway operation diagram, which comprises the following steps,
acquiring and inputting target content required by laying an operation line;
sorting the running lines to be laid according to the priority;
loading the running lines of different types of vehicles;
and circularly compiling the running line to be laid and drawn to finish the automatic compilation of the running chart.
Furthermore, the sorting of the running lines to be laid according to the priority specifically comprises: firstly, sequencing the running lines to be paved and drawn according to the attributes of the trains; a group of trains with the same train attribute are sorted according to the type of the starting station; a group of trains of the same train attribute and the same origin station type are sorted by earliest time of origin.
Furthermore, the running lines of different vehicle types comprise a passenger car running line, a road vehicle running line and a rail car running line; loading the passenger car operation line specifically comprises the steps of updating the starting time occupying each interval and the starting time occupying each station track into a resource pool, and setting the priority of the passenger car operation line to be the highest; loading the running lines of the road vehicles and the rail vehicles specifically comprises updating the starting time occupied in each interval and the starting time occupied in each station track into a resource pool, and setting the priority of the running lines of the road vehicles and the rail vehicles to be next highest.
Further, the method further comprises loading construction content data after loading the running lines of the vehicles of different types, and specifically comprises the steps of updating the starting time of the construction occupied interval and the starting time of the occupied station track to the resource pool, updating the starting time of the interval slow walking caused by the construction and the starting time of the station slow walking caused by the construction to the resource pool, and setting the priority of the construction content to be the third highest.
Furthermore, the circularly compiling the running line to be laid and drawn and finishing the automatic compiling of the running chart specifically comprise taking out a single running line of a head of a queue in a queue to be laid and drawn; weaving the taken single operating line; and if the queue is empty, finishing the compilation, otherwise, continuously taking out the single operating line of the head of the queue to be paved and drawn for compilation, and circularly compiling the single operating line until the compilation is finished.
Furthermore, the weaving single-strip operation line specifically comprises the following steps,
s1, according to the initial station and the final station, calculating to obtain the passing stations and the sequence of the operation line as the traveling path by the shortest path algorithm; s2, loading a rule basis for calculating the available time period, and circularly calculating each station in the walking path; s3, if all stations are calculated, ending; otherwise, executing the next step; s4, calculating a set A of reachable time periods of each train receiving interval reaching a station according to the resource pool occupation data; s5, calculating a set D of departure time periods of each departure interval of the station according to the resource pool occupation data; s6, calculating a set T of the time periods which can be occupied by each station track according to the resource pool occupation data; s7, calculating whether the set A and the set D have overlapped available time periods or not, if so, recording the passing time and the track, advancing and calculating the next station; if not, the product can not pass through and enters the next step; s8, calculating whether the set A, the set D and the set T have overlapped available time periods or not, if so, waiting for avoidance at a station, recording arrival time, departure time and occupied station tracks, advancing, and calculating the next station; if not, entering the next step; s9, calculating the earliest reachable time of the running line at the station of the vehicle according to the set A, D, T, backing up and entering the previous station; s10, calculating the earliest possible departure time of the last station, judging whether available tracks and departure time exist under the condition that the arrival time is not changed, if so, avoiding the last station, advancing, and jumping to the step S3; if not, the earliest reachable time of the previous station is calculated, and the previous station is entered by going back to step S3.
Further, the target content includes train number, origin station, terminal station, earliest origination time, and train attributes.
In another aspect, the present invention discloses an automatic railway map compiling system, which comprises,
the input unit is used for acquiring and inputting target contents required by paving and drawing the operation line;
the sorting unit is used for sorting the running lines to be laid according to the priority;
the loading unit is used for loading running lines of different types of vehicles;
and the compiling unit is used for circularly compiling the running line to be laid and drawn to finish the automatic compiling of the running chart.
Furthermore, the sorting unit specifically sorts the to-be-laid running lines according to priority, including: firstly, sequencing the running lines to be paved and drawn according to the attributes of the trains; a group of trains with the same train attribute are sorted according to the type of the starting station; a group of trains of the same train attribute and the same origin station type are sorted by earliest time of origin.
Furthermore, the running lines of the different types of vehicles comprise a passenger car running line, a road vehicle running line and a rail car running line;
the loading unit is used for loading the passenger car operation line and comprises the steps of updating the initial time occupied in each interval and the initial time occupied in each station track into a resource pool, and setting the priority of the passenger car operation line to be the highest; the loading unit is used for loading the running lines of the road vehicles and the running lines of the rail cars, and specifically comprises the steps of updating the starting time of occupying each interval and the starting time of occupying each track into a resource pool, and setting the priority of the running lines of the road vehicles and the rail cars to be next highest; the loading unit is further used for loading construction content data after loading the running lines of the vehicles of different types, and specifically comprises the steps of updating the starting time of the construction occupied interval and the starting time of the occupied station track into the resource pool, updating the starting time of the interval slow walking caused by the construction and the starting time of the station slow walking caused by the construction into the resource pool, and setting the priority of the construction content to be the third highest.
Furthermore, the compiling unit circularly compiles the running line to be laid and drawn, and the automatic compiling of the running chart specifically comprises the following steps: taking out a single running line of a head of a queue in a queue to be paved and drawn; weaving the taken single operating line; and if the queue is empty, the compilation is finished, otherwise, the single running line at the head of the queue in the queue to be paved and drawn is continuously taken out for compilation, and the single running line is compiled circularly until the compilation is finished.
Furthermore, the compiling unit compiles the single running line specifically comprises,
s1, according to the initial station and the final station, calculating to obtain the passing stations and the sequence of the operation line as the traveling path by the shortest path algorithm; s2, loading a rule basis for calculating the available time period, and circularly calculating each station in the walking path; s3, if all stations are calculated, ending; otherwise, executing the next step; s4, calculating a set A of reachable time periods of each train receiving interval reaching a station according to the resource pool occupation data; s5, calculating a set D of departure time periods of each departure interval of the station according to the resource pool occupation data; s6, calculating a set T of the time periods which can be occupied by each station track according to the resource pool occupation data; s7, calculating whether the set A and the set D have overlapped available time periods or not, if so, recording the passing time and the track, advancing and calculating the next station; if not, the product can not pass through and enters the next step; s8, calculating whether the set A, the set D and the set T have overlapped available time periods or not, if so, waiting for avoidance at a station, recording arrival time, departure time and occupied station tracks, advancing, and calculating the next station; if not, entering the next step; s9, calculating the earliest reachable time of the running line at the station of the vehicle according to the set A, D, T, backing up and entering the previous station; s10, calculating the earliest possible departure time of the last station, judging whether available tracks and departure time exist under the condition that the arrival time is not changed, if so, avoiding the last station, advancing, and jumping to the step S4; if not, the earliest reachable time of the previous station is calculated, and the previous station is entered by going back to step S3.
The present invention has at least the following effects,
the method of the scheme is adopted to compile the railway operation diagram, the rules are more and more complete, the applicability is stronger, and the conflict relief is more accurate.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 shows a flowchart of a railway map preparation method in the embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the application discloses an automatic compilation system of a railway operation diagram, which comprises an input unit, a display unit and a control unit, wherein the input unit is used for acquiring and inputting target contents required by laying operation lines; the sorting unit is used for sorting the running lines to be laid according to the priority; the loading unit is used for loading the running lines of different types of vehicles and loading construction content data; and the compiling unit is used for circularly compiling the running line to be laid and drawn to finish the automatic compiling of the running chart.
The embodiment of the application also discloses an automatic compilation method of the railway operation diagram, and the method is introduced with reference to fig. 1.
Referring to fig. 1, a flowchart of a method for compiling a railway operation diagram in the embodiment of the present application is shown, where the method includes the following steps:
step one, an input unit acquires and inputs target content required by paving a running line.
And laying a running line for compiling a running chart, wherein the required target content mainly comprises train number, an initial station, a final station, the earliest starting time and train attributes. The train attribute mainly refers to attribute classification of the train, and the train attribute is acquired to know which train belongs to a key train, a through train, a pick-up train, a small running train and the like.
And step two, the sequencing unit sequences the running lines to be laid according to the priority.
The sorting process of this step mainly includes the following processes,
firstly, the operation line to be laid is sorted according to the attributes of the trains, and when the operation line is sorted, the operation line is sorted according to the attributes of the trains such as key trains, through trains, pick-and-place trains, small running trains and the like.
Then, a group of trains with the same train attribute are sorted according to the type of the starting station, and sorted according to the priority order of the marshalling station, the section station and the intermediate station.
Thereafter, a group of trains of the same train attributes and of the same origin station type are sorted by the earliest time of origin. And finally, sequentially putting the sequenced running lines to be paved and drawn into a queue to be paved and drawn.
And step three, loading the running lines of different types of vehicles and loading construction content data by the loading unit.
The running lines of different types of vehicles include passenger car running lines, road car running lines and rail car running lines.
The loading operation line needs to load the contents including train number, route station, arrival and departure time of each station, occupied station track, occupied interval and the like. And loading construction contents, namely loading contents including a blocking section, a blocking station, a slow-speed section, a slow-speed station and the like.
Specifically, loading the passenger car operation line means updating the start time occupied by each interval and the start time occupied by each station track into the resource pool, and setting the priority of the passenger car operation line to be the highest.
Loading the road vehicle running lines and the rail vehicle running lines specifically means that the starting time of occupying each section and the starting time of occupying each track are updated to the resource pool, and the priority of the road vehicle and the rail vehicle running lines is set to be next highest.
The construction content data are required to be loaded after the operation lines of the vehicles of different types are loaded, specifically, the starting time of an interval occupied by construction and the starting time of a station occupied by the construction are updated into a resource pool, the starting time of the interval slow walking caused by the construction and the starting time of the station slow walking caused by the construction are updated into the resource pool, and the priority of construction content is set to be the third highest.
And step four, the compiling unit circularly compiles the operation line to be laid, traverses the operation line to be laid, and disambiguates conflicts of the single operation line to finish the automatic compiling of the operation chart.
The steps specifically comprise the steps of,
taking out a single running line of a head of a queue in a queue to be paved and drawn; weaving the taken single operating line;
and if the queue is empty, the compilation is finished, otherwise, the single running line at the head of the queue in the queue to be paved and drawn is continuously taken out for compilation, and the single running line is compiled circularly until the compilation is finished.
Referring to fig. 1, the content of compiling a single operation line in step four specifically includes the following steps:
s1, according to the initial station and the final station, calculating to obtain the station and sequence of the running line as the running path by a shortest path algorithm (generally, the method is used for calculating the shortest path from one node to all other nodes, and is mainly characterized in that the starting point is used as the center to expand outwards layer by layer until the end point is expanded);
s2, loading a rule basis for calculating the available time period, and circularly calculating each station in the walking path;
wherein, the rule basis for calculating the available time period mentioned in this step mainly includes: the train control system comprises different arrival interval time, meeting interval time, train continuous transmission interval time in the same direction, train continuous transmission interval time in the opposite direction, train continuous channel interval time in the opposite direction, single-line section driving rules, semi-automatic block section driving rules, automatic block section minimum tracking intervals, route crossing rules and construction driving rules. The above contents are loaded to serve as a rule basis for calculating the available time period in the method.
S3, if all stations are calculated, ending; otherwise, executing the next step;
s4, calculating a set A of reachable time periods of each train receiving interval reaching a station according to the resource pool occupation data;
s5, calculating a set D of departure time periods of each departure interval of the station according to the resource pool occupation data;
s6, calculating a set T of the time periods which can be occupied by each station track according to the resource pool occupation data;
s7, calculating whether the set A and the set D have overlapped available time periods or not, if so, recording the passing time and the track, advancing and calculating the next station; if not, the product can not pass through and enters the next step;
s8, calculating whether the set A, the set D and the set T have overlapped available time periods or not, if so, waiting for avoidance at a station, recording arrival time, departure time and occupied station tracks, advancing, and calculating the next station; if not, entering the next step;
s9, calculating the earliest reachable time of the running line at the station of the vehicle according to the set A, D, T, backing up and entering the previous station;
s10, calculating the earliest possible departure time of the last station, judging whether available tracks and departure time exist under the condition that the arrival time is not changed, if so, avoiding the last station, advancing, and jumping to the step S3; if not, the earliest reachable time of the previous station is calculated, and the previous station is entered by going back to step S3.
And (4) finishing the calculation process through the cyclic calculation of the steps until each station in the walking path is calculated, thereby finishing the compiling of the single operation line. The railway operation diagram is compiled by compiling each single operation line.
By adopting the technical scheme, the method uniformly considers the attributes of single and double railway lines of the railway, the type of block of the section, the different arrival interval time, the meeting interval time, the different arrival interval time of trains in the same direction, the continuous transmission interval time of trains in the same direction, the different passing interval time minimum tracking interval time of trains in opposite directions, the construction plan running rule and the like, can adapt to the conditions of single-line railway, double-line railway, single and double-line railway, railway network and construction blockade when being compiled, and has stronger applicability. Because the interval running time and various time parameters are calculated in a computer mode, conflict relief is more accurate according to the occupation condition of the resource pool.
Although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (13)
1. A method for automatically compiling a railway operation diagram, which is characterized by comprising the following steps,
acquiring and inputting target content required by laying an operation line;
sorting the running lines to be laid according to the priority;
loading running lines of different types of vehicles;
and circularly compiling the running line to be laid and drawn to finish the automatic compilation of the running chart.
2. The method for automatically compiling the railway operation diagram according to claim 1, wherein the sorting of the operation lines to be laid according to the priority comprises the following steps:
firstly, sequencing the running lines to be paved and drawn according to the attributes of the trains;
a group of trains with the same train attribute are sorted according to the type of the starting station;
a group of trains of the same train attribute and the same origin station type are sorted by earliest time of origin.
3. The automatic compilation method of a railway map of claim 1, wherein the travel lines of different vehicle types include a passenger train travel line, a road car travel line and a rail car travel line;
loading the passenger car operation line specifically comprises the steps of updating the starting time occupied in each interval and the starting time occupied in each station track into a resource pool, and setting the priority of the passenger car operation line to be the highest;
loading the running lines of the road vehicles and the rail vehicles specifically comprises updating the starting time occupied in each interval and the starting time occupied in each station track into a resource pool, and setting the priority of the running lines of the road vehicles and the rail vehicles to be next highest.
4. The method for automatically constructing a railway operation map according to claim 1 or 3, wherein the method further comprises, after the loading of the operation lines of the vehicles of different types, loading construction content data, specifically comprising,
updating the starting time of the construction occupied interval and the starting time of the occupied station track into the resource pool, updating the starting time of the interval slow walking caused by the construction and the starting time of the station slow walking caused by the construction into the resource pool, and setting the priority of the construction content to be the third highest.
5. The method for automatically compiling a railway operation diagram according to claim 1, wherein the circularly compiling the operation line to be laid comprises,
taking out a single running line of a head of a queue in a queue to be paved and drawn;
weaving the taken single operating line;
and if the queue is empty, the compilation is finished, otherwise, the single running line at the head of the queue in the queue to be paved and drawn is continuously taken out for compilation, and the single running line is compiled circularly until the compilation is finished.
6. The automatic compilation method of a railway operation map according to claim 5, characterized in that the compilation of a single operation line comprises the following steps,
s1, according to the initial station and the final station, calculating to obtain the passing stations and the sequence of the operation line as the traveling path by the shortest path algorithm;
s2, loading a rule basis for calculating the available time period, and circularly calculating each station in the walking path;
s3, if all stations are calculated, ending; otherwise, executing the next step;
s4, calculating a set A of reachable time periods of each train receiving interval reaching a station according to the resource pool occupation data;
s5, calculating a set D of departure time periods of each departure interval of the station according to the resource pool occupation data;
s6, calculating a set T of the time periods which can be occupied by each station track according to the resource pool occupation data;
s7, calculating whether the set A and the set D have overlapped available time periods or not, if so, recording the passing time and the track, advancing and calculating the next station; if not, the product can not pass through and enters the next step;
s8, calculating whether the set A, the set D and the set T have overlapped available time periods or not, if yes, waiting for avoidance at a station, recording arrival time, departure time and occupied station tracks, advancing, and calculating the next station; if not, entering the next step;
s9, calculating the earliest reachable time of the running line at the station of the vehicle according to the set A, D, T, backing up and entering the previous station;
s10, calculating the earliest possible departure time of the last station, judging whether available tracks and departure time exist under the condition that the arrival time is not changed, if so, avoiding the last station, advancing, and jumping to the step S3; if not, the earliest reachable time of the previous station is calculated, and the previous station is entered by going back to step S3.
7. The method of claim 6, wherein the rules for calculating the available time period are based on the following rules: the train control system comprises different arrival interval time, meeting interval time, train continuous transmission interval time in the same direction, train continuous transmission interval time in the opposite direction, train continuous channel interval time in the opposite direction, single-line section driving rules, semi-automatic block section driving rules, automatic block section minimum tracking intervals, route crossing rules and construction driving rules.
8. The automatic railway running diagram compiling method according to claim 1 or 2, wherein the target contents comprise train number, starting station, ending station, earliest starting time and train attributes.
9. An automatic compilation system for a railway operation map, characterized in that the system comprises,
the input unit is used for acquiring and inputting target contents required by paving and drawing the operation line;
the sorting unit is used for sorting the running lines to be laid according to the priority;
the loading unit is used for loading running lines of different types of vehicles;
and the compiling unit is used for circularly compiling the running line to be laid and drawn to finish the automatic compiling of the running chart.
10. The automatic railway operation diagram compiling system according to claim 9, wherein the sorting unit sorts the operation lines to be laid according to priority, and specifically comprises:
firstly, sequencing the running lines to be paved and drawn according to the attributes of the trains;
a group of trains with the same train attribute are sorted according to the type of the starting station;
a group of trains of the same train attribute and the same origin station type are sorted by earliest time of origin.
11. A railway map automatic compilation system according to claim 9 or 10, wherein the running lines of the different types of vehicles include passenger car running lines, road car running lines and rail car running lines;
the loading unit is used for loading the passenger car operation line and comprises the steps of updating the initial time occupied in each interval and the initial time occupied in each station track into a resource pool, and setting the priority of the passenger car operation line to be the highest;
the loading unit is used for loading the running lines of the road vehicles and the rail vehicles and specifically comprises the steps of updating the starting time of occupying each interval and the starting time of occupying each station track into a resource pool, and setting the priority of the running lines of the road vehicles and the rail vehicles to be next highest;
the loading unit is also used for loading construction content data after loading the running lines of different types of vehicles, and specifically comprises,
updating the starting time of the construction occupied interval and the starting time of the occupied station track into the resource pool, updating the starting time of the interval slow walking caused by the construction and the starting time of the station slow walking caused by the construction into the resource pool, and setting the priority of the construction content to be the third highest.
12. The automatic compilation system of a railway working diagram according to claim 9, wherein the compilation unit compiles a working line to be laid in a circulating manner, and the automatic compilation of the working diagram specifically comprises:
taking out a single running line of a head of a queue in a queue to be paved and drawn;
weaving the taken single operating line;
and if the queue is empty, finishing the compilation, otherwise, continuously taking out the single operating line of the head of the queue to be paved and drawn for compilation, and circularly compiling the single operating line until the compilation is finished.
13. The automatic compilation system of a railroad map according to claim 12, wherein the compilation unit compiles the single run line, specifically comprising,
s1, according to the initial station and the final station, calculating to obtain the passing stations and the sequence of the operation line as the traveling path by the shortest path algorithm;
s2, loading a rule basis for calculating the available time period, and circularly calculating each station in the walking path;
s3, if all stations are calculated, ending; otherwise, executing the next step;
s4, calculating a set A of reachable time periods of each train receiving interval reaching a station according to the resource pool occupation data;
s5, calculating a set D of departure time periods of each departure interval of the station according to the resource pool occupation data;
s6, calculating a set T of the time periods which can be occupied by each station track according to the resource pool occupation data;
s7, calculating whether the set A and the set D have overlapped available time periods or not, if so, recording the passing time and the track, advancing and calculating the next station; if not, the product can not pass through and enters the next step;
s8, calculating whether the set A, the set D and the set T have overlapped available time periods or not, if so, waiting for avoidance at a station, recording arrival time, departure time and occupied station tracks, advancing, and calculating the next station; if not, entering the next step;
s9, calculating the earliest reachable time of the running line at the station of the vehicle according to the set A, D, T, backing up and entering the previous station;
s10, calculating the earliest possible departure time of the last station, judging whether available tracks and departure time exist under the condition that the arrival time is not changed, if so, avoiding the last station, advancing, and jumping to the step S4; if not, the earliest reachable time of the previous station is calculated, and the previous station is entered by going back to step S3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210109930.5A CN114611871A (en) | 2022-01-29 | 2022-01-29 | Automatic compilation method and system for railway operation diagram |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210109930.5A CN114611871A (en) | 2022-01-29 | 2022-01-29 | Automatic compilation method and system for railway operation diagram |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114611871A true CN114611871A (en) | 2022-06-10 |
Family
ID=81859307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210109930.5A Pending CN114611871A (en) | 2022-01-29 | 2022-01-29 | Automatic compilation method and system for railway operation diagram |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114611871A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115320678A (en) * | 2022-08-30 | 2022-11-11 | 通号城市轨道交通技术有限公司 | Method and device for compiling train linkage and de-compilation operation diagram |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04135969A (en) * | 1990-09-28 | 1992-05-11 | Mitsubishi Electric Corp | Train diagram drawing device |
| CN101853440A (en) * | 2010-05-11 | 2010-10-06 | 北京交通大学 | Method for realizing automatic compilation of train operation plan and system thereof |
| CN105253170A (en) * | 2015-09-08 | 2016-01-20 | 国电南瑞科技股份有限公司 | City railway transport vehicle scheduling management and running chart display method |
| CN111391896A (en) * | 2020-03-30 | 2020-07-10 | 卡斯柯信号有限公司 | All-day train operation diagram generation method based on time-sharing scheme and activity event relation |
-
2022
- 2022-01-29 CN CN202210109930.5A patent/CN114611871A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04135969A (en) * | 1990-09-28 | 1992-05-11 | Mitsubishi Electric Corp | Train diagram drawing device |
| CN101853440A (en) * | 2010-05-11 | 2010-10-06 | 北京交通大学 | Method for realizing automatic compilation of train operation plan and system thereof |
| CN105253170A (en) * | 2015-09-08 | 2016-01-20 | 国电南瑞科技股份有限公司 | City railway transport vehicle scheduling management and running chart display method |
| CN111391896A (en) * | 2020-03-30 | 2020-07-10 | 卡斯柯信号有限公司 | All-day train operation diagram generation method based on time-sharing scheme and activity event relation |
Non-Patent Citations (1)
| Title |
|---|
| 陈光伟: "《铁路信息系统应用技术》", 30 April 2017, 中国铁道出版社, pages: 240 - 243 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115320678A (en) * | 2022-08-30 | 2022-11-11 | 通号城市轨道交通技术有限公司 | Method and device for compiling train linkage and de-compilation operation diagram |
| CN115320678B (en) * | 2022-08-30 | 2024-03-29 | 通号城市轨道交通技术有限公司 | Train coupling-decoupling-editing operation chart compiling method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5539590B2 (en) | Train operation control system | |
| CN112606881B (en) | Automatic turnout triggering method and device based on vehicle-vehicle communication | |
| CN114044031B (en) | Automatic adjustment method for train running chart, storage medium and electronic equipment | |
| CN113212503B (en) | Detection method for rail transit vehicle shunting plan conflict | |
| CN112693505B (en) | Subway train operation adjusting method and system under unidirectional blocking condition | |
| KR102209711B1 (en) | Method and device for railway capacity allocation | |
| US20090119145A1 (en) | Rolling stock scheduling apparatus and method | |
| CN111859193B (en) | Method and device for generating driving schedule and electronic equipment | |
| CN113821039A (en) | Time window-based path planning method, device, equipment and storage medium | |
| CN109229155B (en) | A kind of method that evading train operation deadlock state and train operation global optimization control method | |
| CN112373521A (en) | Automatic compiling, detecting and adjusting system and method for multi-line and multi-intersection train timetable | |
| CN114611871A (en) | Automatic compilation method and system for railway operation diagram | |
| KR20210007208A (en) | System for train scheduling and scheduling method for operating of train | |
| CN109625036B (en) | Calculation processing method for number window of non-communication vehicle | |
| Chiang et al. | Railway scheduling system using repair-based approach | |
| CN115638804B (en) | Deadlock-free unmanned vehicle online path planning method | |
| CN113962599B (en) | Urban rail transit networked operation management method and system | |
| JP4571349B2 (en) | Change replacement plan creation program, storage medium, and change replacement plan creation system | |
| Toletti et al. | Energy savings in mixed rail traffic rescheduling: an RCG approach | |
| Borndörfer et al. | Recent success stories on optimization of railway systems | |
| JPH07106704B2 (en) | Train control method | |
| JPH0435389B2 (en) | ||
| Shi et al. | Reschedule the shunting and service scheduling plan after disturbances at a Chinese high-speed railway depot | |
| CN115195817B (en) | Locomotive turnover data display method and device | |
| CN117273393B (en) | Dynamic adjustment method and device for vehicle running chart and electronic equipment |
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 |