CN110163501B - System and method for automatically compiling driver traffic list of urban rail transit - Google Patents
System and method for automatically compiling driver traffic list of urban rail transit Download PDFInfo
- Publication number
- CN110163501B CN110163501B CN201910422197.0A CN201910422197A CN110163501B CN 110163501 B CN110163501 B CN 110163501B CN 201910422197 A CN201910422197 A CN 201910422197A CN 110163501 B CN110163501 B CN 110163501B
- Authority
- CN
- China
- Prior art keywords
- driver
- time
- task
- hot standby
- data
- 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.)
- Active
Links
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/06311—Scheduling, planning or task assignment for a person or group
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a system and a method for automatically compiling a driver traffic list of urban rail transit, belonging to the field of urban rail transit. The method comprises the following steps: 1, collecting train operation diagram data; 2, importing a configuration file; 3, segmenting the train running chart data into a plurality of driver tasks according to the number of driver transfer stations; 4, sequencing a plurality of driver tasks according to time 5, correcting hot standby information, and generating a task library to be arranged; 6, sequentially arranging each driver task in the task bank to be arranged, and outputting preliminary driver traffic data; and 7, carrying out space and time conflict check on the preliminary driver traffic data, and outputting the traffic data of each driver. The system comprises a data interface device, a remote management center, a cloud data storage server and a visual display device. The method has the advantages that the problems that time is long and workload is large when a driver traffic list is manually compiled in the prior art are solved; the accuracy of the weaving is improved; the optimal shift arrangement with balanced working duration is realized.
Description
Technical Field
The invention relates to the field of urban rail transit, in particular to a system and a method for automatically compiling a driver transit list of the urban rail transit.
Background
The urban rail transit is different from other public transportation modes such as buses and the like, and has the characteristics of large transportation volume, high speed, safety, accuracy and the like. Taking a subway as an example, the minimum departure interval at the peak stage of the subway can even reach 1 minute and a half to 2 minutes, and in order to match the departure interval with high density, the minimum departure interval not only needs careful consideration of designers at the early stage and support of circuit supporting hardware equipment, but also puts a very high requirement on the driver dispatching management level of a rail transit operation company. If the driver scheduling management (i.e. the driver's arrangement for taking a ride) is not reasonable, the driver arrangement is easy to be disordered in the peak stage, the situation of driving on the main line is influenced, and the train is late, so that the whole operation efficiency and the service quality of the line are influenced.
In order to better and reasonably plan and arrange the tasks of drivers for taking a ride and avoid disordered arrangement of the drivers, generally, an operation office adopts a driver traffic list form to plan and arrange the tasks of all the drivers. The driver traffic list is a reasonable and ordered set list of the number of cars taken by the driver every day, and is an indispensable basis for the shift dispatcher to compile a shift dispatching plan.
The driver traffic list has three evaluation bases: (1) the accuracy is high, the train number set of each driver on the road in the driver road table must be continuously connected front and back, so that the current time conflict and space conflict cannot be obtained, and the road missing cannot be caused; (2) the rationality is that the driver traffic list must simultaneously take account of the rationality of the driver exit and exit position and exit time; the reasonable rest time of the driver after completing each traffic task, the reasonable dining time and the reasonable dining position of the driver must be considered; (3) the balance is that the riding task needs to be arranged efficiently, fairly and reasonably under the condition of the existing human resources, and the condition that the working time deviation of a driver is large is avoided as much as possible.
The compilation of driver traffic lists of most urban rail transit lines in China still adopts a manual compilation mode. The manual compilation of the driver traffic list takes a long time, has large workload and is easy to make mistakes. According to investigation, manual work of making a driver traffic list takes about 2-3 days, the correctness of the making result is low, the balance is poor, the working time of some drivers is several times longer than that of other drivers, and the efficient and fair arrangement and taking task cannot be met.
Disclosure of Invention
The invention aims to overcome the defects in the prior art and provides a system and a method for automatically compiling a driver traffic list of urban rail transit.
In order to achieve the above purpose, the invention provides the following technical scheme:
a method for automatically compiling a driver traffic list of urban rail transit comprises the following steps:
s1, acquiring train running chart data;
s2, importing a configuration file containing driver transfer station information and hot standby information;
s3, segmenting the train running chart data into a plurality of driver tasks according to the driver transfer station information;
s4, sequencing a plurality of driver tasks according to time to generate a task library;
s5, correcting the hot standby information according to the hot standby information in the configuration file to generate a task library to be arranged;
s6, sequentially arranging each driver task in the task bank to be arranged, outputting preliminary driver traffic data, and screening drivers according to constraint conditions by each driver task;
and S7, carrying out space and time conflict check on the preliminary driver traffic data, and outputting the traffic data of each driver.
The train diagram data includes: the system comprises a running chart ID, station names, train numbers, uplink and downlink directions, starting station names, final arrival station names, arrival points, departure points, station stop time, station stop tracks and service numbers.
The configuration file further includes: the number of drivers, the serial number of the drivers, the start and end time of lunch, the start and end time of dinner, the minimum interval of dining time, the minimum interval of rest time, the advance time of attendance in field and the advance time of attendance on line.
According to driver transfer station information, segmenting the train operation diagram data into a plurality of driver tasks, which means that: dividing each train number into a plurality of driver tasks in turn according to the number of transfer stations when each train number makes a round trip, wherein the total number of the driver tasks every day is calculated according to the formula:
M=2×(K-1)×N，
wherein M is the total number of driver tasks per day, N is the total number of train operation round trips per day, and K is the number of transfer stations.
Every driver task all carries out driver's screening step according to the constraint and includes:
s11, before each driver task is arranged, a driver database to be scheduled is generated, wherein the driver database to be scheduled comprises a driver number, the driver number is not arranged to carry out a ride, and each driver task comprises a pick-up time, a corresponding getting-on transfer station, an arrival time and a corresponding getting-off transfer station;
s12, sequentially judging whether the accumulated working time of each driver in the driver database to be scheduled exceeds the maximum working time, if so, deleting the driver number corresponding to the driver from the driver database to be scheduled, and if not, keeping the driver number in the driver database to be scheduled to generate a second database to be scheduled;
s13, sequentially judging whether the interval between the arrival time of each driver from the previous task and the next vehicle receiving time in the second to-be-scheduled database is larger than or equal to a rest threshold value or not, if not, deleting the driver number corresponding to the driver from the second to-be-scheduled database, if so, keeping the driver number in the second to-be-scheduled database, and generating a third to-be-scheduled database;
and S14, selecting the driver with the longest interval from the arrival time of the last task to the pick-up time of the next task from the third to-be-scheduled database, getting on the vehicle at the pick-up time and the corresponding transfer station, and getting off the vehicle at the arrival time and the corresponding transfer station.
When the time period between the vehicle receiving time and the arrival time in each driver task is overlapped with the lunch time period or the dinner time period, the rest threshold value is replaced by a meal rest threshold value, wherein the rest threshold value is smaller than the meal rest threshold value.
The conflict inspection in space and time is carried out on the driver traffic data, and the conflict inspection comprises the following steps:
judging whether the getting-off transfer station of the previous driver task of the same driver is the getting-on transfer station of the next driver task, if so, checking the space conflict;
and judging whether the train receiving time of each task of the same driver is earlier than the arrival time of the train of the next task, if not, the time conflict check is passed.
And if the spatial conflict check fails or the time conflict check fails, outputting the task which fails the spatial conflict check or the time conflict check.
Correcting the hot standby information according to the hot standby information in the configuration file, and generating a task library to be arranged, wherein the step comprises the following steps: according to the hot standby information in the configuration file, cutting the hot standby time of the hot standby vehicle into a first hot standby time period, a second hot standby time period and a third hot standby time period according to the hot standby starting time, the hot standby first midpoint time, the hot standby second midpoint time and the hot standby ending time, and generating a hot standby task to be scheduled, wherein the hot standby vehicle and the corresponding hot standby time and hot standby stations are contained in the hot standby information, and the hot standby task to be scheduled comprises the first hot standby time period, the corresponding first hot standby station, the corresponding second hot standby time period, the corresponding second hot standby station, the corresponding third hot standby time period and the corresponding third hot standby station; and replacing the hot standby vehicle driver task in the task library with a hot standby task to be scheduled to generate a task library to be scheduled.
A system for automatically compiling a driver traffic list of urban rail transit comprises a data interface device, a remote management center, a cloud data storage server and a visual display device,
the data interface device comprises a data acquisition device, an acquisition controller and a data output interface; the data acquisition end of the acquisition controller is in communication connection with the data acquisition device; the data acquisition device is in communication connection with a data storage server of the ATS system; the data output end of the acquisition controller is in communication connection with the data output interface;
the remote management center comprises a data processing unit, a routing unit and a correctness verifying unit,
the remote management center sends a data acquisition control signal to the acquisition controller, receives train working diagram data output by the data output interface, and the train working diagram data are processed by the data processing unit, the traffic route arrangement unit and the correctness verification unit in sequence and output traffic route data of each driver to the cloud data storage server; the remote management center also controls the cloud data storage server to send the stored traffic data of each driver to a plurality of visual display devices, so that real-time sharing of information is realized;
the data processing unit prestores configuration files containing driver transfer station information and hot standby information, receives train operation diagram data output from the data output interface, segments the train operation diagram data into a plurality of driver tasks according to the number of the driver transfer stations, sequences the plurality of driver tasks according to time sequence to generate a task library, performs data correction on the task library according to the hot standby information in the configuration files to generate a task library to be arranged, and outputs the task library to be arranged to the traffic routing unit;
the traffic routing unit inputs the task bank to be routed from the data processing unit, sequentially routes each driver task in the task bank to be routed, screens drivers according to constraint conditions for each driver task, and outputs preliminary driver traffic routing data;
and the correctness verification unit inputs the preliminary driver traffic data from the traffic arrangement unit, performs spatial and temporal conflict check on the preliminary driver traffic data, and outputs the traffic data of each driver.
Compared with the prior art, the invention has the beneficial effects that:
1. the problem of current manual work compile driver's traffic table consuming time for a long time, work load is big, easily makes mistakes, compile the result unreasonable is solved. The optimal shift arrangement is realized, the working time of each driver is balanced, and the deviation is within 10 percent.
2. The invention combines the train operation diagram data and the line characteristic data to carry out analysis and calculation, and automatically compiles a driver traffic table which is reasonable, has high accuracy and high availability. According to actual comparison and analysis, the time spent for automatically compiling the driver traffic map is about 3min, which is one thousandth of the manual compiling time, the integrity rate of the automatically compiled driver traffic map is 100%, the accuracy rate is 99%, and the availability rate is 97%.
3. The invention effectively improves the working efficiency and the informatization level of the urban rail transit driver scheduling management, indirectly ensures the punctual operation of the urban rail transit main line, improves the service level and the quality of the urban rail transit whole line, and adapts to the requirements of the informatization and intelligent development of the urban rail transit.
Drawings
FIG. 1 is a flow chart of a method for automatically compiling an urban rail transit driver traffic list;
FIG. 2 is a flow chart of the screening of drivers according to the constraint conditions in embodiment 1;
FIG. 3 is a block diagram of a system for automatically compiling a driver traffic list of urban rail transit;
fig. 4 is a structural diagram of a remote management center in embodiment 1;
fig. 5 is a traffic data map of each driver finally outputted in embodiment 2;
fig. 6 is a manually constructed driver traffic data map in example 2.
Detailed Description
The present invention will be described in further detail with reference to test examples and specific embodiments. It should be understood that the scope of the above-described subject matter is not limited to the following examples, and any techniques implemented based on the disclosure of the present invention are within the scope of the present invention.
Example 1
A flow chart for automatically compiling a driver traffic list of urban rail transit is shown in figure 1, and comprises the following steps:
s1, collecting train operation diagram data, wherein the mode of collecting the train operation diagram data can be file import or train operation diagram data collection from an ATS system interface. The train running diagram data at least comprises a running diagram ID (running diagram identifier), a station name, a train number, an uplink and downlink direction, an initial station name, a final station name, an arrival point, an origin point, stop time, stop station tracks and a service number.
And S2, importing a configuration file containing driver transfer station information and hot standby information, wherein the data in the configuration file further comprises the number of drivers, the serial numbers of the drivers, the start and end time of lunch, the start and end time of dinner, the minimum interval of dining time, the minimum interval of rest time, the advance time of field attendance, the advance time of line attendance and the like.
And S3, segmenting the train operation diagram data into a plurality of driver tasks according to the number of driver transfer stations. Each driver task comprises: the receiving time, the receiving number of cars and the corresponding getting-on transfer station, the driving number of cars, the arrival time and the corresponding getting-off transfer station. Taking an urban rail line with three transfer stations as an example, the specific arrangement is as follows:
each train number of the train has a starting station and corresponding arrival time; a midpoint station and corresponding arrival time; end station and corresponding arrival time. And each vehicle passes through the midpoint station twice in one round trip, the midpoint station from the starting station to the first pass is set as a first task interval, the midpoint station from the first pass to the destination station is set as a second task interval, the midpoint station from the destination station to the second pass is set as a third task interval, and the midpoint station from the second pass to the starting station is set as a fourth task interval. Each task interval corresponds to a minimum working interval and working time for the driver to route. Correspondingly, the train receiving time of the first task interval is the arrival time of the train at the starting station, the train receiving number is the number of the trains reaching the starting station, the train starting number is the number of the trains when the trains are started from the starting station, and the arrival time is the arrival time of the trains reaching the middle point station for the first time; the train receiving time and the train receiving number of the second task interval are the arrival time and the arrival number of the train reaching the midpoint station for the first time, the driving number is the number of the train which is driven from the midpoint station for the first time, and the arrival time is the arrival time of the train reaching the terminal station; the train receiving time and the train receiving number of the third task interval are the arrival time and the arrival time of the train reaching the terminal station, the train receiving number is the train number of the train driving out from the terminal station, and the arrival time is the arrival time of the train reaching the midpoint station for the second time; the train receiving time and the train receiving number of the fourth task interval are the arrival time and the arrival time of the train reaching the midpoint station for the second time, the train departure number of the fourth task interval is the train number of the train running out of the midpoint station for the second time, and the arrival time is the arrival time of the train returning to the starting station.
And (3) performing task cutting on each train number according to the method, wherein if K transfer stations exist on the whole line, the calculation formula of the total number of driver tasks per day is as follows: m =2 × (K-1) × N, where M is the total number of driver tasks per day, N is the total number of train trips per day, and K is the number of transfer stations.
When K =3, the total number of train round trips per day is N, and the number of tasks required for route scheduling is:
m =4 × N, where M is the total number of driver tasks per day.
And S4, sequencing the total M driver tasks every day according to the time sequence from morning to evening to generate a task library.
And S5, correcting the hot standby information according to the hot standby information in the configuration file to generate a task library to be arranged.
The specific correction process is as follows: according to the hot standby information in the configuration file, cutting the hot standby time of a hot standby vehicle into a first hot standby time period, a second hot standby time period and a third hot standby time period according to the hot standby starting time, the hot standby first midpoint time, the hot standby second midpoint time and the hot standby ending time, wherein the hot standby vehicle and the corresponding hot standby time and hot standby station are contained in the hot standby information to generate a hot standby to-be-scheduled task, and the hot standby to-be-scheduled task comprises the first hot standby time period and the corresponding first hot standby station, the second hot standby time period and the corresponding second hot standby station, the third hot standby time period and the corresponding third hot standby station; and replacing the hot standby train number task in the task library with the hot standby task to be scheduled.
For example, a certain hot standby vehicle station is a starting station, the hot standby time is 5 to 23 points, where 5 points are hot standby starting time, 23 points are hot standby ending time, 10 points are set as first middle point time of hot standby, 17 points are set as second middle point time of hot standby, in the hot standby task, the first hot standby station, the second hot standby station and the third hot standby station are all starting stations, the first hot standby time period is 5 to 10 points (early shift time), the second hot standby time period is 10 to 17 points (white shift time), and the third hot standby time period is 17 to 23 points (late shift time), the hot standby task is generated as the first hot standby time period: 5 o 'clock-10 o' clock-start station; 10-17 points-the origin station; 10-17 points-the origin station; 17 Point-23 Point-the origin station.
And deleting the original hot standby vehicle driver task in the task library, replacing the original hot standby vehicle driver task with a hot standby task to be scheduled, and generating a final task library to be scheduled. After the hot standby vehicle finishes the cutting, the scheduling task of the hot standby vehicle and other driver tasks can participate in scheduling together.
And S6, arranging each driver task in the task bank to be arranged in sequence, screening drivers according to constraint conditions by each driver task, and outputting preliminary driver traffic data.
The flow chart of screening drivers according to the constraint conditions is shown in fig. 2, and the specific screening is as follows:
s11, before a certain driver task is arranged, the receiving time of the driver task, the corresponding getting-on transfer station, the arrival time and the corresponding getting-off transfer station are known, before the task is scheduled, a database of drivers to be scheduled is generated, the database of the drivers to be scheduled comprises driver numbers, the drivers corresponding to the driver numbers are the drivers who have completed the previous task and have not scheduled the transfer, and the drivers who have scheduled the train in the receiving time and the arrival time period of the driver task do not participate in the distribution of the driver task and are excluded from the database of the drivers to be scheduled.
S12, sequentially judging whether the accumulated working time of each driver in the driver database to be scheduled exceeds the maximum working time (for example, the maximum working time is 5 hours), if so, deleting the driver information from the driver database to be scheduled, and avoiding fatigue driving of the driver; if not, the information of the driver is reserved in the database of the driver to be scheduled, and a second database to be scheduled is generated.
And S13, sequentially judging whether the interval between the arrival time of each driver from the last getting-off to the time of getting-on and receiving the driver in the second to-be-scheduled database is larger than or equal to a rest threshold (for example, the rest threshold is 10 minutes), if not, deleting the driver information from the second to-be-scheduled database, if so, keeping the driver information in the second to-be-scheduled database, and generating a third to-be-scheduled database.
Specifically, when the time period between the pickup time and the arrival time overlaps with the lunch time period (for example, lunch time is set to 12 o 'clock to 1 o' clock) or the dinner time period (for example, lunch time is set to 12 o 'clock to 1 o' clock), the rest threshold value is replaced by the meal rest threshold value, for example, 10 minutes of the rest threshold value is replaced by 20 minutes of the meal rest threshold value. And then sequentially judging whether the interval between the arrival time of each driver from the last getting-off to the current time of getting-on in the second to-be-scheduled database is greater than or equal to the dining rest threshold value or not, if not, deleting the driver information from the second to-be-scheduled database, if so, retaining the driver information in the second to-be-scheduled database, and generating a third to-be-scheduled database.
And S14, selecting the driver number with the longest interval from the arrival time of the last task to the pick-up time from the third to-be-scheduled database, inputting the corresponding driver number at the pick-up time and the corresponding getting-on transfer station, and inputting the corresponding driver number at the arrival time and the corresponding getting-off transfer station.
And S15, returning to the step S11, arranging the next driver task according to the steps from S11 to S14, selecting a driver number, filling the driver number in a traffic route and arranging the driver until each driver task arranges the driver, and generating preliminary driver traffic data.
And S7, carrying out space and time conflict check on the preliminary driver traffic data, and outputting the traffic data of each driver.
The method comprises the following specific steps: judging whether the getting-on transfer station of the same driver in the previous task is the getting-on transfer station of the next task, if so, passing the space conflict check, and if not, failing to pass the space conflict check;
and judging whether the train receiving time of each task of the same driver is earlier than the time of the arrival of the train to be changed at the transfer station, if not, passing the time conflict check, and if not, failing the time conflict check.
And when the spatial conflict check is not passed, outputting prompt information of failing to pass the spatial conflict check. And when the time conflict check is not passed, outputting prompt information of failing to pass the time conflict check. And manually correcting the shift through the prompt message or returning to the step S6 to carry out the shift arrangement again.
A system for automatically compiling a driver traffic list of urban rail transit is shown in figure 3 and comprises a data interface device, a remote management center, a cloud data storage server and a visual display device.
The data interface device comprises a data acquisition device, an acquisition controller and a data output interface; the data acquisition end of the acquisition controller is in communication connection with the data acquisition device; the data acquisition device is in communication connection with a data storage server of the ATS system; and the data output end of the acquisition controller is in communication connection with the data output interface.
The remote management center comprises a data processing unit, a routing unit and a correctness verification unit, and the structure diagram of the remote management center is shown in fig. 4.
The remote management center sends a data acquisition control signal to the acquisition controller, receives train working diagram data output by the data output interface, and the train working diagram data are processed by the data processing unit, the traffic route arrangement unit and the correctness verification unit in sequence and output traffic route data of each driver to the cloud data storage server; the remote management center also controls the cloud data storage server to send the stored traffic data of each driver to the plurality of visual display devices, and real-time sharing of information is achieved.
The data processing unit prestores configuration files containing driver transfer station information and hot standby information, receives train working diagram data output from the data output interface, segments the train working diagram data into a plurality of driver tasks according to the number of the driver transfer stations, sequences the plurality of driver tasks according to time sequence to generate a task library, corrects the data of the task library according to the hot standby information in the configuration files to generate a task library to be arranged, and outputs the task library to be arranged to the traffic route arrangement unit.
And the traffic route arrangement unit inputs the task library to be arranged from the data processing unit, arranges each driver task in the task library to be arranged in sequence, screens drivers according to constraint conditions and outputs preliminary driver traffic route data.
And the correctness verification unit inputs the preliminary driver traffic data from the traffic arrangement unit, performs space and time conflict check on the preliminary driver traffic data, and outputs the traffic data of each driver.
Example 2
Taking the second line of the Chengdu subway as an example, the driver traffic list generated according to the method of the invention is shown in FIG. 5. The method comprises the steps of 1, 3 and 5, 8230, numbering drivers, wherein the row where each driver number is located lists the time and the station of the driver needing to change the bus on the same day, and FIG. 6 is a driver traffic map manually arranged on the same day under the condition that the total task volume is the same.
Claims (10)
1. A method for automatically compiling a driver traffic list of urban rail transit is characterized by comprising the following steps:
s1, collecting train operation diagram data;
s2, importing a configuration file containing driver transfer station information and hot standby information;
s3, segmenting the train operation diagram data into a plurality of driver tasks according to the driver transfer station information;
s4, sequencing the plurality of driver tasks according to time to generate a task library;
s5, correcting the hot standby information according to the hot standby information in the configuration file to generate a task library to be arranged;
s6, sequentially arranging each driver task in the task library to be arranged, and outputting preliminary driver traffic data, wherein each driver task screens drivers according to constraint conditions;
and S7, performing space and time conflict check on the preliminary driver traffic data, and outputting the traffic data of each driver.
2. The method for automatically compiling a driver's road list of urban rail transit according to claim 1, wherein the train running map data comprises: the system comprises a running chart ID, station names, train numbers, uplink and downlink directions, starting station names, final arrival station names, arrival points, departure points, station stop time, station stop tracks and service numbers.
3. The method for automatically compiling a driver traffic list of an urban rail transit according to claim 1, wherein the configuration file further comprises: the system comprises a driver number, lunch starting and ending time, dinner starting and ending time, minimum dining time intervals, minimum rest time intervals, field attendance advance time and line attendance advance time.
4. The method for automatically compiling the driver traffic list of the urban rail transit according to claim 1, wherein the step of segmenting the train running chart data into a plurality of driver tasks according to the driver transfer station information comprises the following steps: dividing each train number back and forth into a plurality of driver tasks according to the number of transfer stations, wherein the total number of the driver tasks per day is calculated according to the formula:
M=2×(K-1) ×N
wherein M is the total number of driver tasks per day, N is the total number of train operation round trips per day, and K is the number of transfer stations.
5. The method for automatically compiling the driver traffic list of the urban rail transit according to the claim 1, wherein each driver task carries out the screening step of the drivers according to the constraint condition, and the screening step comprises the following steps:
s11, before each driver task is arranged, a driver database to be scheduled is generated, wherein the driver database to be scheduled comprises a driver number, the driver number is not arranged to carry out a ride, and each driver task comprises the vehicle receiving time, the corresponding vehicle getting-on transfer station, the arrival time and the corresponding vehicle getting-off transfer station;
s12, sequentially judging whether the accumulated working time of each driver in the driver database to be scheduled exceeds the maximum working time, if so, deleting the serial number of the driver corresponding to the driver from the driver database to be scheduled, otherwise, keeping the serial number of the driver in the driver database to be scheduled, and generating a second database to be scheduled;
s13, sequentially judging whether the interval from the last task arrival time to the next vehicle receiving time of each driver in the second to-be-scheduled database is larger than or equal to a rest threshold value or not, if not, deleting the driver number corresponding to the driver from the second to-be-scheduled database, if so, keeping the driver number in the second to-be-scheduled database, and generating a third to-be-scheduled database;
and S14, selecting the driver with the longest interval from the arrival time of the last task to the pick-up time of the next task from the third database to be scheduled, getting on the vehicle at the pick-up time and the corresponding transfer station, and getting off the vehicle at the arrival time and the corresponding transfer station.
6. The method for automatically compiling the driver traffic list of the urban rail transit according to claim 5, wherein when the time period between the vehicle pick-up time and the arrival time in each driver task is overlapped with the lunch time period or the dinner time period, the rest threshold value is replaced by a meal rest threshold value, wherein the rest threshold value is smaller than the meal rest threshold value.
7. The method for automatically compiling the driver traffic list of the urban rail transit according to claim 1, wherein the spatial and temporal conflict check is performed on the driver traffic data by:
judging whether the getting-off transfer station of the previous driver task of the same driver is the getting-on transfer station of the next driver task, if so, checking the space conflict;
and judging whether the train receiving time of each task of the same driver is earlier than the arrival time of the train of the next task, if not, the time conflict check is passed.
8. The method for automatically compiling an urban rail transit driver traffic list according to claim 7, wherein if the spatial conflict check fails or the time conflict check fails, a task of failing the spatial conflict check or the time conflict check is output.
9. The method for automatically compiling the driver traffic list of the urban rail transit according to claim 1, wherein the step of correcting the hot standby information according to the hot standby information in the configuration file to generate the task library to be arranged comprises the following steps of: according to the hot standby information in the configuration file, cutting hot standby time of a hot standby vehicle into a first hot standby time period, a second hot standby time period and a third hot standby time period according to hot standby starting time, hot standby first midpoint time, hot standby second midpoint time and hot standby ending time to generate a hot standby task to be scheduled, wherein the hot standby vehicle and corresponding hot standby time and hot standby stations are contained in the hot standby information, and the hot standby task to be scheduled comprises the first hot standby time period, corresponding first hot standby stations, corresponding second hot standby time periods, corresponding second hot standby stations, corresponding third hot standby time periods and corresponding third hot standby stations; and replacing the hot standby vehicle driver task in the task library with the hot standby task to be scheduled to generate a task library to be scheduled.
10. A system for automatically compiling a driver traffic list of urban rail transit is characterized by comprising a data interface device, a remote management center, a cloud data storage server and a visual display device,
the data interface device comprises a data acquisition device, an acquisition controller and a data output interface; the data acquisition end of the acquisition controller is in communication connection with the data acquisition device; the data acquisition device is in communication connection with a data storage server of the ATS system; the data output end of the acquisition controller is in communication connection with the data output interface;
the remote management center comprises a data processing unit, a routing unit and a correctness verification unit,
the remote management center sends a data acquisition control signal to the acquisition controller, receives train working diagram data output by a data output interface, and the train working diagram data are processed by a data processing unit, a traffic route arrangement unit and a correctness verification unit in sequence and output traffic route data of each driver to the cloud data storage server; the remote management center also controls the cloud data storage server to send the stored traffic data of each driver to a plurality of visual display devices, so that real-time sharing of information is realized;
the data processing unit prestores a configuration file containing driver transfer station information and hot standby information, receives the train running chart data output from the data output interface, segments the train running chart data into a plurality of driver tasks according to the number of the driver transfer stations, sorts the driver tasks according to time sequence to generate a task library, performs data correction on the task library according to the hot standby information in the configuration file to generate a task library to be arranged, and outputs the task library to be arranged to the traffic routing unit;
the traffic route arrangement unit inputs the task library to be arranged from the data processing unit, sequentially arranges each driver task in the task library to be arranged, screens drivers according to constraint conditions and outputs primary driver traffic route data;
the correctness verifying unit inputs the preliminary driver traffic data from the traffic arrangement unit, performs spatial and temporal conflict check on the preliminary driver traffic data, and outputs the traffic data of each driver.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910422197.0A CN110163501B (en) | 2019-05-21 | 2019-05-21 | System and method for automatically compiling driver traffic list of urban rail transit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910422197.0A CN110163501B (en) | 2019-05-21 | 2019-05-21 | System and method for automatically compiling driver traffic list of urban rail transit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110163501A CN110163501A (en) | 2019-08-23 |
| CN110163501B true CN110163501B (en) | 2022-11-29 |
Family
ID=67631553
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910422197.0A Active CN110163501B (en) | 2019-05-21 | 2019-05-21 | System and method for automatically compiling driver traffic list of urban rail transit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110163501B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111547113B (en) * | 2020-05-22 | 2022-04-19 | 卡斯柯信号(成都)有限公司 | Automatic scheduling method for subway driver positive line multi-point value multiplication |
| CN112418733A (en) * | 2020-12-14 | 2021-02-26 | 西安市轨道交通集团有限公司 | Intelligent checking system for subway riding traffic scheme |
| CN112967519B (en) * | 2021-02-01 | 2022-05-13 | 青岛海信网络科技股份有限公司 | Public transport means scheduling method, device and equipment |
| CN113320577B (en) * | 2021-06-21 | 2022-05-13 | 北京交通大学 | Automatic urban rail train running chart compiling method for single-running intersection |
| CN114312923B (en) * | 2021-12-31 | 2023-05-12 | 河南思维自动化设备股份有限公司 | LKJ source file automatic compiling method |
| GB2622294A (en) * | 2022-05-25 | 2024-03-13 | Zhuhai Unitech Power Tech Co | First object allocation method and apparatus, storage medium and electronic apparatus |
| CN115438898B (en) * | 2022-05-25 | 2023-05-26 | 珠海优特电力科技股份有限公司 | Method and device for distributing first object, storage medium and electronic device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102930399A (en) * | 2012-11-07 | 2013-02-13 | 深圳市地铁三号线投资有限公司运营分公司 | Scheduling method of subway attendant management system |
| WO2016045195A1 (en) * | 2014-09-22 | 2016-03-31 | 北京交通大学 | Passenger flow estimation method for urban rail network |
| CN106845743A (en) * | 2015-12-04 | 2017-06-13 | 河南蓝信科技股份有限公司 | A kind of EMUs driver manipulation information moves back diligent analysis method and its system |
-
2019
- 2019-05-21 CN CN201910422197.0A patent/CN110163501B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102930399A (en) * | 2012-11-07 | 2013-02-13 | 深圳市地铁三号线投资有限公司运营分公司 | Scheduling method of subway attendant management system |
| WO2016045195A1 (en) * | 2014-09-22 | 2016-03-31 | 北京交通大学 | Passenger flow estimation method for urban rail network |
| CN106845743A (en) * | 2015-12-04 | 2017-06-13 | 河南蓝信科技股份有限公司 | A kind of EMUs driver manipulation information moves back diligent analysis method and its system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110163501A (en) | 2019-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110163501B (en) | System and method for automatically compiling driver traffic list of urban rail transit | |
| CN108082224B (en) | Urban rail transit train running chart compiling method based on AFC time-varying passenger flow | |
| Kang et al. | A practical model for last train rescheduling with train delay in urban railway transit networks | |
| CN111452669B (en) | Intelligent bus charging system and method and medium | |
| CN111915176A (en) | Scheduling method and system of pure electric bus in hybrid operation mode | |
| CN105575108A (en) | Intelligent bus dispatching operation method | |
| CN111161560B (en) | Bus corridor operation order management method and device | |
| Li et al. | Train rescheduling with stochastic recovery time: A new track-backup approach | |
| Fleurent et al. | Transit timetable synchronization: Evaluation and optimization | |
| Ceder et al. | Measuring public transport connectivity performance applied in Auckland, New Zealand | |
| CN111291303A (en) | Electric bus scheduling optimization method considering heterogeneity of shift | |
| CN110766196A (en) | Regular bus operation system based on enterprise employee requirements | |
| CN115204561A (en) | Scheduling system and method for unmanned bus taxi appointment operation | |
| CN114971136A (en) | Bus and tour bus scheduling method | |
| Xiao et al. | Optimizing coordinated transfer with probabilistic vehicle arrivals and passengers' walking time | |
| CN111547113B (en) | Automatic scheduling method for subway driver positive line multi-point value multiplication | |
| Lai et al. | Resilient schedule coordination for a bus transit corridor | |
| CN112289065A (en) | Customized bus route design method and system based on accurate OD big data | |
| CN114331231B (en) | Method and system for scheduling public transport | |
| CN115238997A (en) | Urban rail transit operation scheme optimization method based on passenger flow data | |
| Armellini | Simulation of Demand Responsive Transport using a dynamic scheduling tool with SUMO | |
| Liu et al. | Research in public transport vehicle scheduling | |
| Zhou et al. | Computationally efficient dynamic assignment for on-demand ridesharing in congested networks | |
| Armellini et al. | Simulation of a Demand Responsive Transport feeder system: A case study of Brunswick | |
| CN106683029A (en) | Evaluation method and system for first and last bus on-time rate |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |