WO2016147212A1 - 列車ダイヤ校正装置および列車ダイヤ校正プログラム - Google Patents
列車ダイヤ校正装置および列車ダイヤ校正プログラム Download PDFInfo
- Publication number
- WO2016147212A1 WO2016147212A1 PCT/JP2015/001420 JP2015001420W WO2016147212A1 WO 2016147212 A1 WO2016147212 A1 WO 2016147212A1 JP 2015001420 W JP2015001420 W JP 2015001420W WO 2016147212 A1 WO2016147212 A1 WO 2016147212A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- time
- diamond
- node
- train
- arc
- Prior art date
Links
- 238000010586 diagram Methods 0.000 title claims abstract description 125
- 238000012937 correction Methods 0.000 title abstract description 4
- 239000010432 diamond Substances 0.000 claims description 181
- 229910003460 diamond Inorganic materials 0.000 claims description 176
- 238000003860 storage Methods 0.000 claims description 27
- 238000013500 data storage Methods 0.000 claims description 23
- 238000000034 method Methods 0.000 description 46
- 230000008569 process Effects 0.000 description 36
- 230000008859 change Effects 0.000 description 19
- 238000004364 calculation method Methods 0.000 description 13
- 238000012423 maintenance Methods 0.000 description 13
- 230000009467 reduction Effects 0.000 description 13
- 238000012545 processing Methods 0.000 description 11
- 230000001174 ascending effect Effects 0.000 description 8
- 238000001514 detection method Methods 0.000 description 8
- 238000004904 shortening Methods 0.000 description 7
- 238000012795 verification Methods 0.000 description 7
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000013459 approach Methods 0.000 description 4
- 238000011144 upstream manufacturing Methods 0.000 description 4
- 239000000284 extract Substances 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 101150031329 Ets1 gene Proteins 0.000 description 1
- 238000010521 absorption reaction Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000001915 proofreading effect Effects 0.000 description 1
- 238000012552 review Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 239000004308 thiabendazole Substances 0.000 description 1
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
- B61L27/10—Operations, e.g. scheduling or time tables
- B61L27/14—Following schedules
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
- B61L27/10—Operations, e.g. scheduling or time tables
- B61L27/12—Preparing schedules
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
- B61L27/10—Operations, e.g. scheduling or time tables
- B61L27/16—Trackside optimisation of vehicle or train operation
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
- B61L27/50—Trackside diagnosis or maintenance, e.g. software upgrades
- B61L27/57—Trackside diagnosis or maintenance, e.g. software upgrades for vehicles or trains, e.g. trackside supervision of train conditions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Definitions
- the present embodiment relates to a train diagram calibration device and a train diagram calibration program.
- diamond When drafting a train or bus operation plan, determine in advance the travel time between two stations (the standard driving time) and the stopping time at each station (predetermined stopping time), and use that time to create Is basic. In addition, it is rare to create an operation plan for mobiles such as railways, and improvement based on the experience based on a copy of the existing diagram (hereinafter referred to as “diamond") is made several times. It is the fact that diamond is matured by repeating it.
- the method using the conventional PERT treats only the minimum time interval required between events as a constraint, the application is limited, and the method using the critical path can basically be used only for schedule delay analysis. was there.
- the station stopping time is also the predetermined predetermined stopping time considered for delay absorption and the minimum for delay recovery
- the time interval between events such as allowing the stop time, which is difficult to handle in the conventional PERT critical path analysis.
- the train diagram calibration device automatically calibrates the diagram while adjusting the consistency between the stripes on the diagram when changing the existing diagram. It is
- a train diagram calibration device reads a diagram data from a diagram data storage unit storing diagram data relating to a train traveling on a route connecting a plurality of stations, and the diagram data storage unit.
- the nodes are sequentially generated by generating nodes representing arrival and departure events at each station of the train, and connecting the nodes sequentially by arcs respectively representing time intervals between the nodes and arrival order on the time series, and the diagram data Specify a stripe included in the diamond network displayed by the display unit, and a display unit that displays the diamond network generated by the diamond network generation unit.
- a continuing time interval representing a time interval between two trains traveling in a direction, and a cross time interval representing a time interval between two trains traveling in an opposite direction to the terminal station of the line A diamond network updating unit that calculates the earliest time and the latest time of the nodes in the line in the moving direction by calibrating based on the constraint time condition data according to the second embodiment, and updating the diamond network; And the like.
- FIG. 2 is a block diagram showing an example of the hardware configuration of the train diagram calibration device of FIG. 1; Diagram of diamond data converted to a diamond network according to PERT. The figure which shows the specific example of the correspondence of a route and diagram data. The figure which converted the route and diagram data of FIG. 4 into the diagram network according to PERT. The figure which shows the specific example of a diamond calibration mode setting screen.
- the flowchart which shows the specific example of the diamond network production
- the figure explaining generation of the 1st stop arc The figure explaining generation of the 2nd stop arc.
- the figure explaining generation of the 1st arrival order arc The figure explaining generation of the 2nd arrival order arc.
- the figure explaining generation of the 3rd arrival order arc The figure explaining generation of the 4th arrival order arc.
- the figure explaining generation of the 1st number line order arc The figure explaining generation of the 2nd number line order arc.
- the figure explaining generation of the 3rd number line order arc The flowchart which shows the specific example of the diamond network update process in the diamond network update part of FIG. 20 is a flowchart showing a detailed process example of S105 of FIG. 19; 20 is a flowchart showing a detailed process example of S107 of FIG.
- the train diagram calibration device does not automatically create a complete diagram from the state of a blank sheet, but supports the user to change an existing diagram.
- all set time constraints consisttraints of upper limit value and lower limit value of implementation time of each arrival / arrival node, It is possible to obtain at high speed the arrival / departure time of a diamond that adheres to the constraints of the minimum value and the maximum value of the time interval between nodes, and this embodiment is used in this embodiment.
- "do not change the structure of the network” means that there is a restriction on the vehicle operation (how to connect the return line), the arrival order at the station, and the use order of the same line.
- FIG. 1 is a diagram showing an example of the overall configuration of a train diagram calibration device 1.
- the train diagram calibration device 1 includes a diagram data storage unit 11, an input unit 12, a constraint time condition data storage unit 13, a schedule verification unit 14, a diagram calibration mode storage unit 15, and a violation node storage unit 16 , And the display unit 17.
- the diagram data storage unit 11 is a storage device that stores diagram data (operation plan data) related to a train traveling on a route connecting a plurality of stations.
- the diagram data storage unit 11 also stores train information and vehicle operation information as diagram data.
- the train information is, for example, train type information such as an express or an express, and arrangement information of a stop / pass station, using a unique train number as a key.
- the station arrangement information is the numbers given in ascending order of stopping and passing from the starting station to the ending station, the corresponding station code, the classification of passing and stopping, arrival time, departure time (the starting station is only the departure time, the ending station Is a structure composed of arrival time only).
- the vehicle operation information is, for example, vehicle type information such as E233 system and arrangement information of train numbers to be operated, using a unique vehicle operation number as a key.
- the arrangement information of the train number is a structure configured of the numbers assigned in ascending order when the train numbers are arranged in the operation order from the time of leaving and the corresponding train number information.
- the input unit 12 is various input devices used by the user to input information, and corresponds to, for example, a mouse.
- a line included in the diamond network is designated on the editing screen displayed by the display unit 17, and movement destination information is input in time series.
- the constraint time condition data storage unit 13 stores the minimum value and the maximum value of the time intervals between nodes respectively representing the events related to arrival and departure at each station of the train as constraint time condition data of arc connecting these events. It is a storage device.
- constraint time condition data is also referred to as “arc weight”.
- the schedule verification unit 14 When the schedule verification unit 14 receives an input of a schedule (diagram data) related to a plurality of events in the input unit 12, whether the schedule satisfies the constraint time condition stored in the constraint time condition data storage unit 13 or not Verify.
- the schedule verification unit 14 includes a diamond network generation unit 14a, a diamond network update unit 14b, a violation node detection unit 14c, a earliest / latest time constraint change unit 14d, and a diamond calibration mode setting unit 14e.
- the diamond network generation unit 14a reads diamond data from the diamond data storage unit 11, generates nodes, and sequentially connects these by arcs respectively representing time intervals between nodes and arrival order on the time series. Generate a diamond network representing Further, when generating the diamond network, the diamond network generation unit 14a designates both minimum value and maximum value of the time interval required between nodes (arc) from the constraint time condition data as constraints (arc weight). .
- the diagram network update unit 14 b exists in the moving direction of the streak based on the constraint time condition data stored in the constraint time condition data storage unit 13.
- This is a program that calculates the earliest time and the latest time of nodes in a stripe, respectively, updates the diamond network, and outputs the updated data to the display unit 17.
- the diamond network updating unit 14b converges the calculation to correct the upper limit value (early time ET) and the lower limit value (latest time LT) of the execution time of the event specified by the constraint time condition data in each node. It shall be executed repeatedly.
- the violation node detection unit 14c determines whether or not the magnitude relationship between the earliest time ET and the latest time LT of each node is reversed in the calculation process of the earliest time ET and the latest time LT in the diamond network updating unit 14b. If a checked node (ET> LT) is detected, it is stored as a violated node in the violated node storage unit 16.
- the earliest / latest time constraint change unit 14 d is a node obtained by increasing or decreasing the earliest time constraint, the latest time constraint to be protected by the earliest time ET / latest time LT set in each node of the diamond network by each prescribed amount. Designate as the initial value of. That is, the earliest / latest time constraint change unit 14d sequentially changes the increase / decrease value according to the calculation result in the diagram network update unit 14b.
- the diamond calibration mode setting unit 14e causes the display unit 17 to display the diamond calibration mode setting screen based on the input from the input unit 12, and outputs the mode selection information (diamond calibration mode information) designated on the screen. .
- the diamond calibration mode storage unit 15 is a storage device that stores the diamond calibration mode information output from the diamond calibration mode setting unit 14 e.
- the violation node storage unit 16 is a storage device that stores the violation node detected by the schedule verification unit 14 (the violation node detection unit 14c).
- the diagram data storage unit 11, the constraint time condition data storage unit 13, the diagram calibration mode storage unit 15, and the violating node storage unit 16 may be integrated into one storage device or provided appropriately distributed to a plurality of storage devices. May be
- the display unit 17 is a display device that displays a diamond network generated by the diamond network generation unit 14a, a diamond network updated by the diamond network update unit 14b, a diamond calibration mode setting screen output by the diamond calibration mode setting unit 14e, and the like.
- FIG. 2 is a block diagram showing an example of a hardware configuration of the train diagram calibration device 1 of FIG.
- the train diagram calibration device 1 includes a central processing unit (CPU) 101, a read only memory (ROM) 102, a random access memory (RAM) 103, an input / output interface 104, a system bus 105, and an input device. It is a computer configured of the display device 107, the storage 108 and the communication device 109.
- CPU central processing unit
- ROM read only memory
- RAM random access memory
- It is a computer configured of the display device 107, the storage 108 and the communication device 109.
- the CPU 101 is a processing device that executes various arithmetic processes using programs and data stored in the ROM 102 and the RAM 103.
- the ROM 102 is a read-only storage device that stores basic programs for causing the computer to function, environment files, and the like.
- the RAM 103 is a main storage device that stores programs executed by the CPU 101 and data necessary for executing each program, and can perform high-speed reading and writing.
- the input / output interface 104 is a device that mediates connection between various hardware and the system bus 105.
- a system bus 105 is an information transmission path shared by the CPU 101, the ROM 102, the RAM 103, and the input / output interface 104.
- the input device 106 is a device that processes input from a user, and is, for example, a keyboard, a mouse, or the like.
- the display device 107 is a device for displaying the calculation result and the creation screen to the user, and is, for example, a liquid crystal display or a plasma display.
- the storage 108 is a large-capacity auxiliary storage device that stores programs and data, and is, for example, a hard disk drive.
- FIG. 3 is a diagram showing a specific example of a diamond network according to diamond data (schedule) according to PERT.
- Each circle indicates a node.
- the time before the change is set as the standard time, and from the constraint time condition data as the constraint condition of the single event, the earliest time ET (lower limit time) that can be executed, the latest time LT (upper limit) Time) It is assumed that restrictions are added.
- arrows indicate arcs, respectively. Arcs are roughly classified into three types.
- the arc R of the solid line arrow is placed between the departure node of each station (hereinafter also referred to as “departing node”) and the arrival node of the next station (hereinafter referred to as “coming node”), and travels between stations It is an arc equivalent to the "inter-station arc”.
- an arc S indicated by a solid arrow is an arc which is placed between an arrival node of each station and a departure node of the station and corresponds to a station stop, and is referred to as a "stop arc”.
- arc A / D of a dashed arrow is an arc which shows the order between the trains using the same station, and is called "arrival order arc".
- the difference in time set in the diamond before the change (difference in standard time set in the departure node and the arrival node) is set as the standard time interval between events, and should be protected between events As time constraints, it is assumed that minimum time intervals and maximum time intervals are added from the constraint time condition data.
- FIG. 4 is a diagram showing a specific example of the correspondence between the route and the diagram data.
- the A station, the B station, and the C station each show a route map including a plurality of bus lines.
- FIG. 4 (B) shows the diamond data corresponding to three trains operating the route of FIG. 4 (A). For example, diamonds shown by solid lines indicate the movement of a train that leaves station A, passes station B, and then turns back at station C in the opposite direction.
- FIG. 5 is a diagram expressing the route and the diamond data of FIG. 4 by a network type model according to PERT.
- a diamond network is shown, which comprises a plurality of departure and arrival nodes and an arc connecting these nodes.
- a different point from the case of FIG. 3 is that there are a plurality of trains for each of stations A to C, nodes and arcs are set for each train number, and arc P with a two-dot chain arrow is included.
- the arc P is an arc that represents the order in which the same track is used in indwelling / passing at each station, and is referred to as “line order arc” in the present embodiment.
- the minimum time interval and the maximum time interval are added from the constraint time condition data as the time constraints to be protected between events as in the case of the number line order arc P as in the case of other types of arcs.
- Standard driving time The standard driving time required to move from a certain station to a certain station is called "standard driving time".
- the reference operation time is calculated by drawing and simulating a normal operation curve. If the vehicle changes, the vehicle performance also changes, and the simulation value varies. However, simulation is usually performed on the vehicle requiring the longest time, and the standard driving time that all the vehicles can travel can be obtained. When operating at high density like the railways in urban areas in Japan, the density is increased by running all the trains according to this standard driving time.
- the meaning of “hours and minutes” used in the present embodiment also includes time in seconds.
- the reference operation time is constraint time condition data used as a weight of inter-station arc, and data in which ⁇ line section, traveling direction, start station, end station ⁇ is a unique key.
- the data structure is as follows.
- Minimum (standard) stopping time The stopping time at a certain station is determined in advance, and the minimum necessary time is usually set. This is called “minimum (standard) stop time", and most trains operate at this stop time. In some cases, the stopping time may be extended intentionally by the connection between trains at the same station, etc., but if a delay occurs, it can be shortened to the minimum (standard) stopping time. Since the stopping time depends on the number of passengers getting on and off, the rating of the stopping time may change depending on the time zone, and the minimum (standard) stop time may be changed.
- the minimum (standard) stopping time is generally determined for each traveling direction.
- the minimum (standard) stopping time is one of the constraint time condition data used as the weight of the stopping arc, and ⁇ line section, traveling direction, station ⁇ is data having a unique key. In that case, the structure is as follows.
- Minimum return time for a turn back The time from when a train arrives at the terminal station until the return from the terminal station is called "minimum return time for return".
- the stopping time at the time of turning back is determined by the connection between the planned train and the train and is arbitrary. In order to improve the robustness of the diamond against train delays, it is important to increase the stopping time at the time of this turnaround. This is because it is easy to absorb the delay of the train at this stopping time and restore it to the planned diagram. Even when shortening the stopping time at the time of turning back, there is a minimum necessary stopping time.
- the minimum required stop time is the minimum stop time for turning back.
- the minimum turning time for turning back is one of the constraint time condition data used as the weight of the stopping arc, and the data for which ⁇ line section, traveling direction, station ⁇ is a unique key.
- the data structure is as follows.
- Every other hour The time interval at which the preceding train and the following train can travel safely when arriving at the station or leaving the station is called "every other hour.”
- Preceding trains and continuing trains may pass through the turnout when arriving and leaving the station, in which case the time between trains must be greater than the switching time of the turnout.
- a speed difference between the trains occurs, so the train approaches between the two trains. Therefore, it is necessary to secure a time difference (every hour) so as not to approach even if there is a speed difference.
- the "continuation time interval” which represents the time interval between trains traveling in the same direction, and the time interval between trains traveling in the opposite direction, such as arrival trains at the terminal station and departure trains
- crossing intervals since the turnouts are at both ends of the station, time intervals are defined for both ends of the station, and there are as many combinations of arrivals, departures and transits.
- the continuation time intervals exist at both ends of the station, and there is a combination of leading trains and continuation trains.
- the combination has three patterns of arrival, departure, and passage, and usually represents arrival as arrival, departure as departure, and passage as passage. For example, when the preceding train arrives and the continuing train passes, it is expressed as "arriving time interval".
- the continuation time interval is one of the constraint time condition data used as the weight of the arrival order arc and the number line order arc, and the ⁇ U, section, direction, station, combination pattern of preceding and succeeding ⁇ is a unique key. Data that The data structure is as follows.
- turnaround intervals (crossing intervals)
- the turnaround intervals mainly exist in the direction other than the terminal end side of the terminal station, and if there is a turnaround train also at the middle station, there are turnaround intervals.
- the combination includes arrival and departure, and in the case of a transit station, there are three patterns of passage, which are usually expressed as arrival, arrival, departure, and passage.
- Folded time interval (crossed time interval) time and minute is one of the constraint time condition data used as the weight of the arrival order arc and the number line order arc. , Is a unique key data.
- the data structure is as follows.
- FIG. 6 is a diagram showing a specific example of the diamond calibration mode setting screen. This screen is displayed on the display unit 17 by the diamond calibration mode setting unit 14e. Here, it is shown that six diamond calibration modes can be set on the screen.
- the user can change the movement of the streak (calibration pattern) in the diamond editing operation by changing the setting of the diamond calibration mode. This is because the value of the weight of the arc added to the arc at the time of generation of the diamond network changes and is subject to the restriction at the time of movement of the stripe.
- the value to be set to the arc can be changed as follows by ON (apply, maintain, permit) / OFF (do not apply, not maintain, not permit) of each mode.
- Standard driving time application mode ON time When applying: Forces the standard driving time between stations regardless of the train (trains other than the standard driving time) when the slope of the line is Calculate to keep the applied constraints. That is, the standard driving time is applied to all the trains.
- OFF time (when not applied): Calculation is performed to keep restrictions on the driving time between the current Diamond Street stations. That is, the current driving time is kept.
- Driving time delay permission mode ON (when permitting): Regardless of ON / OFF of the standard driving time application mode, remove restrictions for driving time and allow delay for driving time to calculate. .
- OFF time (when not permitted): Calculation is performed so as to keep restrictions on the standard driving time or the driving time between the stations on the current diamond street.
- Transit train order maintenance mode ON time (when maintenance is performed): The transit train at the station is maintained and calculated between the transit train and the stop train.
- OFF time (when not maintained): Arriving between the arrival train and the departure train, without regard to the entry and exit order at that station.
- Stop time shortening permission mode ON time (when permitting): The stop time is calculated so as to keep the minimum (standard) stop time for each predetermined station shorter than the current stop time of the diamond.
- the stop time is calculated so as to maintain the current stop time of the diamond.
- a turning time is calculated so as to protect a predetermined minimum turning time for each station which is shorter than the current turning time of the diamond.
- the looping time is calculated so as to protect the current diamond looping time.
- FIG. 7 is a flowchart showing a specific example of diamond network generation processing in the diamond network generation unit 14a. This process is started by the user requesting the display of the current diamond network.
- the diagram network generation unit 14a reads the diagram data along the operation of the formation n (S1), it generates a destination / outgoing node for each event of one operation (S2).
- the diagram network generation unit 14a refers to the diagram calibration mode storage unit 15 and determines ON / OFF of the reference operation time application mode (S3).
- S3 ON
- S4 the reference driving time application mode
- S3: OFF the process proceeds to S5.
- the diamond network generation unit 14a refers to the diamond calibration mode storage unit 15 and determines ON / OFF of the operation hour / minute delay permission mode.
- the operation time / minute delay permission mode is ON (S4: ON)
- an inter-station arc is generated under the following conditions (S6), and the process proceeds to S10.
- the inter-station arc in the present embodiment is an arc connecting a departure node (departure time node) of a station having the same train to an arrival node (arrival time node) of the next station.
- the diamond network generation unit 14a refers to the diamond calibration mode storage unit 15 and shortens the stopping time Determine the permission mode ON / OFF.
- the stop time reduction mode is ON (S10: ON)
- the first stop arc is generated under the following conditions (S11), and the process proceeds to S13.
- the first stopping arc in the present embodiment is an arc connecting a terminal node (arrival time node) of a station which is the same train to a departure node (departure time node) of the same station.
- the diagram network generation unit 14a refers to the diagram calibration mode storage unit 15 and determines ON / OFF of the return time reduction permission mode.
- the turnaround time reduction mode is ON (S13: ON)
- the second stop arc is generated under the following conditions (S14), and the process proceeds to S16.
- the second stop arc in the present embodiment is an arc that connects from the arrival arrival time node of a certain train included in one vehicle operation to the start departure time node of another train in the same station included in the same vehicle operation. .
- the diagram network generation unit 14a searches all the generated nodes, and extracts a pair of nodes heading from the departure node of each station to the arrival node of the same station. Then, the pairs are sorted in the ascending order of the initial time (standard time) of the source node (S18), and the source node and the destination node are connected by the generated destination order arc according to the sorted order (S19). In addition, even if it is a departure from the same station, if the destination stations are different, the lines passing between the stations are different, so arcs are not connected to each other. Details of the method of generating the arrival order arc will be described later.
- the diagram network generation unit 14a determines whether the connection of the arrival / arrival nodes of all the stations has been completed by the arrival / departure order arc (S20). Here, if the connection of the arrival and departure nodes of all the stations is completed by the arrival and arrival order arc (S20: Yes), the process proceeds to S21. On the other hand, if the connection is not completed (S20: No), the process returns to S17.
- the diagram network generation unit 14a searches all the generated nodes, extracts the destination node and the departure node of each track of each station (S21), and sorts the nodes in the order of earlier initial time (standard time) (S22) ), According to the sorted order, the nodes belonging to different operations are connected by the generated track order arc (S23). The details of the method of generating the number order arc will be described later.
- the diagram network generation unit 14a determines whether or not connection has been completed for the connection / termination nodes of all the number lines of all the stations by the number line order arc (S24).
- the processing is ended.
- the connection is not completed (S24: No)
- the process returns to S21.
- FIG. 8 is a diagram for explaining generation of a node.
- the arrival node is generated in the form of Node (“0”, “node ID”) and the departure node in the form of Node (“1”, “node ID”) for each arrival time point and departure time point.
- the first departure node on Line 1 of Station A is Node (1, A11)
- the arrival node on Line 1 of Station B on the same train is Node (0, B11).
- the value of the weight of the node is set as follows.
- Early time (Et) The arrival node is the arrival time set in the diagram data, and the departure node is the departure time.
- FIG. 9 is a diagram for explaining generation of an inter-station arc.
- the inter-station arc is an arc connecting a departure time node of a station having the same train to an arrival time node of the next station.
- the station-to-station arc uses the departure time of a certain station as a reference (connection source) node according to the diamond data, and uses the arrival time of the next stop station of the same train (the departure time if the next is passing) as the connection destination node Create an arc between In FIG.
- inter-station arc is represented in the form of Arc (“1”, “reference node ID (departure)”, “0”, “connection destination node ID (arrival)”).
- Arc reference node ID (departure)
- connection destination node ID (arrival) For example, an inter-station arc connecting the departure node A11 of the A station line 1 and the arrival node B11 of the B station line 1 is Arc (1, A11, 0, B11).
- each value of the weight of the inter-station arc is set as follows. (1) In the case of the reference operation time application mode ON and the operation time delay permission mode ON-Minimum interval: The reference operation time preset in the section to which the arc corresponds. Maximum time interval: The maximum movable time (for example, 24 hours). (2) When the reference driving time application mode is ON and the driving time delay permission mode is OFF-Minimum time interval: The reference driving time preset in the section to which the arc corresponds. Maximum interval: The reference operation time set in advance in the section to which the arc corresponds.
- FIG. 10 is a diagram for explaining the generation of the first stopping arc.
- the first stopping arc is an arc connecting from an arrival time node of a station having the same train to a departure time node of the same station.
- the first stopping arc creates the arrival time of a certain station as a reference node and the departure time of the next same train as a connection destination node according to the diamond data. In the case of passing stations, create the same way.
- broken line arrows indicate the first stopping arcs, respectively.
- FIG. 10 is a diagram for explaining the generation of the first stopping arc.
- the first stopping arc is an arc connecting from an arrival time node of a station having the same train to a departure time node of the same station.
- the first stopping arc creates the arrival time of a certain station as a reference node and the departure time of the next same train as a connection destination node according to the diamond data. In the case of passing stations, create the same way.
- broken line arrows indicate the
- the first stop arc is represented in the form of Arc (“0”, “reference node ID (arrival)”, “1”, “connection destination node ID (departure)”).
- Arc reference node ID (arrival)
- connection destination node ID (departure) connection destination node ID (departure)
- the first stop arc connecting the arrival node B11 of the B station line 1 and the departure node B12 of the B station line 1 is Arc (0, B11, 1, B12).
- each value of the weight of a 1st stop arc is set as follows.
- FIG. 11 is a diagram for explaining the generation of the second stopping arc.
- the second stopping arc is an arc connecting a terminal arrival arrival time node of a certain train included in one vehicle operation to a start departure time node of another train in the same station included in the same vehicle operation.
- the second stopping arc creates the end arrival time as a reference node, and creates the next departure and departure time of another train as a connection destination node.
- the broken arrow indicates the second stopping arc.
- the second stop arc is represented in the form of Arc (“0”, “reference node ID (arrival)”, “1”, “connection destination node ID (departure)”).
- Arc 0, “reference node ID (arrival)”, “1”, “connection destination node ID (departure)
- a second stopping arc connecting the arrival node C12 of the C station line 1 and the departure node C13 of the C station line 1 is Arc (0, C12, 1, C13).
- each value of the weight of a 2nd stop arc is set as follows.
- FIG. 12 is a diagram for explaining the generation of the first arrival order arc.
- the first arrival order (same route direction arrival) arc is an arc connecting the arrival time node of one train to the arrival time node of the next train when the nodes are sorted in ascending order according to the traveling direction of a station. It is.
- the first arrival and arrival order arc searches node information sorted by station and traveling direction according to train information from the one with a small arrival time, and uses it as a node based on the arrival time, and sets the arrival time of the next separate train Create as a connection destination node.
- FIG. 12 is a diagram for explaining the generation of the first arrival order arc.
- the first arrival order (same route direction arrival) arc is an arc connecting the arrival time node of one train to the arrival time node of the next train when the nodes are sorted in ascending order according to the traveling direction of a station. It is.
- the first arrival and arrival order arc searches node information sorted by station and
- a first arrival order arc connecting the arrival node A12 of the A station line 1 and the arrival node A21 of the A station line 2 is Arc (0, A12, 3, A21).
- Each value of the weight of the first arrival order arc is set as follows.
- Minimum time interval The same interval time as the combination of two nodes already set on the diamond data, the station, the predetermined time interval in the traveling direction (minimum value) is set.
- Maximum time interval The maximum movable time (for example, 24 hours).
- the time interval to be selected is determined as follows.
- the passing train order maintenance mode selected on the diagram calibration mode setting screen of FIG. 6 is ON (maintained)
- the generation condition of the first arrival order arc according to the type of stop / pass of the connection destination node It is different.
- the passing train order maintenance mode is / OFF (not maintained)
- arc generation conditions differ depending on the combination of the stop / pass type of the connection source node and the stop / pass type of the connection destination node. Specifically, the generation condition of the first arrival order arc is determined as follows.
- FIG. 13 is a diagram for explaining the generation of the second arrival order arc.
- the second arrival order (from the same route direction) is an arc connecting the departure time node of one train to the departure time node of the next train when nodes are sorted in ascending order according to the traveling direction of a station. is there.
- the second arrival and departure order arc searches node information sorted by station and traveling direction from those with small departure times according to the train information, and takes the departure time as the node based on the departure time and sets the departure time of the next separate train
- a second arrival order arc is created as a connection destination node.
- broken arrows indicate the second arrival order arcs, respectively.
- FIG. 13 broken arrows indicate the second arrival order arcs, respectively.
- the second arrival order arc is represented in the form of Arc (“1”, “reference node ID (departure)”, “3”, “connection destination node ID (departure)”).
- Arc a second arrival order arc connecting the departure node B32 of the B station line 3 and the departure node B42 of the B station line 4 is Arc (1, B32, 3, B42).
- Each value of the weight of the second arrival order arc is set as follows.
- Minimum time interval The same track interval time (minimum value) predetermined in the direction of travel and the station is set, which is the same as the combination of two nodes already set on the diamond data.
- Maximum time interval The maximum movable time (for example, 24 hours).
- the time interval to be selected is determined as follows.
- the passing train order maintenance mode selected on the diagram calibration mode setting screen of FIG. 6 is ON (maintained)
- the generation condition of the second arrival order arc according to the type of stop / pass of the connection destination node It is different.
- the passing train order maintenance mode is / OFF (not maintained)
- arc generation conditions differ depending on the combination of the stop / pass type of the connection source node and the stop / pass type of the connection destination node. Specifically, the generation condition of the second arrival order arc is determined as follows.
- FIG. 14 is a diagram for explaining the generation of the third arrival order arc.
- the third arrival order (turn back arrival) arc departs from the arrival arrival time node of one train included in one car operation (train operation) in the opposite direction at the same station included in another car operation It is an arc connecting up to the start time node.
- the third arrival order arc creates the arrival time of the next opposite direction train as the connection destination node, with the arrival time as the reference node and the next opposite direction train according to the train information and the vehicle operation information.
- broken arrows indicate the third arrival order arcs, respectively.
- the third arrival order arc is expressed in the form of Arc (“0”, “reference node ID (arrival)”, “3”, “connection destination node ID (reverse departure)”) There is.
- the third arrival order arc connecting the arrival node A12 of the A station line 1 and the reverse departure node A24 of the A station line 2 is Arc (0, A12, 3, A24).
- Each value of the weight of the third arrival order arc is set as follows. Minimum time interval: same as the combination of two nodes already set on the diamond data, the station, the return arrival time interval predetermined in the return direction (minimum value) is set. Maximum time interval: The maximum movable time (for example, 24 hours).
- the time interval to be selected is determined as follows.
- the third arrival order is made by the combination of the traveling direction between two trains and the presence or absence of the numbered line at the station.
- Conditions for arc generation are different.
- the turnaround train order maintenance mode is / OFF (does not maintain), it is not necessary to generate an arc.
- the generation condition of the third arrival order arc is determined as follows.
- FIG. 15 is a diagram for explaining the generation of the fourth arrival order arc.
- the fourth arrival sequence (turning back and forth) arc is from the start departure time node of one train included in one car operation to the end time node arriving in the opposite direction at the same station included in another car operation It is an arc connecting
- the fourth arrival and departure order arc creates, based on the train information and the vehicle operation information, a first departure and departure time as a reference node, and an arrival time of the next opposite direction train as a connection destination node.
- dashed arrows indicate the fourth arrival order arcs, respectively.
- FIG. 15 is a diagram for explaining the generation of the fourth arrival order arc.
- the fourth arrival order arc is expressed in the form of Arc (“1”, “reference node ID (departure)”, “3”, “connection destination node ID (reverse arrival)”) There is.
- the fourth arrival order arc connecting the departure node A11 of the A station line 1 and the reverse direction arrival node A12 of the A station line 1 is Arc (1, A11, 3, A12).
- Each value of the weight of the fourth arrival order arc is set as follows. Minimum time interval: same as the combination of two nodes already set on the diamond data, station, setting the return arrival time interval (minimum value) predetermined in the return direction. Maximum time interval: The maximum movable time (for example, 24 hours).
- the time interval to be selected is determined as follows.
- the fourth arrival order is made according to the combination of the traveling direction between two trains and the presence or absence of the number line at the station. Conditions for arc generation are different.
- the turnaround train order maintenance mode is / OFF (does not maintain), it is not necessary to generate an arc.
- the generation condition of the fourth arrival order arc is determined as follows.
- FIG. 16 is a diagram for explaining the generation of a first numbered line order arc.
- the first numbered line order arc is an arc connecting the departure time node of one train to the arrival time node of the next train when the nodes are sorted in ascending order for each station number line.
- the first track order arc searches the node information sorted by station and track from the one with the smallest departure time according to the train information, sets the node based on the departure time, and connects the arrival time of the next different train Create as a destination node.
- broken arrows indicate the first numbered line order arcs, respectively.
- the first numbered line order arc is represented in the form of Arc (“0”, “reference node ID (departure)”, “2”, “connection destination node ID (arrival)”).
- Arc 0
- reference node ID departure
- connection destination node ID arrival
- a first numbering order arc connecting the departure node B32 of the B station line 3 and the arrival node B33 of the B station line 3 is Arc (1, B32, 2, B33).
- the values of the weight of the first numbered line order arc are set as follows.
- Minimum time interval The same interval time as the combination of two nodes already set on the diamond data, station and number lines, and predetermined time interval hour and minute (minimum value) are set.
- Maximum time interval The maximum movable time (for example, 24 hours).
- the time interval to be selected is determined as follows.
- the passing train order maintenance mode selected on the diagram calibration mode setting screen of FIG. 6 is ON (maintained)
- the first numbered line order arc by the combination of the traveling direction between the two trains and the presence or absence of the numbered line at the station.
- the generation conditions of are different.
- the passing train order maintenance mode is / OFF (do not maintain)
- arc generation is performed by the combination of the traveling direction between two trains, the type of stop / pass between the connection source node and the connection destination node, and the presence or absence of a numbered line at the station.
- Conditions are different. Specifically, the generation conditions of the first numbered line order arc are determined as follows.
- FIG. 17 is a diagram for explaining the generation of a second numbered line order arc.
- the second numbered line order arc is an arc connecting the terminal arrival time node of one train to the node of the next train when the nodes are sorted in ascending order for each numbered station.
- the second numbered line order arc searches node information sorted by station and numbered line from those with small arrival times according to train information, uses the arrival time as the reference node, and connects the node of the next different train to the connection destination node Create as.
- broken arrows indicate the second numbered line order arcs, respectively.
- the second numbered line order arc is represented in the form of Arc (“0”, “reference node ID (end arrival)”, “2”, “connection destination node ID”).
- Arc reference node ID (end arrival)
- connection destination node ID connection destination node ID
- a second numbered line order arc connecting the terminal A21 of the A station line to the node A22 of the A station line is Arc (0, A21, 2, A22).
- each value of the weight of the second numbered line order arc is set as follows.
- Minimum time interval The same interval time as the combination of two nodes already set on the diamond data, station and number lines, and predetermined time interval hour and minute (minimum value) are set.
- Maximum time interval The maximum movable time (for example, 24 hours).
- the time interval to be selected is determined as follows.
- the generation condition of the second numbered line order arc differs depending on the combination of the traveling direction between the two trains and the presence or absence of the numbered line at the station. Specifically, the generation conditions of the second numbered line order arc are determined as follows.
- FIG. 18 is a diagram for explaining the generation of a third numbered line order arc.
- the third number order arc is When the nodes are sorted in ascending order for each train number of a certain station, it is an arc connecting the first departure and departure time node of one train to the node of the next train.
- the third track order arc searches node information sorted by station and track according to predetermined train information from the one with the smallest departure time, and uses it as the node based on the first departure time, and the node of the next separate train Is created as a connection destination node.
- broken line arrows respectively indicate third numbered line-order arcs.
- FIG. 18 is a diagram for explaining the generation of a third numbered line order arc.
- the third number order arc is When the nodes are sorted in ascending order for each train number of a certain station, it is an arc connecting the first departure and departure time node of one train to the node of the next train.
- the third track order arc
- the third number line order arc is represented in the form of Arc (“1”, “reference node ID (first departure)”, “2”, “connection destination node ID”).
- Arc reference node ID (first departure)
- connection destination node ID connection destination node ID
- a third track order arc connecting the first departure node C21 of the C station line 2 and the node C22 of the C station line 2 is Arc (1, C21, 2, C22).
- each value of the weight of the third numbered line order arc is set as follows.
- Minimum time interval (seconds) The same interval time as the combination of two nodes already set on the diamond data, station and line, and predetermined time interval (minimum value) is set.
- the time interval to be selected is determined as follows.
- the generation condition of the third numbered track order arc differs depending on the combination of the traveling direction between the two trains and the presence or absence of the numbered line at the station. Specifically, the generation condition of the third numbered line order arc is determined as follows.
- FIG. 19 is a flowchart showing a specific example of the diamond network update process in the diamond network update unit 14 b of FIG. 1. This process is started by the user editing a diagram on the screen.
- the diagram network updating unit 14b extracts all the nodes affected by the edited stripe (S101), and stores, for each node, the set time of each node before moving the stripe as an initial value of ET (the earliest time).
- the diagram network updating unit 14b determines whether the edited line has moved backward (future time) in time series with respect to the time of the diamond before editing (S103).
- the time of the editing stripe is set as the earliest / latest time constraint (S104)
- Update calculation of ET ⁇ LT is performed in the backward movement mode (S105).
- the initial value LT0 is gradually updated according to the number of repetitions as follows based on, for example, the latest time constraint LTmax to be protected by each node: Tighten the constraints and detect the most bottleneck nodes.
- DT1 and DT2 are correction values, and the number of iterations is the number of iterations of step S102.
- LT0 LTmax + (DT1-number of iterations ⁇ DT2) Since the latest time constraint LTmax which is the maximum time interval constraint is included, the contents of this update operation are different from the time update operation in the conventional PERT.
- Step 1: Topological Sorting of Nodes Since ET needs to calculate values in the preceding order of nodes (LT in the reverse direction), it carries out topological sorting in advance. The topological sort is to rearrange all the nodes in the order that A precedes B whenever certain node A precedes node B.
- Step 2 Initialization
- the following initialization is performed for all nodes i. As described above, in the process of detecting the constraint violating node, the earliest / latest time constraint changing unit 14 d corrects the initial value.
- ETs-1 is the value before updating
- ETs is the value after updating.
- Step 4 LT Update Operation
- LTs-1 is a value before updating
- LTs is a value after updating
- ET and LT can be calculated independently, and the order of ET update operation and LT update operation may be reversed, and the operations from equations (1) to (4) can be performed in the same loop of iterative operation It may be implemented by
- the diagram network update unit 14b determines whether the ET ⁇ LT update operation has succeeded in S105 or S107 (S108).
- S108: Yes when it is determined that the operation is successful (S108: Yes), the time determined by the operation is taken out from ET and LT, this is reflected on the stripe, and a new diamond network is redrawn (S109). The earliest and latest time constraints are set and the process proceeds to S113.
- S108: No when it is determined that the operation fails, that is, a violating node is generated (S108: No), the stripe is returned to the state before editing and redrawn (S111), ET, LT, latest time constraint The value before editing is restored (S112), and the process proceeds to S113.
- the diagram network updating unit 14b determines whether or not the user has finished editing the stripe. Specifically, it is determined whether the user has instructed the end of the editing screen. Here, when it is determined that the line editing is completed (S113: Yes), the process is ended. On the other hand, when it is determined that the line editing is not finished (S113: No), the process returns to S101.
- FIG. 20A is a flowchart showing a detailed process example of S105 of FIG.
- the ET (i) is updated according to equation (1) for each node (S201), and if there is a node where ET (i) is larger than LT (i) (S202, S203: YES) returns an error (S204), and the violation node detection unit 14c detects the node as a violation node.
- update calculation of ET (i) is performed according to the equation (2) for each node (S211), and when there is a node where ET (i) is larger than LT (i) (S212, S213: YES And returns an error (S214), and the violation node detection unit 14c detects the node as a violation node.
- Cmax described in the flowchart is used to store the most downstream node whose value has been updated according to equation (1), and to limit the range of calculation of equation (2) upstream of that node.
- Cmin conversely stores the most upstream node whose value has been updated according to equation (2), and is used to limit the range in which the operation of equation (1) is performed downstream of that node.
- FIG. 20B is a flowchart showing a detailed process example of S107 of FIG.
- update calculation of ET (i) is performed for each node according to equation (2) (S301), and when there is a node where ET (i) is larger than LT (i) (S302, S303: YES And returns an error (S304), and the violation node detection unit 14c detects the node as a violation node.
- update calculation of ET (i) is performed according to the equation (1) for each node (S311), and when there is a node in which ET (i) becomes larger than LT (i) (S312, S313: YES) returns an error (S314), and the violation node detection unit 14c detects the node as a violation node.
- the process included in block B1 is the same as block A2 in FIG. 20A
- the process included in block B2 is the same as block A1 in FIG. 20A
- the execution order is reversed.
- Cmax described in the flowchart stores the most downstream node whose value has been updated by equation (1), and the range in which equation (2) is calculated is upstream of that node Used to limit.
- Cmin conversely stores the most upstream node whose value has been updated according to equation (2), and is used to limit the range in which the operation of equation (1) is performed downstream of that node.
- the LT updating operation is also performed by repeating the procedure of updating values alternately using Equations (3) and (4) according to the processing flowchart of FIG. 20B until the values converge. The description is omitted because
- FIG. 21 is a diagram showing a case (1) of editing a diamond.
- the case where the fixed range of diamond stripes is moved to the screen right direction (late time) is shown.
- the time value of each node indicated by a dotted circle is updated. Each time interval and order between C2 and node F1 is maintained.
- FIG. 22 is a diagram showing a case (2) of editing a diamond.
- the case where only the arrival node C2 on the diamond is specified and the screen moves in the right direction (late time) of the screen is shown.
- the time value of the node C2 is updated.
- changes may be made possible, such as moving sequentially as in FIG. 21 or warning as a violation node.
- FIG. 23 is a diagram showing a case (3) of editing a diamond.
- the movement of the diamond when the reference driving time application mode is ON (apply) and the stopping time reduction permission mode is ON is shown.
- the time interval between the departure node B2 and the arrival node B3 is T1
- the time interval between the arrival node B3 and the departure node B4 is T2.
- the two diamond lines are set according to the standard operation time. By moving the left streak from this state to approach the right diamond with a sufficient stopping time, the stopping time is reduced to T1 'while shortening the time interval T1 of the critical path portion to the minimum value T1'.
- the diamond is adjusted so as to shorten from T2 '.
- FIG. 24 is a diagram showing a case (4) of editing a diamond.
- the movement of the diamond when the reference driving time application mode is ON and the stopping time reduction permission mode is OFF (does not apply) is shown. If there are two diamond stripes according to the standard driving time and the left diamond stripe is moved to approach the right diamond stripe with sufficient stopping time, the critical path part hourly interval T1 of the landing order arc It is shortened to T1 'corresponding to the minimum value of the weight, and the diamond is adjusted while maintaining the stopping time between the node B3 and the node B4 at T2. Also, unlike the nodes on the left side of the diamond, the implementation time of each node on the right side is not changed after editing.
- FIG. 25 is a diagram showing a case (5) of editing a diamond.
- the critical path portion is obtained by connecting the two diamonds according to the standard driving time to be folded back at the A station and bringing the left diamond designated by the broken line close to the diamond on the right with sufficient folding time.
- the diamond is adjusted by shortening the turn-back time T1 to the minimum turn-back time T1 '.
- FIG. 26 is a diagram showing a case (6) of editing a diamond.
- the critical path portion is obtained by connecting the two diamonds according to the standard driving time to be folded back at the A station and bringing the left diamond designated by the broken line close to the diamond on the right with sufficient folding time. While maintaining the value of the turn-back time T1, the diamond on the right side is also moved to the right, and the diamond is adjusted.
- FIG. 27 is a diagram showing a case (7) of editing a diamond. Here, the movement of the diamond when the driving time delay permission mode is ON and the vehicle stop time shortening permission mode is OFF is shown.
- the train diagram calibration device 1 even when the user moves a line on the screen, it can be limited to the change of the range in which the structure of the diamond network is not changed. It is possible to change the diagram with almost no influence on the operation plan (vehicle operation, crew operation, on-site work plan, etc.). For example, it is effective at the time of diagram revision and operation rearranging (at the time of recovery of diagram disorder due to an accident etc.). In order to change the arrival and departure times of main trains of some trains and stop stations in consideration of the convenience of changing trains with other main trains, etc. It is possible to automatically change the arrival and departure times of other trains.
- FIG. 28 is a diagram showing a computer system which is a modification of the train diagram calibration device according to the embodiment of the present invention.
- a computer system is shown in which the client terminal 100 is connected to the web application server 200 via the network NW1 such as the Internet, and the web application server 200 is connected to the database server 300 via the network NW2 such as LAN.
- the client terminal 100 corresponds to the input unit 12 and the display unit 17 of FIG. 1
- the application of the web application server 200 corresponds to the schedule verification unit 14
- the database server 300 corresponds to the diagram data storage unit 11 and the constraint time condition data storage unit 13, respectively.
- all of the diagram data, the time limit condition data, the schedule verification unit, etc. are provided in one computer device, but as shown in FIG. 28, the client terminal 100 and the web application server 200 And distributed to the database server 300.
- the method of converting the diamond data (schedule) into the network type model is not limited to PERT.
- the present invention is applicable as long as the earliest time ET (lower limit time), the latest time LT (upper limit time), the minimum time interval of each arc, and the maximum time interval are specified.
- the diamond network when a violating node is generated due to the movement of a line, the diamond network is redisplayed after being returned to the line before editing, but the moving state of the line is maintained,
- the location including the violation node may be identifiably displayed to prompt the user for correction.
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Biomedical Technology (AREA)
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Human Resources & Organizations (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Operations Research (AREA)
Abstract
Description
を備えることを特徴とする。
ある駅からある駅まで移動に必要な運転時間の基準値を「基準運転時分」という。この基準運転時分は、通常運転曲線を描画し、シミュレーションすることで算出される。車両が変われば車両性能も異なるためシミュレーション値にばらつきが出るが、通常は最も時間のかかる車両でシミュレーションし、全車両が走行可能な基準運転時分が求められる。日本の都市圏の鉄道のように高密度で運行する場合は、全ての列車がこの基準運転時分通りに走行することで、密度を高めている。本実施形態で使用する「時分」の意味には、秒単位の時間も含まれるものとする。
ある駅での停車時間は予め決められていて、通常必要最低限の時間が設定されている。これを「最小(標準)停車時分」といい、殆どの列車はこの停車時間で運行される。同一駅での列車間の乗り継ぎなどで意図的に停車時間を延ばされることもあるが、遅れが発生した場合は最小(標準)停車時分までは短縮可能である。また、停車時間は乗降する人の数によって左右されるため、時間帯によって停車時間の評定が変わり、最小(標準)停車時分を変えることもある。この最小(標準)停車時分は一般的に進行方向別に定められている。最小(標準)停車時分は停車アークの重みとして使用される制約時間条件データの一つであり、{線区,進行方向,駅}がユニークなキーとなるデータである。その場合は以下のような構造になる。
ある列車が終端駅に到着してから折返して出発するまでの時分を「折返し最小停車時分」という。この折返し時の停車時分は、計画した列車と列車の繋がりで決まるもので任意である。列車の遅れに対するダイヤの堅牢性を高めるには、この折返し時の停車時間を長くすることが重要である。列車の遅れをこの停車時間で吸収し、計画したダイヤに復元させることが容易だからである。折返し時の停車時間を短縮させる場合でも、最低限必要な停車時間が存在する。その最低限、必要な停車時間が、折返し最小停車時分である。折返し最小停車時分は停車アークの重みとして使用される制約時間条件データの一つであり、{線区,進行方向,駅}がユニークなキーとなるデータである。そのデータ構造は以下のようになる。
駅到着や駅出発時に、先行列車と続行列車が安全に走行できる時間間隔のことを「時隔時分」という。先行列車と続行列車は駅到着、出発時に分岐器を通過することがあり、その場合は分岐器の切り替え時間以上に、列車間の時間を空けないといけない。また、停車する列車と通過する列車の組み合わせになる場合は、列車間の速度差が発生するため、2列車間で接近してしまう。そのため速度差があっても接近しないような時間差(時隔時分)を確保する必要がある。時隔時分には、同一方向を進行する列車間の時間間隔を表す「続行時隔」と、終端駅での到着列車と出発列車のように反対方向に進行する列車間の時間間隔を表す「折返し時隔(交差時隔)」の2つがある。また、分岐器が駅の両端にあることから、時隔時分は駅の両端について定義され、到着、出発、通過の組み合わせの数だけ存在する。
続行時隔は駅の両端に存在し、先行列車と続行列車の通停による組み合わせが存在する。組み合わせは、到着、出発、通過の3パターンがあり、通常到着を“着”、出発を“発”、通過を“通”と表現する。例えば、先行列車が到着で、続行列車が通過の場合は、“着通時隔”と表現する。続行時隔時分は着発順序アークおよび番線順序アークの重みとして使用される制約時間条件データの一つであり、{線区,進行方向,駅,先行・続行の組み合わせパターン}がユニークなキーとなるデータである。そのデータ構造は以下のようになる。
折返し時隔は、主として終端駅の終端側でない方向に存在し、途中駅でも折返し列車がある場合は、折返し時隔が存在する。また、折返し時隔には、折返し列車の先行列車と続行列車の通停による組み合わせが存在する。組み合わせは、到着、出発があり、通過駅の場合は通過の3パターンがあり、通常到着を“着”、出発を“発”、通過を“通”と表現する。
ON時(適用する時):スジの傾きがいかなる列車(基準運転時分以外の走行の列車)であろうとも、駅間の基準運転時分を強制的に適用した制約を守るように演算する。すなわち、全列車に基準運転時分を適用する。
ON時(許可する時):基準運転時分適用モードのON、OFFに関係なく、運転時分の制約を外し、運転時分の遅延を許容させて演算する。
ON時(維持する時):通過列車と停車列車の間で、その駅での通過順を維持して演算する。
ON時(維持する時):到着列車と出発列車の間で、その駅での入出場順を維持して演算する。
ON時(許可する時):現状のダイヤの停車時間より短い、予め定められた駅ごとの最小(標準)停車時間を守るように停車時間を演算する。
ON時(許可する時):現状のダイヤの折返し時間より短い、予め定められた駅ごとの折返し最小停車時分を守るように折返し時間を演算する。
図7は、ダイヤネットワーク生成部14aにおけるダイヤネットワーク生成処理の具体例を示すフローチャートである。この処理はユーザが現時点のダイヤネットワークの表示を要求することで開始される。
・最小時隔:対応区間の基準運転時分
・最大時隔:24時間
これに対し、運転時分遅延許可モードがOFFの場合(S4:OFF)は、以下の条件で駅間アークを生成し(S7)、S10へ進む。
・最小時隔:対応区間の基準運転時分
・最大時隔:対応区間の基準運転時分
S5において、ダイヤネットワーク生成部14aは、ダイヤ校正モード記憶部15を参照し、運転時分遅延許可モードのON/OFFを判定する。ここで、運転時分遅延許可モードがONの場合(S5:ON)は、以下の条件で駅間アークを生成し(S8)、S10へ進む。
・最小時隔:ダイヤ上の駅間走行時分
・最大時隔:24時間
これに対し、運転時分遅延許可モードがOFFの場合(S5:OFF)は、以下の条件で駅間アークを生成し(S9)、S10へ進む。
・最小時隔:ダイヤ上の駅間走行時分
・最大時隔:ダイヤ上の駅間走行時分
S10において、ダイヤネットワーク生成部14aは、ダイヤ校正モード記憶部15を参照し、停車時分短縮許可モードのON/OFFを判定する。ここで、停車時分短縮許可モードがONの場合(S10:ON)は、以下の条件で第1の停車アークを生成し(S11)、S13へ進む。本実施形態における第1の停車アークは、同一列車である駅の着ノード(到着時刻ノード)から同一駅の発ノード(出発時刻ノード)までを結ぶアークである。
・最小時隔:基準ノードが停車駅に係るノードならば駅・進行方向ごとの最小停車時分、基準ノードが通過駅ならば0
・最大時隔:基準ノードが停車駅に係るノードならば24時間、基準ノードが通過駅に係るノードならば0
これに対し、停車時分短縮許可モードがOFFの場合(S10:OFF)は、以下の条件で第1の停車アークを生成し(S12)、S13へ進む。
・最小時隔:基準ノードが停車駅に係るノードならばダイヤ上の停車時間、基準ノードが通過駅に係るノードならば0
・最大時隔:基準ノードが停車駅に係るノードならば24時間、基準ノードが通過駅に係るノードならば0
S13において、ダイヤネットワーク生成部14aは、ダイヤ校正モード記憶部15を参照し、折返し時分短縮許可モードのON/OFFを判定する。ここで、折返し時分短縮許可モードがONの場合(S13:ON)は、以下の条件で第2の停車アークを生成し(S14)、S16へ進む。本実施形態における第2の停車アークは、1つの車両運用に含まれるある列車の終着到着時刻ノードから、同一車両運用に含まれる同一駅での別列車の始発出発時刻ノードまでを結ぶアークである。
・最小時隔:駅ごとの折返し列車用の最小停車時分
・最大時隔:24時間
これに対し、折返し時分短縮許可モードがOFFの場合(S13:OFF)は、以下の条件で第2の停車アークを生成し(S15)、S16へ進む。
・最小時隔:ダイヤ上の折返し停車時間
・最大時隔:24時間
S16において、ダイヤネットワーク生成部14aは、全運行の着・発ノード、駅間アーク、停車アークの生成が完了しているか否かを判定する。ここで、全運行のノード、駅間アーク、停車アークの生成が完了している場合(S16:Yes)は、S17へ進む。これに対し、全運行のノード、駅間アーク、停車アークの生成が未完了の場合(S16:No)は、S1へ戻る。
図8は、ノードの生成を説明する図である。ここでは、到着ノードをNode(“0”,“ノードID”)、出発ノードをNode(“1”,“ノードID”)の形式で到着時刻点、出発時刻点ごとに生成している。例えば、A駅の1番線における最初の出発ノードはNode(1,A11)であり、同一列車のB駅の1番線における到着ノードはNode(0,B11)である。
・最早時刻(Et):着ノードはダイヤデータで設定されている到着時刻、発ノードは出発時刻とする。
・最遅時刻制約:移動可能な最大の時刻とする。(例えば27:00:00)
2.駅間アーク
図9は、駅間アークの生成を説明する図である。駅間アークは、同一列車のある駅の出発時刻ノードから次の駅の到着時刻ノードまでを結ぶアークである。駅間アークは、ダイヤデータに従い、ある駅の出発時刻を基準(接続元)ノードとし、同一列車の次の停車駅の到着時刻(次が通過の場合は出発時刻)を接続先ノードとして、駅間アークを作成する。図9では、破線矢印が駅間アークをそれぞれ示している。図9において駅間アークは、Arc(“1”,“基準ノードID(出発)”,“0”,“接続先ノードID(到着)”)の形式で表されている。例えば、A駅1番線の出発ノードA11とB駅1番線の到着ノードB11を結ぶ駅間アークは、Arc(1,A11,0,B11)である。
(1)基準運転時分適用モードON、運転時分遅延許可モードONの場合
・最小時隔:アークが対応する区間に予め設定されている基準運転時分とする。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
(2)基準運転時分適用モードON、運転時分遅延許可モードOFFの場合
・最小時隔:アークが対応する区間に予め設定されている基準運転時分とする。
・最大時隔:アークが対応する区間に予め設定されている基準運転時分とする。
(3)基準運転時分適用モードOFF、運転時分遅延許可モードONの場合
・最小時隔:アークが対応する区間をダイヤ上で走行する駅間走行時分とする。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
(4)基準運転時分適用モードOFF、運転時分遅延許可モードOFFの場合
・最小時隔:アークが対応する区間をダイヤ上で走行する駅間走行時分とする。
・最大時隔:アークが対応する区間をダイヤ上で走行する駅間走行時分とする。
3.停車アークの生成
続いて、停車アークについて説明する。本実施形態において、停車アークは、2種類に分類される。図10は、第1の停車アークの生成を説明する図である。第1の停車アークは、同一列車のある駅の到着時刻ノードから同一駅の出発時刻ノードまでを結ぶアークである。第1の停車アークは、ダイヤデータに従い、ある駅の到着時刻を基準ノードとし、次の同一列車の出発時刻を接続先ノードとして作成する。通過駅の場合も同様に作成する。図10では、破線矢印が第1の停車アークをそれぞれ示している。図10において、第1の停車アークは、Arc(“0”,“基準ノードID(到着)”,“1”,“接続先ノードID(出発)”)の形式で表されている。例えば、B駅1番線の到着ノードB11とB駅1番線の出発ノードB12を結ぶ第1の停車アークは、Arc(0,B11,1,B12)である。
(1)停車時間短縮許可モードON
・最小時隔:基準ノードが停車駅の時は、予め駅ごとに設定されている同じ進行方向の最小停車時分マスタ設定の値とする。ノードが通過駅の時は、0とする。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。ノードが通過駅の時は、0とする。
(2)停車時間短縮許可モードOFF
・最小時隔:基準ノードが停車駅の時は、既に存在するダイヤ上での停車時間を設定する。基準ノードが通過駅の時は、0とする。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。基準ノードが通過駅の時は、0とする。
(1)折返し時間短縮許可モードON
・最小時隔:予め駅ごとに設定されている折返し列車用の最低停車時分とする。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
(2)折返し時間短縮許可モードOFF
・最小時隔:既に存在するダイヤ上での折返し停車時間を設定する。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
4.着発順序アークの生成
続いて、着発順序アークについて説明する。本実施形態において、着発順序アークは、4種類に分類される。図12は、第1の着発順序アークの生成を説明する図である。第1の着発順序(同一進路方向着)アークは、ある駅の進行方向別に、ノードを昇順ソートしたときに、ある列車の到着時刻ノードから次の別の列車の到着時刻ノードまでを結ぶアークである。第1の着発順序アークは、列車情報に従い、駅・進行方向別にソートされたノード情報を到着時刻の小さいものから検索し、到着時刻を基準とするノードとし、次の別列車の到着時刻を接続先ノードとして作成する。図12では、破線矢印が第1の着発順序アークをそれぞれ示している。図12において、第1の着発順序アークは、Arc(“0”,“基準ノードID(到着)”,“3”,“接続先ノードID(到着”)の形式で表されている。例えば、A駅1番線の到着ノードA12とA駅2番線の到着ノードA21を結ぶ第1の着発順序アークは、Arc(0,A12,3,A21)である。
・最小時隔:ダイヤデータ既に存在上で設定されている2ノードの組み合わせと同じ、駅、進行方向で予め定められている時隔時分(最小値)を設定する。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
・最小時隔:ダイヤデータ既に存在上で設定されている2ノードの組み合わせと同じ、駅、進行方向で予め定められている同一進路時隔時分(最小値)を設定する。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
・最小時隔:ダイヤデータ既に存在上で設定されている2ノードの組み合わせと同じ、駅、折返し方向で予め定められている折返し着発時隔時分(最小値)を設定する。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
・最小時隔:ダイヤデータ既に存在上で設定されている2ノードの組み合わせと同じ、駅、折返し方向で予め定められている折返し発着時隔時分(最小値)を設定する。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
5.番線順序アークの生成
続いて、番線順序アークについて説明する。本実施形態において、番線順序アークは、3種類に分類される。図16は、第1の番線順序アークの生成を説明する図である。第1の番線順序アークは、ある駅の番線ごとに、ノードを昇順ソートしたときに、ある列車の出発時刻ノードから次の別の列車の到着時刻ノードまでを結ぶアークである。第1の番線順序アークは、列車情報に従い、駅・番線ごとにソートされたノード情報を出発時刻の小さいものから検索し、出発時刻を基準とするノードとし、次の別列車の到着時刻を接続先ノードとして作成する。図16では、破線矢印が第1の番線順序アークをそれぞれ示している。図16において、第1の番線順序アークは、Arc(“0”,“基準ノードID(出発)”,“2”,“接続先ノードID(到着)”)の形式で表されている。例えば、B駅3番線の出発ノードB32とB駅3番線の到着ノードB33を結ぶ第1の番線順序アークは、Arc(1,B32,2,B33)である。
・最小時隔:ダイヤデータ既に存在上で設定されている2ノードの組み合わせと同じ、駅、番線で予め定められている時隔時分(最小値)を設定する。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
・最小時隔:ダイヤデータ既に存在上で設定されている2ノードの組み合わせと同じ、駅、番線で予め定められている時隔時分(最小値)を設定する。
・最大時隔:移動可能な最大の時間(例えば24時間)とする。
ある駅の番線ごとに、ノードを昇順ソートしたときに、ある列車の始発出発時刻ノードから次の別の列車のノードまでを結ぶアークである。第3の番線順序アークは、所定の列車情報に従い、駅・番線ごとにソートされたノード情報を出発時刻の小さいものから検索し、始発出発時刻を基準とするノードとし、次の別列車のノードを接続先ノードとして作成する。図18では、破線矢印が第3の番線順序アークをそれぞれ示している。図18において、第3の番線順序アークは、Arc(“1”,“基準ノードID(始発出発)”,“2”,“接続先ノードID”)の形式で表されている。例えば、C駅2番線の始発出発ノードC21とC駅2番線のノードC22を結ぶ第3の番線順序アークは、Arc(1,C21,2,C22)である。
・最小時隔(秒):ダイヤデータ既に存在上で設定されている2ノードの組み合わせと同じ、駅、番線で予め定められている時隔時分(最小値)を設定する。
・最大時隔(秒):移動可能な最大の時間(例えば24時間)とする。
図19は、図1のダイヤネットワーク更新部14bにおけるダイヤネットワーク更新処理の具体例を示すフローチャートである。この処理は、ユーザが画面上でダイヤを編集することで開始される。
最大時間間隔制約である最遅時刻制約LTmaxが含まれるため、本更新演算の内容は、従来のPERTにおける時刻更新演算とは異なる。
h:ノードiに流入する(先行する)ノード
ETmin(i):ノードiの取りうる最も早い時刻の制約
k:ノードiから流出する(後発する)ノード
LTmax(i):ノードiの取りうる最も遅い時刻の制約
そして、以下の手順1~4で更新を行う。
[手順1:ノードのトポロジカルソート]
ETはノードの先行する順番に値を演算していく必要があるため(LTは逆方向)、事前にトポロジカル(topological)ソートを実施する。トポロジカルソートとは、あるノードAがノードBに先行する時、必ずAがBの前になるような順番で全てのノードを並べ直すことである。
全てのノードiについて、以下の初期化を行う。なお、先に説明したように、制約違反ノードを検出する過程においては、最早・最遅時刻制約変更部14dにより初期値が修正される。
LT0(i)=LTmax(i)
[手順3:ET更新演算]
以下の式(1)、式(2)の演算を値が収束し変化しなくなるまで交互に反復する。ここで、ETs-1は更新前、ETsは更新後の値である。
以下の式(3)、式(4)の演算を値が収束し変化しなくなるまで交互に反復する。
ブロックA1では、各ノードについて式(1)に従ってET(i)の更新演算を行い(S201)、ET(i)がLT(i)よりも大きくなったノードがあったときは(S202、S203:YES)、エラーを返し(S204)、違反ノード検出部14cでは当該ノードを違反ノードとして検出する。
ブロックB1では各ノードについて式(2)に従ってET(i)の更新演算を行い(S301)、ET(i)がLT(i)よりも大きくなったノードがあったときは(S302、S303:YES)、エラーを返し(S304)、違反ノード検出部14cでは当該ノードを違反ノードとして検出する。
最後に、以上の処理の結果、スジが移動する幾つかの事例を示す。
図28は、本発明の一実施形態に係る列車ダイヤ校正装置の変形例であるコンピュータシステムを示す図である。ここでは、クライアント端末100がインターネットなどのネットワークNW1を介してWebアプリケーションサーバ200に接続され、Webアプリケーションサーバ200がLANなどのネットワークNW2を介してデータベースサーバ300に接続されたコンピュータシステムが示されている。クライアント端末100は、図1の入力部12と表示部17、Webアプリケーションサーバ200のアプリケーションは、スケジュール検証部14、データベースサーバ300は、ダイヤデータ記憶部11および制約時間条件データ記憶部13にそれぞれ相当する。このように、上記実施形態では、ダイヤデータ、制限時間条件データ、スケジュール検証部等の全てを一台のコンピュータ装置が備えていたが、図28に示すように、クライアント端末100、Webアプリケーションサーバ200およびデータベースサーバ300に分散して備えることもできる。
11…ダイヤデータ記憶部、
12…入力部、
13…制約時間条件データ記憶部、
14…スケジュール検証部、
14a…ダイヤネットワーク生成部、
14b…ダイヤネットワーク更新部、
14c…違反ノード検出部、
14d…最早・最遅時刻制約変更部、
14e…ダイヤ校正モード設定部、
15…ダイヤ校正モード記憶部、
16…違反ノード記憶部、
100…クライアント端末、
200…Webアプリケーションサーバ、
300…データベースサーバ。
Claims (5)
- 複数の駅を繋ぐ路線上を走行する列車に係るダイヤデータを記憶するダイヤデータ記憶部と、
前記ダイヤデータ記憶部から前記ダイヤデータを読込み、前記列車の各駅における到着及び出発に係るイベントをそれぞれ表すノードを生成するとともに、これらのノードを前記ノード間の時間間隔及び時系列上の着発順序をそれぞれ表すアークによって順次接続して前記ダイヤデータを表すダイヤネットワークを生成するダイヤネットワーク生成部と、
前記ダイヤネットワーク生成部が生成したダイヤネットワークを画面表示する表示部と、
前記表示部が表示しているダイヤネットワークに含まれるスジを指定し、時系列上で移動先情報を入力する入力部と、
前記ノード間の時間間隔の最小値及び最大値を前記アークの制約時間条件データとして記憶する制約時間条件データ記憶部と、
前記入力部から前記スジの移動先情報が入力された場合に、前記スジの移動方向に存在するスジについて、同一方向へ進行する2つの前記列車間の時間間隔を表す続行時隔及び前記路線の終端駅に対して反対方向へ進行する2つの前記列車間の時間間隔を表す交差時隔を、対応するノード間に係る前記制約時間条件データに基づいて校正することで、前記移動方向に存在するスジにおける前記ノードの最早時刻及び最遅時刻をそれぞれ演算し、前記ダイヤネットワークを更新するダイヤネットワーク更新部と、
を備えることを特徴とする列車ダイヤ校正装置。 - 複数の駅を繋ぐ路線上を走行する列車に係るダイヤデータを記憶するダイヤデータ記憶部と、
前記ダイヤデータ記憶部から前記ダイヤデータを読込み、前記列車の各駅における到着及び出発に係るイベントをそれぞれ表すノードを生成するとともに、これらのノードを前記ノード間の時間間隔及び時系列上の着発順序をそれぞれ表すアークによって順次接続して前記ダイヤデータを表すダイヤネットワークを生成するダイヤネットワーク生成部と、
前記ダイヤネットワーク生成部が生成したダイヤネットワークを画面表示する表示部と、
前記表示部が表示しているダイヤネットワークに含まれるスジを指定し、時系列上で移動先情報を入力する入力部と、
前記ノード間の時間間隔の最小値及び最大値を前記アークの制約時間条件データとして記憶する制約時間条件データ記憶部と、
前記入力部から前記スジの移動先情報が入力された場合に、前記スジの移動方向に存在するスジについて、隣接する2つの駅間における同一の前記列車の運転時分を、対応するノード間に係るアークの前記制約時間条件データに基づいて校正することで、前記移動方向に存在するスジにおける前記ノードの最早時刻及び最遅時刻をそれぞれ演算し、前記ダイヤネットワークを更新するダイヤネットワーク更新部と、
を備えることを特徴とする列車ダイヤ校正装置。 - 前記ダイヤネットワーク更新部は、前記入力部から前記スジの移動先情報が入力された場合に、前記運転時分に加えて、同一の前記列車の停車時間及び折返し時間を、対応するノード間に係るアークの前記制約時間条件データに基づいて校正することで、前記移動方向に存在するスジにおける前記ノードの最早時刻及び最遅時刻をそれぞれ演算し、前記ダイヤネットワークを更新することを特徴とする請求項2記載の列車ダイヤ校正装置。
- 前記ダイヤネットワーク更新部は、前記入力部から前記スジの移動先情報が入力された場合に、前記続行時隔及び前記交差時隔に加えて、隣接する2つの駅間における同一の前記列車の運転時分、同一の前記列車の停車時間及び折返し時間を、対応するノード間に係るアークの前記制約時間条件データに基づいて校正することで、前記移動方向に存在するスジにおける前記ノードの最早時刻及び最遅時刻をそれぞれ演算し、前記ダイヤネットワークを更新することを特徴とする請求項1記載の列車ダイヤ校正装置。
- 複数の駅を繋ぐ路線上を走行する列車に係るダイヤデータを記憶する記憶装置から前記ダイヤデータを読込み、前記列車の各駅における到着及び出発に係るイベントをそれぞれ表すノードを生成するとともに、これらのノードを前記ノード間の時間間隔及び時系列上の着発順序をそれぞれ表すアークによって順次接続して前記ダイヤデータを表すダイヤネットワークを生成するダイヤネットワーク生成ステップと、
前記ダイヤネットワーク生成ステップにおいて生成されたダイヤネットワークを画面表示する表示ステップと、
前記表示ステップにおいて表示されたダイヤネットワークに含まれるスジを指定し、時系列上で移動先情報を入力する移動先入力ステップと、
前記入力ステップにおいて前記スジの移動先情報が入力された場合に、前記スジの移動方向に存在するスジについて、同一方向へ進行する2つの前記列車間の時間間隔を表す続行時隔及び前記路線の終端駅に対して反対方向へ進行する2つの前記列車間の時間間隔を表す交差時隔、隣接する2つの駅間における同一の前記列車の運転時分、同一の前記列車の停車時間及び折返し時間を、対応するノード間の時間間隔の最小値及び最大値を予め定義した制約時間条件データに基づいて校正することで、前記移動方向に存在するスジにおける前記ノードの最早時刻及び最遅時刻をそれぞれ演算し、前記ダイヤネットワークを更新するダイヤネットワーク更新ステップと、
をコンピュータに実行させることを特徴とする列車ダイヤ校正プログラム。
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2015/001420 WO2016147212A1 (ja) | 2015-03-13 | 2015-03-13 | 列車ダイヤ校正装置および列車ダイヤ校正プログラム |
CN201580046933.7A CN106794854B (zh) | 2015-03-13 | 2015-03-13 | 列车运行图校正装置及列车运行图校正程序 |
KR1020177005327A KR20170036068A (ko) | 2015-03-13 | 2015-03-13 | 열차 시각표 교정 장치 및 열차 시각표 교정 프로그램 |
JP2016553481A JPWO2016147212A1 (ja) | 2015-03-13 | 2015-03-13 | 列車ダイヤ校正装置および列車ダイヤ校正プログラム |
US15/350,456 US9873444B2 (en) | 2015-03-13 | 2016-11-14 | Train scheduling diagram correction apparatus and train scheduling diagram correction program |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2015/001420 WO2016147212A1 (ja) | 2015-03-13 | 2015-03-13 | 列車ダイヤ校正装置および列車ダイヤ校正プログラム |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/350,456 Continuation US9873444B2 (en) | 2015-03-13 | 2016-11-14 | Train scheduling diagram correction apparatus and train scheduling diagram correction program |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2016147212A1 true WO2016147212A1 (ja) | 2016-09-22 |
Family
ID=56918467
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2015/001420 WO2016147212A1 (ja) | 2015-03-13 | 2015-03-13 | 列車ダイヤ校正装置および列車ダイヤ校正プログラム |
Country Status (5)
Country | Link |
---|---|
US (1) | US9873444B2 (ja) |
JP (1) | JPWO2016147212A1 (ja) |
KR (1) | KR20170036068A (ja) |
CN (1) | CN106794854B (ja) |
WO (1) | WO2016147212A1 (ja) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2020183145A (ja) * | 2019-05-07 | 2020-11-12 | 株式会社日立製作所 | 輸送計画作成支援システムおよび方法 |
JP2020203549A (ja) * | 2019-06-14 | 2020-12-24 | 株式会社東芝 | 情報処理装置、情報処理方法及びコンピュータプログラム |
JP7492301B2 (ja) | 2021-01-07 | 2024-05-29 | 北京交通大学 | 列車が本線運行から退出する条件における地下鉄の走行調整方法及びシステム |
JP7519335B2 (ja) | 2021-08-30 | 2024-07-19 | 公益財団法人鉄道総合技術研究所 | ダイヤ作成装置及びダイヤ作成方法 |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10279823B2 (en) * | 2016-08-08 | 2019-05-07 | General Electric Company | System for controlling or monitoring a vehicle system along a route |
JP6559913B2 (ja) * | 2017-04-17 | 2019-08-14 | 株式会社東芝 | 無閉塞時隔計算システム |
EP3831691A4 (en) | 2018-07-31 | 2022-03-23 | Toshiba Digital Solutions Corporation | TRAIN OPERATION PLANNING ASSISTANCE SYSTEM AND DATA STRUCTURE OF DATA RELATING TO TRAIN OPERATION PLANNING |
KR102134031B1 (ko) * | 2018-11-05 | 2020-07-15 | 한국철도기술연구원 | 무정차 스케줄링을 이용한 열차운영 시스템 |
CN112373521A (zh) * | 2019-09-27 | 2021-02-19 | 北京城建设计发展集团股份有限公司 | 多线路多交路列车时刻表自动编制检测调整***及方法 |
CN111071307B (zh) * | 2020-01-02 | 2021-12-28 | 中国铁道科学研究院集团有限公司通信信号研究所 | 一种不同子图间多方向区段默认线别设置方法 |
CN111634312A (zh) * | 2020-05-26 | 2020-09-08 | 虞萍 | 基于无线传感器网络和数据源的机车信号*** |
CN114312925A (zh) * | 2020-09-30 | 2022-04-12 | 比亚迪股份有限公司 | 一种时刻表的离线校正方法及离线校正装置 |
CN112330007B (zh) * | 2020-10-30 | 2024-04-26 | 交控科技股份有限公司 | 面向乘客的换乘衔接优化方法及装置 |
CN114140037B (zh) * | 2022-02-08 | 2022-06-14 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | 列车运行图与动车组运用计划一体化调整方法 |
CN114179873B (zh) * | 2022-02-15 | 2022-04-22 | 四川华睿兴科技有限公司 | 一种多交路多时段全日列车运行图自动编制方法和*** |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH06321111A (ja) * | 1993-05-11 | 1994-11-22 | Toshiba Corp | 列車ダイヤ作成装置 |
JPH09123913A (ja) * | 1995-10-27 | 1997-05-13 | Toshiba Corp | 輸送管理システム |
JP2009274664A (ja) * | 2008-05-16 | 2009-11-26 | Toshiba Corp | スケジュール検証支援装置およびその方法ならびにプログラム |
JP2013023080A (ja) * | 2011-07-21 | 2013-02-04 | Hitachi Systems Ltd | ダイヤスジ作成システム、スジの時刻変更方法およびプログラム |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4166643B2 (ja) | 2003-07-22 | 2008-10-15 | 財団法人鉄道総合技術研究所 | プログラム及び列車ダイヤ評価支援装置 |
-
2015
- 2015-03-13 WO PCT/JP2015/001420 patent/WO2016147212A1/ja active Application Filing
- 2015-03-13 KR KR1020177005327A patent/KR20170036068A/ko not_active Application Discontinuation
- 2015-03-13 JP JP2016553481A patent/JPWO2016147212A1/ja active Pending
- 2015-03-13 CN CN201580046933.7A patent/CN106794854B/zh active Active
-
2016
- 2016-11-14 US US15/350,456 patent/US9873444B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH06321111A (ja) * | 1993-05-11 | 1994-11-22 | Toshiba Corp | 列車ダイヤ作成装置 |
JPH09123913A (ja) * | 1995-10-27 | 1997-05-13 | Toshiba Corp | 輸送管理システム |
JP2009274664A (ja) * | 2008-05-16 | 2009-11-26 | Toshiba Corp | スケジュール検証支援装置およびその方法ならびにプログラム |
JP2013023080A (ja) * | 2011-07-21 | 2013-02-04 | Hitachi Systems Ltd | ダイヤスジ作成システム、スジの時刻変更方法およびプログラム |
Non-Patent Citations (2)
Title |
---|
HIDEYUKI AISU: "Unko no Network Model-ka to Keikaku Sakutei Shien", OPERATIONS RESEARCH, vol. 57, no. 8, 1 August 2012 (2012-08-01), pages 414 - 419 * |
JUN IMAIZUMI: "Network Flow Model ni yoru Tetsudo no Shutan'eki no Noryoku Hyoka", OPERATIONS RESEARCH, vol. 56, no. 4, 1 April 2011 (2011-04-01), pages 237 - 243 * |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2020183145A (ja) * | 2019-05-07 | 2020-11-12 | 株式会社日立製作所 | 輸送計画作成支援システムおよび方法 |
JP7324042B2 (ja) | 2019-05-07 | 2023-08-09 | 株式会社日立製作所 | 輸送計画作成支援システムおよび方法 |
JP2020203549A (ja) * | 2019-06-14 | 2020-12-24 | 株式会社東芝 | 情報処理装置、情報処理方法及びコンピュータプログラム |
JP7169251B2 (ja) | 2019-06-14 | 2022-11-10 | 株式会社東芝 | 情報処理装置、情報処理方法及びコンピュータプログラム |
US11702120B2 (en) | 2019-06-14 | 2023-07-18 | Kabushiki Kaisha Toshiba | Information processing apparatus, information processing method, and non-transitory computer readable medium |
JP7492301B2 (ja) | 2021-01-07 | 2024-05-29 | 北京交通大学 | 列車が本線運行から退出する条件における地下鉄の走行調整方法及びシステム |
JP7519335B2 (ja) | 2021-08-30 | 2024-07-19 | 公益財団法人鉄道総合技術研究所 | ダイヤ作成装置及びダイヤ作成方法 |
Also Published As
Publication number | Publication date |
---|---|
JPWO2016147212A1 (ja) | 2017-06-01 |
CN106794854A (zh) | 2017-05-31 |
KR20170036068A (ko) | 2017-03-31 |
US20170057529A1 (en) | 2017-03-02 |
CN106794854B (zh) | 2019-07-16 |
US9873444B2 (en) | 2018-01-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2016147212A1 (ja) | 列車ダイヤ校正装置および列車ダイヤ校正プログラム | |
Xiao et al. | A simulating annealing algorithm to solve the green vehicle routing & scheduling problem with hierarchical objectives and weighted tardiness | |
Mu et al. | Scheduling freight trains traveling on complex networks | |
Liu et al. | Scheduling trains as a blocking parallel-machine job shop scheduling problem | |
Kraay et al. | Optimal pacing of trains in freight railroads: model formulation and solution | |
Grube et al. | An event-driven simulator for multi-line metro systems and its application to Santiago de Chile metropolitan rail network | |
WO2019078025A1 (ja) | ダイヤ作成装置および自動列車制御システム | |
Yaghini et al. | An integer programming model for analysing impacts of different train types on railway line capacity | |
CN110997449B (zh) | 列车营运计划支援***、以及列车营运计划相关的数据的数据构造 | |
Borndörfer et al. | A path-based model for line planning in public transport | |
Zhao et al. | Exclusive bus lane network design: A perspective from intersection operational dynamics | |
Huang et al. | Real-time energy-saving metro train rescheduling with primary delay identification | |
Enayatollahi et al. | Modelling bus bunching under variable transit demand using cellular automata | |
JP4191497B2 (ja) | 運転整理案作成情報及び運転整理案作成装置 | |
Yaghini et al. | A population-based algorithm for the railroad blocking problem | |
JP7169251B2 (ja) | 情報処理装置、情報処理方法及びコンピュータプログラム | |
JP6637720B2 (ja) | 運行管理装置 | |
JP2010188750A (ja) | 運転整理支援システム | |
Arizti et al. | A bilevel approach to frequency optimization in public transportation systems | |
Cheng | Optimal train traffic rescheduling simulation by a knowledge-based system combined with critical path method | |
El Amraoui et al. | Optimization of a train traffic management problem under uncertainties and disruptions | |
JP6889130B2 (ja) | 運転整理支援システムおよび運転整理支援方法 | |
RU2802974C1 (ru) | Способ имитационного моделирования поездопотока по участку железной дороги | |
Baalaganapathy et al. | Evaluation of Bus Signal Priority and Dedicated Bus Lane for Efficiency Improvement | |
Tanaka et al. | Passenger flow analysis for train rescheduling and its evaluation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
ENP | Entry into the national phase |
Ref document number: 2016553481 Country of ref document: JP Kind code of ref document: A |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15885312 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 20177005327 Country of ref document: KR Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 15885312 Country of ref document: EP Kind code of ref document: A1 |