CN113962599A - Urban rail transit network operation management method and system - Google Patents
Urban rail transit network operation management method and system Download PDFInfo
- Publication number
- CN113962599A CN113962599A CN202111334332.XA CN202111334332A CN113962599A CN 113962599 A CN113962599 A CN 113962599A CN 202111334332 A CN202111334332 A CN 202111334332A CN 113962599 A CN113962599 A CN 113962599A
- Authority
- CN
- China
- Prior art keywords
- time
- passenger flow
- sharing
- traffic
- train
- 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
- 238000007726 management method Methods 0.000 title claims abstract description 47
- 238000010586 diagram Methods 0.000 claims abstract description 45
- 238000004364 calculation method Methods 0.000 claims description 12
- 238000000034 method Methods 0.000 claims description 12
- 238000011156 evaluation Methods 0.000 claims description 5
- 230000008859 change Effects 0.000 abstract description 4
- 230000008901 benefit Effects 0.000 description 4
- 238000005457 optimization Methods 0.000 description 3
- 239000011541 reaction mixture Substances 0.000 description 3
- 230000007306 turnover Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 description 1
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 229910052799 carbon Inorganic materials 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000011158 quantitative evaluation Methods 0.000 description 1
- 238000012546 transfer 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
-
- 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"
-
- 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/06315—Needs-based resource requirements planning or analysis
-
- 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/10—Services
- G06Q50/26—Government or public services
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a networked operation management method and a networked operation management system for urban rail transit. And then calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data. And finally, paving and drawing the operation line according to the time-sharing full-traffic road train number set and the time-sharing small-traffic road train number set to obtain an operation diagram, and further, on the basis of considering dynamic passenger flow change and traffic network complexity, the operation diagram with accurate matching of passenger demands and operation resources can be efficiently and automatically compiled.
Description
Technical Field
The invention relates to the technical field of rail transit networked operation management, in particular to an urban rail transit networked operation management method and system based on an intelligent scheduling optimization technology.
Background
With the increase of the travel demand of urban population and the requirement of urban ecological environment, rail transit is becoming an indispensable part of public transport. The method has the characteristics of high bearing capacity, low carbon emission and the like, and the rail transit becomes an optimal scheme for relieving environmental pressure and improving social benefits in cities. The construction of urban rail transit influences the utilization of urban land, and connecting lines are formed in different business circles, urban centers and suburbs in cities, so that the value of surrounding land is improved, and the development range of the cities is expanded. Therefore, the rail transit has the advantage of assisting the urban development besides meeting the travel demands of people.
The train operation diagram is a diagram of the relation between time and space of train operation, and is a two-dimensional line diagram showing the states of train operation in each section and stop or passing at each station. The operation diagram specifies train operation cross roads and arrival and departure times of each train at each station, and is the basis for organizing all-line train operation.
The service of urban rail transit systems in China faces many challenges such as unbalanced passenger flow distribution, large system network scale, many resource elements and the like, so the difficulty of networked operation management is particularly expressed in that the coupling relation among people, vehicles and road resources in the system is complex, and the accurate and optimized configuration of available resources is difficult to realize. Networked operations highlight a new set of practical problems: the problems of capacity matching, line-to-line connection, passenger transfer, vehicle bottom network turnover and the like need to be further considered. Particularly, the existing software system cannot provide intelligent decision support for compiling the road network train running diagram, so that a dispatcher needs to invest a large amount of manpower time to manually compile the running diagram, the manually compiled running diagram is lack of quantitative evaluation and accurate optimization, and the rail transit transportation potential cannot be fully exploited.
Disclosure of Invention
The invention aims to provide a networked operation management method and system for urban rail transit, which can efficiently and automatically compile a running chart accurately matching passenger demands and operation resources in consideration of dynamic passenger flow change and traffic network complexity.
In order to achieve the purpose, the invention provides the following scheme:
a networked operation management method for urban rail transit comprises the following steps:
acquiring road network data and passenger flow data; the road network data comprises train operation data and line topology data;
calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data;
and paving and drawing the running line according to the time-sharing total-traffic-road train number set and the time-sharing small-traffic-road train number set to obtain a running chart.
An urban rail transit networked operation management system, the management system comprising:
the acquisition module is used for acquiring road network data and passenger flow data; the road network data comprises train operation data and line topology data;
the calculation module is used for calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data;
and the paving and drawing module is used for paving and drawing the running line according to the time-sharing total-traffic-road train number set and the time-sharing small-traffic-road train number set to obtain a running chart.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention provides a networked operation management method and system for urban rail transit. And then calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data. And finally, paving and drawing the operation line according to the time-sharing full-traffic road train number set and the time-sharing small-traffic road train number set to obtain an operation diagram, and further, on the basis of considering dynamic passenger flow change and traffic network complexity, the operation diagram with accurate matching of passenger demands and operation resources can be efficiently and automatically compiled.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
FIG. 1 is a flowchart of a method of managing a communication system according to embodiment 1 of the present invention;
FIG. 2 is a schematic diagram of a partition in an example provided in embodiment 1 of the present invention;
fig. 3 is a system block diagram of a management system provided in embodiment 2 of the present invention.
Detailed Description
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 only a part of the embodiments of the present invention, and not all of the embodiments. 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 invention aims to provide a networked operation management method and system for urban rail transit, which can efficiently and automatically compile a running chart accurately matching passenger demands and operation resources in consideration of dynamic passenger flow change and traffic network complexity.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
Example 1:
the embodiment is used to provide an urban rail transit networked operation management method, as shown in fig. 1, the management method includes:
s1: acquiring road network data and passenger flow data; the road network data comprises train operation data and line topology data;
before S1, the management method of this embodiment further includes setting a road network management module and a passenger flow module, where the road network management module includes a line management submodule and a traffic management submodule, the line management submodule is used to draw a rail transit network object line graph and input line data, the traffic management submodule is used to manually add and delete traffic information, and further obtains road network data from the road network management module, the passenger flow module is used to import a time-sharing cross-section passenger flow volume of a line, and the road network management module and the passenger flow module are data preparation parts for plotting a running graph.
Specifically, the road network data includes train operation data and route topology data. The train operation data comprises train checking passenger capacity, maximum full load rate, operation starting time, operation ending time, calculation interval, maximum departure interval and minimum departure interval. The line topology data comprises line station number, station stop time, interval running time, turn-back station number, turn-back station position and train running and crossing scheme set. The train operation intersection scheme set comprises a full intersection and a small intersection which are arranged on the line. The train operation cross road refers to a fixed turnover section in which a train performs a passenger flow transportation task in urban rail transit, that is, a line section in which the train travels back and forth from a starting station to a terminal station, and the train operation cross road is divided into a full cross road and a small cross road. The full-traffic route refers to a section along a line that a train starts from a terminal station and drives to another terminal station of the line, and the small-traffic route refers to a section along a line that a train drives from a terminal station to a certain intermediate station.
S2: calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data;
specifically, S2 may include:
1. dividing an operation time window into n equally spaced time intervals according to the train operation data; specifically, the operation time window is divided into n equally spaced time intervals according to the operation starting time, the operation ending time and the calculation interval. The operation time window refers to a time window from the operation starting time to the operation ending time.
2. For each line in the road network, performing the following operations:
1) the line is divided into a plurality of sections according to the line topology data. The method specifically comprises the steps of dividing a line into a plurality of sections according to the number of the switchback stations on the line and the positions of the switchback stations, more specifically, determining adjacent switchback stations according to the number of the switchback stations and the positions of the switchback stations, wherein a section is formed by a section between every two adjacent switchback stations so as to divide the line into a plurality of sections.
2) Calculating the maximum time-sharing passenger flow and the minimum time-sharing passenger flow of the line at each time interval according to the passenger flow data; the traffic data includes time-of-use traffic for each segment at each time interval. The maximum time-sharing passenger flow of the line at a certain time interval is the maximum value of the time-sharing passenger flow of each section of the line at the time interval; the minimum time-sharing passenger flow of the line in a certain time interval is the minimum value of the time-sharing passenger flow of each section of the line in the time interval.
3) And for each time interval, calculating the times of the full traffic vehicles corresponding to the time interval according to the minimum time-sharing passenger flow, updating the passenger flow according to the passenger flow data, calculating the times of the small traffic vehicles corresponding to the time interval, and further obtaining the times of the full traffic vehicles and the times of the small traffic vehicles of each line in each time interval by using the step 2. The total number of times of traffic of each line under each time interval constitutes a time-sharing total number of times of traffic of the road, and the number of times of traffic of the small traffic of each line under each time interval constitutes a set of times of traffic of the small traffic of the road.
In this embodiment, from the operation start time to the operation end time, recursive calculation is performed on each time interval and each line segment to obtain a time-sharing total-traffic-road vehicle number set and a time-sharing minor-traffic-road vehicle number set.
Wherein, calculating the number of the total-traffic-road vehicles corresponding to the time interval according to the minimum time-sharing passenger flow volume may include: and taking the ratio of the minimum time-sharing passenger flow volume to the product of the train approved passenger load volume and the maximum full load rate in the train operation data as the number of times of the full-traffic trains corresponding to the time interval, and paving and drawing the full-traffic train operation diagram of the time interval according to the number of times of the full-traffic trains. The calculation formula of the times of the full traffic is as follows:
in the formula (1), N is the number of times of the full-traffic vehicles; d is the minimum time-sharing passenger flow; c, checking the passenger capacity of the train; and alpha represents the maximum loading rate of the train.
Wherein, updating the passenger flow according to the passenger flow data, and calculating the number of the small traffic routes corresponding to the time interval may include:
1) and subtracting the minimum time-sharing passenger flow from the time-sharing passenger flow of each section at the time interval to obtain the updated time-sharing passenger flow of each section at the time interval, and determining the updated maximum time-sharing passenger flow and the updated minimum time-sharing passenger flow at the time interval according to all the updated time-sharing passenger flows. And the minimum time-sharing passenger flow volume after updating is larger than 0.
Specifically, the minimum time-sharing passenger flow is subtracted from the time-sharing passenger flow of each section, and the subtraction is to subtract the minimum passenger flow to which the train number has been allocated, prevent the train number from being repeatedly allocated, and find out the current minimum time-sharing passenger flow and the current maximum time-sharing passenger flow from each section. The minimum time-sharing passenger flow and the maximum time-sharing passenger flow are changed due to the fact that the passenger flow is updated, and at the moment, the maximum time-sharing passenger flow is equal to the original maximum time-sharing passenger flow minus the original minimum time-sharing passenger flow.
2) Judging whether the updated maximum time-sharing passenger flow is smaller than a preset threshold value or not to obtain a first judgment result;
3) if the first judgment result is negative, determining the longest small traffic route of the section corresponding to the minimum time-sharing passenger flow after the coverage updating according to the line topology data, namely determining the longest small traffic route according to the train operation traffic route scheme set. And calculating the number of the train numbers corresponding to the longest minimum traffic route according to the updated minimum time-sharing passenger flow, and calculating by adopting the formula (1), wherein D in the formula (1) represents the updated minimum time-sharing passenger flow. Taking the updated time-sharing passenger flow as the time-sharing passenger flow in the next cycle, taking the updated minimum time-sharing passenger flow as the minimum time-sharing passenger flow in the next cycle, and returning to the step of subtracting the minimum time-sharing passenger flow from the time-sharing passenger flow of each section at the time interval;
4) if the first judgment result is yes, judging whether the number of the vehicle times corresponding to all the sections is calculated; it should be noted that the total number of traffic routes is the number of traffic routes corresponding to the section corresponding to the earliest minimum time-sharing passenger flow; 3) the number of the train times of the longest minor cross road determined in the step (2) is the number of the train times of the corresponding section of the longest minor cross road.
5) If so, obtaining the times of the small traffic vehicles corresponding to the time interval; the number of the small traffic routes corresponding to the time interval comprises the number of the vehicles corresponding to the rest sections except the number of the vehicles corresponding to the section corresponding to the minimum time-sharing passenger flow at the beginning.
6) Otherwise, the updated time-sharing passenger flow is used as the time-sharing passenger flow, the updated minimum time-sharing passenger flow is used as the minimum time-sharing passenger flow, the time-sharing passenger flow of each section in the time interval is subtracted from the minimum time-sharing passenger flow to obtain the updated time-sharing passenger flow of each section in the time interval, and the updated minimum time-sharing passenger flow in the time interval is determined according to all the updated time-sharing passenger flows. And calculating the number of the train numbers corresponding to the section corresponding to the updated minimum time-sharing passenger flow according to the updated minimum time-sharing passenger flow, and calculating by adopting the formula (1), wherein D in the formula (1) represents the updated minimum time-sharing passenger flow. And returning to the step of judging whether the number of the vehicle numbers corresponding to all the sections is calculated.
S3: and paving and drawing the running line according to the time-sharing total-traffic-road train number set and the time-sharing small-traffic-road train number set to obtain a running chart.
The method is applied to Beijing subway No. 6 line to further explain the management method, and the steps are as follows:
step 1: data input including train checking and passenger capacity, maximum full load rate, operation start time, operation end time, calculation interval, maximum departure interval, minimum departure interval, and line topology data is obtained according to the road network management module and the passenger flow module, as shown in table 1. Specifically, the line topology data includes the number of line stations, station stop time, section running time, the number of retracing stations, retracing station positions, and a train running and routing scheme set, and the line topology data of beijing subway No. 6 line is shown in table 2. And acquiring the time-sharing section passenger flow volume of each section according to the passenger flow module.
TABLE 1
| Description of data | Data symbol | Description of data | Data symbol |
| Train checking and passenger capacity | TrainCapacity | Maximum full load factor | CapacityRate |
| Operation start time | StartTime | End of run time | EndTime |
| Calculating intervals | UnitTime | Line topology data | BaseLineMap |
| Maximum departure interval | MaxHeadway | Minimum departure interval | MinHeadway |
TABLE 2
Step 2: dividing the whole operation time window into n equidistant time intervals according to the operation starting time, the operation ending time and the calculation interval, wherein T is equal to { T ═ T ] is used for the time interval set1，T2，…TnRepresents;
and step 3: for each line in the road network: according to the number of the reentrant stations and the positions of the reentrant stations in the route topological data, a section between two reentrant stations is regarded as a section to divide the route into a plurality of sections, and the sections are collected by S { [ S ]1，S2，…，SnDenotes that, as shown in fig. 2, the beijing subway No. 6 line is divided into 3 sections, { S }1，S2，S3}。
And 4, step 4: by using
Representing the section S in the ith time intervaljThe maximum time-sharing passenger flow of each time interval of the line is calculated
And minimum timesharing passenger flow MinPaxvolume ═ last dictionaryD 1，D 2，…，D nAnd for the ith time interval, the maximum value of the passenger flow of all the zones is the maximum time-sharing passenger flow. For example, Beijing subway line No. 6, time interval T1The cross-sectional passenger flow of each section in the interior is
(unit: number of persons), at this time, T1The maximum time-sharing passenger flow in the time interval is 6000 passenger times, and the minimum time-sharing passenger flow is 2000 passenger times;
and 5: from the operation start time to the operation end time, for each time interval TiAnd line section SjPerforming recursive computation:
step 5-1, according to the minimum time-sharing passenger flow of the time interval
Calculating the number N of full-traffic vehicles in the time interval according to the formula (1)iAnd laying a full-traffic train running chart at the time interval. For example, the train checking passenger capacity C is set to 600, the maximum load factor α is set to 1, and the number of times of all trains is set to
Step 5-2, updating the passenger flow, specifically, time-sharing passenger flow of each section
Minus minimum time-of-use passenger flowD iThen finding out the current minimum time-sharing section passenger flow MinPaxvolume ═ ready pocket from each sectionD 1，D 2，…，D nAnd updating the maximum time-sharing passenger flow numerical value of each time interval
After the number of the total-traffic routes is calculated, the minimum passenger flow which is already distributed is subtracted from the passenger flow of each section, at this time, the maximum passenger flow is equal to the original maximum passenger flow minus the minimum passenger flow, and the process is called as updating the maximum time-sharing passenger flow. For example, at this time, the maximum passenger flow rate in the time interval T1 is changed from 6000 times to 6000 times 2000 times to 4000 times.
In this example, the time interval T is updated after the passenger flow1The cross-sectional passenger flow of each section in the interior is
(unit: number of people), after updating the passenger flow, T1The maximum time-sharing passenger flow in the time interval is 4000 people, the minimum time-sharing passenger flow is 1000 people, and S3The section has no passenger flow; and S3, the number of the corresponding vehicle times is the number of the full-traffic vehicles.
And 5-3, continuously drawing the longest small intersection covering the section with the minimum passenger flow by using a formula, continuously updating the passenger flow, and calculating the number of the vehicles in the section with the minimum passenger flow until the current maximum section passenger flow in all the sections is smaller than a certain threshold value.
In this example, the section with the smallest traffic is S1Covering S1The longest minor cross-road of the section is S4According to
(rounded) and T is calculated1Covering S in time interval1Number of cars on block 4
Equal to 2;
step 5-4, judging whether the current time interval has finished the calculation of the number of the train times of all the sections, if so, carrying out the step 5-5, and if not, continuously calculating the section S where the next minimum passenger flow is locatedj′The number of trains still needs to be updated until all the sections are completely counted. In this embodiment, the current time interval T1Has finished S1And S3The number of the cars in the section is calculated, and S still remains2The zone has not completed the calculation, so the next zone with the minimum passenger flow is calculated continuously, i.e. S2The number of trains;
step 5-5, judging the current time interval TiIf the time interval is the last time interval, stopping paving and drawing, obtaining the time-sharing total-traffic-road number of cars and the time-sharing small-traffic-road number of cars, and if the time interval is not the last time interval, continuously calculating the next time interval Ti+1(ii) a The number of the vehicles on the full traffic roads is the number of the vehicles calculated in the step 5-1, and the number of the vehicles on the small traffic roads is the step5-3 and 5-4.
Step 6: and paving and drawing the operation lines and outputting the paving and drawing results of the operation chart according to the number of the full-traffic vehicles and the number of the small-traffic vehicles.
After obtaining the operation diagram, the management method of the embodiment further includes automatically checking the train bottom in the operation diagram, and specifically includes:
1) taking a programmed operation diagram as input, and for each intersection in a road network, acquiring a train number set in the uplink and downlink directions of the intersection according to an input timetable to establish a 0-1 mixed integer linear programming model; the 0-1 mixed integer linear programming model comprises a model objective function and a model constraint condition, wherein the model objective function takes the maximum connection number of the uplink trains and the downlink trains as a target; the traffic routes comprise full traffic routes and minor traffic routes;
here, the 0-1 decision variables of the model are first defined
As shown in the following formula (2):
in the formula (2), SupRepresenting the train number set of the uplink direction of the road crossing in the current time period; sdnAnd the train number set represents the downlink direction of the road intersection in the current time period.
The model objective function is to perform vehicle bottom selection by taking the maximum connection quantity of the uplink and downlink trains as a target, and is specifically expressed as follows:
the model constraints include:
in the formula (6), the reaction mixture is,
the departure time of the train number j at the starting station is shown;
the arrival time of the train number i at the last stop of the traffic route is shown; t is tsThe shortest turn-back time of the train at the turn-back station is obtained; m represents a larger value.
In the formula (7), tlThe longest retrace time of the train at the retrace station.
In the formula (8), SupI is shown at SupRemoving the element of the train number i; alpha is alphai，i′When 1 is taken, the train number i is connected with the train number i 'and the train number i is the train number before the train number i', otherwise, alphai，i′Take 0.
In the formula (9), the reaction mixture is,
the arrival time of the train number i' at the last stop of the intersection is shown.
In the formula (10), hminIs the minimum traffic interval;
the departure time of the train number i at the starting station is shown;
the departure time of the train number i-1 at the starting station is shown; h ismaxThe maximum driving interval is set;
the departure time of the train number j-1 at the starting station is shown; i-1 is the previous vehicle in the uplink direction i; j-1 is the previous vehicle in the descending direction j.
In the formula (11), the reaction mixture is,
the departure time of the train number i at the station p is shown;
the departure time of the train number i at the p-1 station is shown;
for the stop time of train i at p-1 station, rp-1Representing the interval running time from the p-1 station to the p station; p \1 represents that the element of 1 is excluded from the P set; p represents a station set of the route;
the departure time of the train number j at the station p is shown;
the departure time of the train number j at the p-1 station is shown;
the stop time of the train j at the p-1 station.
2) And solving the 0-1 mixed integer linear programming model to obtain the train couching and selecting vehicle bottom in the operation diagram.
The train bottom intelligent checking method takes a generated running chart as input, and solves a 0-1 mixed integer linear programming model for each intersection in an intersection set in sequence to obtain an optimal train bottom checking scheme. The 0-1 mixed integer linear programming model takes a well-programmed operation diagram as input data, takes the maximum connection quantity between the train numbers as a target, and can be accurately solved by a mathematical solver. It should be noted that the concept of train bottom refers to a vehicle group formed by linking a plurality of cars, and a train number refers to a train number assigned by a train bottom executing a passenger flow transportation task according to a determined train route.
After obtaining the operation diagram, the management method of this embodiment further includes:
1) manually selecting a train in-out warehouse line in the operation diagram; the in-out garage line is used for indicating a source yard at the bottom of the train car and a yard for recovering the train car to the garage.
2) The train operation line is manually adjusted in the operation diagram, and the arrival and departure time of the train can be manually adjusted, so that the train operation line can be used as an auxiliary function for automatically compiling the operation diagram, and the train operation line is manually adjusted to improve the train operation efficiency and stability on the basis of the automatically compiled operation diagram under the special condition.
3) Manually selecting the train on the bottom of the train in the running chart.
4) Counting evaluation index objects in the operation diagram; the evaluation index objects comprise the number of the up-going trains and the down-going trains, departure intervals in a certain period, the number of kilometers of running at the bottom of the train and the number of operating trains at the bottom of the train.
And intelligently paving the operation diagram or generating the batch operation diagram according to whether the passenger flow module leads in the passenger flow. The passenger flow module is an unnecessary premise for paving the operation diagram, if passenger flow data is imported, the operation diagram guided by passenger flow can be intelligently paved by one key according to the passenger flow data, and if the passenger flow data is not imported, the operation diagram can be paved by batch periodic operation diagrams.
The embodiment provides a rail transit network operation management method based on an intelligent scheduling optimization technology, and the method is also an intelligent train operation diagram laying method for realizing accurate matching of transportation capacity and transportation volume based on passenger guidance. In function, the practical requirements of transport capacity matching and vehicle bottom turnover under networked operation are considered, passenger flow data in practical operation are fully utilized to compile a train operation diagram, the networked operation goal of reducing cost and increasing quality is achieved, and a solution is provided for realizing resource sharing among multiple lines of rail transit and mutual cooperation operation of the lines under the condition of network formation and fully exerting the maximum advantage of network operation.
Example 2:
the embodiment is used to provide an urban rail transit networked operation management system, as shown in fig. 3, the management system includes:
the acquisition module M1 is used for acquiring road network data and passenger flow data; the road network data comprises train operation data and line topology data;
the calculation module M2 is used for calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data;
and the paving and drawing module M3 is used for paving and drawing the running line according to the time-sharing total-traffic-road train number set and the time-sharing small-traffic-road train number set to obtain a running chart.
The embodiment further includes an operation diagram management module, configured to manually adjust the automatically compiled operation diagram, including: manually selecting a train in-out warehouse line in the operation diagram; intelligently checking the train bottom in the operation diagram; manually selecting the train bottom in the operation diagram; and manually adjusting the arrival time of the train.
And the statistical module is used for carrying out statistics on the evaluation index objects in the operation diagram.
The emphasis of each embodiment in the present specification is on the difference from the other embodiments, and the same and similar parts among the various embodiments may be referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present invention have been described herein using specific examples, which are provided only to help understand the method and the core concept of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.
Claims (10)
1. A networked operation management method for urban rail transit is characterized by comprising the following steps:
acquiring road network data and passenger flow data; the road network data comprises train operation data and line topology data;
calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data;
and paving and drawing the running line according to the time-sharing total-traffic-road train number set and the time-sharing small-traffic-road train number set to obtain a running chart.
2. The management method according to claim 1, wherein the calculating a time-sharing total-traffic-road-number set and a time-sharing small-traffic-road-number set according to the road network data and the passenger flow data specifically comprises:
dividing an operation time window into n equally spaced time intervals according to the train operation data; the train operation data comprises operation starting time, operation ending time and calculation interval;
for each line in the road network, performing the following operations:
dividing the line into a plurality of sections according to line topology data; the line topology data comprises the number of reentry stations and the location of the reentry stations on the line;
calculating the maximum time-sharing passenger flow volume and the minimum time-sharing passenger flow volume of the line at each time interval according to the passenger flow data; the passenger flow data comprises time-sharing passenger flow of each section at each time interval;
for each time interval, calculating the times of all traffic vehicles corresponding to the time interval according to the minimum time-sharing passenger flow, updating the passenger flow according to the passenger flow data, calculating the times of the small traffic vehicles corresponding to the time interval, and obtaining the times of all traffic vehicles and the times of small traffic vehicles of each line in each time interval; and each line is composed of time-sharing total-traffic-road-number sets according to the total-traffic-road-number times of each time interval, and each line is composed of time-sharing total-traffic-road-number sets according to the small-traffic-road-number sets according to the time-sharing total-traffic-road-number times of each time interval.
3. The method according to claim 2, wherein the dividing the line into a plurality of segments according to the line topology data specifically comprises:
and determining adjacent reentry stations according to the topological data of the line, wherein a section is formed by the sections between every two adjacent reentry stations, and the line is divided into a plurality of sections.
4. The management method according to claim 2, wherein the calculating the number of total-traffic-road vehicles corresponding to the time interval according to the minimum time-sharing passenger flow volume specifically comprises:
and taking the ratio of the minimum time-sharing passenger flow volume to the product of the train approved passenger load volume and the maximum full load rate in the train operation data as the number of times of the full traffic corresponding to the time interval.
5. The management method according to claim 2, wherein the updating of the passenger flow according to the passenger flow data and the calculating of the number of the small traffic routes corresponding to the time interval specifically comprise:
subtracting the minimum time-sharing passenger flow volume from the time-sharing passenger flow volume of each section at the time interval to obtain an updated time-sharing passenger flow volume of each section at the time interval, and determining an updated maximum time-sharing passenger flow volume and an updated minimum time-sharing passenger flow volume at the time interval according to all the updated time-sharing passenger flow volumes; the minimum time-sharing passenger flow volume after updating is larger than 0;
judging whether the updated maximum time-sharing passenger flow is smaller than a preset threshold value or not to obtain a first judgment result;
if the first judgment result is negative, determining the longest minibus covering the section corresponding to the updated minimum time-sharing passenger flow according to the line topology data, and calculating the number of times of vehicles corresponding to the longest minibus according to the updated minimum time-sharing passenger flow; taking the updated time-sharing passenger flow volume as the time-sharing passenger flow volume in the next cycle, taking the updated minimum time-sharing passenger flow volume as the minimum time-sharing passenger flow volume in the next cycle, and returning to the step of subtracting the minimum time-sharing passenger flow volume from the time-sharing passenger flow volume of each section at the time interval;
if the first judgment result is yes, judging whether the number of the vehicle numbers corresponding to all the sections is calculated;
if so, obtaining the times of the small traffic route service vehicles corresponding to the time interval;
otherwise, the updated time-sharing passenger flow volume is used as a time-sharing passenger flow volume, the updated minimum time-sharing passenger flow volume is used as a minimum time-sharing passenger flow volume, the time-sharing passenger flow volume of each section at the time interval is subtracted from the minimum time-sharing passenger flow volume to obtain the updated time-sharing passenger flow volume of each section at the time interval, and the updated minimum time-sharing passenger flow volume at the time interval is determined according to all the updated time-sharing passenger flow volumes; and calculating the number of the train numbers corresponding to the sections corresponding to the updated minimum time-sharing passenger flow according to the updated minimum time-sharing passenger flow, and returning to the step of judging whether the number of the train numbers corresponding to all the sections is calculated.
6. The management method according to claim 1, wherein after obtaining the operation diagram, the management method further comprises automatically checking a train bottom in the operation diagram, and specifically comprises:
for each intersection in the road network, acquiring a train number set in the uplink and downlink directions of the intersection to establish a 0-1 mixed integer linear programming model; the 0-1 mixed integer linear programming model comprises a model objective function and a model constraint condition, wherein the model objective function takes the maximum connection number of the uplink trains and the downlink trains as a target;
and solving the 0-1 mixed integer linear programming model to obtain the train couching and selecting vehicle bottom in the operation diagram.
7. The management method according to claim 1, wherein after obtaining the operation graph, the management method further comprises: manually selecting a train in-out warehouse line in the operation diagram; the in-out garage line is used for indicating a source yard at the bottom of the train car and a yard for recovering the train car to the garage.
8. The management method according to claim 1, wherein after obtaining the operation graph, the management method further comprises: manually adjusting the train line in the operation diagram.
9. The management method according to claim 1, wherein after obtaining the operation graph, the management method further comprises: counting the evaluation index objects in the operation diagram; the evaluation index objects comprise the number of the up-going trains and the down-going trains, departure intervals in a certain period, the number of kilometers of running at the bottom of the train and the number of operating trains at the bottom of the train.
10. An urban rail transit networked operation management system, characterized in that the management system comprises:
the acquisition module is used for acquiring road network data and passenger flow data; the road network data comprises train operation data and line topology data;
the calculation module is used for calculating a time-sharing total-traffic road and vehicle number set and a time-sharing small-traffic road and vehicle number set according to the road network data and the passenger flow data;
and the paving and drawing module is used for paving and drawing the running line according to the time-sharing total-traffic-road train number set and the time-sharing small-traffic-road train number set to obtain a running chart.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111334332.XA CN113962599A (en) | 2021-11-11 | 2021-11-11 | Urban rail transit network operation management method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111334332.XA CN113962599A (en) | 2021-11-11 | 2021-11-11 | Urban rail transit network operation management method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113962599A true CN113962599A (en) | 2022-01-21 |
Family
ID=79470131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111334332.XA Pending CN113962599A (en) | 2021-11-11 | 2021-11-11 | Urban rail transit network operation management method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113962599A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114943484A (en) * | 2022-07-20 | 2022-08-26 | 深圳市城市交通规划设计研究中心股份有限公司 | Rail passenger flow capacity matching method, electronic equipment and storage medium thereof |
-
2021
- 2021-11-11 CN CN202111334332.XA patent/CN113962599A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114943484A (en) * | 2022-07-20 | 2022-08-26 | 深圳市城市交通规划设计研究中心股份有限公司 | Rail passenger flow capacity matching method, electronic equipment and storage medium thereof |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dong et al. | Integrated optimization of train stop planning and timetabling for commuter railways with an extended adaptive large neighborhood search metaheuristic approach | |
| Fu et al. | A hierarchical line planning approach for a large-scale high speed rail network: the China case | |
| CN102044149B (en) | City bus operation coordinating method and device based on time variant passenger flows | |
| CN109033718B (en) | Dynamic emergency evacuation method for urban rail transit line failure | |
| CN110648022B (en) | Community public transportation network and departure frequency synchronous optimization method of connection subways considering full coverage of stations | |
| CN111401614B (en) | Dynamic passenger flow distribution method and system for urban rail transit | |
| CN105070044A (en) | Dynamic scheduling method for customized buses and car pooling based on passenger appointments | |
| CN105809962A (en) | Traffic trip mode splitting method based on mobile phone data | |
| CN101661668A (en) | Electronic navigation method for public transport | |
| CN113919650A (en) | Train operation scheme optimization compilation method and system | |
| CN113320577B (en) | Automatic urban rail train running chart compiling method for single-running intersection | |
| Kang et al. | Last train station-skipping, transfer-accessible and energy-efficient scheduling in subway networks | |
| CN103530694A (en) | Urban subway dynamic passenger flow distribution method constructed on the basis of time-space network | |
| CN114179873B (en) | Multi-road multi-time-interval all-day train operation diagram automatic compilation method and system | |
| Wang et al. | Optimization models for high-speed train unit routing problems | |
| CN106997662A (en) | A kind of city bus operating mode construction method | |
| CN112446648A (en) | Urban rail transit mixed transportation method and system based on off-peak hours | |
| CN113962599A (en) | Urban rail transit network operation management method and system | |
| KR20120129344A (en) | Method and apparatus for establishing an operation schedule of trains | |
| Ng et al. | Redesigning large-scale multimodal transit networks with shared autonomous mobility services | |
| CN111160722A (en) | Bus route adjusting method based on passenger flow competition relationship | |
| Lin et al. | Bus frequency optimisation considering user behaviour based on mobile bus applications | |
| Li et al. | An efficient matching method for dispatching autonomous vehicles | |
| CN113469451B (en) | Customized bus route generation method based on heuristic algorithm | |
| CN115130868A (en) | Mobile phone signaling-based urban land utilization and traffic integrated interactive feedback model |
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 |