JP2013212798A - Route control system and route control method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To facilitate the switching of an order-determining rule in a route control.SOLUTION: In relation to a route control system which issues route control information for controlling a route of a train to a device arranged on a rail track for allowing the train to run thereon, the route control system includes a processor and a memory. Train information including on-rail-track information for exhibiting a position where the train exists on the rail track and constraint information including constraint conditions for determining the route of the train are stored in the memory. The route control system includes: an input and output part allowing a user to input the constraint conditions thereto; a route control model construction part which produces a route control model, including a constraint equation for determining the route of the train, according to the train information; a route control calculation execution part which determines the route of the train by solving the route control model produced by the route control model construction part; and a route control information production part which produces the route control information so that the train runs on the route determined by the route control calculation execution part.

Description

  The present invention relates to a route control system, and more particularly to a route control system in a railway operation management system.

  Control of railway operation management has changed from the conventional manual control of traffic lights by station staff to automatic control by an operation management system. The route control device provided in the operation management system is a device that automates manual operation by station staff. The railway operation management system also has an operation arrangement function that restores the diagram when the diagram is disrupted. And a course control apparatus controls a train according to the result of a driving | running | working control function.

  The route control device acquires the status of the train line from the track circuit, which is ground equipment, through the train central control device that centrally controls the station signals and the switch. Further, the route control device acquires the train schedule from a device that generates and manages the train schedule. Then, the course control device determines the course of the train, that is, the operation of the signal and the switch based on the acquired train status and the train schedule, and further controls the ground equipment based on the determination result. Send.

  Further, the route control device determines the route of the train by determining the order in which the train departs from the station, the order in which the train uses the competition points, and the like.

  The route control method of the train by the route control device has become complicated due to the recent increase in train schedule density, the diversification of vehicles and vehicle types, and the increase in inter-line crossing operation. And in order to respond | correspond to these, the technique regarding the course control apparatus and the operation management system which devised the course setting method or the order judgment method has been developed.

  Specifically, in the route setting of a train, a technology has been proposed that reduces the amount of processing for determining the route setting by determining whether or not the route setting is possible for the route setting candidate selected by the route setting availability information providing device. (For example, refer to Patent Document 1).

  Further, in the train order determination, the entry priority and advance priority for the train to use the competition points are determined based on the implementation schedule, and further, which of the determined entry priority and advance priority is determined. There has been proposed a technique for determining whether the train entry priority and the advance priority are high based on the train line status (see, for example, Patent Document 2). The technique described in Patent Literature 2 performs route control for the competition point use priority (first rank) train and the competition point use non-priority (second rank) train, which are determined based on the determination result.

JP 2004-017670 A JP 2009-083628 A

  The technique described in Patent Literature 1 stores several patterns from the past history for the route setting candidates used for determining whether or not the route setting is possible, and predicts the route based on the pattern. For this reason, when it is desired to set a course by an unstored pattern, and when a determination rule is changed, the stored pattern cannot be changed, so it is not easy to switch the method for predicting the course. .

  The technique described in Patent Document 2 permits use of competition points even for non-priority trains, and enables route control of non-priority trains. However, this is a technique for controlling only the order judgment in a part of equipment, and it is impossible to realize a route control considering other operational restrictions. Furthermore, since the apparatus which implement | achieves patent document 2 implements judgments, such as train competition judgment and order judgment, by procedural programming, when changing an order change judgment rule etc., it is necessary to add a change part to the existing program There is.

  The objective of this invention is providing the course control system which can change the judgment rule for performing course control rapidly.

  According to a typical embodiment of the present invention, a route control system for issuing route control information for controlling a route of the train to a device arranged on a track on which the train travels, the route control system comprising: , A processor, and a memory, and the train information including the track information indicating the position where the train is tracked and the constraint information including the constraint condition for determining the route of the train is stored in the memory. An input / output unit to which the constraint condition is input by a user, a route control model constructing unit that generates a route control model including a constraint equation for determining a route of the train according to the train information, and the route control The route control calculation execution unit that determines the route of the train by solving the route control model generated by the model building unit and the route control calculation execution unit It was such that the train route to progress is, having a route control information generating unit configured to generate the route control information.

  According to an embodiment of the present invention, it is possible to provide a route control system that can quickly change a determination rule for performing route control.

It is a block diagram which shows the structure of the course control system of the 1st Embodiment of this invention. It is a block diagram which shows the structural example of a railway operation management system provided with the course control system of the 1st Embodiment of this invention. It is explanatory drawing which shows an example of the restrictions setting screen of the 1st Embodiment of this invention. It is a flowchart which shows the process in the course control system of the 1st Embodiment of this invention. It is explanatory drawing which shows an example of the wiring of the track | line of the 1st Embodiment of this invention, and the existing track condition of a train. It is explanatory drawing which shows the example of a table structure of the signal information table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the area information table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the course information table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the area competition information table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the course reservation information table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the diagram data table of the 1st Embodiment of this invention. It is explanatory drawing which shows the example of a table structure of the standing train information table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the operation | movement restrictions list table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the basic restriction list table of the 1st Embodiment of this invention. It is explanatory drawing which shows the table structural example of the departure order information table of the 1st Embodiment of this invention. It is a flowchart which shows the process in the course control model construction part of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint conditions regarding the movement of the train of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint type | formula regarding safety | security and interlocking | linking of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint expression of the course reservation constraint of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint formula regarding the relationship between the states of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint expression regarding the diamond of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint equation of the early-prohibition prohibition constraint of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint equation of the departure order observance constraint of the 1st Embodiment of this invention. It is a flowchart which shows the process which produces | generates the constraint equation of the number line compliance restrictions of the 1st Embodiment of this invention. It is a flowchart which shows the process in the restrictions setting regarding the operation | movement of the 1st Embodiment of this invention. It is a flowchart which shows an example of the process which produces | generates the constraint expression of the restrictions regarding the operation | movement of the 1st Embodiment of this invention. It is a block diagram which shows the structure of the course control system of the 2nd Embodiment of this invention. It is explanatory drawing which shows the table structural example of the simulation diagram information table of the 2nd Embodiment of this invention. It is a flowchart which shows the process in the course control system of the 2nd Embodiment of this invention. It is explanatory drawing which shows an example of the screen which a GUI display part displays in order to make a user regenerate the train schedule of the 2nd Embodiment of this invention. It is a block diagram which shows the structure of the course control system of the 3rd Embodiment of this invention. It is explanatory drawing which shows the table structural example of the train schedule information table after a change of the 3rd Embodiment of this invention. It is a flowchart which shows the process in the course control system of the 3rd Embodiment of this invention.

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

(First embodiment)
In the first embodiment, a route control system in a railway operation management system will be described as an application target of the present invention.

  In the first embodiment, the route control system generates a route control model including a constraint equation according to the constraint conditions in order to determine the route of the train. Then, route control information for controlling the route of the train is generated by solving the route control model.

  FIG. 1 is a block diagram showing a configuration of a course control system 100 according to the first embodiment of the present invention.

  The course control system 100 of this embodiment is configured as a computer system, and includes a storage device 101, a processor 102, an input device 103, and an output device 104.

  The storage device 101 is a storage device that accumulates data. The storage device 101 in this embodiment may be a storage device that temporarily holds data, or may be a secondary storage device such as a hard disk drive. The storage device 101 may be any storage device as long as the processor 102 can read out data from the storage device 101 so that the processor 102 can execute the functions of the present embodiment.

  The storage device 101 includes a diagram data table 105, a train-track information table 106, a basic restriction list table 107, an operation restriction list table 108, a traffic light information table 116, a section information table 117, a course information table 118, a section competition information table 119, a course It has a reservation information table 120 and a departure order information table 111.

  The diagram data table 105 is a table that stores a diagram indicating a train operation plan. The on-line train information table 106 is a table that stores on-line information on trains in the control range of the route control system 100. The basic constraint list table 107 is a table that stores constraint conditions that are essential for train route control. The operation constraint list table 108 is a table that stores operational constraint conditions that can be selected by the user.

  The departure order information table 111 is generated from the diagram data table 105, and stores the departure order of trains used for generating constraint conditions related to train schedules.

  The processor 102 is an arithmetic device that processes data in the storage device 101 using a plurality of functional units. Further, the processor 102 may be an arithmetic device that executes a program read to the primary storage device.

  The processor 102 of the first embodiment includes a course control information generation unit 112, a course control model construction unit 113, a GUI display unit 114, and a course control calculation execution unit 115 as functional units. The processor 102 executes the program read to the primary storage device.

  The route control information generation unit 112 generates route control information for the train. The route control model construction unit 113 generates the mathematical model of the first embodiment by generating variables and constraint conditions necessary for route control from train track information and train schedule information.

  The GUI display unit 114 allows the user to select whether to apply operational restrictions on the processing of the course control model construction unit 113. The course control computation execution unit 115 solves the course control model using a mathematical computation technique for solving a mathematical model described by a line format, a logical expression, a set computation, and the like.

  Each of the route control information generation unit 112, the route control model construction unit 113, the GUI display unit 114, and the route control calculation execution unit 115 may be implemented by a plurality of functional units or programs. Further, the route control information generation unit 112, the route control model construction unit 113, the GUI display unit 114, and the route control calculation execution unit 115 may be implemented by one functional unit or program.

  The input device 103 is a device into which data is input by a user. The input device 103 is a general-purpose input device for a computer such as a mouse and a keyboard.

  The output device 104 is a device that displays the processing result of the course control system 100 of the first embodiment. The output device 104 is an output device used in a computer such as a display.

  FIG. 2 is a block diagram illustrating a configuration example of a railway operation management system including the route control system 100 according to the first embodiment of the present invention.

  The railway operation management system shown in FIG. 2 is a system for controlling the route of the train 207. That is, the railway operation management system shown in FIG. 2 is a system that monitors the position of the train 207 and the equipment state such as a traffic light and a switch, and manages the operation of the train 207 based on the monitoring result and the train operation plan. is there.

  The railway operation management system includes a planning system 201, a route control device 202, a ground device 203, and a ground device group. The ground device group shown in FIG. 2 includes a traffic light 205, a track circuit 204, and a switch 206.

  In FIG. 2, the course control system 100 is the same as the course control apparatus 202. Further, the route control system 100 of the present embodiment may be implemented by a route control device 202 connected to a plurality of ground devices 203.

  The route control device 202, that is, the route control system 100, receives and receives the train diagram information determined by the planning system 201 and the state of the ground facility group collected by the ground device 203 via the network. Information is held in the storage device 101. The state of the ground facility group collected by the ground device 203 includes the on-line position of the train 207.

  The course control device 202 identifies the current position of the train 207 acquired from the track circuit 204, the departure time indicated by the train schedule information, and the planned course from the received information. And the traffic light 205 and the switch 206 installed in the course of the train 207 are controlled via the ground device 203 based on the specified information.

  The planning system 201 is a system that supports creation of a plan related to train operation such as a train schedule, a vehicle operation plan, and an inspection and maintenance plan. The planning system 201 is connected to the route control device 202 via a network.

  The ground device 203 is connected to the route control device 202 via a network. The ground device 203 receives the control request from the course control device 202, and performs the reverse control of the traffic light 205 and the switch 206 in accordance with the received control request.

  Further, the ground device 203 monitors the state of the traffic light 205 and the switch 206 (localization / inversion) and the state of the track circuit 204 (falling / climbing), and transmits the monitoring result to the route control device 202.

  The train 207 has a safety device for automatically stopping or automatically controlling the train 207, such as ATS (Automatic Train Stop) or ATC (Automatic Train Control).

  In addition, the train 207 includes an on-board device such as an information management system that collects, displays, and records detailed operation states and failure information in the train 207. The train 207 transmits information held by the on-board device to the ground device 203 via digital radio.

  In the following description, the ground device 203 determines the on-line position of the train 207 based on the state of the track circuit 204. However, for example, the on-board device of the train 207 may calculate or measure position information indicating the position of the train 207 on which the train 207 is mounted, and transmit it to the ground device 203 via digital radio. Then, the ground device 203 may determine the on-line position of the train 207 based on the position information transmitted from the on-board device of the train 207.

  In this embodiment, the train 207 travels on a track, and the track includes a plurality of sections. The route control system 100 according to the present embodiment controls the route of the train 207 in a plurality of predetermined sections that are predetermined as the range of each station.

  For this reason, the route control system 100 performs route control described later for each station, and each table stored in the storage device 101 includes information for each station. Moreover, the railway operation management system of this embodiment may be provided with one course control system 100 for one station, or may be provided with one course control system 100 for a plurality of stations.

  Hereinafter, the route control system 100 that controls the route of the train 207 in a plurality of sections included in one station will be described. However, the route of the train 207 in a section in which one route control system 100 is included in a plurality of stations. May be controlled.

  FIG. 3 is an explanatory diagram illustrating an example of the constraint setting screen 300 according to the first embodiment of this invention.

  A constraint setting screen 300 illustrated in FIG. 3 is a diagram illustrating an example of a user input screen displayed on the output device 104 by the GUI display unit 114. In FIG. 3, a train presence line display screen 301 is a screen that displays a position where a train 207 exists. In FIG. 3, a constraint setting screen 302 is a screen for allowing the user to set operational constraints.

  Check boxes 303 to 306 are check boxes for the user to select whether to apply the constraint. In the present embodiment, the user stores “re” in the check box of the constraint to be selected. The determination button 307 is a button for the user to determine the content input on the constraint setting screen 302.

  The train presence line display screen 301 is a screen showing the presence state of the train 207. The user changes the operational restriction setting using the restriction setting screen 302 while looking at the train presence line display screen 301. In the present embodiment, “a” indicates the a train 207 (hereinafter referred to as train a), and “b” indicates the b train 207 (hereinafter referred to as train b).

  For example, when the user stores “re” in the check box 303, the route control system 100 changes the route of the train 207 (train a, train b) to the opposite train if the constraint condition “customer handling takes time”. Control by “prioritize”.

  When the user stores “re” in the check box 303 to the check box 306 on the constraint setting screen 302 and further presses the decision button 307, the course control system 100 inputs the constraint condition that the user desires to apply to the input device 103. To get through. Then, the data on whether or not the constraint is applied in the operation constraint list table 108 shown in FIG.

  FIG. 4 is a flowchart showing processing in the course control system 100 according to the first embodiment of this invention.

  The course control system 100 repeatedly executes the process shown in FIG.

  The course control information generation unit 112 determines whether or not the status of the railway operation management system indicates the update timing of the course control information (401). The update timing of the route control information is, for example, when the on-line information of the train 207 is changed, when the facility information is changed, when a predetermined time has elapsed.

  In step 401, the route control information generation unit 112 acquires information from the planning system 201 to determine whether or not the train schedule has been changed. Further, in step 401, by acquiring information from the ground device 203, it is determined whether there is a change in on-line information of the train 207, a change in facility information, or whether there is a failure in the facility.

  When it is determined in step 401 that the state of the railway operation management system indicates the update timing, the route control information generation unit 112 executes step 402. When it is determined in step 401 that the status of the railway operation management system does not indicate the update timing, the route control information generation unit 112 ends the processing illustrated in FIG. 4 and repeats the determination in step 401 until the update timing is reached.

  In step 402, the route control information generation unit 112 includes a diagram data table 105, an on-line train information table 106, a basic restriction list table 107, an operation restriction list table 108, a traffic signal information table 116, a section information table 117, a route information table 118, The section conflict information table 119 and the course reservation information table 120 are read from the storage device 101. In the operation restriction list table 108, the operation restriction conditions selected by the user on the restriction setting screen 300 displayed by the GUI display unit 114 are stored as being applied.

  FIG. 5 is an explanatory diagram illustrating an example of the track wiring and the presence status of the train 207 according to the first embodiment of this invention.

  The wiring of the track | line shown in FIG. 5 shows the 2nd going up number line in one station. Moreover, the standing state of the train 207 illustrated in FIG. 5 indicates that the train b is on the number line 1. Further, “c” indicates that the train “c” is on a line called section 2.

  Section 0 shown in FIG. 5 is an ascending approach section to the station. Section 3-1 is an advancing section from section 1. A section 3-2 is an advancing section from the section 2.

  The traffic light 1RA is a traffic light 205 that protects the section 1, and the traffic light 1RB is a traffic light 205 that protects the section 2. The traffic light 11R is a traffic light 205 that protects the section 3-1, and the traffic light 12R is a traffic light 205 that protects the section 3-2.

  The traffic light 12R shown in FIG. 5 indicates that the current status is blue, and indicates that the train c is allowed to enter the section 3-2. The wiring diagram and standing line status in the following description are, for example, the wiring diagram and standing line status shown in FIG.

  FIG. 6 is an explanatory diagram illustrating a table configuration example of the traffic signal information table 116 according to the first embodiment of this invention.

  The traffic signal information table 116 includes information indicating what kind of indication the traffic signal 205 which is an element constituting the route of the train 207 is. Each record of the traffic signal information table 116 includes information regarding one traffic signal 205.

  The traffic signal information table 116 includes a traffic signal ID 601, a name 602, a current indication 603, and a next current indication 604. The traffic signal information table 116 illustrated in FIG. 6 includes records 605 to 608.

  The traffic signal ID 601 is an identifier for uniquely identifying the traffic signal 205 and is a continuous value starting from 0. The name 602 is a character string indicating the name of the traffic light 205.

  A current indication 603 is a character string indicating the latest current indication of the traffic light 205. The present indication 603 of the present embodiment includes a character string of either “red” or “blue”.

  The next display 604 is a character string indicating the next display of the traffic light 205. Similarly to the current display 603, the next display 604 of the present embodiment also includes a character string of either “red” or “blue”.

  For example, the record 605 indicates information related to the current status of the traffic light 1RA in FIG. 5, the traffic signal ID 601 is “0”, the name 602 is “1RA”, the current status 603 is “red”, 604 indicates “red”.

  The values stored in the traffic signal ID 601 and the name 602 of the traffic signal information table 116 may be added and updated by a user or an administrator. Further, the route control information generation unit 112 may update the traffic signal information table 116 according to the information regarding the traffic signal 205 transmitted from the ground device 203.

  The current indication 603 is updated by the route control information generation unit 112 according to information transmitted from the ground device 203.

  FIG. 7 is an explanatory diagram illustrating a table configuration example of the section information table 117 according to the first embodiment of this invention.

  The section information table 117 includes information related to a section that is an element constituting the route of the train 207. Each record of the section information table 117 includes information related to one section.

  The section information table 117 shows information on sections included for each station. For example, the section information table 117 shown in FIG. 7 shows the information of the section in the station shown in FIG. For this reason, the course control system 100 of this embodiment may hold | maintain the area information table 117 corresponding to a some station.

  The section information table 117 includes a section ID 701, a name 702, a direction 703, a type 704, and a traffic light 705. The section information table 117 illustrated in FIG. 7 includes records 706 to 710.

  The section ID 701 is an identifier for uniquely identifying the section, and is a continuous value starting from 0. The name 702 is a character string indicating the name of the section.

  The direction 703 includes a character string indicating the direction of the section, that is, the direction in which the train 207 traveling in the section travels. The direction 703 of the present embodiment includes a character string of “up” or “down”.

  The type 704 indicates the type of section. In the present embodiment, a section in which “0” is included in the type 704 is a block that has an on-site traffic signal and allows passengers to get in and out of the section. Further, a section in which “1” is included in the type 704 is a block that has an on-site traffic signal and that passengers cannot get in and out of the section.

  Further, a section in which “2” is included in the type 704 is a block having a departure signal. Further, a section in which “3” is included in the type 704 is a block having a block signal.

  The traffic light 705 includes a character string indicating the name of the traffic light 205 protecting the section. The value included in the traffic signal 705 corresponds to the name 602 of the traffic signal information table 116. When the traffic light 705 is included in a record indicating a section that does not include the traffic light 205, “−” is stored in the traffic light 705.

  For example, the record 706 indicates the section 0 in FIG. Therefore, in the record 706, the section ID 701 is “0”, the name 702 is “section 0”, the direction 703 is “up”, and the type 704 is “3”. That is, section 0 is a block having a block signal, and indicates that no signal is included in section 0.

  In addition, since the block traffic signal of the section 0 is arrange | positioned in the position just before the train 207 approachs into the section 0, it is arrange | positioned in the range adjacent to the station shown in FIG. For this reason, the traffic signal 705 in the section 0 (record 706) does not include the name of the block traffic signal.

  A record 707 indicates section 1 in FIG. Therefore, in the record 707, the section ID 701 is “1”, the name 702 is “section 1”, the direction 703 is “up”, and the type 704 is “0”. In other words, section 1 is a block that has an on-site traffic signal and that passengers can get on and off. Further, the traffic signal in the section 1 is the traffic signal 1RA.

  Values stored in the section information table 117 may be added or updated in advance by a user or an administrator. Further, the route control information generation unit 112 may update the information according to information transmitted from the ground device 203.

  FIG. 8 is an explanatory diagram illustrating a table configuration example of the route information table 118 according to the first embodiment of this invention.

  The route information table 118 shows route information that is information for controlling the train 207 and information related to the reservation of the route. Each record of the course information table 118 includes a value indicating one course.

  The course information table 118 shows information on courses and reservations included in each station. For example, the route information table 118 shown in FIG. 8 shows information on the route and reservation at the station shown in FIG. For this reason, the route control system 100 of this embodiment may hold the route information table 118 corresponding to a plurality of stations.

  The course information table 118 includes a course ID 801, a name 802, an outer section 803, an inner section 804, a type 805, a current reservation state 806, and a next reservation state 807. The course information table 118 illustrated in FIG. 8 includes records 808 to 811.

  The course ID 801 is an identifier for uniquely identifying the course, and is a continuous value starting from 0. The name 802 is a character string indicating the name of the course.

  The outward section 803 includes a character string indicating the name of the section located outside (starting point) of the course. The inward section 804 includes a character string indicating the name of the section located inward (landing point) of the course. The values stored in the outer section 803 and the inner section 804 correspond to the values stored in the name 702 of the section information table 117.

  The type 805 includes a character string indicating the type of course. The type 805 of this embodiment includes a character string of “physical” or “virtual”.

  A route in which “physical” is included in the type 805 (hereinafter referred to as a physical route) is a route that actually exists. That is, the physical route is a section in the order in which the train 207 travels without changing the traveling direction.

  A route in which “virtual” is included in the type 805 (hereinafter referred to as a virtual route) is physically overlapped, but when there are two sections having different train traveling directions, the presence line of the train 207 is determined according to the traveling direction. This is a virtual route for switching between sections.

  That is, the virtual route is set when the train 207 is turned back. The user can switch the existing section of the train 207 from the outer section (starting point) to the inner section (pointing point) by setting the hypervirtual route. When a virtual route is set, the train 207 does not actually move and only the traveling direction changes. Along with this, the traffic light 205 that the train 207 follows changes.

  The current reservation state 806 includes a character string indicating the latest reservation state of the course. The current reservation state 806 includes “-” when the route is not reserved, and includes a character string indicating the name of the reserved train 207 when the route is reserved.

  The next reservation state 807 includes a character string indicating the reservation state of the next planned course. The next reservation state 807 includes a character string indicating the name of the reserved train 207 if the route is reserved if the route is reserved, as in the current reservation state 806. Including.

  The route ID 801, the name 802, the outer section 803, the inner section 804, and the type 805 are information for controlling the train 207, and the current reservation state 806 and the next reservation state 807 relate to the reservation of the route. Information.

  For example, a record 808 indicates a course 1 that goes from section 0 to section 1 in FIG. The course ID 801 of the record 808 is “0”, the name 802 is “path 1”, the outer section 803 is “section 0”, the inner section 804 is “section 1”, and type Reference numeral 805 denotes “physical”. That is, the course 1 is a course that actually exists.

  Since the current reservation state 806 of the route 1 is “−” and the next reservation state 807 is also “−”, the route 1 is not reserved by the train 207, and also at the next timing. It shows that it is not reserved by the train 207.

  A record 811 indicates a course 4 that travels from section 2 to section 3-2 in FIG. The route ID 801 of the record 811 is “3”, the name 802 is “route 4”, the outer section 803 is “section 2”, the inner section 804 is “section 3-2”, and the type 805 Is “physical”. That is, the course 4 is a course that actually exists.

  The current reservation state 806 of the route 4 is “c”. That is, the route 4 is currently reserved for the train c train. Since the next reservation state 807 of the route 4 is “none”, it indicates that there is no train 207 that reserves the route 4 after the train c passes the route 4.

  The values stored in the route ID 801, the name 802, the outer section 803, the inner section 804, and the type 805 of the course information table 118 may be added or updated in advance by a user or an administrator.

  FIG. 9 is an explanatory diagram illustrating a table configuration example of the section conflict information table 119 according to the first embodiment of this invention.

  The section conflict information table 119 includes a value indicating whether or not a combination of two sections competes.

  In the vertical axis 901 and the horizontal axis 902, the values of the name 702 in FIG. 7 are stored in ascending order of the section ID 701. The section conflict information table 119 indicates whether each section is in a competitive relationship by “0” and “1”.

  In the section conflict information table 119 of the present embodiment, “1” indicates that sections compete. “0” indicates that there is no contention between sections.

  For example, since the column 903 includes “0”, it indicates that the section 3-2 and the section 2 are not in a competitive relationship. Further, since the column 904 includes “1”, the section 3-2 and the section 3-1 are in a competitive relationship.

  Column 903 and column 906 contain the same value. Further, the column 904 and the column 907 include the same value. Further, the column 905 stores a value indicating a competitive relationship between the section 3-2 and the section 3-2, that is, a value indicating a competitive relationship with itself. Therefore, “1” is always stored in the column 905. For other sections, “1” is stored in the column indicating the competitive relationship with itself.

  The value stored in the section conflict information table 119 may be added or updated in advance by a user or an administrator.

  FIG. 10 is an explanatory diagram illustrating a table configuration example of the route reservation information table 120 according to the first embodiment of this invention.

  The route reservation information table 120 includes route reservation information that defines rules for reserving a plurality of routes at the same time, such as a forward signal. Each record of the route reservation information table 120 includes one route reservation information.

  The route reservation information table 120 includes, as items, a route reservation ID 1001, a name 1002, a target train 1003, a trigger route 1004, and a simultaneous reservation route 1005. The course reservation information table 120 includes records 1113 to 1117.

  The course reservation ID 1001 includes an identifier for uniquely identifying the course reservation, and includes a continuous value starting from 0. The name 1002 includes a character string indicating the name of the course reservation.

  The target train 1003 includes a character string indicating the name or type of the train 207 that reserves the route. The target train 1003 may store a value indicating a plurality of trains 207 or a value indicating all trains 207.

  When all the trains 207 reserve a course, the target train 1003 of this embodiment includes “-”. Further, when the train 207 passing through the route does not stop in the section included in the route and reserves the route, the target train 1003 of the present embodiment includes “pass”.

  The trigger route 1004 includes a character string indicating the name of the route that becomes a reserved trigger. The simultaneous reservation route 1005 includes a character string indicating the name of the route reserved simultaneously with the trigger route. The simultaneous reservation route 1005 may include a value indicating a plurality of routes.

  Values included in the trigger route 1004 and the simultaneous reservation route 1005 are values corresponding to the name 802 in the route information table 118.

  For example, when the train 207 passes through the route 1 that is a route from the section 0 to the section 1 and the route 3 that is a route from the section 1 to the section 3-1 shown in FIG. It is shown that the course 3 is reserved at the same time. Further, when the route 1 is reserved, the train 207 always travels along the route 3, so the trigger route is the route 1.

  Specifically, the record 1006 indicates that the route reservation ID 1001 indicates “0”, the name 1002 indicates “passage reservation 1”, the target train 1003 indicates “pass”, and the trigger route 1004 indicates “route 1”. The simultaneous reservation route 1005 indicates “route 3”.

  In addition, the record 1007 indicates that all trains 207 reserve a route 2 that is a route from the zone 0 to the zone 2 and a route 4 that is a route from the zone 2 to the zone 3-2 shown in FIG. Show. Specifically, in the record 1007, the route reservation ID 1001 is “1”, the name 1002 is “simultaneous reservation 1”, the target train 1003 is “−”, and the trigger route 1004 is “route 2”. The simultaneous reservation route 1005 is “route 4”.

  Values stored in the route reservation information table 120 may be added or updated in advance by a user or an administrator.

  FIG. 11 is an explanatory diagram illustrating a table configuration example of the diagram data table 105 according to the first embodiment of this invention.

  The diagram data table 105 shows diagram information regarding the train 207 using each station. Each record of the diagram data table 105 indicates diagram information regarding one train 207. The diagram data table 105 is transmitted from the planning system 201.

  The diagram data table 105 includes, as items, a train ID 1101, a train number 1102, an entry position 1103, an advance position 1104, a passing stop section 1105, an arrival time 1106, a departure time 1107, an arrival number line 1108, a departure number line 1109, an upper and lower section 1110, previous An operation train 1111 and a post-operation train 1112 are included. The diagram data table 105 shown in FIG. 11 includes records 1113 to 1117.

  The train ID 1101 is an identifier for uniquely identifying the train 207, and includes a continuous value starting from 0. Train number 1102 includes a character string indicating the name of train 207. The approach position 1103 includes a character string indicating the name of the section that is on the line when each train 207 enters the station. The advance position 1104 includes a character string indicating the name of the section that is on the line when each train 207 advances from the station.

  The passing stop section 1105 includes a character string indicating a passing or stopping section. The value included in the passing stop category 1105 is either “stop” or “pass”.

  The arrival time 1106 includes a numerical value indicating the station arrival time of the train 207. When the train 207 does not stop at the station because the train 207 is a passing train or the like, the station information of the train 207 is not included in the schedule information, and therefore “−” is stored in the arrival time 1106.

  The departure time 1107 includes a numerical value indicating the station departure time of the train 207. When the train 207 does not stop at the station, the departure time 1107 stores the time when the train 207 passes the station.

  The arrival number line 1108 includes a character string indicating the number name of the number line used when the train 207 arrives at the station. The departure number line 1109 includes a character string indicating the number name of the number line used when the train 207 leaves the station.

  The upper and lower section 1110 includes a character string indicating the up or down section of the train 207.

  The pre-operation train 1111 includes a character string of a pre-operation train name indicating a train operated at the target station before the train 207 arrives at the target station. “-” Stored in the previous operation train 1111 indicates that there is no previous operation train in the target station.

  The post-operation train 1112 includes a character string of a post-operation train name indicating a train operated at the target station after the train 207 arrives at the target station. As with the pre-operation train 1111, “−” stored in the post-operation train 1112 indicates that there is no post-operation train at the target station.

  For example, the record 1114 indicates the train b in FIG. Specifically, the train ID 1101 of the diagram data table 105 is “1”, the train number 1102 is “b”, the entry position 1103 is “section 0”, and the advance position 1104 is “section 3-1”. The passing stop section 1105 is “stop”, the arrival time 1106 is “10:04:00”, the departure time 1107 is “10:05:20”, and the arrival number 1108 is “section 1 ", The departure number 1109 is" section 1 ", the upper and lower sections 1110 are" up ", the front operation train 1111 is"-"or" none ", and the rear operation train 1112 is"-"or" None ”.

  FIG. 12 is an explanatory diagram illustrating a table configuration example of the on-line train information table 106 according to the first embodiment of this invention.

  The on-line train information table 106 indicates the on-line information of the train 207 that uses the station and information on the next state of the train. The standing line information is transmitted from the ground device 203.

  Each record in the on-line train information table 106 includes information on one train 207. The train line information table 106 includes, as items, a train ID 1201, a train number 1202, a track position 1203, a traveling direction 1204, a route reservation position 1205, and a section 1206 that can be tracked next. The on-line train information table 106 illustrated in FIG. 12 includes records 1207 to 1211.

  The train ID 1201 is an identifier for uniquely identifying the train 207, and is a continuous value starting from zero. The value stored in the train ID 1201 corresponds to the value stored in the train ID 1101 of the diagram data table 105.

  Train number 1202 includes a character string indicating the name of train 207. The value stored in the train number 1202 corresponds to the value stored in the train number 1102 of the diagram data table 105.

  The standing line position 1203 includes a character string indicating the name of the section where the train 207 is located. When the train 207 is not present in any section in the target station, “−” is stored in the standing position 1203. The value stored in the standing line position 1203 corresponds to the value stored in the name 702 of the section information table 117.

  The traveling direction 1204 includes a character string indicating the traveling direction of the train 207, and includes a character string “up” or “down”. When the train 207 is not present in any section of the target station, “−” is stored in the traveling direction 1204.

  The route reservation position 1205 includes a character string indicating the name of the route being reserved by the train 207. When the train 207 has not reserved the route of the station, “−” is stored in the route reservation position 1205. The value stored in the route reservation position 1205 corresponds to the value stored in the name 802 of the route information table 118.

  The section 1206 where the next line can be located includes a character string indicating a section where the train 207 can be next. The section in which the train 207 can be on next is either the current on-line section (corresponding to the value of the on-line position 1203) or the inward section of the traffic light in the section scheduled to enter (the landing section of the route).

  However, depending on the “next” timing, there is a case where the train 207 has not moved to the inward section, that is, the train is waiting in the current section, or is moving in the current section. Therefore, the next section indicated by the section 1206 where the next line can be present does not necessarily match the next section where the train 207 is actually present.

  The on-line train information table 106 is updated when information is transmitted from the ground device 203. The ground device 203 transmits information stored in the on-line train information table 106 to the route control system 100 at a predetermined time interval such as every 2 seconds.

  For example, the record 1207 indicates the on-line information of the train a in FIG. Note that the train a is not located in the station section shown in FIG. Specifically, the train ID 1201 of the on-line train information table 106 is “0”, and the train number 1202 is “a”. The standing line position 1203, the traveling direction 1204, the reserved course position 1205, and the section 1206 that can be next lined are "-". That is, the train “a” indicates that there is no line at the station corresponding to the line train information table 106 shown in FIG.

  A record 1208 indicates the on-line information of the train b shown in FIG. Specifically, the train ID 1201 in the on-line train information table 106 is “1”, the train number 1202 is “b”, the on-line position 1203 is “section 1”, and the traveling direction 1204 is “up”. is there. Since the route reservation position 1205 is “−”, the record 1208 indicates that the train b has not reserved a route. Further, since the section 1206 that can be next lined is “section 1”, the record 1208 indicates that the next line segment of the train b is also in the same position as the present.

  The values stored in the train ID 1201 and the train number 1202 of the on-line train information table 106, that is, the values stored in the diagram data table 105 may be added or updated by a user or an administrator. Further, the route control information generation unit 112 may update the values of the train ID 1201, the train number 1202, the standing line position 1203, and the traveling direction 1204 in the standing train information table 106 according to the information transmitted from the ground device 203.

  FIG. 13 is an explanatory diagram illustrating a table configuration example of the operation constraint list table 108 according to the first embodiment of this invention.

  The operation restriction list table 108 indicates restrictions on operation and whether or not each restriction is applied. In other words, the operation constraint list table 108 indicates operational constraints that can be selected by the user on the operational constraint setting screen 302 shown in FIG. 3 and whether or not each constraint is applied by user input.

  Each record of the operation restriction list table 108 indicates one operation restriction. The operation constraint list table 108 includes ID 1301, constraint name 1302, constraint 1303, and application 1304 as items. The operation constraint list table 108 illustrated in FIG. 13 includes records 1305 to 1308.

  The ID 1301 includes an identifier for uniquely identifying the constraint, and is a continuous value starting from 0. The constraint name 1302 includes a character string indicating the name of an operational constraint.

  The constraint 1303 includes a character string indicating the content of the operational constraint. A value is stored in the application 1304 based on information input to the operational restriction setting screen 302 displayed on the output device 104 by the GUI display unit 114.

  That is, the application 1304 includes a symbol indicating whether or not the constraint is applied. When a check is input to the check box on the operational constraint setting screen 302, “○” indicating application is stored in the application 1304, and when no check is input, the application 1304 indicates “not applied” X ”is stored.

  For example, the record 1305 indicates the content of the constraint indicated by the first item in the operational constraint setting screen 302 and whether or not the constraint indicated by the first item is applied. Specifically, the ID 1301 of the operation constraint list table 108 is “0”, the constraint name 1302 is “customer treatment”, and the constraint 1303 is “prioritize oncoming trains if it takes time to treat customers”, The application 1304 is “◯”. In other words, the record 1305 indicates that the restriction “prioritize the oncoming train if it takes time to handle the customer” is applied.

  The route control of the route control system 100 in the case where the restriction “prioritize oncoming train if time is required for customer handling” is applied is shown below. That is, when the train 207 stopped on the line takes time to handle the passenger (passengers get on and off, etc.), the route control system 100 passes through the competition point that is scheduled to pass when the stopped train 207 departs. Another train 207 is extracted. Then, of the extracted trains 207, the route control is performed so that the train 207 that is scheduled to arrive at the station and can pass first passes through the above-mentioned competition points before the stopped train 207. I do.

  Values of the ID 1301, the constraint name 1302, and the constraint 1303 of the operation constraint list table 108 are stored in advance by a user or an administrator.

  FIG. 14 is an explanatory diagram illustrating a table configuration example of the basic constraint list table 107 according to the first embodiment of this invention.

  The basic constraint list table 107 shows the contents of constraint conditions constituting the route control model, which is a basic model of route control, and whether or not it is applied. Each record in the basic constraint list table 107 represents one basic constraint condition.

  The basic constraint list table 107 is a table generated in advance by a user or an administrator.

  The basic constraint list table 107 includes, as items, a constraint ID 1501, a constraint type 1502, a constraint 1503, and an application 1504. The basic constraint list table 107 illustrated in FIG. 14 includes records 1505 to 1514.

  The constraint ID 1501 is an identifier for uniquely identifying the constraint condition, and is a continuous value starting from 0.

  The constraint type 1502 includes a character string indicating the name of the constraint type. In the present embodiment, the constraint type 1502 includes “movement”, “security / linkage”, “relation between states”, “relation between states”, and “diamond”.

  The type “movement” indicates a restriction condition regarding movement of the train 207. The type “security / interlocking” indicates a constraint condition regarding the security and interlocking of the train 207. The type “relationship between states” indicates a constraint condition relating to the relationship between the state of the train 207, the state of the traffic light 205, and the state of the route. The type “diamond” indicates a constraint condition related to a train schedule.

  The constraint 1503 includes a character string indicating the content of the constraint condition. The application 1504 includes a character string indicating whether or not the constraint condition is applied.

  In the present embodiment, “essential” is stored in the application 1504 of the record in which the constraint condition that is essential in the course control is stored. On the other hand, “apply” is stored in the record application 1504 in which the constraint condition that may not be applied in some cases is stored.

  For example, in a case where it is necessary to change part of the constraint conditions related to the diamond in order to perform route control that satisfies the constraint conditions related to the operation, “apply” is stored in the application 1504 of the type “diamond” record. .

  Further, in the case where “applied” is stored in the record 1504 of the type “diamond” record, when the train schedule is not transmitted from the planning system 201, the route control system 100 does not consider the constraint condition regarding the diagram. In addition, route control that satisfies only the constraint condition in which the application 1504 is “essential” may be performed.

  For example, the record 1505 indicates the contents of the constraint condition regarding the movement of the train 207 and the presence / absence of application of the constraint condition regarding the movement. Specifically, in the record 1505, the constraint ID 1501 is “0”, the constraint type 1502 is “move”, and the constraint 1503 is “the next state of the train remains the current section or the current section is outside. “Inward section of the course” and application 1504 is “essential”.

  The current section is the latest existing section of the train 207.

  The restriction condition indicated by the record 1505 is that the currently existing train 207 is either at the same position at the next time point or moved to an inward section of the route with the current position outward. The constraint condition such as

  Further, for example, the record 1513 indicates the restriction condition whether or not to observe the departure order, which is the departure order of the train 207 determined from the train schedule, and whether or not to apply. Specifically, in the record 1513, the constraint ID 1501 is “8”, the constraint type 1502 is “diamond”, the constraint 1503 is “observance of departure order”, and the application 1504 is “apply”.

  The constraint condition indicated by the record 1513 is a constraint condition of keeping the departure order determined by the train schedule, and is normally applied. However, for example, when the constraint condition indicated by the record 1305 of the operation constraint list table 108 illustrated in FIG. 13 is applied, the constraint condition indicated by the record 1305 and the constraint condition indicated by the record 1513 may conflict, and thus conflict. In this case, the constraint condition indicated by the record 1513 is not applied.

  The values of the constraint ID 1501, the constraint type 1502, and the constraint 1503 in the basic constraint list table 107 are stored in advance by a user or an administrator.

  In step 402 shown in FIG. 4, the route control information generation unit 112 performs the diagram data table 105, the train-track information table 106, the basic constraint list table 107, the operation constraint list table 108, the traffic signal information table 116, the section information table 117, and route information. After reading the table 118, the section conflict information table 119, and the course reservation information table 120, the course control model construction unit 113 constructs a course control model (403). Here, the course control model of the present embodiment is a mathematical model that expresses requirements (constraints) that must be observed in order to generate course control information as mathematical expressions.

  FIG. 15 is an explanatory diagram illustrating a table configuration example of the departure order information table 111 according to the first embodiment of this invention.

  The departure order information table 111 is a table showing the departure order of the trains 207 that have not yet started at the current time among the trains 207 that use each station.

  The departure order information table 111 is generated based on information in the diagram data table 105 and the train-in-train information table 106. The departure order information table 111 is generated by the route control model construction unit 113.

  The timing at which the departure order information table 111 is generated may be every predetermined time or may be generated when a course control model described later is generated. Note that when at least one of the diagram data table 105 and the on-line train information table 106 is updated, the course control model construction unit 113 updates the departure order information table 111.

  Each record of the departure order information table 111 indicates one departure order information. The departure order information table 111 includes, as items, a departure order 2201, a train number 2202, a departure number line 2203, a departure route 2204, and a departure time 2205. The departure order information table 111 in FIG. 15 includes records 2206 to 2210.

  The departure order 2201 is a different value indicating the order of the train 207 that leaves each station in the same direction, and is a continuous value starting from 1. In this embodiment, the smaller the value of the departure order 2201, the earlier the departure order. The departure order may be set so that the value of the departure order 2201 becomes smaller as the value of the departure time 2205 is smaller, or the departure order may be determined by the user or the administrator by other methods.

  Train number 2202 includes a character string indicating the name of train 207. The train number 2202 corresponds to the train number 1102 in the diagram data table 105. The course control model construction unit 113 refers to the on-line position 1203 of the on-line train information table 106, and specifies whether or not the train 207 on the target station has already started. In addition, the train 207 identified as having already departed is identified as having already departed. Then, a record of the diagram data table 105 including the train number 1102 corresponding to the train number 1202 corresponding to the train 207 other than the specified already-departed train, that is, the train 207 that has not left the target station is extracted, and the extracted diagram data table 105 is extracted. The departure order information table 111 is generated from the records.

  The departure number 2203 includes a character string indicating the name of a section that is a number line used when the train 207 leaves the station. The departure number line 2203 corresponds to the departure number line 1109 of the extracted record of the diagram data table 105.

  The departure route 2204 includes a character string indicating a route used when the train 207 leaves the station. A departure route 2204 indicates a route from the departure number line 1109 to the advance position 1104 in the extracted record of the diagram data table 105. The route control model construction unit 113 refers to the route information table 118 in order to store a value in the departure route 2204.

  The departure time 2205 indicates the time when the train 207 leaves the departure number line 2203, that is, the departure time 1107 of the extracted record of the diagram data table 105.

  For example, the record 2206 indicates the departure order of the train c shown in FIG. Therefore, the departure order 2201 of the record 2206 is “1”, the train number 2202 is “c”, and the departure number line 2203 is “section 2”. The departure route 2204 of the record 2206 is “Route 4”, and the departure time 2205 is “10:05:05”.

  Each of the above-described tables stored in the storage device 101 only needs to include the contents of the items shown in FIGS. 6 to 15 and does not need to hold data in a table format. Each of the above-described tables stored in the storage device 101 may be stored in the storage device 101 in the csv format, for example.

  FIG. 16 is a flowchart showing processing in the course control model construction unit 113 according to the first embodiment of the present invention, that is, processing corresponding to step 403.

  The course control model construction unit 113 determines whether or not the in-line information has been updated by comparing the in-line train information table 106 with the in-line train information table 106 accumulated in the past (1401). Specifically, when the tracked position 1203 of the latest tracked train information table 106 transmitted from the ground device 203 is different from the tracked position 1203 of the past tracked train information table 106, the route control model construction unit 113 It is determined that the information has been updated. When it is determined that the standing line information has been updated, the course control model construction unit 113 proceeds to Step 1402.

  When it is determined that the standing line information has not been updated, the course control model construction unit 113 ends the process illustrated in FIG.

  The course control model construction unit 113 determines in step 1402 whether the facility information has been updated. Specifically, among the traffic signal information table 116, the section information table 117, the course information table 118, the section competition information table 119, and the course reservation information table 120, the latest course control model for items related to the basic equipment information is displayed. If there is a difference as a result of comparison with each table at the time of generation, it is determined that the facility information has been updated.

  The items related to the basic information of the equipment are the traffic signal ID 601 and the name 602 in the traffic signal information table 116, and are the items in the section information table 117. The course ID 801, the name 802, the outer section 803, the inward in the course information table 118 The section 804 and the type 805 are each item of the section conflict information table 119 and each item of the route reservation information table 120.

  For example, when the traffic light 205 becomes unusable due to equipment failure or the like, and the traffic light 205 is changed, or when a section or course where the train 207 can travel is changed due to a rail failure or the like, the basic information of the equipment described above The item regarding is changed by transmission of information from the user or the like or the ground device 203.

  If it is determined that the facility information has been updated, the course control model construction unit 113 proceeds to step 1403. If it is determined that the facility information has not been updated, the course control model construction unit 113 proceeds to step 1405.

  Note that the flowchart shown in FIG. 16 shows processing for updating the course control model after at least one course control model has already been generated. For this reason, in step 1401 and step 1402, the course control model construction unit 113 determines whether or not there is a change from past information. However, when the course control model is generated for the first time, the course control model construction unit 113 determines “updated” in step 1401, and further determines “updated” in step 1402. Processing may be executed.

  When it is determined in step 1402 that the facility information has been updated, the course control model construction unit 113 executes step 1403. The course control model construction unit 113 adds or deletes a variable related to the next state of the traffic light 205 based on the latest facility information (1403).

  Specifically, in step 1403, the course control model construction unit 113 adds or deletes a variable related to the next state of the traffic light 205, that is, the next display 604 of each record of the traffic light information table 116. For example, when the traffic signal 205 is newly added, a variable indicating the next display 604 of the record of the traffic signal information table 116 indicating the newly added traffic signal 205 is added.

  Further, after step 1403, the route control model construction unit 113 adds or deletes a variable related to the next state of the updated route based on the latest facility information (1404). Specifically, the course control model construction unit 113 updates a variable related to the next state of the course, that is, the next reservation state 807 of each record in the course information table 118 in step 1404.

  In step 1403 and step 1404, any method may be used for updating the next display 604 and the next reservation state 807.

  The variable for determining the value stored in the next display 604, the next reservation state 807, and the section 1206 that can be next lined will be referred to as a decision variable hereinafter. The decision variable is a variable to be decided by the course control calculation execution unit 115. Further, the constraint conditions in the course control model of the present embodiment are expressed numerically using decision variables.

  When it is determined in step 1402 that the facility information has been updated, the decision variable also needs to be changed. Therefore, the course control model construction unit 113 determines the above-described determination in accordance with the updated facility information in steps 1403 and 1404. Update variables.

  In the present embodiment, the effective train is a value stored in any of the on-line position 1203, the route reservation position 1205, and the section 1206 in which the next line can be located among the trains 207 described in the on-line train information table 106 in FIG. Train 207. In other words, the effective train in the present embodiment is the train 207 that is subject to route control before and after executing the processing shown in FIG.

  When it is determined in step 1404 or 1402 that the facility information has not been updated, the route control model construction unit 113 generates a constraint condition regarding the movement of the train (1405).

  FIG. 17 is a flowchart illustrating processing for generating a constraint condition related to movement of the train 207 according to the first embodiment of this invention.

  The process shown in FIG. 17 corresponds to step 1405 shown in FIG.

  The course control model construction unit 113 sets S as the set of valid trains among all the trains 207 included in each entry of the on-line train information table 106 (1601).

  The course control model construction unit 113 determines whether the set S of effective trains is an empty set or an empty set (1602). If it is not an empty set, the course control model construction unit 113 proceeds to step 1603. When the process of step 1603 is executed for all the empty trains, that is, the valid trains, the route control model construction unit 113 ends the process shown in FIG.

  The course control model construction unit 113 extracts one train 207 from the set S. Then, the train 207 extracted from the set S is deleted, and the extracted train 207 is determined as train x (1603). The course control model construction unit 113 adds the current section (the value of the on-line position 1203) to the value (domain) that can be taken by the decision variable for determining the next state of the train x train, that is, the section 1206 that can be next. (1604).

  After step 1604, the route control model construction unit 113 determines whether there is a route in which steps 1606 and 1607 are not executed among routes having the current section of the train x train as an outer section. The determination is made using the table 118 (1605). When the course information table 118 includes a record that stores the current section of the train x train in the outer section 803, the course control model construction unit 113 determines that there is a course that uses the current section of the train x train as the outer section. Then, the process proceeds to Step 1606.

  In addition, when the route information table 118 does not include a record that stores the current section of the train x train in the outward section 803, the route control model construction unit 113 determines the course that uses the current section of the train x train as the outer section. Judge that it does not exist. Then, the process proceeds to Step 1608.

  After step 1605, the route control model construction unit 113 selects one unprocessed route as the route r from the routes having the current section of the train x train as the outer section (1606). After step 1606, the course control model construction unit 113 adds the inward section of the course r to the next state of the train x train (1607). Specifically, the value of the inner section 804 of the route r is added to the value (domain) that can be taken by the decision variable for determining the next state of the train x train, that is, the section 1206 that can be next.

  After the process of step 1607, the course control model construction unit 113 returns to step 1605. That is, step 1606 and step 1607 are executed for all routes that have the current section of train x train as the outer section. As a result, the next state of train xle, that is, the value (domain) of the decision variable for determining the next section 1206 that can be present is a value indicating all the sections where train xre can be present next. Stored.

  In Step 1605 after Step 1607, when it is determined that Step 1606 and Step 1607 have been executed for all the routes in which the current section of the train x train is the outer section, the course control model construction unit 113 determines in Step 1608. Proceed to The course control model construction unit 113 generates a constraint expression related to the section 1206 that can be present next to the train x and adds it to the course control model (1608).

  The constraint expression generated in step 1608 is a formula (1) representing a constraint condition (record 1505) in which the constraint ID 1501 in the basic constraint list table 107 shown in FIG. 14 is “0”.

Next_Section (x): Next state of train x (-1: no line or section s: line section)
Now_Section (x): Current section of train x
Inner_Section (r): Inner section of course r
S: Set of valid trains Equation (1) shows that the next state of train x is the current section, or a constraint condition that determines that the current section is the inner section of the route r with the current section as the outer section. It is the formula shown by the mathematical model.

  In Expression (1) and each constraint expression described below, “A⇒B” indicates “B if A” and “A⇔B” indicates “A⇒B and B⇒A”. , “A || B” indicates “A or B”, and “A && B” indicates “A and B”.

  Further, the mathematical model generated in the present embodiment is not limited to a constraint expression that expresses a constraint condition by a logical expression as in the above-described formula (1). That is, any expression method may be used as long as it is a mathematical model that can express a constraint condition.

  In step 1608, the course control model construction unit 113 adds the generated expression (1) to the course control model held in the storage device 101.

  After step 1608, the route control model construction unit 113 returns to step 1602, and extracts the other trains 207 from the set S as train x trains, thereby repeating the process of generating constraint equations relating to movement for all valid trains.

  After step 1405 shown in FIG. 17 ends, the course control model construction unit 113 proceeds to step 1406. In step 1406, the course control model construction unit 113 generates a constraint expression related to security and interlocking.

  FIG. 18 is a flowchart illustrating a process of generating a constraint expression related to security and interlocking according to the first embodiment of this invention.

  The process shown in FIG. 18 corresponds to step 1406 shown in FIG.

  The route control model construction unit 113 sets a set R of all the routes indicated by the route information table 118 (1701). After step 1701, the course control model construction unit 113 determines whether the course set R is not an empty set (1702). If the set R is not an empty set, the course control model construction unit 113 proceeds to step 1703.

  If the set R is an empty set, the process of step 1703 is completed for all the paths indicated by the path information table 118, and therefore the path control model construction unit 113 ends step 1406 shown in FIG.

  In step 1703, the course control model construction unit 113 extracts one course from the set R as the course r, and deletes the extracted course r from the set R. After step 1703, the course control model construction unit 113 determines whether or not the course r is a virtual course by referring to the type 805 of the course information table 118 (1704).

  If the record type 805 of the route information table 118 indicating the route r does not indicate “virtual”, the route control model construction unit 113 determines that the route r is not a virtual route, and proceeds to step 1705. This is because Steps 1705 to 1711 are processing for generating a constraint expression related to the physical path.

  If it is determined in step 1704 that the route r is a virtual route, the route control model construction unit 113 proceeds to step 1712.

  After step 1704, the course control model construction unit 113 determines whether or not the train 207 is present in a section that competes with the inner section of the course r using the section competition information table 119 and the train-in-train information table 106. (1705). Specifically, in step 1705, the course control model construction unit 113 refers to the section competition information table 119, and identifies a section that competes with the inner section (the value of the inner section 804) of the course r. Then, it is determined whether or not there is a record including the value indicating the identified conflicting section in the standing line position 1203 in the standing line train information table 106.

  When there is a record that includes a value indicating the identified conflicting section in the standing line position 1203 in the standing line train information table 106, the route control model construction unit 113 determines that the train 207 exists in a section that competes with the inner section of the route r. Determine and proceed to step 1706.

  When there is no section competing with the inner section of the route r, or when there is no record in the on-site train information table 106 that includes the value indicating the identified competing section in the on-line train information table 106, the route control model construction unit 113 It is determined that the train 207 does not exist in the section competing with the inner section of r, and the process proceeds to step 1707.

  After step 1705, the course control model constructing unit 113 generates a constraint expression “reservation is impossible for the inner section of the path r”, and stores the generated constraint expression in the course control model (1706). The constraint expression generated in step 1706 is a formula (2) representing a constraint condition (record 1506) having a constraint ID 1501 of “1” in the basic constraint list table 107 shown in FIG.

Conf_Section (s): Set of sections competing with section s
Inner_Section (r): Inner section of course r
Now_Sec_Train (s): Trains in the section s
Next_Route (r): Next state of the route (-1: No reservation or Train x: r reserved)
Equation (2) shows, as one of the mathematical expressions constituting the mathematical model, a constraint that defines that the route r cannot be reserved if another train is present in a section competing with the inner section of the route r. It is a formula.

  After step 1706, the course control model construction unit 113 defines the course set R 'as a set equal to the set R (1707). That is, the set R ′ includes a route that has not yet been extracted as the route r among all the routes indicated by the route information table 118.

  After step 1707, the course control model construction unit 113 determines whether or not the set R ′ is an empty set (1708). If the set R ′ is not an empty set, the course control model construction unit 113 proceeds to step 1709. When the set R ′ is an empty set, the course control model construction unit 113 proceeds to step 1712.

  The course control model construction unit 113 extracts one course from the set R ′ as the course r ′, and deletes the extracted course r ′ from the set R ′ (1709). After step 1709, the course control model construction unit 113 determines whether or not the course r and the course r 'are in a competitive relationship using the section competition information table 119 (1710).

  Specifically, in step 1710, the course control model construction unit 113 identifies the inner sections (values indicated by the inner section 804) of the course r and the course r '. When the section conflict information table 119 indicates that the identified inner section of the course r and the inner section of the course r ′ are in a competitive relationship, the course control model construction unit 113 determines that the course r and the course It is determined that r ′ is in a competitive relationship.

  When the course r and the course r ′ are in a competitive relationship, the course control model construction unit 113 needs to generate a constraint expression between the competing courses, and thus the process proceeds to Step 1711. When the route r and the route r ′ are not in a competitive relationship, the route control model construction unit 113 returns to Step 1708 and performs Step 1710 for all the routes in the set R ′.

  In step 1711, the route control model construction unit 113 generates a constraint expression “r is no reservation, or r ′ is no reservation, or both are reserved on the same train, or both are not reserved”. Store the generated constraint expression in the course control model. The constraint expression generated in step 1711 is an expression (3) representing a constraint condition (record 1507) having a constraint ID 1501 of “2” in the basic constraint list table 107 shown in FIG.

Route_Conf [r] [r ′]: Presence / absence of conflict between route r and route r ′ (1: conflict, 0: not conflict)
Next_Route (r): Next state of route r (-1: no reservation or train x: r reserved)
Expression (3) is an expression showing a constraint condition that determines that the competing course r and course r ′ cannot be reserved at the same time as one of the mathematical expressions constituting the mathematical model.

  After step 1711, the course control model construction unit 113 returns to step 1708 and performs step 1710 on all the courses of the set R ′.

  When it is determined in step 1708 that the set R ′ is an empty set, the course control model construction unit 113 determines whether or not there is course reservation information in the course reservation information table 120 (1712). Specifically, in step 1712, the course control model construction unit 113 determines that there is course reservation information when the course reservation information table 120 includes at least one record.

  If there is route reservation information, the route control model construction unit 113 proceeds to step 1713. If there is no route reservation information, the route control model construction unit 113 returns to step 1702, and performs the processing after step 1703 shown in FIG. 18 until the constraint expressions related to security and interlocking are generated for all the routes indicated by the route information table 118. repeat.

  In step 1713, the route control model construction unit 113 generates a constraint equation for route reservation constraints.

  FIG. 19 is a flowchart illustrating processing for generating a constraint expression for a route reservation constraint according to the first embodiment of this invention.

  The process shown in FIG. 19 corresponds to step 1713 shown in FIG.

  The process up to step 1808 shown in FIG. 19 is a process for generating an expression representing a constraint condition where the constraint ID 1501 of the basic constraint list table 107 shown in FIG. 14 is “3”, and the process from step 1809 to step 1813 is shown in FIG. 14 is a process for generating an expression representing a constraint condition in which the constraint ID 1501 of the basic constraint list table 107 shown in FIG. 14 is “4”.

  When Step 1713 is started, the course control model construction unit 113 generates a set B including each record of the course reservation information table 120 as the course reservation information (1801).

  After step 1801, the course control model construction unit 113 determines whether or not the set B is an empty set (1802). If the set B is not an empty set, the course control model construction unit 113 proceeds to step 1803. If the set B is an empty set, the course control model construction unit 113 proceeds to step 1809.

  In step 1803, the route control model construction unit 113 extracts one route reservation information from the set B as the route reservation information b, and deletes the extracted route reservation information b from the set B. After step 1803, the route control model construction unit 113 generates a set S as a set of valid trains (1804).

  After step 1804, the course control model construction unit 113 determines whether or not the set S is an empty set (1805). If the set S is not an empty set, the course control model construction unit 113 proceeds to step 1806. When the set S is an empty set, the course control model construction unit 113 returns to step 1802 and repeats step 1803 for all the course reservation information indicated by the course reservation information table 120.

  After step 1805, the route control model construction unit 113 extracts one train from the set S as a train x train and deletes the extracted train x train from the set S (1806).

  After step 1806, the route control model construction unit 113 determines whether the train x train is a designated train of the route reservation information b using the route reservation information table 120 (1807). Specifically, in step 1807, the route control model construction unit 113 determines that the train x train corresponds to the train 207 indicated by the target train 1003 of the record of the route reservation information b in the route reservation information table 120. It is determined that the train is designated as the route reservation information b.

  When it is determined that the train x is a designated train in the route reservation information b, the route control model construction unit 113 proceeds to step 1808 to generate a constraint equation. If the train x is not a designated train in the route reservation information b, the route control model construction unit 113 returns to step 1805 and repeats step 1806 for all valid trains.

  In step 1808, the route control model construction unit 113 generates a constraint expression “reserve the designated route in the route reservation information b if the train x train next enters the inner section of the trigger route in the route reservation information b”. The generated constraint equation is added to the course control model. Here, the designated course is a course indicated by the simultaneous reservation course 1005.

  The constraint expression generated in step 1808 is a formula (4) indicating a constraint condition in which the constraint ID 1501 in the basic constraint list table 107 shown in FIG. 14 is “3”.

Next_Section (x): Next state of train x (-1: no line or section s: line section)
Inner_Section (s): Set of inward sections of the course with section s as the outside
Now_Section (x): Current section of train x
Route_Lock_Route (b): Set of designated routes for route reservation information b
Route_Lock_Train (b): Set of designated trains for route reservation information b
Trigger_Route (b): Trigger route for route reservation information b
Inner_Section (r): Inner section of course r
Route_Lock: Collection of route reservation information
Next_Route (r): Next state of the route (-1: No reservation or Train x: r reserved)
Expression (4) is an expression that shows a constraint condition that determines that the designated route of the route reservation information b is reserved at the same time as one of the mathematical expressions constituting the mathematical model.

  After step 1808, the route control model construction unit 113 returns to step 1802, and repeats step 1803 and the like for all route reservation information of the set B. If the set B is an empty set in step 1802, the route control model construction unit 113 generates a set S 'as a set of valid trains (1809).

  After step 1809, the course control model construction unit 113 determines whether or not the set S ′ is an empty set (1810). If the set S ′ is not an empty set, the course control model construction unit 113 proceeds to step 1811. When the set S ′ is an empty set, the course control model construction unit 113 ends step 1713 shown in FIG. 19 and returns to step 1702 shown in FIG.

  In step 1811, the route control model construction unit 113 extracts one train from the set S ′ as a train y and deletes the extracted train y from the set S ′. After step 1811, the course control model construction unit 113 determines whether or not the course in the traveling direction of the train y has been reserved by the train y (1812).

  Specifically, the route control model constructing unit 113 sets the value indicating the train y in the current reservation state 806 of the route information table 118 to a value other than the current reservation state 806 of the record indicating the route on the line of the train y. When at least one is stored, it is determined that the course in the traveling direction of the train y is reserved by the train y.

  When it is determined that the route in the traveling direction of the train y is reserved by the train y, the route control model construction unit 113 proceeds to step 1813. When the course in the traveling direction of the train y is not reserved by the train y, the course control model construction unit 113 returns to step 1810 and repeats step 1812 and the like for all valid trains.

  In step 1813, the course control model construction unit 113 generates a constraint expression “take over reservation of y” and adds the generated constraint expression to the course control model. The constraint expression generated in step 1813 is a formula (5) representing a constraint condition in which the constraint ID 1501 in the basic constraint list table 107 shown in FIG. 14 is “4”.

Route_Train (y): set of courses for train y
Now_Route (r): Current state of route r
Inner_Section (r): Inner section of course r
Now_Section (y): Current section of train y
Next_Route (r): Next state of the route (-1: no reservation or train y: reserve r)
R: Set of courses
S: Set of valid trains Equation (5) is a mathematical formula that constitutes a mathematical model, with the constraint that it is determined to take over the reservation when the course in the direction of travel of train y is reserved in train y. It is the formula shown as one.

  After step 1813, the course control model construction unit 113 returns to step 1810 and repeats step 1812 and the like for all valid trains.

  In Step 1810, it is determined that the set S ′ is an empty set, and Step 1713 shown in FIG. 19 ends. Further, in Step 1702, if it is determined that the set R is an empty set, Step 1406 ends. . As described above, the course control model construction unit 113 generates a constraint expression related to security and interlocking in step 1406.

  After step 1406, the course control model construction unit 113 proceeds to step 1407. In step 1407, the course control model construction unit 113 generates a constraint expression related to the relationship between the states.

  FIG. 20 is a flowchart illustrating a process for generating a constraint expression related to a relationship between states according to the first embodiment of this invention.

  The process shown in FIG. 20 corresponds to step 1407 shown in FIG.

  The process up to step 1904 shown in FIG. 20 is a process for generating a constraint expression representing a constraint condition where the constraint ID 1501 in the basic constraint list table 107 shown in FIG. 14 is “5”. Further, the processing from Step 1905 to Step 1909 shown in FIG. 20 is processing for generating a constraint expression representing a constraint condition with constraint ID 1501 of “6” in the basic constraint list table 107 shown in FIG.

  When step 1407 is started, the course control model construction unit 113 generates a set S as a set of valid trains (1901). After step 1901, the course control model construction unit 113 determines whether or not the set S is an empty set (1902).

  If the set S is not an empty set, the course control model construction unit 113 proceeds to step 1903, and if it is an empty set, the course control model construction unit 113 proceeds to step 1905. In step 1903, the route control model construction unit 113 extracts one train from the set S as a train x train and deletes the extracted train x train from the set S.

  After step 1903, the course control model construction unit 113 generates the constraint expression “(train x train advances next) and (train x train course is reserved)”, and the generated constraint The formula is added to the course control model (1904). The constraint formula generated in step 1904 is formula (6) representing a constraint condition (record 1510) with a constraint ID 1501 of “5” in the basic constraint list table 107 shown in FIG.

Inner_Section (r): Inner section of course r
Next_Section (x): Next state of train x (-1: no line or section s: line section)
S: Set of valid trains Equation (6) is an equation that shows a constraint condition for linking the train state and the route state as one of the mathematical expressions constituting the mathematical model.

  After the process of step 1904, the course control model construction unit 113 returns to step 1902 and repeats steps 1903 and 1904 for all valid trains.

  In step 1905, the course control model construction unit 113 generates a set R as a set of all courses indicated by the course information table 118. The course control model construction unit 113 determines whether the set R is an empty set (1906). When the set R is not an empty set, the course control model construction unit 113 proceeds to step 1907, and when the set R is an empty set, the step 1407 shown in FIG.

  In step 1907, the course control model construction unit 113 extracts one course as a course r from the set R and deletes the extracted course r from the set R.

  After step 1907, the course control model construction unit 113 generates a constraint equation “If the route r is reserved, the traffic light 205 is red”, and adds the generated constraint equation to the track control model (1908). Further, after step 1908, the course control model construction unit 113 generates a constraint expression “When the course r is reserved, the traffic light 205 is blue”, and adds the generated constraint expression to the course control model (1909). ).

  The constraint equation generated in step 1908 and step 1909 is the equation (7) representing the constraint condition (record 1511) with the constraint ID 1501 of “6” in the basic constraint list table 107 shown in FIG.

Next_Signal (r): Next state of the traffic light (1: Blue, 0: Red)
Next_Route (r): Next state of the route (-1: No reservation or Train x: r reserved)
S: Set of valid trains The constraint equation generated in step 1908 is the first constraint equation in equation (7), and the constraint equation generated in step 1909 is the second constraint equation in equation (7). It is a formula. Expression (7) is an expression showing a constraint condition for linking the state of the route r and the state of the traffic light 205 as one of mathematical expressions constituting the mathematical model.

  After step 1909, the course control model construction unit 113 returns to step 1906 and repeats steps 1907 to 1909 for all the courses indicated by the course information table 118. If it is determined in step 1906 that the set R is an empty set, the course control model construction unit 113 ends step 1407.

  In step 1407, after setting a constraint equation regarding the relationship between states, the course control model construction unit 113 proceeds to step 1408. In step 1408, the course control model construction unit 113 generates a constraint equation related to the diagram.

  FIG. 21 is a flowchart illustrating a process for generating a constraint expression related to a diagram according to the first embodiment of this invention.

  The process shown in FIG. 21 corresponds to step 1408 shown in FIG.

  When step 1408 starts, the course control model construction unit 113 determines whether or not the early departure prohibition constraint is applied using the basic constraint list table 107 (2001). Specifically, in step 2001, the course control model construction unit 113 refers to the application 1504 of the record (record 1512) in which the constraint 1503 of the basic constraint list table 107 indicates “prohibition of early departure”. Indicates “applied” and the restriction can be applied, it is determined that the early-prohibition restriction is applied.

  If it is determined that the early departure restriction is applied, the course control model construction unit 113 proceeds to step 2002. If it is determined that the early departure prohibition restriction is not applied, the course control model construction unit 113 proceeds to step 2003. In step 2002, the course control model construction unit 113 generates a constraint expression for the early departure prohibition constraint.

  FIG. 22 is a flowchart illustrating a process for generating a constraint expression of the early departure prohibition constraint according to the first embodiment of this invention.

  The process shown in FIG. 22 corresponds to step 2002 of the process shown in FIG.

  When step 2002 is started, the course control model construction unit 113 generates a set S as a set of valid trains (2101). After step 2101, the course control model construction unit 113 determines whether or not the set S is an empty set. If the set S is not an empty set, the course control model construction unit 113 proceeds to step 2103. If the set S is an empty set, the course control model construction unit 113 ends step 2002 shown in FIG.

  In step 2103, the route control model construction unit 113 extracts one train from the set S as a train x train and deletes the extracted train x train from the set S.

  After step 2103, the course control model construction unit 113 determines whether the on-line position of the train x is a number line using the diagram data table 105 and the on-line train information table 106 (2104). Specifically, the course control model construction unit 113 identifies the section indicated by the on-line position 1203 of the record in the on-line train information table 106 indicating the train x train. When the section identified from the existing line position 1203 is the same as the section indicated by the arrival number line 1108 or the departure number line 1109 of the record in the diagram data table 105 indicating the train x record, the route control model construction unit 113 sets the train x It is determined that the current track position is a number line.

  When the on-line position of the train x is a number line, the route control model construction unit 113 proceeds to step 2105. In addition, when the current position of the train x is not a number line, the route control model construction unit 113 returns to step 2102, and repeats step 2103 and the like for all valid trains.

  In step 2105, the course control model construction unit 113 determines whether the current time is before the departure time of the train x or the stay time of the train x is shorter than the minimum stop time.

  In addition, the course control system 100 holds the time synchronized with the planning system 201 and the ground device 203. Then, the route control system 100 acquires the time when the train 207 enters each section and the time when the train 207 advances from each section via the ground device 203. Further, the course control system 100 holds a minimum stop time specified by a user or an administrator in a storage device such as the storage device 101.

  In step 2105, the route control model construction unit 113 specifically acquires the current time held in the route control system 100 as the current time, and further, the time at which the train x train entered the current line section from the current time. By subtracting, the stay time of train x train is calculated. In step 2105, the course control model construction unit 113 acquires the minimum stop time from a storage device such as the storage device 101.

  In step 2105, the route control model construction unit 113 determines that the current time is before the departure time of the train x when the current time is earlier than the time indicated by the departure time 1107 of the diagram data table 105. judge. In addition, the route control model construction unit 113, when the calculated stay time of the train x is shorter than the minimum stop time previously stored in the storage device 101 or the like, the stay time of the train x is shorter than the minimum stop time. Judge as short.

  If the current time is before the departure time of the train x or the stay time is shorter than the minimum stop time, the route control model construction unit 113 proceeds to step 2106 to generate a constraint equation. If the current time is after the departure time of the train x and the stay time of the train x is equal to or longer than the minimum stop time, the route control model construction unit 113 returns to step 2102 and sets all effective trains to step 2103. Repeat etc.

  In step 2106, the course control model construction unit 113 generates a constraint expression “the next position of train x train is the current position”, and adds the generated constraint expression to the course control model. The constraint equation generated in step 2106 is equation (8) representing a constraint condition in which the constraint ID 1501 in the basic constraint list table 107 shown in FIG. 14 is “7”.

Now_Section (x): Current section of train x
Now_Time: Current time
In_Section_Time (x): Time when the current position was entered
Stay_Time: Minimum stop time
Next_Section (x): Next state of train x (-1: no line or section s: line section)
Now_Section (x): Current section of train x
P: Set of sections corresponding to the number line Expression (8) is an expression showing a constraint condition for prohibiting early departure as one of mathematical expressions constituting the mathematical model.

  After step 2106, the route control model construction unit 113 returns to step 2102, and repeats step 2103 and the like for all valid trains.

  If it is determined in step 2102 that the set S is an empty set, the course control model construction unit 113 ends step 2002 shown in FIG. After step 2002, the process of generating a constraint expression related to the diagram in step 1408 is continued by the processes in and after step 2003.

  In step 2002, after generating the constraint equation regarding the early departure prohibition constraint, the course control model construction unit 113 proceeds to step 2003.

  In step 2003, the course control model construction unit 113 determines whether or not the departure order compliance constraint is applied, using the basic constraint list table 107. Specifically, in step 2003, the course control model construction unit 113 refers to the application 1504 of the record (record 1513) in which the restriction 1503 of the basic restriction list table 107 indicates “observation of departure order”. Indicates “applied” and if the constraint is applicable, it is determined that the departure order compliance constraint is applied.

  If it is determined that the departure order observance restriction is applied, the course control model construction unit 113 proceeds to step 2004. If it is determined that the departure order observance restriction is not applied, the course control model construction unit 113 proceeds to step 2005. In step 2004, the course control model construction unit 113 generates a constraint equation for the departure order compliance constraint.

  FIG. 23 is a flowchart illustrating a process for generating a constraint expression for the departure order observance constraint according to the first embodiment of this invention.

  The process shown in FIG. 23 corresponds to the process of step 2004 shown in FIG.

  When step 2004 is started, the route control model construction unit 113 records the train 207 of the record in which the value of 2 or more is stored in the departure order 2201 in the departure order information table 111, that is, a record in which a value of 2 or more is stored in the departure order 2201. Extract. Then, the route control model construction unit 113 generates a set S ′ as a set of the extracted trains 207 (2301).

  After step 2301, the course control model construction unit 113 determines whether or not the set S ′ is an empty set (2302). If the set S ′ is not an empty set, the process proceeds to step 2303. If the set S ′ is an empty set, step 2004 shown in FIG. 23 is ended.

  In step 2303, the route control model construction unit 113 extracts one train from the set S 'as a train x and deletes the extracted train x from the set S'.

  After step 2303, the course control model construction unit 113 determines whether or not the train x train is an active train by using the on-line train information table 106 (2304). If the train x is an active train, the route control model construction unit 113 proceeds to step 2305. When the train x is not a valid train, the process returns to step 2302, and step 2304 and the like are repeated for all trains in the second order of departure.

  In step 2305, the route control model construction unit 113 determines whether the current position of the train x train is a number line, whether the current position 1203 of the current train information table 106, the arrival number 1108 and the departure number 1109 of the diagram data table 105. Determine using. A specific determination method is the same as that in step 2104 shown in FIG.

  If the current position of the train x is not a number line, the course control model construction unit 113 proceeds to step 2306. If the present position of the train x is a number line, the course control model construction unit 113 proceeds to step 2307.

  In step 2306, the route control model construction unit 113 generates a constraint equation “train x train does not reserve a departure route”, and adds the generated constraint equation to the route control model.

  On the other hand, in step 2307, the route control model construction unit 113 generates a constraint equation “Train x train is next current position” and adds it to the generated route control model.

  The constraint equation generated in step 2306 and step 2307 is equation (9) representing a constraint condition (record 1513) with a constraint ID 1501 of “8” in the basic constraint list table 107 shown in FIG. The constraint expression generated in step 2306 is the first expression of the following expression (9). Further, the constraint expression generated in step 2307 is the second expression of the following expression (9).

Now_Section (x): Current section of train x
Sot (x): Departure order of train x
Next_Section (x): Next state of train x (-1: no line or section s: line section)
P: Set of sections corresponding to the line
S: Set of valid trains Equation (9) is an equation that shows the constraint condition for ensuring the departure order as one of the mathematical expressions constituting the mathematical model.

  After the process of step 2306 or step 2307, the route control model construction unit 113 returns to step 2302, and repeats step 2304 and the like for all trains in the second order of departure.

  If it is determined in step 2302 that the set S ′ is an empty set, the course control model construction unit 113 ends step 2004 shown in FIG. 23 and proceeds to step 2005 shown in FIG.

  After generating the constraint expression of departure order compliance constraints in step 2004, in step 2005, the course control model construction unit 113 determines whether or not the number line compliance constraint is applied. Specifically, in step 2005, the course control model construction unit 113 refers to the application 1504 of the record (record 1514) in which the constraint 1503 of the basic constraint list table 107 indicates “use designated line” is used. If 1504 indicates “applied” and the constraint can be applied, it is determined that the number line compliance constraint is applied.

  When the line compliance restriction is applied, the course control model construction unit 113 proceeds to step 2006. When the number line compliance restriction is not applied, the course control model construction unit 113 ends Step 1408 shown in FIG. In step 2006, the course control model construction unit 113 generates a number line compliance constraint.

  FIG. 24 is a flowchart illustrating processing for generating a constraint equation for the number line compliance constraint according to the first embodiment of this invention.

  The process shown in FIG. 24 corresponds to the process shown in step 2006 of FIG.

  When step 2006 is started, the course control model construction unit 113 generates a set S ′ as a set of valid trains and arrival number 1108 or departure number 1109 unarrived trains (2401). After step 2401, the course control model construction unit 113 determines whether or not the set S ′ is an empty set (2402).

  In step 2401, the course control model construction unit 113 indicates that the arrival line 1108 or the departure number 1109 of the diagram data table 105 has arrived at the line indicated by the current line position 1203 and the traveling direction 1204 of the current line train information table 106. If it can be determined by the above, it is determined that the valid train has arrived on the line and is not included in S ′.

  If the set S ′ is not an empty set, the process proceeds to step 2403, and if the set S ′ is an empty set, step 2006 shown in FIG. 24 is ended.

  In step 2403, the route control model construction unit 113 extracts one train as a train x from the set S ′ and deletes the train x from the set S ′. After step 2403, the route control model construction unit 113 determines whether or not the train x train is reserving a route (2404).

  Specifically, in step 2404, when the route name is stored in the route reservation position 1205 of the on-line train information table 106, the route control model construction unit 113 determines that the train x train is reserving the route. .

  In step 2404, when the train x train is reserving a route, the route control model construction unit 113 proceeds to step 2405. If the train x train has not reserved a route, the route control model construction unit 113 proceeds to step 2415.

  In step 2405, the course control model construction unit 113 determines whether there are a plurality of courses in which the inner section of the reserved course of the train x is the outer section. Specifically, in step 2405, the course control model construction unit 113 specifies the course (reserved course) reserved by the train x train from the course reservation position 1205 of the record in the train information table 106 indicating the train x train. Then, the inner section 804 of the record of the course information table 118 indicating the identified reserved course is identified. Then, when there are a plurality of records in the route information table 118 that include the value of the specified inner section 804 in the outer section 803, the course control model construction unit 113 excludes the inner section of the reserved route of the train x train. It is determined that there are a plurality of routes to be used as the direction section.

  When there are a plurality of routes having the inner section of the reserved route of train x train as the outer section, the route control model construction unit 113 proceeds to step 2406. When there are not a plurality of routes in which the inner section of the reserved route of train x is the outer section, the route control model construction unit 113 returns to step 2402 and repeats step 2404 and the like for all valid trains.

  In step 2406, the route control model construction unit 113 generates a set R as a set of routes having the inner section of the reserved route of train x train as the outer section, and proceeds to step 2407.

  In step 2415, the route control model construction unit 113 determines whether there are a plurality of routes having the train x train existing section as an outer section. Specifically, in step 2415, the course control model construction unit 113 identifies the on-line position of the train x from the on-line position 1203 of the record in the on-line train information table 106 indicating the train x. Then, when there are a plurality of records in the route information table 118 including the value of the specified staying line position 1203 in the outer section 803, the course control model construction unit 113 sets the staying section of the train x train as the outer section. It is determined that there are multiple.

  When there are a plurality of routes having the current section of the train x train as the outer section, the course control model construction unit 113 proceeds to step 2416. When there are not a plurality of routes having the current section of train x as the outer section, the route control model construction unit 113 returns to step 2402 and repeats step 2404 and the like for all valid trains.

  In step 2416, the route control model construction unit 113 generates a set R as a set of routes in which the existing section of the train x is the outer section, and proceeds to step 2407.

  In step 2407, the course control model construction unit 113 determines whether the set R is an empty set. If the set R is not an empty set, the course control model construction unit 113 proceeds to step 2408. When the set R is an empty set, the route control model construction unit 113 returns to step 2402, and repeats step 2404 and the like for all valid trains.

  In step 2408, the course control model construction unit 113 extracts one course from the set R as the course r, and deletes the extracted course r from the set R. After step 2408, the route control model construction unit 113 determines whether or not the route r is the route on the shortest route to the designated number line of the train x train (2409).

  Here, the “designated number line” is a section indicated by the arrival number line 1108 when the train x train has not arrived at the arrival number line 1108, and has arrived at the arrival number line 1108 but has not arrived at the departure number line 1109. Is the section indicated by the departure number line 1109.

  The “shortest route” is a route from the section indicated by the current position 1203 of the train x train to the section indicated by the designated number line, which is obtained by a generally known method for solving the shortest path problem. If the route r is not the route on the shortest route to the designated number line of the train x train, the route control model construction unit 113 proceeds to step 2410.

  When the route r is the route on the shortest inspection route to the designated line of the train x train, the route control model construction unit 113 returns to step 2407 and sets the inner section or the existing section of the reserved course of the train x train as the outer section. Step 2409 and the like are repeated for all the routes.

  Note that the route of the train 207 may be a route designated in advance by a user or an administrator, or may not be limited to the shortest route. In this case, the “shortest station road” in step 2409 is replaced with “designated route” in the case of a designated route, and “route” if not the shortest route. In the case of a designated route, whether or not the route r is a designated route, and if it is not limited to the shortest route, the route r is routed from the route r to the designated number line via the route stored in the route information table 118. It is determined whether or not it can be reached.

  In step 2410, the route control model construction unit 113 generates a constraint equation “Train x train does not reserve route r”, and adds the generated constraint equation to the route control model. The constraint expression generated in step 2410 is an expression (10) representing a constraint condition in which the constraint ID 1501 in the basic constraint list table 107 shown in FIG. 14 is “9”.

Now_Section (x): Current section of train x
R (x): The union of the route with the inward section of the reserved route of train x as the outside and the route with the in-line section of train x as the outside
Arv_Route (x): A set of routes to the designated line of train x
Next_Route (r): Next state of the route (-1: no reservation or train x: route r reserved)
S ': A set of valid trains and arrival number 1108 or departure number 1109 not arriving train Equation (10) shows the constraint condition for using the specified number line as one of the mathematical expressions constituting the mathematical model It is a formula.

  After step 2410, the course control model construction unit 113 returns to step 2407, and repeats step 2409 and the like for all courses having the inner section or the existing section of the reserved course of train x train as the outer section.

  If it is determined in step 2407 that the set R is an empty set and it is determined in step 2402 that the set S is an empty set, the course control model construction unit 113 ends step 2006 shown in FIG.

  Further, when step 2006 is completed, or when it is determined in step 2005 that the line compliance restriction is not applied, the course control model constructing unit 113 ends step 1408 shown in FIG.

  In step 1408, after generating the constraint equation regarding the diamond, the course control model construction unit 113 proceeds to step 1409. In step 1409, the course control model construction unit 113 generates a constraint expression related to operation. That is, the course control model construction unit 113 generates a constraint expression for the constraint condition set on the operational constraint setting screen 302 in step 1409.

  FIG. 25 is a flowchart illustrating processing in constraint setting related to operation according to the first embodiment of this invention.

  The process shown in FIG. 25 corresponds to Step 1409 shown in FIG.

  When step 1409 is started, the course control model construction unit 113 generates a set T as a set of constraints related to operations indicated by the operation constraint list table 108 (2501). After step 2501, the course control model construction unit 113 determines whether or not the set T is an empty set (2502).

  When the set T is not an empty set, the course control model construction unit 113 proceeds to step 2503, and when the set T is an empty set, the course control model construction unit 113 ends step 1409 shown in FIG.

  In step 2503, the course control model construction unit 113 extracts a constraint relating to one operation from the set T as a constraint t, and deletes the extracted constraint t from the set T. After step 2503, the course control model construction unit 113 determines whether the constraint t is a constraint to be applied (2504).

  Specifically, in step 2504, the course control model construction unit 113 determines that the constraint t is a constraint to be applied when the record application 1304 of the operation constraint list table 108 indicating the constraint t is “◯”. To do.

  If the constraint t is a constraint to be applied, the course control model construction unit 113 proceeds to step 2505. When it is determined that the constraint t is not a constraint to be applied, the course control model construction unit 113 returns to Step 2502 and repeats Step 2504 and the like for all the constraints related to the operation shown in the operation constraint list table 108.

  The course control model construction unit 113 generates a constraint expression indicating the constraint t in step 2505. In the following, a process for generating a constraint expression “a priority is given to the oncoming train if the customer service takes time” in which the application 1304 of the operation constraint list table 108 illustrated in FIG. 13 is “◯” will be described.

  FIG. 26 is a flowchart illustrating an example of processing for generating a constraint expression for constraints related to operation according to the first embodiment of this invention.

  The process shown in FIG. 26 is an example of the process of step 2505 shown in FIG. Specifically, FIG. 26 shows a process for generating a constraint equation in a case where the constraint t is a constraint of “prioritize oncoming trains if it takes time to handle customers”.

  When step 2505 is started, the course control model construction unit 113 generates a set S as a set of valid trains (2601). After step 2601, the course control model construction unit 113 determines whether or not the set S is an empty set (2602). If the set S is not an empty set, the process proceeds to step 2603. If the set S is an empty set, step 2505 shown in FIG. 26 is ended.

  In step 2603, the route control model construction unit 113 extracts one train as a train x from the set S and deletes the extracted train x from the set S. After step 2603, the course control model construction unit 113 determines whether or not the on-line position of the train x is a number line (2604). The determination method in step 2604 is the same as the determination method in step 2104 shown in FIG.

  When the on-line position of the train x is a number line, the route control model construction unit 113 proceeds to step 2605. When the current position of the train x is not a number line, the route control model construction unit 113 returns to step 2602 and repeats step 2604 and the like for all valid trains.

  In step 2605, the route control model construction unit 113 determines whether the train x train is stopped on the number line because it takes time to treat the customer. Specifically, in step 2605, for example, the route control model construction unit 113 determines whether or not the train x 207 is stopped because the train x train takes time to handle the passenger. The amount of change in weight may be received via the digital radio and the ground device 203. And when the received variation | change_quantity does not become constant in predetermined time, you may determine with having stopped because it takes time for customer treatment.

  In step 2605, the course control model construction unit 113 may receive the result of the judgment of the state of the train x train by the conductor or the station staff via the network. Then, the course control model construction unit 113 may determine that the train x train is stopped because it takes time to handle passengers according to the received judgment result by the conductor or station staff.

  When the train x train is stopped because it takes time to handle customers, the course control model construction unit 113 proceeds to step 2606. If the train x train is not stopping because it takes time to handle customers, the course control model construction unit 113 returns to step 2602 and repeats step 2604 and the like for all valid trains.

  In step 2606, the course control model construction unit 113 generates a constraint expression “the next position of train x train is the current position”, and adds the generated constraint expression to the course control model. In addition, after step 2606, the route control model construction unit 113 generates a constraint equation “train x train does not reserve a departure route” in step 2607, and adds the generated constraint equation to the route control model.

  The constraint expression generated in step 2606 and step 2607 is the expression (11) representing the constraint condition in which the ID 1301 in the operation constraint list table 108 illustrated in FIG. 13 is “0”.

Now_Section (x): Current section of train x
Now_Train: Current state of train t (Example: 1: Handling passengers)
Next_Section (x): Next state of train x (-1: no line or section s: line section)
Next_Route (r): Next state of the route (-1: No reservation or Train x: r reserved)
Dpt_Route (x): Set of departure routes from departure line of train x
P: Set of sections corresponding to the line
S: Set of valid trains Equation (11) is an equation that shows the constraint condition for giving priority to the oncoming train as one of the mathematical formulas constituting the mathematical model if it takes time to handle customers.

  After step 2607, the course control model construction unit 113 returns to step 2602 and repeats step 2604 for all valid trains. When it is determined in step 2602 that the set S is an empty set, the route control model construction unit 113 ends the restriction setting process when the processes for all the effective trains shown in FIG. 26 are completed.

  In step 2505, after generating a set of constraint expressions for the constraint t related to operation, the course control model construction unit 113 returns to step 2502, and repeats step 2504 and the like for all constraints related to operation shown in the operation constraint list table 108. When the processing is completed for all the constraints related to the operation shown in the operation constraint list table 108, the course control model construction unit 113 ends step 1409 shown in FIG.

  Note that, in the above description, only one example of the process for generating the constraint expression for the constraint related to operation has been described. Further, the operation restriction setting screen 302 shown in FIG. 3 and the operation restriction list table 108 shown in FIG. 13 include only the restrictions relating to the four operations.

  However, the route control information generation unit 112 of the present embodiment performs order change or order determination based on the threshold value of data acquired from the ground device 203 of another station or the threshold value of predictable data. As a result, a new constraint condition that can be reflected in the route control information may be generated.

  When the route control system 100 generates a new restriction condition, the route control information generation unit 112 adds a new restriction condition to the operation restriction setting screen 302 and the operation restriction list table 108 illustrated in FIG. . Then, the course control model construction unit 113 generates a constraint expression indicating a new constraint condition by the processing illustrated in FIGS. 25 and 26.

  When step 1409 shown in FIG. 16 is finished, step 403 is finished. After the course control model is generated in step 403, step 404 is started. In step 404, the course control calculation execution unit 115 solves the course control model formulated by the course control model construction unit 113 in order to generate course control information.

  In step 404, the course control calculation execution unit 115 can solve the course control model using any mathematical method as long as it can obtain a solution of a mathematical model formulated like a course control model. Good. In step 404, the course control calculation execution unit 115 may solve the course control model using, for example, a constraint logic program.

  The route control calculation execution unit 115 solves the route control model in step 404 to thereby display the next indication 604 of the traffic signal information table 116 (corresponding to the variable Next_Signal (r) in the above-described equation) and the next reservation in the route information table 118. The stored value of the state 807 (corresponding to the variable Next_Route (r) in the above-described equation) and the section 1206 (corresponding to the variable Next_Section (x) in the above-described equation) that can be on the next line of the on-line train information table 106 is obtained. be able to.

  After step 404, the course control information generation unit 112 updates the course control information scheduled to be transmitted next to the ground device 203 based on the result of the course control model solution in step 404 (405).

  When the course control calculation execution unit 115 solves the course control model as a constraint satisfaction problem in step 404, a plurality of solutions may be calculated. For this reason, when a plurality of solutions for the route control model are calculated, the user, the administrator, or the like may input in advance to the route control system 100 which solution to select.

  For example, the solution having the largest change between the current state (the state indicated by the current indication 603 in the traffic signal information table 116) and the solution obtained in step 404 (the state indicated by the next indication 604 in the traffic signal information table 116) is obtained. A user or the like may input the route control system 100 in advance with a determination method of selecting or selecting a solution having the largest change in a certain section.

  After step 405, the route control information generation unit 112 determines whether or not the train schedule is changed as a result of the update of the route control information in step 405 (406). That is, the route control information generation unit 112 determines whether or not the updated route control information changes the diagram data table 105 or the departure order information table 111 in step 406.

  For example, the route control information generation unit 112 updates the next indication 604 of the traffic light 11R in the section 3-1 where the train b shown in FIG. 5 proceeds next to “blue”, and the train c progresses next. The next indication 604 of the traffic light 12R in the section 3-2 is updated to “red” and the departure order 2201 of the train “b” is larger than the departure order 2201 of the train “c” in the departure order information table 111. In some cases, since the departure order of train b and train c is changed by the updated route control information, it is determined that there is a change in the train diagram indicated by the diagram data table 105 and the departure sequence information table 111.

  If there is a schedule change, the course control information generation unit 112 proceeds to step 407. If there is no timetable change, the course control information generating unit 112 proceeds to step 409.

  In step 407, the route control information generation unit 112 changes the records of the diagram data table 105 and the departure order information table 111, which are determined to have a diamond change, in accordance with the updated route control information. As a result, the route control information generation unit 112 regenerates the train schedule in step 407.

  For example, when the departure order of train b and train c is changed as in the above-described example, in step 407, the route control information generation unit 112 records 2207 indicating the train b in the departure order information table 111. Train number 2202, departure number 2203, departure route 2204, and departure time 2205, and train number 2202, departure number 2203, departure route 2204, and departure time 2205 of record 2206 indicating train c are exchanged .

  After step 407, the route control information generation unit 112 transmits the train diagram regenerated in step 407 to the planning system 201 (408).

  After step 408 or when it is determined in step 406 that there is no timetable change, the route control information generation unit 112 transmits the generated route control information to the ground device 203, so that the traffic signal information table 116 is updated. The route is controlled in accordance with the current indication 604, the next reservation state 807 in the route information table 118, and the section 1206 that can be in the next line in the train information table 106 (409).

  After step 409, the route control information generating unit 112 updates the current indication 603 in the traffic signal information table 116, the current reservation state 806 in the route information table 118, and the train-in-train information table 106 according to the result of the route control (410). . After step 410, the course control information generation unit 112 updates the control display (411). Specifically, in step 411, the route control information generation unit 112 displays the result of the route control in step 405 on the train line display screen 301.

  After step 411, the route control information generation unit 112 returns to step 401 and repeats the process to continue executing the route control for the train 207.

  With the above processing, the processing of the route control system 100 of the first embodiment is completed.

  In the above description, the route control system 100 has restrictions on movement of the train 207 (corresponding to step 1405), restrictions on security and interlocking (corresponding to step 1406), restrictions on relations between states (corresponding to step 1407), and diagrams. The course control model was generated by generating constraint expressions for all of the constraints (corresponding to 1408) and the constraints related to operation (step 1409). However, a constraint equation for some of the above-described constraints may be generated in accordance with an instruction from the user or the like.

  According to the first embodiment, a constraint equation for controlling the route of the train 207 is automatically generated according to the train location information and the constraint condition for determining the route of the train. That is, a constraint expression indicating all constraint conditions necessary for route control is generated, and route control information is generated using a mathematical operation method for solving a mathematical model. For this reason, even when a rule including a restriction for controlling a course such as an order change determination rule is changed, the course control information can be quickly generated by changing only the constraint condition.

  In addition, since it is possible for the user to select whether or not to apply a restriction that the user needs to change as appropriate, such as operational restrictions, it is easy for the user to change the restriction condition.

  Furthermore, since the course control system 100 according to the first embodiment generates a constraint equation according to the constraint conditions and the like, it is possible to avoid a complicated function unit or program that the course control system 100 holds in advance. .

(Second Embodiment)
The course control system 100 according to the second embodiment is applied to a course control training apparatus for training a driver or the like. The second embodiment is an embodiment for providing the course control system 100 shown in the first embodiment as a training device to a user (such as a driver) who controls a train or a user who monitors a train. This is a system that allows the user to check what route control result is obtained when selecting a constraint on the operational constraint setting screen 302 by a route control simulation.

  Since the course control system 100 according to the second embodiment is an apparatus for training, it is a system that prompts the user to change the train diagram if necessary after performing a simulation. For this reason, the course control system 100 of the second embodiment need not be connected to the planning system 201 and the ground device 203.

  FIG. 27 is a block diagram illustrating a configuration of a route control system 100 according to the second embodiment of this invention.

  The course control system 100 according to the second embodiment includes a processor 2702, a storage device 2701, an input device 2703, and an output device 2704. The processor 2702, the storage device 2701, the input device 2703, and the output device 2704 are the same as the processor 102, the storage device 101, the input device 103, and the output device 104 of the first embodiment.

  However, the storage device 2701 has data different from that of the storage device 101 of the first embodiment. Then, the processor 2702 generates route control information for simulation by executing a function unit included in the processor 2702 based on data included in the storage device 2701.

  Further, the input device 2703 is a device for receiving operational restrictions that the user wants to try and information regarding the train that the user wants to simulate, and the output device 2704 is a device for outputting the simulation result.

  The processor 2702 includes a route control information generation unit 2712, a route control model construction unit 2713, a GUI display unit 2714, and a route control calculation execution unit 2715. The course control information generation unit 2712, the course control model construction unit 2713, the GUI display unit 2714, and the course control calculation execution unit 2715 are the course control information generation unit 112, the course control model construction unit 113, the GUI display unit 114, and The same function as the route control calculation execution unit 115 can be realized.

  That is, each function unit included in the processor 2702 may be executed when the processor 2702 reads a program from the storage device 2701.

  The storage device 2701 includes a simulation diagram information table 2705, a train simulation information table 2706, a basic constraint list table 2707, an operation constraint list table 2708, a traffic signal information table 2716, a section information table 2717, a route information table 2718, a section conflict information table 2719, A route reservation information table 2720 and a departure order information table 2711 are included.

  The basic constraint list table 2707, the operation constraint list table 2708, the traffic signal information table 2716, the section information table 2717, the route information table 2718, the section conflict information table 2719, the route reservation information table 2720, and the departure order information table 2711 are the basic constraints. The list table 107, the operation restriction list table 108, the traffic signal information table 116, the section information table 117, the course information table 118, the section competition information table 119, the course reservation information table 120, and the departure order information table 111 each include the same information. .

  The simulation diagram information table 2705 is a table corresponding to the diagram data table 105 of the first embodiment. That is, the diagram data table 105 includes diagram information of the train 207 that actually travels, while the simulation diagram information table 2705 includes diagram information of the train to be simulated. Specifically, unlike the diagram data table 105, the simulation diagram information table 2705 includes a preset entry time of each train.

  The train simulation information table 2706 is a table corresponding to the on-line train information table 106 of the first embodiment. In the first embodiment, the on-line train information table 106 includes a value indicating the on-line position of the actually traveling train 207 transmitted from the ground device 203. On the other hand, the train simulation information table 2706 of the second embodiment includes a value indicating the on-line position of the train in the simulation.

  Since the items included in the train simulation information table 2706 are the same as those in the train-in-train information table 106, description of the items included in the train simulation information table 2706 is omitted.

  FIG. 28 is a diagram illustrating a table configuration example of the simulation diagram information table 2705 according to the second embodiment of this invention.

  FIG. 28 is a diagram showing a simulation diagram information table 2705 showing train diagrams for simulation. A simulation diagram information table 2705 shown in FIG. 28 includes records 2814 to 2818.

  The items included in the simulation diagram information table 2705 are the same as the items included in the diagram data table 105 except for the entry time 2805. Specifically, in the simulation diagram information table 2705, train ID 2801, train number 2802, entry position 2803, advance position 2804, passing stop classification 2806, arrival time 2807, departure time 2808, arrival number line 2809, departure number line 2810, upper and lower classification 2811, pre-operation train 2812, and post-operation train 2813 are train ID 1101, train number 1102, entry position 1103, advance position 1104, passing stop section 1105, arrival time 1106, departure time 1107, arrival in the diagram data table 105. It is the same as the number 1108, the departure number 1109, the upper and lower sections 1110, the front operation train 1111 and the rear operation train 1112.

  The approach time 2805 is the time when the train enters the station in the simulation. For example, in the record 2814, the train ID 2801 is “0”, and the entry time 2805 of the train 207 is “10:05:10”. For this reason, the record 2814 indicates that the train whose train ID is “0” has a simulation time (corresponding to the current time in the first embodiment) held by the processor 2702 “10:05:10”. This indicates that the vehicle enters the section 0 indicated by the entry position 2803.

  In the first embodiment, when the on-line position of the train 207 is transmitted from the ground device 203, a value indicating the on-line is stored in the on-line position 1203 of the on-line train information table 106. On the other hand, in the second embodiment, a value indicating a train whose simulation time is the entry time included in the simulation diagram information table 2705 is stored in the entry position 2803.

  FIG. 29 is a flowchart showing processing in the course control system 100 according to the second embodiment of this invention.

  The course control information generation unit 2712 determines whether or not a simulation train remains (2901). Specifically, in step 2901, the route control information generation unit 2712 performs simulation if there is no train that has not been processed in step 2903 and subsequent steps shown in FIG. 29 among the trains indicated by the records in the simulation diagram information table 2705. Determine that there are no trains left.

  If there is a simulation train in step 2901, the route control information generation unit 2712 proceeds to step 2902. When there is no simulation train, that is, when all the simulation target trains have been simulated, the route control information generation unit 2712 ends the process illustrated in FIG.

  Steps 2902 to 2906 and steps 2908 to 2910 are the same processes as steps 402 to 406 and steps 408 to 410. However, in the process of generating an operational constraint expression in the process of generating the route control model in Step 2903 (Step 1409 in FIG. 16), the process using the information transmitted from the ground device 203 (for example, the determination in Step 2605). The course control model construction unit 2713 performs the processing by using a past record accumulated or a predetermined constant.

  Furthermore, step 2907 of the second embodiment is different from 407 of the first embodiment. That is, in step 2907, the route control information generation unit 2712 does not automatically regenerate the train diagram even when the train schedule is changed as a result of the route control in step 2904. However, in step 2907, the route control information generation unit 2712 displays a screen on the GUI display unit 2714 and the output device 2704 so as to regenerate the train diagram to the user.

  Unlike the course control system 100 of the first embodiment, the course control system 100 in the second embodiment does not need to be connected to the planning system 201. For this reason, it is not necessary for the route control information generation unit 2712 to transmit the regenerated train diagram to the planning system 201, and therefore the route control information generation unit 2712 does not automatically regenerate the train diagram in step 2907.

  In step 2907, the user himself / herself refers to the route control result, and then regenerates the train diagram, so that the route control system 100 allows the user to grasp the selection of the control condition and the relationship between the diagrams. Is realized.

  The process shown in FIG. 29 is repeatedly executed at predetermined time intervals as simulation update timings until the simulation is completed.

  FIG. 30 is an explanatory diagram illustrating an example of a screen displayed by the GUI display unit 2714 for causing the user to regenerate the train diagram according to the second embodiment of this invention.

  In step 2907 shown in FIG. 29, the GUI display unit 2714 displays the train line display screen 3001, the display 3002, the display 3003, the confirmation button 3004, the screen 3005, the screen 3006, and the diagram regeneration screen transition button 3007 on the output device 2704. To display.

  Similar to the train presence line display screen 301, the train presence line display screen 3001 is a screen showing the position of the presence line after the route control of the train. A display 3002 indicates whether or not the diagram has been changed as a result of the route control. A display 3003 indicates whether or not there is a contradiction in the train diagram as a result of the change of the train diagram.

  When the confirmation button 3004 is operated by the user, a screen 3005, a screen 3006, and the like for confirming the change contents and contradiction contents of the train diagram are displayed. A screen 3005 is a screen showing the contents of the train schedule being changed as a result of the route control. A screen 3006 is a screen showing the contents of the contradiction when a contradiction occurs in the train diagram as a result of the change of the train diagram. A diagram regeneration screen transition button 3007 is a button for displaying a screen for changing a diagram when the user manually regenerates a train diagram.

  When the train schedule is changed, in step 2907, the route control information generation unit 2712 displays a display 3002 below the train presence line display screen 3001 via the GUI display unit 2714. When the train schedule is changed and there is a contradiction in the train schedule, the route control information generation unit 2712 displays the display 3003 via the GUI display unit 2714.

  In step 2907, when the confirmation button 3004 is operated by the user, the course control information generation unit 2712 displays a screen 3005, a screen 3006, and a diagram regeneration screen transition button 3007 on the output device 2704 via the GUI display unit 2714. Display the screen that contains it.

  The course control information generation unit 2712 obtains the train schedule change content displayed on the screen 3005 by comparing the simulation diagram information table 2705 before changing the train diagram with the simulation diagram information table 2705 after changing. The course control information generation unit 2712 obtains the contents of the diagram contradiction to be displayed on the screen 3006 by using a general algorithm that uses the strongly connected component decomposition of the graph.

  Further, when the diagram regeneration screen transition button 3007 is operated, the route control information generation unit 2712 displays a diagram change screen possessed by the route control device by using a diagram change function that is one function of a general route control device. May be.

  With the above processing, the processing of the route control system 100 of the second embodiment is completed.

  According to the second embodiment, it is possible to simulate the course control of the train and provide the simulation result to the user based on the simulation data and the operational restrictions that the user wants to try. Then, the user can create a new train diagram after confirming the simulation result.

(Third embodiment)
The course control system 100 according to the third embodiment is a course control test simulator that supports generation of a train schedule. The course control system 100 according to the third embodiment is a system when the course control system 100 according to the second embodiment is applied to a support device for creating a train diagram.

  The course control system 100 according to the third embodiment performs a course control simulation on a train schedule given for simulation, and tests whether the train schedule is actually train controllable. And when it is a train diagram which cannot actually carry out route control, it is a system which generates a train diagram which can actually be controlled and holds the generated train diagram after change as information.

  The differences between the course control system 100 of the second embodiment and the course control system 100 of the third embodiment are as follows. That is, in the second embodiment, the user regenerates the train diagram based on the simulation result. In the third embodiment, the course control system 100 automatically reproduces the train diagram based on the simulation result. The difference is the difference between the second embodiment and the third embodiment.

  FIG. 31 is a block diagram showing the configuration of the course control system 100 according to the third embodiment of the present invention.

  The course control system 100 according to the third embodiment includes a processor 3102, a storage device 3101, an input device 3103, and an output device 3104. The processor 3102, the storage device 3101, the input device 3103, and the output device 3104 are the same as the processor 2702, the storage device 2701, the input device 2703, and the output device 2704 of the second embodiment.

  The processor 3102 includes a course control information generation unit 3112, a course control model construction unit 3113, a GUI display unit 3114, and a course control calculation execution unit 3115. In the third embodiment, a course control model construction unit 3113, a GUI display unit 3114, and a course control calculation execution unit 3115 are configured with a course control model construction unit 2713, a GUI display unit 2714, and a course control calculation execution unit 2715. The same.

  However, part of the processing by the route control information generation unit 3112 is different from part of the processing by the route control information generation unit 2712 of the second embodiment.

  The storage device 3101 includes a train diagram information table 3105, a train simulation information table 3106, a basic restriction list table 3107, an operation restriction list table 3108, a traffic signal information table 3116, a section information table 3117, a course information table 3118, a section conflict information table 3119, The route reservation information table 3120, the departure order information table 3111, and the changed train diagram information table 3121 are provided.

  Train simulation information table 3106, basic restriction list table 3107, operation restriction list table 3108, traffic light information table 3116, section information table 3117, course information table 3118, section competition information table 3119, course reservation information table in the third embodiment 3120 and departure order information table 3111 are train simulation information table 2706, basic restriction list table 2707, operation restriction list table 2708, traffic signal information table 2716, section information table 2717, route information table 2718 in the second embodiment. These are the same as the section conflict information table 2719, the route reservation information table 2720, and the departure order information table 2711.

  The train diagram information table 3105 is a table corresponding to the simulation diagram information table 2705 of the second embodiment. The simulation diagram information table 2705 in the second embodiment shows the train diagram information to be trained by the user, while the train diagram information table 3105 in the third embodiment shows the train diagram of the train to be verified. . Items included in the train diagram information table 3105 are the same as those in the simulation diagram information table 2705.

  The post-change train diagram information table 3121 is a table specific to the third embodiment, and is a table showing train diagram information changed by simulation for trains using each station.

  FIG. 32 is an explanatory diagram illustrating a post-change train diagram information table 3121 according to the third embodiment of this invention.

  The changed train diagram information table 3121 shown in FIG. 32 shows train diagram information that has been changed by simulation for trains that use each station. Each record in the post-change train diagram information table 3121 indicates one post-change train information.

  The changed train diagram information table 3121 includes, as items, a train ID 3201, a train number 3202, a changed arrival time 3203, a changed departure time 3204, a changed arrival number line 3205, and a changed departure number line 3206. The post-change train diagram information table 3121 shown in FIG. 32 includes records 3207 to 3211.

  The train ID 3201 is an identifier for uniquely identifying a train, and is a continuous value starting from 0. Train number 3202 includes a character string indicating the name of the train.

  The changed arrival time 3203 indicates the station arrival time of the train changed as a result of the simulation. The changed departure time 3204 indicates the station departure time of the train changed as a result of the simulation.

  An after-change arrival number line 3205 indicates a number line used when a train arrives at a station after being changed as a result of simulation. The changed departure number line 3206 indicates a number line used when the train leaves the station after being changed as a result of the simulation.

  For example, the record 3207 indicates train schedule change information regarding the train a, the train ID 3201 is “0”, the train number 3202 is “a”, and the changed arrival time 3203 is “−” (none). Yes, the changed departure time 3204 is “10:05:50”, the changed arrival number 3205 is “section 2”, and the changed departure number 3206 is “section 2”. That is, the record 3207 indicates that the departure time has been changed as compared with the information in the train schedule information table 3105.

  FIG. 33 is a flowchart showing processing in the course control system 100 according to the third embodiment of this invention.

  The process shown in FIG. 33 corresponds to the process shown in FIG. 29 of the second embodiment. Specifically, Step 3301 to Step 3306 and Step 3308 to Step 3310 are the same as Step 2901 to Step 2906 and Step 2908 to Step 2910.

  In step 3307, the route control information generation unit 3112 changes the train schedule information for the train schedule that has been changed by simulation, specifically, at least one of arrival time, departure time, arrival number line, and departure number line. Stored in the changed arrival time 3203, the changed departure time 3204, the changed arrival number line 3205, and the changed departure number line 3206 in the table 3121. The route control information generation unit 3112 stores the same data as the train diagram information table 3105 in the items that are not changed.

  With the above processing, the processing of the route control system 100 according to the third embodiment is completed.

  According to the third embodiment, as a result of the simulation, the user can acquire information on the train schedule to be changed.

  In addition, this invention is not limited to embodiment mentioned above, Various modifications are included. For example, the above-described embodiments have been described in detail for easy understanding of the present invention, and are not necessarily limited to those having all the configurations described. Further, a part of the configuration of an embodiment can be replaced with the configuration of another embodiment, and the configuration of another embodiment can be added to the configuration of an embodiment. In addition, it is possible to add, delete, and replace other configurations for a part of the configuration of each embodiment.

  Each of the above-described configurations, functional units, processes, and the like may be realized by hardware by designing a part or all of them with, for example, an integrated circuit. Each of the above-described configurations, functions, and the like may be realized by software by interpreting and executing a program that realizes each function by the processor. Information such as programs, tables, and files for realizing each function is stored in a recording device such as a memory, a hard disk, or an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD. be able to.

  In addition, the control lines and the information lines are those that are considered necessary for the explanation, and not all the control lines and the information lines on the product are necessarily shown. Actually, it may be considered that almost all the components are connected to each other.

DESCRIPTION OF SYMBOLS 101 Memory | storage device 102 Processor 103 Input device 104 Output device 105 Diagram data table 106 Standing train information table 107 Basic restriction list table 108 Operation restriction list table 111 Departure order information table 112 Course control information generation part 113 Course control model construction part 114 GUI display Section 115 Course control calculation execution section 301 Train presence line display screen

Claims (15)

A route control system for transmitting route control information for controlling the route of the train to a device arranged on a track on which the train travels,
The route control system includes:
A processor and a memory;
The memory holds train information including on-line information indicating a position where the train is on-line, and constraint information including constraint conditions for determining a route of the train,
An input / output unit to which the constraint condition is input by a user;
A route control model construction unit that generates a route control model including a constraint equation for determining the route of the train according to the train information;
A route control calculation execution unit that determines the route of the train by solving the route control model generated by the route control model construction unit;
A route control system, comprising: a route control information generation unit that generates the route control information so that the train travels on a route determined by the route control calculation execution unit. The track includes a plurality of sections,
The train information includes traffic signal information indicating current indications of a plurality of traffic lights arranged on the track, section information indicating the traffic lights arranged in the sections, and section conflict information indicating a competitive relationship of the sections. Further comprising facility information including route information indicating a route along which the train travels and route reservation information indicating the train that reserves the route,
The constraint information includes the constraint condition for determining the route according to the presence line information and the facility information,
The route control model constructing unit generates the route control model including the constraint equation for determining a route based on the track information and the facility information according to the train information. Course control system. The input / output unit accepts a constraint condition selected by the user among a plurality of constraint conditions indicating operational constraints,
The constraint information includes the accepted constraint condition,
2. The route control according to claim 1, wherein the route control model construction unit generates the route control model including the constraint equation for determining a route according to the operational constraint according to the train information. system. The track includes a plurality of sections,
The train information includes a diagram information indicating a section in which the train travels and a time at which the train travels through each section,
The constraint information includes a constraint condition related to the departure time of the train, a constraint condition related to the departure order, and a constraint condition related to a use number line,
The route control model constructing unit generates the route control model including the constraint equation for determining a route according to the constraint on the departure time, the constraint on the departure order, and the constraint on the use number line according to the train information. The course control system according to claim 1. The route control information generation unit controls the route of the train by transmitting the generated route control information to a device arranged on the track,
The route control system according to claim 1, wherein the input / output unit generates screen data for outputting the standing line information after the route is controlled. The route control information generation unit simulates the control of the route of the train performed when the generated route control information is transmitted to a device arranged on the track,
The route control system according to claim 1, wherein the input / output unit generates screen data for outputting the result of the simulation. The track includes a plurality of sections,
When the route control information generation unit transmits the generated route control information to a device arranged on a track as a result of the simulation, a section where the train travels and the train travel each section 7. The route control system according to claim 6, wherein simulation diagram information indicating time is generated. The course control model construction unit
Generating the constraint expression expressing the constraint condition by a logical expression;
The route control system according to claim 1, wherein the route control model including the generated constraint equation is generated. A route control method by a route control system that transmits route control information for controlling the route of the train to a device arranged on a track on which the train travels,
The route control system includes a processor and a memory,
The memory holds train information including on-line information indicating a position where the train is on-line, and constraint information including constraint conditions for determining the route of the train,
The method
An input / output procedure for the processor to accept the constraint input by a user;
A route control model construction procedure for generating a route control model including a constraint equation for determining a route of the train according to the train information;
A route control calculation execution procedure for determining a route of the train by the processor solving a route control model generated by the route control model construction procedure;
A route control method comprising: a route control information generation procedure for generating the route control information so that the processor travels on a route determined by the route control calculation execution procedure. The track includes a plurality of sections,
The train information includes traffic signal information indicating current indications of a plurality of traffic lights arranged on the track, section information indicating the traffic lights arranged in the sections, and section conflict information indicating a competitive relationship of the sections. Further comprising facility information including route information indicating a route along which the train travels and route reservation information indicating the train that reserves the route,
The constraint information includes the constraint condition for determining the route according to the presence line information and the facility information,
The route control model construction procedure includes a procedure in which the processor generates the route control model including the constraint equation for determining a route based on the standing line information and the facility information according to the train information. The course control method according to claim 9. The input / output procedure includes a procedure in which the processor receives a constraint condition selected by the user from among a plurality of constraint conditions indicating operational constraints.
The constraint information includes the accepted constraint condition,
The route control model construction procedure includes a procedure in which the processor generates the route control model including the constraint equation for determining a route according to the operational constraint according to the train information. Item 10. A route control method according to Item 9. The track includes a plurality of sections,
The train information includes a diagram information indicating a section in which the train travels and a time at which the train travels through each section,
The constraint information includes a constraint condition related to the departure time of the train, a constraint condition related to the departure order, and a constraint condition related to a use number line,
In the route control model construction procedure, the processor generates the route control model including the constraint equation for determining the route according to the constraint on the departure time, the constraint on the departure order, and the constraint on the use number line according to the train information. The course control method according to claim 9, further comprising: The route control information generation procedure includes a procedure in which the processor controls the route of the train by transmitting the generated route control information to a device disposed on the track.
10. The route control method according to claim 9, wherein the input / output procedure includes a procedure in which the processor generates screen data for outputting the standing line information after the route is controlled. The route control information generation procedure includes a procedure of simulating the route control of the train performed when the processor transmits the generated route control information to a device disposed on the track,
10. The course control method according to claim 9, wherein the input / output procedure includes a procedure in which the processor generates screen data for outputting the simulation result. The track includes a plurality of sections,
In the route control information generation procedure, when the processor transmits the generated route control information to a device arranged on a track as a result of the simulation, a section in which the train travels and the train 15. The course control method according to claim 14, further comprising a procedure of generating simulation diagram information indicating a time at which a section travels.