JP6889130B2 - Operation control support system and operation control support method - Google Patents

Description

The present invention relates to a technique for supporting the elimination of disturbances in an operation plan.

For example, Patent Documents 1 and 2 disclose an operation rearrangement support system for supporting the elimination of disturbances in the operation plan.

For those disclosed in Patent Document 1, a database in which operation reorganization conditions and operation reorganization proposal contents for each condition are registered is created in advance, and an operation reorganization plan is automatically created by referring to the database when a timetable disorder occurs. It is what you do. This solves the problem that the grasping of the delay situation and the transmission of the command are becoming considerably automated, but the preparation of the operation reorganization plan is still a heavy burden on the commander.

What is disclosed in Patent Document 2 is that the operation rearrangement conditions and the operation rearrangement contents are patterned in advance, the global train schedule is automatically changed when the schedule is disturbed, and then a small part of the part that does not match the pattern is small-scale. Manual timetable correction. This is because the process of detecting "faulty" parts in the train schedule and correcting those parts is repeated in sequence, and the process becomes more complicated as the number of trains subject to operation control increases. It solves the problem.

Special Fair 7-64257 Gazette Japanese Patent No. 4597811

In both of the techniques described in Patent Document 1 and Patent Document 2, it is necessary to manually implement the operation control conditions and the operation control contents for each condition, that is, the operation control rules in advance. Generally, the operation control rules are implemented by interviewing the commander of the railway company to which the operation control support system is delivered, or by analyzing the logs of the current operation control support system, but this takes a lot of time. It takes. In addition, the operation control rules themselves are based on empirical rules in both methods. Therefore, it is necessary to carry out the same work again when the operation reorganization policy changes due to a change in equipment conditions or when the operation reorganization support system is deployed on another route.

An object of the present invention is to provide a technique for reducing the work performed in advance in order to support the operation control in the operation control support system.

The operation reorganization support system according to one aspect of the present invention is an operation reorganization support system that supports operation reorganization for a given situation in operation according to a preset planning schedule, and the operation reorganization has been executed in the past. Operation based on the history planning timetable, which is the planning timetable set at the time, the history prediction timetable, which is the prediction timetable predicted at that time, and the history operation arrangement operation, which is the operation arrangement operation performed at that time. Supports operation rearrangement for the situation based on the storage device that holds the rearrangement history information, the input plan timetable that is the plan timetable in the given situation, and the input prediction timetable that is the prediction timetable that is predicted in that situation. It has a processing device that executes processing using the operation rearranging history information, and the operation rearrangement history information includes history difference information representing the difference between the history planning timetable and the history prediction timetable, and history operation representing the history operation rearranging operation. The processing device generates input difference information representing the difference between the input planning timetable and the input prediction timetable, including the rearranging operation information, compares the input difference information with the history difference information, and sets the input difference information and the history difference information. Based on the comparison result of the above and the historical operation reorganization operation, the recommended operation reorganization operation for the situation is determined.

It is possible to make an operation reorganization proposal without setting an operation reorganization rule that relies on empirical rules in advance.

FIG. 1 is a block diagram showing a configuration of an operation control support system according to the present embodiment. It is a figure which shows an example of the operation situation of the train which performs the operation reorganization by the operation reorganization support system shown in FIG. It is a figure which shows an example of the running prediction of the future train on the premise that the operation reorganization is not executed by the operation reorganization support system shown in FIG. It is a flowchart for demonstrating the process in the operation control support system shown in FIG. It is a plan diagram data showing a train operation situation shown in FIG. 2A. It is the prediction timetable data showing the train operation situation shown in FIG. 2B. It is a figure which shows a part of the planning network generated from the planning diagram data shown in FIG. 4A. It is a figure which shows a part of the prediction network generated from the prediction diagram data shown in FIG. 4B. It is a figure which shows the planned network link information table generated from the planned network shown in FIG. 5A. It is a figure which shows the planning network node information table generated from the planning network shown in FIG. 5A. It is a figure which shows the prediction network link information table generated from the prediction network shown in FIG. 5B. It is a figure which shows the prediction network node information table generated from the prediction network shown in FIG. 5B. Differences generated from the planned network link information table shown in FIG. 6A and the planned network node information table shown in FIG. 6B, and the predicted network link information table shown in FIG. 7A and the predicted network node information table shown in FIG. 7B. It is a figure which shows the network. It is a figure which shows the difference network link information table generated from the difference network shown in FIG. It is a figure which shows the difference network node information table generated from the difference network shown in FIG. It is a figure which shows the main difference network information table generated from the difference network link information shown in FIG. 9A and the prediction network node information table shown in FIG. 7B. It is a figure which shows an example of the operation arrangement history information table shown in FIG.

Hereinafter, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing a configuration of an operation control support system according to the present embodiment. The operation control support system according to this embodiment is applied to a railway operation management system as an example.

The operation control support system in this embodiment is composed of a computer, a database (DB) 1200 formed in a storage device to store various data, a processing device 1100 for executing a program, and an input device 1300 for inputting data by a user. And a display device 1400 that displays various data including the processing results of the system.

The database 1200 includes a planned network link information table 1210, a planned network node information table 1220, a predicted network link information table 1230, a predicted network node information table 1240, a differential network link information table 1250, and a differential network node information table 1260. It has a main difference network information table 1270 and an operation rearrangement history information table 1280.

The planning network link information table 1210 stores the link information of the planning network representing the order relationship and the time interval between the planned arrival time and the planned departure time in the planning timetable.

The planning network node information table 1220 stores the node information of the planning network.

The predicted network link information table 1230 stores the linked information of the predicted network representing the order relationship and the time interval between the predicted arrival time and the predicted departure time in the prediction timetable.

The predicted network node information table 1240 stores the node information of the predicted network.

The difference network link information table 1250 stores the link information of the difference network representing the difference between the planned network and the predicted network.

The difference network node information table 1260 stores the node information of the difference network.

The main difference network information table 1270 stores information on the main difference network representing the location of the cause of the timetable disorder.

The operation reorganization history information table 1280 stores the main difference network at the time of executing the past operation reorganization operation, the operation reorganization operation information, the change location information of the planning network, and the cumulative number of executions of each operation reorganization operation.

The processing device 1100 includes a planning network data generation unit 1110, a prediction network data generation unit 1120, a difference network data generation unit 1130, a main difference network extraction unit 1140, the same main difference network search unit 1150, and operation adjustment operation input. It has a screen display unit 1160 and an operation rearranging operation execution unit 1170, and by executing a predetermined application program, the processing functions of the above-mentioned units are realized.

The planning network data generation unit 1110 generates planning network data that represents the arrival / departure time of each station of each train as a node, the order relationship between arrival / departure times, and the time interval as a weighted link from the planning diagram data that represents the operation plan information of the train. Then, it is stored in the planning network link information table 1210 and the planning network node information table 1220.

The prediction network data generation unit 1120 generates the prediction network data in the same manner as when generating the planning network data from the prediction diagram data representing the train operation prediction information, and generates the prediction network link information table 1230 and the prediction network node information table 1240. Store in.

The differential network data generation unit 1130 obtains differential network data representing the difference between the planned network and the predicted network from the planned network link information table 1210, the planned network node information table 1220, the predicted network link information table 1230, and the predicted network node information table 1240. It is generated and stored in the differential network link information table 1250 and the differential network node information table 1260.

The main difference network extraction unit 1140 generates main difference network data representing the location of the cause of the timetable disturbance from the difference network link information table 1250 and the difference network node information table 1260, and stores the same main difference network search in the main difference network information table 1270. The unit 1150 searches the main difference network data which is the same as the main difference network data stored in the main difference network information table 1270 from the operation reorganization history information table 1280 which stores the past main difference network data and the operation reorganization operation related data. ..

The operation reorganization operation input screen display unit 1160 searches the operation reorganization operation input screen data corresponding to the main difference network data searched from the operation reorganization history information table 1280 from the operation reorganization history information table 1280 and outputs the data to the display device 1400.

The operation reorganization operation execution unit 1170 updates the plan schedule data and the operation reorganization history information table based on the input operation reorganization operation contents.

The input device 1300 is an input device such as a mouse or a keyboard used in a computer system.

The output device 1400 is an output device such as a display.

The processing in the operation control support system configured as described above will be described below.

First, the operation status of the train in which the operation reorganization is executed by the operation reorganization support system of this embodiment will be described.

FIG. 2A is a diagram showing an example of an operation situation of a train in which operation reorganization is executed by the operation reorganization support system shown in FIG.

In this example, as shown in FIG. 2A, the ordinary train 1 train and the limited express train 2 train traveling in the downward direction are all intermediate stations A station, B station, C station, D station and E station. It is a section. The regular train 1 departs from A station and stops at all of B station, C station, D station and E station, and the limited express train 2 departs from A station and departs from B station, C station and D station. Pass and stop at E station. In FIG. 2A, the train travel plans of the ordinary train 1 and the limited express train 2 are represented by the time on the horizontal axis and the on-line position on the vertical axis.

Here, there are two down train lines at B station and E station, the regular train 1 train uses lines 1 and 3 at B station and E station, respectively, and the limited express train 2 train uses B station and E station, respectively. Use lines 2 and 4 at each of the E stations. In addition, the regular train 1 train will wait for the limited express train 2 train to pass at station B.

The planned departure time of A station for ordinary train 1 is time 3110, the planned arrival time of B station for ordinary train 1 is time 3120, and the planned departure time of B station for ordinary train 1 is time 3130. The planned arrival time at C station of 1 le is time 3140, the planned departure time of C station of 1 le is time 3150, the planned arrival time of D station of 1 le is 3160, and the planned arrival time of D station of 1 le is time 3160. The planned departure time of D station is time 3170, the planned arrival time of E station of ordinary train 1 is 3180, and the planned departure time of E station of ordinary train 1 is 3190.

Further, the A station planned departure time of the limited express train 2 is time 3210, the B station planned passing time of the limited express train 2 is time 3220, and the C station planned passing time of the limited express train 2 is time 3230. The D station planned transit time of the limited express train 2 is time 3240, the E station planned arrival time of the limited express train 2 is time 3250, and the E station planned departure time of the limited express train 2 is time 3260.

FIG. 2B is a diagram showing an example of a running prediction of a future train on the premise that the operation reorganization is not executed by the operation reorganization support system shown in FIG.

In this example, the predicted departure time of A station of the regular train 1 is time 3310, the predicted arrival time of B station of the regular train 1 is time 3320, and the predicted departure time of B station of the regular train 1 is time 3330. The predicted arrival time at C station of the regular train 1 is time 3340, the predicted departure time of C station of the regular train 1 is 3350, and the predicted arrival time of D station of the regular train 1 is 3360. The predicted departure time of D station of the ordinary train 1 is time 3370, the estimated arrival time of E station of the ordinary train 1 is 3380, and the estimated departure time of E station of the ordinary train 1 is 3390.

Further, the predicted departure time of A station of the limited express train 2 is time 3410, the predicted passing time of B station of the limited express train 2 is time 3420, and the predicted passing time of C station of the limited express train 2 is time 3430. The predicted transit time of D station of the limited express train 2 is time 3440, the predicted arrival time of E station of the limited express train 2 is 3450, and the predicted departure time of E station of the limited express train 2 is 3460.

In this example, the estimated departure time of A station of the limited express train 2 is 3410, which is 1 minute and 30 seconds later than the planned departure time of A station of the limited express train 2A 3210 shown in FIG. 2A. It is predicted that the arrival and departure times of the regular train 1 train, which waits for the passage of the limited express train 2 train, will be delayed after the departure from station B.

Further, the mark indicated by the white square in the figure indicates that the predicted arrival time or the predicted departure time is delayed by 2 minutes or more from the planned arrival time or the planned departure time of the corresponding portion in FIG. 2A. Mark 3510 is the estimated departure time of B station of 1 ordinary train, Mark 3520 is the estimated arrival time of C station of 1 ordinary train, Mark 3530 is the estimated departure time of C station of 1 ordinary train, and Mark 3540 is the estimated departure time of C station of ordinary train. The estimated arrival time at D station of 1 le is the predicted arrival time of D station of 1 le, mark 3550 is the estimated departure time of D station of 1 le of ordinary train, the mark 3560 is the estimated arrival time of E station of 1 le of ordinary train, and the mark 3570 is E station of 1 le of ordinary train. It indicates that the predicted departure time is delayed by 2 minutes or more from the planned arrival time or the planned departure time of the relevant location, respectively.

FIG. 3 is a flowchart for explaining the processing in the operation control support system shown in FIG.

When the planned timetable data and the predicted timetable data are input from the input device 1300, the plan network data generation unit 1110 first sets each station planned arrival time and planned departure time for each train as nodes from the input plan timetable data. The order relationship between these, the order relationship between the planned arrival times and the planned departure times of the trains before and after each station, and the order between the planned arrival times and the planned departure times of the trains before and after using the same track for each station. Planned network data with the relationship as the directed link and the time interval as the weight of the directed link is generated and stored in the planned network link information table 1210 and the planned network node information table 1220, respectively. Further, the prediction network data generation unit 1120 generates prediction network data from the prediction diagram data input from the input device 1300 in the same manner as in the case of the planning network data, and the prediction network link information table 1230 and the prediction network node information table. Each is stored in 1240 (step 2100). In this way, the planned timetable and the predicted timetable are expressed using a directed network that expresses the context of the time with a directed link, and by using the difference network, the transportation means that the operation of vehicles before and after the time is correlated. You can get information that will help you to organize your operation. Vehicles here include not only railway trains but also other vehicles such as buses and airplanes that operate according to the schedule.

FIG. 4A is a plan diagram data showing the train operation status shown in FIG. 2A.

The planning timetable data input to the input device 1300 is an input planning timetable, and as shown in FIG. 4A, for each of the regular train 1 and the limited express train 2 at each station from A station to E station. It is composed of arrival time, departure time, and track information, and the planning network data generation unit 1110 will generate planning network data using these information.

FIG. 4B is forecast timetable data showing the train operation status shown in FIG. 2B.

The prediction timetable data input to the input device 1300 is an input prediction timetable, and as shown in FIG. 4B, for each of the regular train 1 and the limited express train 2 at each station from A station to E station. It is composed of arrival time, departure time, and track information, and the planning network data generation unit 1110 will generate predicted network data using these information.

FIG. 5A is a diagram showing a part of the planning network generated from the planning diagram data shown in FIG. 4A.

As shown in FIG. 5A, the planning network data generation unit 1110 uses the planning diagram data shown in FIG. 4A to determine the order relationship between the planned arrival time and the planned departure time of each station for each train and the planning of the trains before and after each station. The order relationship between the arrival time and the planned departure time and the order relationship between the planned arrival time and the planned departure time of the trains before and after using the same line for each station are set as the directed link, and the time interval between the times is directed. The planned network data to be the weight of the link will be generated.

FIG. 5B is a diagram showing a part of the prediction network generated from the prediction diagram data shown in FIG. 4B.

As shown in FIG. 5B, the planning network data generation unit 1110 uses the predicted timetable data shown in FIG. 4B to determine the order relationship between the planned arrival time and the planned departure time of each station for each train and the planning of the trains before and after each station. The order relationship between the arrival time and the planned departure time and the order relationship between the planned arrival time and the planned departure time of the trains before and after using the same line for each station are set as the directed link, and the time interval between the times is directed. Predictive network data to be the weight of the link will be generated.

FIG. 6A is a diagram showing a planned network link information table generated from the planned network shown in FIG. 5A, and FIG. 6B is a diagram showing a planned network node information table generated from the planned network shown in FIG. 5A.

As shown in FIG. 6A, the planning network data generation unit 1110 has a planning network link in which the starting node, the ending node, and the time interval thereof are associated with the link ID for each link based on the planning network data shown in FIG. 5A. Register the information table.

Further, as shown in FIG. 6B, the planning network data generation unit 1110 registers the planning network node information table in which the planning time is set for each node based on the planning network data shown in FIG. 5A.

FIG. 7A is a diagram showing a predicted network link information table generated from the predicted network shown in FIG. 5B, and FIG. 7B is a diagram showing a predicted network node information table generated from the predicted network shown in FIG. 5B.

As shown in FIG. 7A, the prediction network data generation unit 1120 is based on the prediction network data shown in FIG. 5B, and the prediction network link in which the start node, the end node, and the time interval thereof are associated with the link ID for each link. Register the information table.

Further, as shown in FIG. 7B, the prediction network data generation unit 1120 registers a prediction network node information table in which a planned time is set for each node based on the prediction network data shown in FIG. 5B.

Next, the differential network data generation unit 1130 predicts that the planned network is a directed network from the planned network link information table 1210 and the planned network node information table 1220, and the predicted network link information table 1230 and the predicted network node information table 1240. The differential network data to be the input differential network obtained by taking the difference from the directed network of the diamond is generated and stored in the differential network link information table 1250 and the differential network node information table 1260 (step 2200).

FIG. 8 shows the planned network link information table 1210 shown in FIG. 6A and the planned network node information table 1220 shown in FIG. 6B, and the predicted network link information table 1230 shown in FIG. 7A and the predicted network node information shown in FIG. 7B. It is a figure which shows the differential network generated from the table 1240.

As shown in FIG. 8, the differential network generated by the differential network data generation unit 1130 includes a planned network link information table 1210 and a planned network node information table 1220, and a predicted network link information table 1230 and a predicted network node information table 1240. It is composed of a link with a difference in weight in the comparison result and a node with a difference in arrival time or departure time.

The difference network can be divided into a main difference network and a sub-difference network defined later, and as a result of the division, only one main difference network or one main difference network and one or more sub-difference networks can be used. Will be generated.

9A is a diagram showing a differential network link information table generated from the differential network shown in FIG. 8, and FIG. 9B is a diagram showing a differential network node information table generated from the differential network shown in FIG. is there.

As shown in FIG. 9A, the difference network data generation unit 1130 has a start node and an end node for each link, and a difference in which the difference time interval is associated with the link ID, based on the difference network data shown in FIG. Register the network link information table.

Further, as shown in FIG. 9B, the difference network data generation unit 1130 registers the difference network node information table in which the difference time is set for each node based on the difference network data shown in FIG.

The difference network link information table does not have to store the information of the link with no difference in weight, and the difference network node information table stores the information of the node with no difference in arrival time or departure time. You don't have to.

Next, the main difference network extraction unit 1140 extracts the main difference network from the difference network link information shown in FIG. 9A (step 2300). Specifically, the main difference network extraction unit 1140 extracts a link having a weight of 2 minutes or more from the difference network link information shown in FIG. 9A, and predicts the arrival time or the predicted departure time corresponding to the starting node of each extracted link. The times are compared using the predicted network node information table shown in FIG. 7B. Then, the link starting from the node with the earliest arrival time or departure time is specified as the disturbance factor link, and the information of the disturbance factor link and the link in which the node and the weight are different from the disturbance factor link are used. Stores all traced link information in the main difference network information table. In this way, the departure and arrival of trains that caused the subsequent disruption of operation and the arrival and departure of trains affected by it are compared as the main part (main difference network), and the given situation and history are compared. Therefore, it is possible to efficiently find a history that matches the given situation of the operation of the main part. Here, the main difference network refers to a subgraph consisting of a disturbance factor link and all nodes and links traced from the disturbance factor link via a node and a link in which a difference in weight occurs in the difference network. In addition, a plurality of subgraphs of the difference network other than the main difference network will be referred to as sub-difference networks.

FIG. 10 is a diagram showing a main difference network information table generated from the difference network link information shown in FIG. 9A and the predicted network node information table shown in FIG. 7B.

As shown in FIG. 10, the main differential network information table generated from the differential network link information shown in FIG. 9A and the predicted network node information table shown in FIG. 7B is the node having the earliest arrival time or departure time, as shown in FIG. It is composed of the information of the disturbance factor link starting from the above and all the link information traced from the disturbance factor link via the link in which the node and the weight are different. Information on the planned arrival time or the planned departure time of the starting node of each link may be added to each record in the main difference network information table 1270.

Next, the same difference network search unit 1500 predicts the main difference network information table stored in the operation reorganization history information table 1280, that is, the planning timetable set when the past operation reorganization is executed. The main difference network information table, which is the difference from the predicted timetable, is compared with the main difference network information table shown in FIG. 10, and the main difference network information table, which is the history difference network stored in the operation rearrangement history information table 1280, is used. It is repeatedly determined whether or not there is the same table as the main difference network information table shown in FIG. 10 (step 2400). This repetition is performed when the same main difference network information table is detected or when the determination is completed for all the main difference network information tables in the operation reorganization history information table 1280, that is, the same main difference network information table is used. Exit if not detected.

FIG. 11 is a diagram showing an example of the operation rearrangement history information table 1280 shown in FIG.

As shown in FIG. 11, the operation reorganization history information table 1280 in this example includes the operation ID and operation screen data when the operation reorganization operation is performed for each main difference network information table, and the planning diagram data changed by each operation. The planned network link change information table and the planned network node information table, which represent the changes on the planned network corresponding to, and the cumulative number of operations used for the operation reorganization executed in the past are stored. The details will be described later.

In the above-mentioned repetition determination, the same difference network search unit 1500 first records the first of the records in which the main difference network information table shown in FIG. 10 and the operation arrangement history information table 1280 shown in FIG. 11 store the main difference network information table. It is compared with the main difference network information table of the above, and it is determined whether or not all the data items match (step 2500). In the example shown in FIG. 11, the first main difference network information table of the record storing the main difference network information table and the data items of the main difference network information table shown in FIG. 10 all match.

When these match, the same difference network search unit 1500 sets the main difference network information table determined in step 2500 to match the main difference network information table shown in FIG. 10 with all the data items. On the other hand, the operation screen data for the operation ID having the largest cumulative number of executions is acquired from the corresponding plurality of operation IDs (step 2600). In the example shown in FIG. 11, the operation rearranging screen data for the operation ID 46 having the largest cumulative number of executions among the operation IDs 46, 41, 134, and 97 is acquired. In this operation rearrangement screen data, the operation classification, which is an operation rearrangement input item, is changed in order, the changed section is from B station to E station, the changed order is in the order of 1 regular train, 2 limited express trains, and the order change start station. It shows that the time interval between the planned departure times after the change of the regular train 1 train and the limited express train 2 train is 30 seconds. It should be noted that, among the operation rearrangement input items, each item excluding the operation classification may be changed depending on the type of the operation classification. In this way, the recommended operation reorganization operation can be determined by a simple process of checking whether at least a part of the difference network matches. Further, by acquiring the operation screen data for the operation ID having the largest cumulative number of executions from the corresponding plurality of operation IDs, it is possible to acquire the most appropriate operation screen data executed in the past.

Next, the operation reorganization operation input screen display unit 1160 displays the operation reorganization screen data acquired in step 2600 on the display device 1400 as a recommended operation reorganization operation for the timetable disorder caused by the limited express train 2 as described above. Display (step 2700).

In the operation rearrangement screen data displayed on the display device 1400, as shown in FIG. 11, the operation classification, which is an operation rearrangement input item, changes the operation order, the changed section is from B station to E station, and the changed order is the ordinary train. It includes the order of 1 train, 2 trains of limited express train, and the time interval between the planned departure time of 1 train of regular train and 2 trains of limited express train at the station where the order change starts is 30 seconds. And these are displayed as modifiable.

On the other hand, when the same main difference network information table is not detected in step 2500, the order change is temporarily input in advance as the operation classification in the operation arrangement operation input screen display unit 1160, and the other input items are left blank. Display the operation control screen data. If the same main difference network information table is not detected in step 2500, the operation rearranging screen data may be displayed with all the input items including the operation classification blank. In this way, by displaying the screen that enables the change of the operation order and the like, the information acquired from the operation arrangement history information table 1280 can be customized and used.

The operator uses the input device 1300 to approve, correct, or reject the operation reorganization operation content shown in the operation reorganization screen data displayed on the display device 1400 by pressing the button corresponding to each operation. Do (step 2800). If you want to modify the operation control operation content shown in the operation control screen data displayed on the display device 1400, for example, you can click the drop-down button displayed next to the input window for each item to display the options. Select from or enter directly in the input window.

When the operation reorganization operation content shown in the operation reorganization screen data displayed on the display device 1400 is approved or modified, the operation reorganization operation execution unit 1170 is encouraged by the approved or modified operation reorganization instruction content. The organization operation is determined, the planned network change link information table and the planned network change node information table shown in FIG. 11 are generated, and the corresponding link or node information in the planned network link information table 1210 and the planned network node information table 1220 is updated. To do. Then, the operation reorganization operation execution unit 1170 generates and outputs the plan diagram data from the updated plan network link information table 1210 and the plan network node information table 1220 (step 2900). As a result, the operation schedule can be appropriately changed using the past history.

Further, the same operation screen data as the operation arrangement screen executed here is searched from the operation screen data record corresponding to the main difference network in the operation arrangement history information table 1280, and the cumulative number of executions of the operation is increased by one. If the same operation screen data does not exist in the operation reorganization history information table, a new operation ID is assigned to this operation screen, the cumulative number of executions is set to 1, and the planned network change link information table and the planned network change node information table are combined. Add data to the operation control history information table.

As a result, in the database 1200, a history planning timetable, which is a planning timetable set when the operation reorganization was executed in the past, a history prediction timetable, which is a prediction timetable predicted at that time, and a history prediction timetable, which is a prediction timetable, are executed at that time. This means that the history operation reorganization operation, which is the operation reorganization operation, and the operation reorganization history information based on the operation reorganization operation are retained.

Further, when the operation reorganization operation content shown in the operation reorganization screen data displayed on the display device 1400 is rejected, the operation reorganization operation input screen display unit 1160 temporarily inputs the order change in advance as, for example, the operation classification. For other input items, blank operation control screen data is displayed, and the operation control operation execution unit 1170 selects or inputs input items as appropriate from the operation control operation contents shown in FIG. 11 in the same manner as described above. The information table and the planned network change node information table are generated, and the information of the corresponding link or node in the planned network link information table 1210 and the planned network node information table 1220 is updated. If the operation reorganization operation content shown in the operation reorganization screen data displayed on the display device 1400 is rejected, the operation corresponding to the operation reorganization operation ID having the next highest cumulative number of executions is performed from the operation reorganization history information table 1280. Screen data may be acquired and displayed on the display device 1400.

As described above, in the present embodiment, the history planning timetable, which is a planning timetable set when the operation reorganization was executed in the past, and the history prediction timetable, which is a prediction timetable predicted at that time, are displayed in the database 1200. The history operation rearrangement operation, which is the operation rearrangement operation performed at that time, and the operation rearrangement history information based on the operation are retained, and in the processing device 1100, the input plan timetable, which is the plan timetable in the given situation, and the input plan timetable, depending on the situation. Input difference information representing the difference from the input prediction diamond, which is a predicted prediction diamond, is generated, and the input difference information is compared with the history difference information representing the difference between the history planning timetable and the history prediction timetable, and this comparison result is obtained. And, based on the historical operation reorganization operation, which is the operation reorganization operation performed when the operation reorganization was executed in the past, the recommended operation reorganization operation for the situation is determined. It is not necessary to implement the above in advance, and the preliminary work of operation rearranging support is reduced.

1100 ... Processing device, 1110 ... Plan network data generation unit, 1120 ... Prediction network data generation unit, 1130 ... Difference network data generation unit, 1140 ... Main difference network extraction unit, 1150 ... Same main difference network search unit, 1160 ... Operation control Operation input screen display unit, 1170 ... Operation reorganization operation execution unit, 1200 ... Database, 1210 ... Plan network link information table, 1220 ... Plan network node information table, 1230 ... Prediction network link information table, 1240 ... Prediction network node information table, 1250 ... Difference network link information table, 1260 ... Difference network node information table, 1270 ... Main difference network information table, 1280 ... Operation reorganization history information table, 1300 ... Input device, 1400 ... Display device

Claims (5)

It is an operation reorganization support system that supports operation reorganization for a given situation in operation according to a preset plan schedule.
A history planning timetable, which is a planning timetable representing a pre-planned operation when the operation reorganization was executed in the past, and a history prediction timetable, which is a prediction timetable representing the predicted operation at that time, are executed at that time. A history operation reorganization operation, which is an operation reorganization operation, and a storage device that holds operation reorganization history information based on the operation reorganization operation,
Based on the input planning timetable which is the planning timetable in the given situation and the input prediction timetable which is the prediction timetable predicted in the situation, the process of supporting the operation arrangement for the situation is performed by using the operation arrangement history information. Has a processing device to execute
The operation rearranging history information includes history difference information representing the difference between the history planning timetable and the history prediction timetable, and historical operation rearranging operation information representing the history operation rearranging operation.
The history difference information is a directed network in which the arrival time and departure time of the stop place of the vehicle operated according to the planning schedule are nodes, and the order relationship of the arrival time or departure time between the nodes is a directed link. It is a history difference network obtained by representing the history planning timetable and the history prediction timetable, respectively, and taking the difference between the directed network of the history planning timetable and the directed network of the history prediction timetable.
The processing device is
Said input planning timetable and is intended to display the difference between the input prediction diamonds, said expressed by a directed network said input planning timetable and the input prediction diamonds respectively, directed network with the input prediction diamond of the input plan Dia Generate input difference information, which is an input difference network, by taking the difference from the directed network of
On the basis of the input differential network and at least a portion corresponding to the history difference network that matches historical operation adjustment operations, to determine the recommended operation adjustment operation on the situation,
When there are a plurality of history difference networks that at least partially match the input difference network, the history operation arrangement operation corresponding to the history difference network with the highest cumulative number of executions used for the operation arrangement executed in the past is used. Determine recommended operation reorganization operations,
Operation control support system. The processing device displays a screen on which the operation order of vehicles in the history difference network that at least partially matches the input difference network can be changed.
The operation control support system according to claim 1. The processing device displays a screen capable of changing the operation order of vehicles in any network when there is no history difference network that at least partially matches the input difference network.
The operation control support system according to claim 2. The processing device changes the information of the link or the node included in the history planning diagram by using the operation order changed by using the screen.
The operation control support system according to claim 2. It is an operation reorganization support method that supports operation reorganization for a given situation in operation according to a preset plan schedule.
The computer
Generates input difference information representing the difference between the input planning timetable, which is a planning timetable representing the operation planned in advance in a given situation, and the input prediction timetable, which is a prediction timetable representing the operation predicted in the above situation.
The input difference information is compared with the history difference information representing the difference between the history planning timetable, which is the planning timetable when the operation reorganization was executed in the past, and the history prediction timetable, which is the prediction timetable predicted at that time. ,
Recommended for the situation based on the comparison result between the input difference information and the history difference information and the history operation reorganization operation which is the operation reorganization operation performed when the operation reorganization was executed in the past. is intended to determine the operation adjustment operation that is,
The history difference information is a directed network in which the arrival time and departure time of the stop place of the vehicle operated according to the planning schedule are nodes, and the order relationship of the arrival time or departure time between the nodes is a directed link. It is a history difference network obtained by representing the history planning timetable and the history prediction timetable, respectively, and taking the difference between the directed network of the history planning timetable and the directed network of the history prediction timetable.
The input difference information represents the input planning timetable and the input prediction timetable by the directed network, respectively, and the input difference obtained by taking the difference between the directed network of the input planning timetable and the directed network of the input prediction timetable. Is a network
The computer
Based on the history reorganization operation corresponding to the history difference network that at least partially matches the input difference network, the recommended operation reorganization operation for the situation is determined.
When there are a plurality of history difference networks that at least partially match the input difference network, the history operation arrangement operation corresponding to the history difference network with the highest cumulative number of executions used for the operation arrangement executed in the past is used. Determine the recommended operation reorganization operation,
Operation control support method.

Images