JP2019172142A - Operation arrangement support system and operation arrangement support method - Google Patents

Abstract

To provide an operation arrangement support system in that work performed in advance for supporting the operation arrangement is reduced.SOLUTION: A processing device 1100 generates input difference information showing a difference between an input schedule diagram that is a schedule diagram in a given situation and an input prediction diagram that is a prediction diagram predicted according to a situation and decides operation arrangement control recommended for the situation based on a result obtained by comparing the input difference information and history difference information showing a difference between a history schedule diagram that is a schedule diagram set when the operation arrangement is executed in the past and a history prediction diagram that is a prediction diagram predicted at that time and history operation arrangement control that is operation arrangement control carried out when the operation arrangement is executed in the past.SELECTED DRAWING: Figure 1

Description

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

  For example, Patent Literatures 1 and 2 disclose a driving arrangement support system for assisting in eliminating disturbance of an operation plan.

  In Patent Document 1, a database in which operation arrangement conditions and operation arrangement proposal contents for each condition are registered in advance is created, and an operation arrangement plan is automatically created by referring to the database when a diamond disturbance occurs. Is what you do. This solves the problem that although the grasping of the delay situation and the transmission of the command are being considerably automated, the preparation of the operation arrangement plan is still a heavy burden for the commander.

  In Patent Document 2, the operation arrangement conditions and operation arrangement contents are pre-patterned, and when a schedule disturbance occurs, the global train schedule is automatically changed first, and then a part of the parts that do not match the pattern is small-scaled. Manual diamond correction. This means that the process becomes more complicated as the number of trains that are subject to operation organization increases, by repeating the process of detecting the part of the train diagram that becomes a “failure” and correcting it. It solves the problem.

Japanese Examined Patent Publication No. 7-64257 Japanese Patent No. 4597811

  In the techniques described in Patent Literature 1 and Patent Literature 2, it is necessary to manually implement in advance an operation arrangement condition and operation arrangement contents for each condition, that is, an operation arrangement rule. In general, implementation of the operation adjustment rules is conducted by interviewing the commander of the railway company to which the operation adjustment support system is delivered or by analyzing the log of the current operation adjustment support system, but this takes a lot of time. Cost. In addition, both methods are based on the rules of thumb for driving arrangement rules themselves. Therefore, it is necessary to perform the same operation again when the driving arrangement policy changes due to a change in equipment conditions or when the driving arrangement support system is deployed on other routes.

  An object of the present invention is to provide a technique for reducing work performed in advance to support driving arrangements in the driving arrangement assistance system.

  An operation arrangement support system according to one aspect of the present invention is an operation arrangement support system that supports operation arrangement for a given situation in operation according to a preset schedule, and the operation arrangement is executed in the past. Operation based on a history plan diagram that is a plan diagram that is set at the time, a history prediction diagram that is a prediction diagram that is predicted at that time, and a history operation organization operation that is an operation organization operation performed at that time Based on the storage device that holds the arrangement history information, the input plan diagram that is the plan diagram in the given situation, and the input prediction diagram that is the forecast figure that is predicted in the situation, it supports the driving arrangement for that situation A processing device that executes processing using the driving arrangement history information, and the driving arrangement history information indicates the difference between the history plan diagram and the history prediction diagram. The processing device generates input difference information representing the difference between the input planning diagram and the input prediction diagram, and includes the input difference information and the history difference. The information is compared, and based on the comparison result between the input difference information and the history difference information and the history driving organization operation, the recommended driving organization operation is determined for the situation.

  Driving arrangement proposals can be made without setting the driving arrangement rules that depend on empirical rules in advance.

FIG. 1 is a block diagram showing the configuration of the driving arrangement support system according to the present embodiment. It is a figure which shows an example of the driving | running state of the train in which driving | running | working arrangement | sequence is performed by the driving | operation arrangement | positioning assistance system shown in FIG. It is a figure which shows an example of the driving | running | working prediction of the future train on the assumption that driving | running | working arrangement | positioning is not performed by the driving | operation arrangement | positioning assistance system shown in FIG. It is a flowchart for demonstrating the process in the driving | operation arrangement | positioning assistance system shown in FIG. It is plan diagram data showing the train operation situation shown in FIG. 2A. It is the prediction diamond data showing the train driving | running state shown to FIG. 2B. It is a figure which shows a part of plan network produced | generated from the plan diagram data shown to FIG. 4A. It is a figure which shows a part of prediction network produced | generated from the prediction diamond data shown to FIG. 4B. It is a figure which shows the plan network link information table produced | generated from the plan network shown to FIG. 5A. It is a figure which shows the plan network node information table produced | generated from the plan network shown to FIG. 5A. It is a figure which shows the prediction network link information table produced | generated from the prediction network shown to FIG. 5B. It is a figure which shows the prediction network node information table produced | generated from the prediction network shown to 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 a network. It is a figure which shows the difference network link information table produced | generated from the difference network shown in FIG. It is a figure which shows the difference network node information table produced | generated from the difference network shown in FIG. It is a figure which shows the main difference network information table produced | generated from the difference network link information shown to FIG. 9A, and the prediction network node information table shown to FIG. 7B. It is a figure which shows an example of the driving | operation arrangement | sequence history information table shown in FIG.

  Embodiments of the present invention will be described below with reference to the drawings.

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

  The driving arrangement support system according to the present embodiment is configured by a computer, and is formed in a storage device and includes a database (DB) 1200 that stores various data, a processing device 1100 that executes a program, and an input device 1300 that allows a user to input data. And a display device 1400 for displaying various data including 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 difference network link information table 1250, and a difference network node information table 1260. And a main difference network information table 1270 and an operation arrangement history information table 1280.

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

  The planned network node information table 1220 stores planned network node information.

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

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

  The difference network link information table 1250 stores 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 node information of the difference network.

  The main difference network information table 1270 stores information of the main difference network that represents the cause part of the diagram disturbance.

  The operation organization history information table 1280 stores the main difference network, operation organization operation information, plan network change location information, and the cumulative number of execution times of each operation organization operation when past operation organization operations are executed.

  The processing device 1100 includes a planned network data generation unit 1110, a predicted network data generation unit 1120, a difference network data generation unit 1130, a main difference network extraction unit 1140, an identical main difference network search unit 1150, and a driving arrangement operation input. It has a screen display unit 1160 and a driving arrangement operation execution unit 1170, and realizes the processing functions of each unit described above by executing a predetermined application program.

  The plan network data generation unit 1110 generates plan network data that represents the arrival / departure times of each train as nodes, the order relationship between the arrival / departure times, and the time interval as weighted links from the plan diagram data representing train operation plan information. And stored in the planned network link information table 1210 and the planned network node information table 1220.

  The prediction network data generation unit 1120 generates prediction network data in the same manner as when the plan network data is generated from the prediction diagram data representing the train operation prediction information, and the prediction network link information table 1230 and the prediction network node information table 1240. To store.

  The difference network data generation unit 1130 generates difference 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 difference network link information table 1250 and the difference network node information table 1260.

The main difference network extraction unit 1140 generates main difference network data representing a diagram disturbance factor location from the difference network link information table 1250 and the difference network node information table 1260, and stores it in the main difference network information table 1270. The unit 1150 retrieves the same main difference network data as the main difference network data stored in the main difference network information table 1270 from the driving arrangement history information table 1280 storing the past main difference network data and the driving arrangement operation related data. .

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

  The driving arrangement operation execution unit 1170 updates the plan diagram data and the driving arrangement history information table based on the inputted driving arrangement operation content.

  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.

  Below, the process in the driving | operation arrangement | positioning assistance system comprised as mentioned above is demonstrated.

  First, the driving | running | working condition of the train in which driving | running | working arrangement | sequence is performed by the driving | operation arrangement | positioning assistance system of this form is demonstrated.

  FIG. 2A is a diagram illustrating an example of an operation state of a train in which operation adjustment is performed by the operation adjustment support system illustrated in FIG. 1.

  In this example, as shown in FIG. 2A, the ordinary train 1 and the limited express train 2 that travel in the down direction are all intermediate stations A, B, C, D, and E. It is a section. 1 train of ordinary trains departs from station A and stops at all of B station, C station, D station and E station, and 2 trains of limited express trains depart from station A, leaving B station, C station and D station. Pass through and stop at E station. In FIG. 2A, the train travel plans of the ordinary train 1 and the limited express train 2 are shown with the horizontal axis as the time and the vertical axis as the current position.

  Here, there are two trains used at the B station and the E station, and the first train of the regular train uses the first and third lines at the B station and the E station, respectively. Use Line 2 and Line 4 at each E station. In addition, the regular train 1 waits for the passage of the limited express train 2 at the B station.

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

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

  FIG. 2B is a diagram illustrating an example of a future train travel prediction based on the assumption that the operation adjustment is not executed by the operation adjustment support system illustrated in FIG. 1.

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

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

  In this example, the predicted A station departure time 3410 of the 2nd limited express train is delayed by 1 minute 30 seconds from the planned A station departure time 3210 of the 2nd limited express train shown in FIG. In addition, a delay in the arrival and departure times after the departure of station B of the ordinary train 1 train that waits for the passing of the limited express train 2 trains is predicted.

  In addition, a mark indicated by a white square in the drawing 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 location in FIG. 2A. Mark 3510 indicates the estimated departure time of station B for one ordinary train, mark 3520 indicates the estimated arrival time of station C for one ordinary train, mark 3530 indicates the estimated departure time of station C for one ordinary train, and mark 3540 indicates the ordinary train. The estimated arrival time for one train at D station, the mark 3550 for the predicted departure time at the D station for the regular train, the mark 3560 for the predicted arrival time at the E station for the regular train 1 mark, and the mark 3570 for the E station for the regular train 1 train. It shows that the predicted departure time is delayed by 2 minutes or more from the planned arrival time or the planned departure time of the corresponding location.

  FIG. 3 is a flowchart for explaining processing in the driving arrangement support system shown in FIG.

  When plan diagram data and forecast diagram data are input from the input device 1300, first, the plan network data generation unit 1110 uses each plan plan arrival time and plan departure time for each train as nodes from the input plan diagram data, The order relationship between these, the order relationship between the planned arrival and departure times of the preceding and following trains for each station, and the order between the planned arrival and departure times of the preceding and following trains using the same line for each station Plan network data having the relationship as a directed link and the interval between times as the weight of the directed link is generated and stored in the plan network link information table 1210 and the plan network node information table 1220, respectively. Further, the predicted network data generation unit 1120 generates predicted network data from the predicted diamond data input from the input device 1300 in the same manner as in the case of the planned network data, and the predicted network link information table 1230 and the predicted network node information table. Each is stored in 1240 (step 2100). In this way, a plan network and a prediction diagram are expressed using a directed network that represents the time relationship with a directed link, and the difference network is used to correlate the operation of vehicles traveling around the time. It is possible to obtain information that favorably assists driving arrangements. The vehicles mentioned here include not only railroad trains but also other vehicles such as buses and airplanes that operate according to a schedule.

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

  The plan diagram data input to the input device 1300 is an input plan diagram. As shown in FIG. 4A, for each of the ordinary train 1 and the limited express train 2 It consists of arrival time and departure time, and number line information, and the plan network data generation unit 1110 generates plan network data using these information.

  FIG. 4B is prediction diagram data representing the train operation status shown in FIG. 2B.

  The prediction diagram data input to the input device 1300 is an input prediction diagram. As shown in FIG. 4B, for each of the ordinary train 1 train and the limited express train 2 train, each station from station A to station E It is comprised from arrival time and departure time, and number line information, and the plan network data production | generation part 1110 produces | generates prediction network data using such information.

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

  As shown in FIG. 5A, the plan network data generation unit 1110 uses the plan diagram data shown in FIG. 4A to determine the order relationship between each station planned arrival time and planned departure time for each train, and the plan of the trains before and after each station. The ordered relationship between the arrival and departure times and the planned departure times and the ordered relationship between the planned arrival and departure times of the preceding and following trains that use the same line for each station is used as a directed link, and the time interval between them is directed. Planned network data as link weights are 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 plan network data generation unit 1110 uses the predicted diagram data shown in FIG. 4B to determine the order relationship between each station planned arrival time and planned departure time for each train, and the plan of the preceding and following trains for each station. The ordered relationship between the arrival and departure times and the planned departure times and the ordered relationship between the planned arrival and departure times of the preceding and following trains that use the same line for each station is used as a directed link, and the time interval between them is directed. Predictive network data is generated as link weights.

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

  As shown in FIG. 6A, the planned network data generation unit 1110 is based on the planned network data shown in FIG. 5A, and the planned network link in which the start node and 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. 6B, the planned network data generation unit 1110 registers a planned network node information table in which a planned time is set for each node based on the planned network data shown in FIG. 5A.

  7A is a diagram illustrating a predicted network link information table generated from the predicted network illustrated in FIG. 5B, and FIG. 7B is a diagram illustrating a predicted network node information table generated from the predicted network illustrated 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 and the end node and the time interval thereof are associated with the link ID for each link. Register the information table.

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

  Next, the difference network data generation unit 1130 predicts the directed network of the planned diagram 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. Difference network data serving as an input difference network obtained by taking a difference from the directed network of the diamond is generated and stored in the difference network link information table 1250 and the difference network node information table 1260 (step 2200).

  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, 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 difference network produced | generated from the table 1240. FIG.

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

  Note that the difference network can be divided into a main difference network and a sub difference network which will be defined later. As a result of the division, only one main difference network or one main difference network and one or more sub difference networks are included. Generated.

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

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

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

  Note that the difference network link information table does not have to store link information having no difference in weight, and the difference network node information table stores node information having 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 the predicted arrival time or predicted call origination corresponding to the extracted starting node of each link. 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 identified as the disturbance factor link, and through the link of the disturbance factor link and the link in which the node and the weight are different from the disturbance factor link All link information to be traced is stored in the main difference network information table. In this way, the departure and arrival of the train that caused the disturbance of the subsequent operation and the arrival and departure of the affected train are compared as main parts (main difference network), and the given situation and the history are compared. Therefore, it is possible to efficiently find a history that matches the situation where the operation of the main part is given. Here, the main difference network refers to a subgraph composed of a disturbance factor link and all nodes and links traced through a disturbance factor link and a link in which a difference in node and weight is generated from the disturbance factor link. In addition, a plurality of subgraphs other than the main difference network in the difference network are referred to as sub-difference networks, respectively.

  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.

  The 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 is a node having the earliest arrival time or departure time as shown in FIG. Information of the disturbance factor link starting from, and all link information traced from the disturbance factor link via the link in which a difference in node and weight is generated. Note that information on the planned arrival time or the planned departure time of the start 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 is the main difference network information table stored in the driving arrangement history information table 1280, that is, the plan diagram set when the past driving arrangement is executed and the prediction is made at that time. A main difference network information table that is a difference between the predicted difference diagram and the main difference network information table shown in FIG. It is repeatedly determined whether there is the same main difference network information table as 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 arrangement history information table 1280, that is, when the same main difference network information table is stored. Exit if not detected.

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

  As shown in FIG. 11, the operation organization history information table 1280 in this example includes, for each main difference network information table, operation ID and operation screen data when operation organization operation is performed, and plan diagram data changed by each operation. The plan network link change information table and the plan network node information table that represent the change locations on the plan network corresponding to, and the cumulative number of executions of operations used for operation arrangement executed in the past are stored. Details thereof will be described later.

  In the repeated determination, first, the same difference network search unit 1500 starts with the main difference network information table shown in FIG. 10 and the first record of the main difference network information table stored in the operation arrangement history information table 1280 shown in FIG. Are compared with the main difference network information table, 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.

  If they match, the same difference network search unit 1500 sets the main difference network information table determined in step 2500 that all data items match the main difference network information table shown in FIG. On the other hand, 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 driving arrangement screen data for the operation ID 46 having the largest cumulative execution number among the operation IDs 46, 41, 134, 97 is acquired. In this operation rearrangement screen data, the operation classification which is the operation rearrangement input item is the order change, the change section is from B station to E station, the order after change is normal train 1 train, express train 2 train, order change start station It shows that the time interval between the planned departure times of the regular train 1 and the limited express train 2 is 30 seconds. It should be noted that each item other than the operation classification among the operation arrangement input items may be changed depending on the type of operation classification. In this way, a recommended driving arrangement operation can be determined by a simple process for checking whether at least a part of the difference network matches. In addition, by acquiring operation screen data for an operation ID having the largest cumulative number of executions from a plurality of corresponding operation IDs, it is possible to acquire appropriate operation screen data that has been executed most in the past.

  Next, the operation arrangement operation input screen display unit 1160 displays the operation arrangement screen data acquired in step 2600 on the display device 1400 as an operation arrangement operation recommended for the schedule disturbance due to the limited express train 2 as described above. It is displayed (step 2700).

  In the operation arrangement screen data displayed on the display device 1400, as shown in FIG. 11, the operation classification which is the operation arrangement input item is the change of the operation order, the change section is from the B station to the E station, and the changed order is the ordinary train. It includes that the time interval between the 1st train, the 2nd limited express train, the 1st regular train and the 2nd limited express train at the order change start station is 30 seconds. These are displayed so as to be changeable.

  On the other hand, if the same main difference network information table is not detected in step 2500, the driving arrangement operation input screen display unit 1160 is preliminarily input, for example, as the operation classification, and the other input items are left blank. Displays operation screen data. If the same main difference network information table is not detected in step 2500, operation arrangement screen data in which all input items including the operation classification are blank may be displayed. In this way, by displaying the screen that enables the change of the operation order or the like, the information acquired from the driving arrangement history information table 1280 can be customized and used.

  By using the input device 1300, the operator presses a button corresponding to each operation to approve, correct, or reject the operation organization operation content indicated in the operation organization screen data displayed on the display device 1400. Perform (step 2800). In addition, when correcting the operation organization operation content shown in the operation organization screen data displayed on the display device 1400, for example, an option displayed by clicking a drop-down button displayed beside the input window of each item You can either select from or type directly into the input window.

  When the operation organization operation content shown in the operation organization screen data displayed on the display device 1400 is approved or modified, the operation organization operation execution unit 1170 is encouraged from the approved or modified operation organization instruction content. The organizing 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 organization operation execution unit 1170 generates and outputs plan diagram data from the updated plan network link information table 1210 and the plan network node information table 1220 (step 2900). Thereby, a service schedule can be changed appropriately 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 execution count of the operation is increased by one. If the same operation screen data does not exist in the operation arrangement history information table, a new operation ID is assigned to the current operation screen, the cumulative execution count is 1, and together with the planned network change link information table and the planned network change node information table Add data to the operation history information table.

  As a result, the database 1200 includes a history plan diagram that is a plan diagram that was set when operation arrangement was executed in the past, and a history prediction diagram that is a prediction diagram that was predicted at that time, and is executed at that time. The operation arrangement history information based on the history operation arrangement operation, which is the operation arrangement operation that has been performed, is held.

  In addition, when the operation arrangement operation content shown in the operation arrangement screen data displayed on the display device 1400 is rejected, the operation arrangement operation input screen display unit 1160 is preliminarily input in advance, for example, as an operation classification, Other input items display the operation organization screen data with blanks, and the operation organization operation execution unit 1170 similarly selects the input items from the operation organization operation contents appropriately selected or input, as shown in FIG. The information table and the planned network change node information table 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. In addition, when the driving arrangement operation content shown in the driving arrangement screen data displayed on the display device 1400 is rejected, the operation corresponding to the driving arrangement operation ID having the next highest cumulative number of executions from the driving arrangement history information table 1280. The screen data may be acquired and displayed on the display device 1400.

  As described above, in the present embodiment, in the database 1200, a history plan diagram that is a plan diagram that is set when driving arrangement has been executed in the past, and a history prediction diagram that is a prediction diagram predicted at that time, The operation arrangement history information based on the history operation arrangement operation that is the operation arrangement operation performed at that time is held, and in the processing device 1100, an input plan diagram that is a plan diagram in a given situation, and depending on the situation The input difference information representing the difference with the input prediction diagram that is the predicted prediction diagram is generated, the input difference information is compared with the history difference information representing the difference between the history plan diagram and the history prediction diagram, and the comparison result And the recommended driving arrangement for the situation based on the historical driving arrangement operation that was performed when the driving arrangement was executed in the past. Because that will determine the work, it becomes unnecessary to advance implementation of the operation simplification rules, pre-work of driving organize support is reduced.

DESCRIPTION OF SYMBOLS 1100 ... Processing apparatus, 1110 ... Plan network data generation part, 1120 ... Prediction network data generation part, 1130 ... Difference network data generation part, 1140 ... Main difference network extraction part, 1150 ... Same main difference network search part, 1160 ... Operation arrangement Operation input screen display unit, 1170 ... operation arrangement operation execution unit, 1200 ... database, 1210 ... planned network link information table, 1220 ... planned network node information table, 1230 ... predicted network link information table, 1240 ... predicted network node information table, 1250 ... Difference network link information table, 1260 ... Difference network node information table, 1270 ... Main difference network information table, 1280 ... Driving arrangement history information table, 13 0 ... input device, 1400 ... display device

Claims (9)

A driving arrangement support system that supports driving arrangement for a given situation in operation according to a preset schedule diagram,
A history plan diagram that is a plan diagram that represents a planned operation when the above-mentioned operation arrangement is executed in the past, and a history prediction diagram that is a forecast diagram that represents a predicted operation at that time, A history driving arrangement operation that is a driving arrangement operation, a storage device that holds driving arrangement history information based on
Based on the input planning diagram that is a planning diagram in a given situation and the input prediction diagram that is a forecasting diagram that is predicted in the situation, a process that supports driving arrangement for the situation is performed using the driving arrangement history information And a processing device to be executed
The driving arrangement history information includes history difference information representing a difference between the history plan diagram and the history prediction diagram, and history driving arrangement operation information representing the history driving arrangement operation,
The processor is
Generating input difference information representing a difference between the input plan diagram and the input prediction diagram;
Compare the input difference information and the history difference information,
Based on the comparison result between the input difference information and the history difference information and the history driving arrangement operation, a recommended driving arrangement operation for the situation is determined.
Driving arrangement support system. The history difference information is a directed network in which arrival times and departure times of stops of vehicles operated according to the schedule are nodes, and an order relationship between the arrival times or the departure times between the nodes is a directed link. Represents the history plan diagram and the history prediction diagram, respectively, and is a history difference network that takes the difference between the directed network of the history plan diagram and the directed network of the history prediction diagram,
The input difference information represents the input plan diagram and the input prediction diagram by the directed network, respectively, and an input difference obtained by taking a difference between the directed network of the input plan diagram and the directed network of the input prediction diagram Network,
The driving arrangement | positioning assistance system of Claim 1. The processing device determines a recommended driving arrangement operation based on a historical driving arrangement operation corresponding to a historical difference network that at least partially matches the input difference network.
The driving arrangement support system according to claim 2. For each of the history difference network and the input difference network, the processing device starts from a node having the earliest arrival time or departure time as a starting point, and follows a portion traced from the starting point by a link having a node and a difference. And determining whether the main difference network of the history difference network and the main difference network of the input difference network match.
The driving arrangement | positioning assistance system of Claim 3. The processing device, when there are a plurality of history difference networks that at least partially match the input difference network, the history operation corresponding to the history difference network having the highest cumulative number of execution times used for operation arrangement executed in the past Determine the recommended driving arrangement operation based on the arrangement operation;
The driving arrangement | positioning assistance system of Claim 3. The processing device displays a screen that can change the operation order of vehicles in a history difference network that at least partially matches the input difference network.
The driving arrangement | positioning assistance system of Claim 3. When there is no history difference network that at least partially matches the input difference network, the processing device displays a screen that can change the operation order of vehicles in any network.
The driving arrangement | positioning assistance system of Claim 6. The processing device changes link or node information included in the history plan diagram using the operation sequence changed using the screen.
The driving arrangement | positioning assistance system of Claim 6. A driving arrangement support method for supporting driving arrangement for a given situation in operation according to a preset schedule diagram,
Computer
Generating input difference information representing a difference between an input plan diagram which is a plan diagram representing a planned operation in a given situation and an input prediction diagram which is a forecast diagram representing an operation predicted in the situation;
The input difference information is compared with history difference information representing a difference between a history plan diagram that is a plan diagram when the operation arrangement has been executed in the past and a history prediction diagram that is a prediction diagram predicted at that time. ,
Recommended for the situation based on a comparison result between the input difference information and the history difference information, and a history driving organization operation that is a driving organization operation performed when the driving organization was executed in the past Determine the driving arrangements to be performed,
Driving arrangement support method.

Images