JPH08295238A - Train diagram plotter - Google Patents

Abstract

PURPOSE: To generate a shuttle diagram in the return station precincts automati cally by installing a shuttle diagram decision means which determines a return route and each arrival-departure time of respective lines from each the shortest time and the starting time of a first train to be stored in a train diagram file. CONSTITUTION: A return route selecting part 11 reads each return route to be stored in a return route file 18 in order of priority, delivering it to the next shuttle diagram operational part 12 which performs those of time interval, minimal stopping time and traveling time checks to the return route inputted in the following procedures, calculating respective arrival-departure times of each line of the return route selected with each time information and the shortest time enabling it to start a shuttle operation. In addition, the next shuttle diagram decision part determines the shuttle diagram being adopted from the shortest time at each return route to be calculated in order.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a train timetable creating device for automatically creating a train timetable by a computer, and more particularly to a train timetable creating device capable of automatically creating a turnaround timetable in a return station.

[0002]

2. Description of the Related Art For example, the most basic method for creating a train schedule for a train at a railway company is that an experienced train expert creates a train schedule for each train in order of time using a ruler or the like on a sheet of paper. It is a method of allocating.

In recent years, the name of each station on the train operating route, the time required for each station interval of the train, the stop time of each station, etc. are stored in advance in a database, and when the departure time of each train at the first departure station is specified, for example, the first departure A train schedule creation device has been proposed that automatically creates a train schedule from the station to the terminal station.

FIG. 6 is a diagram showing a train schedule created by the train schedule creating apparatus and displayed on the display screen.
The horizontal axis indicates time t, and the vertical axis indicates distance d. The stations A to F are arranged on the vertical axis according to distance positions. For example, an upstream A train stops at station F and runs to station A. In addition, the B train operates from F station as the starting station to the B station as an up train, returns at the B station and returns to the F station as a down train.

However, in recent years, the number of trains to be operated has increased, the operation interval of trains has become shorter, and the number of trains to be returned to and returned from a return station has also increased. In the train turn-back operation in the double-track section, for example, a train arriving at the platform of the up main line may be moved to the down main line. On the contrary, a train arriving at the platform of the down line may be moved to the up line.

It takes a certain amount of time for a train to move between the main lines, and it is necessary to prevent the operation of other trains from being interrupted during the moving process. Furthermore, there are cases where a large number of pull lines are laid at stations that can be turned back.

Therefore, it is still difficult for the experienced experts mentioned above to create the turn-back schedule for each start-up train which arrives at the turn-back station and which start train is to be assigned to which start train. And make a streak of the descending train, and then wrap the descending train and the ascending train at the returning station (which descending train wraps at which ascending train)
Are being created.

For example, consider the turnaround station (B station) shown in FIG. At this turnaround station (B station), go down the main line 1
The down home 3 and the up home 4 are provided respectively for the up main line 2 and the up main line 2. A plurality of branching devices 5a, 5b, 5 connecting the main lines 1 and 2 to each other are connected to each other.
c is provided. Further, two pull lines 6 and 7 are laid on the down main line 1, and one pull line 8 is installed on the up main line 2.
Has been laid.

At the turn-around station (B station) having such a configuration, when returning the final train arriving from the down main line 1 to the down platform 3 to the up main line 2 as an up train, for example, the following four typical return routes are used. Can be considered.

Route 1: Arrival from the down main line 1 to the down home 3 → Pass the turnout 5a to the up line 8 → Depart from the up home 4 of the up main line 2 Route 2: Arrival from the down main line 1 to the down home 3 → Pull Route 7: Depart from up home 4 on up line 2 via branch 5b Route 3: Arriving at down home 3 from down main 1 → Route 6 To line 6 → Up home 4 on up line 2 Departing from Route 4: Passing from the down main line 1 through the turnout 5c and arriving at the up home 4 of the up main line 2 → Departing from the up home platform 4. Then, in FIG. It is a figure which shows the turn-back time diagram when the said B train passes the said turn-back route 1 and turns back as an up-start train after arriving as a down-bound train.

A predetermined run to the pull-up line 8 after a lapse of a stop time T ₀₁ required for getting off passengers after the B train indicated by the streak a ₁ of the down-bound train arrives at the down main line 1 (down platform 3). It takes time T ₀₁ to move. Then, on this pulling line 8, the vehicle is stopped for a predetermined constant minimum stop time T ₀₂ associated with the change of the traveling direction. After that, the B train departs from the pulling line 8 and moves to the position of the up platform 4 on the up line 2 with a predetermined traveling time T ₁₂ . The train B arriving at the uphill platform 4 departs as the first uphill train indicated by the streak b ₁ after the stop time T ₀₃ required for the passengers to board has passed.

Further, FIG. 9 shows a turnaround diagram in the case where there is an up-passing train that passes through the B station (turnback station) shown in FIG. 7 without stopping. In this case, this up-passing train passes through the up-main line 2, but turns back so that the passing time of this up-main line 2 and the time when the return train arriving from the pull-up line 8 to the platform 4 do not conflict with each other. You need to create a diamond.

More specifically, as shown in FIG. 9, the departure time t ₁ of the return train from the descending main line 1 to the pull-up line 8 is adjusted, and further, the stop time on the pull-up line 8 is lengthened so that the ascending train can go up. It is necessary to shift the time t ₂ which departs for the main line 2 so that it does not cross the streak b ₂ of the up-passing train. As described above, when a plurality of trains pass through the same line in the return station, it is necessary to provide a route time interval T ₂₁ indicating a preset minimum time interval between the passing times of the trains.

As described above, when the turn-back schedule is created at the turn-back station, the above-mentioned stop times T ₀₁ ,
It is necessary to satisfy each time condition such as T ₀₃ , each traveling time T ₁₁ , T ₁₂ , minimum stop time T _02, and route interval T ₂₁ . Further, as described above, when there are a plurality of return routes, it is necessary to select the best return route after satisfying the above-mentioned time conditions.

[0015]

As described above, in order to create a turnaround diagram at a turnaround station, each stop time T ₀₁ , T ₀₃ , each running time T ₁₁ , T ₁₂ , minimum stop time T _02.
It is necessary to select the best turning route after satisfying each time condition such as the route time interval T ₂₁ .

Therefore, even an experienced diamond maker has required a great deal of time and effort to make a folded diamond. Further, much time and labor was required to correct or change the turn-back timetable that was once created due to the timetable revision or the like so as not to hinder the operation of other trains.

Further, there is a concern that the turn-back time diagram created by hand may include human error such as calculation error. The present invention has been made in view of such circumstances, and by previously storing each turn-back route and each time condition, a turn-back indicating a turn-up of a line of an up train and a line of a down train at a turn-back station. A timetable can be automatically created using the best turnaround route, satisfying each time condition such as route interval, minimum stop time, running time, etc. Even if you are not familiar with making a timetable An object of the present invention is to provide a train timetable creation device that can easily and definitely create a turnback timetable in a short time.

[0018]

[Means for Solving the Problems] In order to solve the problems described above, in the train schedule creating device according to claim 1, a train schedule storing at least train schedules of passing trains, final trains, starting trains, etc. at a turnaround station. A file, a turnaround route file that stores multiple turnaround routes at a turnaround station that has a turnout that connects the main lines to each other, and a plurality of pull lines, and a minimum when multiple trains use all or part of the turnaround route A route time interval memory that stores the route time interval that indicates the time interval, an internal stop time memory that stores the minimum stop time on each line of the return train in the return station, and a return train that moves between the lines in the return station On-premise running time memory that stores each running time required for Stored in the memory for the return route selecting means for selecting each return route stored in the return route file in a predetermined order and for each return route sequentially selected by the return route selecting means. A return timetable calculation means for sequentially calculating the arrival and departure time of the last train on each line of the corresponding return route and the shortest time at which the return operation can be started by using the route time interval, the minimum stop time and each running time, and the return time Equipped with a turn-back timetable determining means for determining a turn-back route and arrival time of each line as a turn-back timetable from each shortest time sequentially calculated by the timetable calculation means and the departure time of the first train stored in the train timetable file. There is.

Further, in the train schedule creation device according to claim 2, a train schedule file storing at least train schedules of passing trains, final trains, starting trains, etc. at the turnaround station and a branching device connecting the main lines to each other. And a return route file storing a plurality of return routes at a return station having a plurality of pulling lines and priorities between the return routes, and a minimum time interval when a plurality of trains use all or a part of the return routes. The route time interval memory that stores the route time interval that indicates, the internal stop time memory that stores the minimum stop time on each line of the return train in the return station, and the return train in the return station to move between the lines On-premise running time memory that stores each running time, and the final train stored in the train timetable file On the other hand, the return route selection means for selecting each return route stored in the return route file in descending order of priority, and the respective return routes sequentially selected by the return route selection means are stored in each memory. Using the route time interval, minimum stop time, and each running time, the turn-back timetable calculation means for sequentially calculating the arrival and departure time of the last train on each line of the turn-back route and the shortest time at which the turn-back operation can be started. , The return time of the priority and the return departure time of each line that is the earliest before the departure time of the first train stored in the train timetable file and the train departure time stored in the train timetable file are determined as the return timetable. And a turn-back timetable determining means.

Further, according to the invention of claim 3, in the train schedule creation device according to each of the above-mentioned inventions, each return route stored in the return route file is corrected, changed, or deleted according to an external operation input. Route setting means to be set and each time information such as route time interval, minimum stop time, and premises running time stored in the route time interval memory, premises stop time memory and premises running time memory according to external operation input Fixed. Multiple time information setting means for changing, deleting, and setting are added.

Further, according to the invention of claim 4, in the train schedule creating apparatus of each of the above-mentioned inventions, the return schedule correcting means for correcting the return schedule determined by the return schedule determining means in accordance with the external operation input. Is added.

[0022]

In the train schedule creating apparatus according to the first aspect of the present invention configured as described above, a plurality of return routes within the return station yard are stored in the return route file. Further, the route time interval memory, the on-site stop time memory, and the on-premises running time memory respectively store the route time interval,
The minimum stop time and each running time are stored.

First, each return route is selected in a predetermined order by the return route selecting means, and the return time calculating means determines the return route with respect to the selected return route.
Using the route time interval, the minimum stop time, and each running time stored in each memory, the arrival and departure time of the last train on each line of the corresponding return route and the shortest time at which the return operation can be started are calculated.

If the calculated shortest time is earlier than the departure time of the first train, the arrival departure time of each line of the selected return route and the calculated return route becomes the return schedule for the corresponding arrival train.

If the calculated shortest time is later than the departure time of the starting train, the returning route selecting means selects the next turning route and the shortest time for the corresponding returning route is calculated, and the turning train of the starting train is calculated. It is compared with the departure time.

In this way, the return route is sequentially selected until the calculated shortest time is earlier than the departure time of the first train. Therefore, a turn-back diamond is created in which the best turn-back route is adopted while satisfying each time condition.

Further, in the train schedule creation device according to the second aspect of the present invention, in addition to the plurality of return routes described above, the priority order among the return routes is also stored in the return route file.

First, the return route selecting means selects the return route having the highest priority, and the return diamond calculating means selects the return route having the highest priority.
Using the route time interval, the minimum stop time, and each running time stored in each memory, the arrival and departure time of the last train on each line of the corresponding return route and the shortest time at which the return operation can be started are calculated.

That is, in the present invention, since each return route is selected according to the stored priority order,
A turn-around diagram is created that efficiently adopts the best turn-around route after satisfying each time condition.

In the third aspect of the present invention, for example, the user arbitrarily corrects, changes, or deletes each return route stored in the return route file. Can be set. Similarly, each time condition can be modified, changed, or deleted by the user.
Can be set. Furthermore, in another invention, the user can modify the turn-back timetable once created as needed.

[0031]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing a schematic configuration of a train schedule creation device of an embodiment. This train schedule creation device is composed of an information processing device such as a computer.

For example, the control unit 14 including the return route selection unit 11, the return time calculation unit 12 and the return time determination unit 13 which are softly formed on the application program, sends the train timetable to the user 15 and the generated return time. A GUI (graphic user interface) 16 that displays a timetable and receives an operation input from the user 15 is connected. Furthermore, the control unit 14
On the other hand, a train schedule file 17, a return route file 18, a route time memory 19 as a route time interval memory, a premises stop time memory 20 and a premises running time memory 21 are connected.

A return route setting unit 22 is connected to the return route file 18, and the route time interval memory 19 is connected.
Is connected to a route time interval setting unit 23, and a premises stop time memory 20 and a premises running time / minute memory 21 are connected to a premises stop time setting unit 24 and a premises running time / minute setting unit 25, respectively.

The setting units 22 to 25 store the contents stored in the file 18 and the memories 19 to 21 in the user 15's memory.
Are provided to arbitrarily perform modification, change, deletion, and setting via the GUI 16.

Next, the configuration and operation of each section will be described in order. In the train schedule file 17, for example, as shown in FIG. 6, the schedule of each train stopping or passing through each station including the return station is stored. Naturally, for the return station, each passing train, each ending train,
Each timetable of each first train is stored.

In the return route file 18, a plurality of return routes described above at the return station are stored together with the priority order among the return routes. Nothing is stored in the return route file 18 in the initial state, and the user 15 sets each return route and each priority using the GUI 16 at the initial operation of the operation of the train schedule creation device.

As described above, when the turnaround station has a large number of branching devices 5a, 5b, 5c and pull lines 6, 7, 8 as shown in FIGS. 7 and 2, there are a lot of turnaround routes. However, the best turnaround route exists for this turnaround station in consideration of the passengers getting on and off and the turnaround time. This best turnaround route is the first priority. In this way, each priority is assigned to each return route.

For example, the three branching devices 5a shown in FIG.
At the turnaround station (station B) where 5b, 5c and three pulling lines 6, 7, 8 are provided, the turnaround route for moving the train from the down main line 1 to the up main line 2 is route 1 as described above. There are a total of 4 from to route 4. On the contrary, when the train is moved from the up main line 2 to the down main line 1, a plurality of return routes are separately set.

If the number of branching stations or pull-up lines installed at the return station or the installation position is changed or a new sub-main line is installed, the user 15 can use the return route setting unit 22 by the above-described method. Perform the change operation.

The route time interval memory 19 stores the route time interval indicating the minimum time interval when a plurality of trains use all or part of the return route. For example, at station B having the configuration shown in FIG. 7, as shown in FIG. 2, a return train B that enters from the down main line 1 to the pull-up line 8 and a train that enters from the adjacent A station to the up main line 2 of this B station. A competition section 26 in which the routes compete with C occurs. In this way, regarding the two routes in which the competition section 26 in which the respective routes of the plurality of trains B and C compete with each other, the trains that use the competition section 26 later are not affected by the trains that use the competition section 26 first. The minimum time interval that can be traveled is defined as the route time interval. Specifically, for example, it corresponds to the time T ₂₁ shown in FIG.

This route time interval is also set in advance by the user 15 via the route time interval setting unit 23.
It is set within 9. Further, when the alignment of the return station is changed or when the number of return stations is increased, the route time interval once set is appropriately changed as necessary.

As described above, each line 1, 2, 6, 7, in the return station premises is stored in the station stop time memory 20.
The minimum stop time of the train in 8 is stored. Specifically, for example, when the return route shown in FIG. 8 is adopted, the minimum stop time corresponds to T ₀₁ , T ₀₂ , T ₀₃ .

The minimum stop time is also set in advance by the user 15 in the premise stop time memory 20 via the premise stop time determining unit 24. In the on-premise running time memory 21, the return trains in the return station yard are on each line 1, 2,
Each travel time required to move between 6, 7 and 8 is stored. For example, at the turnaround station shown in FIG. 7 (FIG. 2), at least the following running hours are set.

1) Downward main line 1 → Upline 8 (time T ₁₁ in FIG. 8) 2) Downline main line 1 → Upline line 7 3) Downlink main line 1 → Upline line 6 4) Upline line 8 → Upline line 2 (FIG. 8) Time T ₁₂ ) 5) Pull-up line 7 → Upgrade main line 2 6) Pull-up line 6 → Upgrade main line 2 7) It is set in the minute memory 21. In addition, when the alignment of the return stations is changed or when the number of return stations is increased, the once set running times are appropriately changed as necessary.

Next, the operations of the loopback route selecting section 11, the loopback diamond calculating section 12 and the loopback diamond determining section 13 which constitute the control section 14 will be described. Return route selection unit 11
Reads sequentially the return routes stored in the return route file 18 in descending order of priority, and sends them to the next return time calculating unit 12.

The turn-back time diagram calculation unit 12 checks the route time interval for the turn-back route input in the following procedure.
Check the minimum stop time, check the running time,
Using these pieces of time information, the arrival and departure time of each line of the selected return route and the shortest time T at which the return operation can be started are calculated.

Then, the next turn back diamond decision unit 13
The turn-back diagram to be adopted is determined from the shortest time T for each turn-back route that is sequentially calculated. The operation of the control unit 11 will be described with reference to the flowchart shown in FIG.

The control unit 11 reads from the train timetable file 17 each train (passage) of each train passing through the corresponding return station, each ending train, and each starting train. FIG. 3 is a diagram showing a train schedule for the turnaround station (B station) shown in FIG. 2 (FIG. 7). Without stopping at this turnaround station (B station), there is a streak a _{1 for the} last train going down at this turnaround station (B station), a streak b _{1 for the} first train going up at this turnaround station (B station) The streak b ₂ of the upward passing train and the respective streaks b ₃ and b ₄ of the other upward starting trains are already set.

Then, this time, the streak a _{1 of the} down train
Then, consider a case of creating a turn-back diamond connected to the streak b ₁ or the streak b ₃ of each up-start train at departure times t ₅ and t ₄ later than the arrival time of the streak a ₁ .

When the flow chart of FIG. 4 is started, first, P
In (program step) 1, an up-start train departing from this turnaround station (B station) is set earliest after the arrival time of the down-bound train (suji a ₁ ). In the diagram of FIG. 3, the first train going up at the streak b _{3 at} the departure time t ₄ is set.

Next, at P2, the return route selection unit 11 sets the return route having the highest priority from the return route file 18. At this turnaround station (B station), of the four turnaround routes described above, the route 3 shown by the broken line in FIG. 3 is adopted as the highest priority.

Route 3: Arrival from the downhill main line 1 to the downhill home 3 → To the uphill line 6 → Departure from the uphill 4 on the uphill main line 2 via the turnout 5b Next, at P3, return to this return route 3 In this case, the shortest time T at which the vehicle can start from the up home 4 on the up main line 2 earliest is calculated as follows.

_First , the time t ₁ when the down train (return train) of the streak a 1 from the down main line 1 departs to the pulling up line 6 is t ₁ = the time when the train (suji a 1) arrives at the down main line 1 + down Set the minimum stop time of main line 1 (1), and check the route time difference with other routes when moving from down main line 1 to pull-up line 6.

When the final train arriving at the down line 1 moves to the pulling line 6, the following routes (1) Route from down line 1 to the adjacent station (A station) (2) From down line 1 Route to pull line 8 (3) Route from down line 1 to pull line 7 (4) Route from pull line 6 to up line 2 (5) Use route from pull line 8 to down line 1 and others Check the minimum gap (route gap) with trains using these routes to compete with other trains.

More specifically, the train lines using the above routes are searched for in the train schedule file 17,
The route time interval stored in the route time interval memory 19 is the time at which the current down-arrival train (return train) travels on the selected return route and the time at which the train passes each of the above-mentioned routes. Check to see if they are further apart.

If the route time interval is not observed, the stop time of the down main line 1 of the down train is adjusted, and the departure time t ₁ from the down main line 1 is adjusted so that the route time interval is observed.

The finally decided departure time t of the down line 1
Based on ₁ , the departure time t ₂ of the pull-up line 6 is set as follows. t ₂ = t ₁ + (Time of travel between down main line 1 to pull-up line 6) + Minimum stop time of pull-up line 6 ... (2) Next, the down-bound train (return train) is pulled up line 6 at time t _2. When departing from and heading for the uphill main line 2, the route time difference with the train using the route in which a conflict occurs is checked. In this case, each of the following routes (1) Route from downhill main line 1 to adjacent station (A station) (2) Route from downhill main line 1 to pulling line 8 (3) Route from downhill main line 1 to pulling line 7 ( 4) Route from Down Line 1 to Pull Line 6 (5) Route from adjacent station (A station) to Up Line 2 (6) Route from Pull Line 8 to Up Line 2 (7) Pull line 7 to Up Line Other trains using the route to 2 are searched in the train schedule file 17, and it is checked by the same method as described above whether or not the route interval stored in the route interval memory 19 is protected. .

If the route time interval cannot be observed, the stop time of the pull-up line 6 of the down train (return train) is adjusted, and the departure time t ₂ from the pull-up line 6 is adjusted so that the route time interval is kept.
To decide.

When the departure time t ₂ from the pull-up line 6 is determined, the pull-up line 6 stored in the on-premise running time memory 21 is determined.
And the running time between the uphill main line 2 and the road. Based on the read running time, this down train (return train)
Determination of the arrival time t ₃ to the upstream home 4 of the upstream main line 2 by the following equation.

Travel time between t ₃ = t ₂ + (lift line 6-up main line 2) (3) Also, from the minimum stop time of the up main line 2 in the on-site stop time memory 20, the fastest of the up main line 2 The shortest time T that can leave the uphill platform 4 is calculated by the following formula.

T = t ₃ + minimum stop time of the uphill main line 2 (4) Next, in P4, the calculated shortest time T and the departure time t ₄ of the upstart train (strip b ₃ ) to be connected makes a comparison, if the shortest time T is earlier than the departure time t _4, at P5, arrival departure time t ₁ of each line 1,6,2 of the selected folded route and streaks a ₁ of the downstream last stop train, t
_{At 2} and t ₃ , connect to the streak of the first train going up and make a turn-back diamond.

However, in P4, when the calculated shortest time T is later than the departure time t _{4 of the} first up train (strip b ₃ ) to be connected, in P6 the return route selection unit 1
1 to check whether another return route is stored in the return route file 18. If another return route is stored, the next return route is selected in P8 according to the priority order.

Similarly, for the return route selected in P8, the above-mentioned various time conditions of the return route are also checked to find the shortest time T at which the up home 4 of the up main line 2 can be departed earliest. , It is compared with the departure time t ₄ of the first up train (strip b ₃ ) to be connected, and it is checked whether or not the connection is possible.

At P6, the shortest time T is late no matter which turnaround route in the turnaround route file 18 is adopted for the first upcoming train (line b ₃ ) to be connected,
If the end-of-down train cannot return at the departure time t ₄ of the corresponding start-of-up train (suji b ₃ ), the train schedule file 17
Inside, the first train going up to connect (suji b ₃ )
The departure time is later than the departure time t _{4 of (4) and} it is checked whether or not there is another unconnected upstream train.

If it exists, it is set in P9 as the first train to go up (strip b ₁ ) to be connected. The process ends if there is no first train going up for which the return timetable is not set.

Then, returning to P2, the return route selection unit 11 reads the return route of the highest priority from the return route file 18 again, and the return time calculation unit 12 returns.
Send to.

The turn-back time calculation unit 12 calculates each shortest time T at which the down-bound train (stripes a ₁ ) leaves the up-main line 2 when each turn-back route is adopted by the above-described method, and the calculated shortest time is calculated. It is determined whether the time T is earlier or later than the departure time t _{5 of the} first train (strip b ₁ ) to be newly connected, and the priority is first set when the shortest time T is earlier than the departure time t _5. The turn-around route is a turn-around diamond connecting the downstream end train (suji a ₁ ) and the new upstream start train (suji b ₁ ).

Then, the finally created turn-back timetable is additionally registered in the train timetable file 17. In the train schedule creation device configured as described above, the return route file 18 stores a plurality of return routes in the return station (station B) and the priority order among the return routes in the return route file 18. Furthermore, in the route time interval memory 19, the on-site stop time memory 29 and the on-premises running time memory 21,
The route time interval, the minimum stop time, and each running time are stored respectively.

First, the return route with the highest priority is selected, and for the return route with the highest priority, the route interval, the minimum stop time, and the respective stop times stored in the memories 19, 20, and 21 are selected. Arrival time and departure time of the last train (return train) on each line of the corresponding return route using the travel time and the shortest time T at which the return operation can be started
Is calculated.

When the calculated shortest time T is earlier than the departure time of the first train, the return route of the highest priority and the calculated arrival and departure time of each line of the return route become the return schedule for the corresponding arrival train.

In this way, each passing train, each ending train, etc. at the turnaround station stored in the train schedule file 17.
Lines (a ₁ , b ₁ , b) indicating the arrival and departure times of each first train
₂ , b ₃ , b ₄ ) is given, the return route with the highest priority is automatically assigned to each arriving train while satisfying the various time conditions described above, and A return timetable for the first train is automatically created.

Therefore, even if the user is unfamiliar with making a train timetable, or if he / she does not completely understand the structure of the turnaround station, he / she can create an accurate turnaround diagram in a short time with a simple operation. can do.

Further, even when the conditions for laying a turnout or a pulling line at a turnaround station are changed, or when a new turnaround station is installed, the turnaround route stored in the turnaround route file 18 is corrected or changed. A new turn-back diamond can be easily created by deleting or adding.

The same can be said when the route interval, the minimum stop time, and the running time are changed. Fifth
FIG. 9 is a block diagram showing a schematic configuration of a train schedule creation device according to another embodiment of the present invention. The same parts as those of the apparatus of the previous embodiment shown in FIG. 1 are designated by the same reference numerals. Therefore, detailed description of the overlapping portions will be omitted.

In the apparatus of this embodiment, the diamond correction unit 27 is connected to the GUI 16 operated by the user 15. The user 15 activates the timetable correction unit 27 via the GUI 16, reads out each turnaround timetable at the turnaround station once created and written in the train timetable file 17, and performs necessary corrections on the display screen of the GUI 16. You can

As described above, by allowing the user 15 to correct the automatically created turn-back timetable, it is possible to make minute corrections such as the departure time which cannot theoretically be expressed by the intuition and experience of many years. You can create a more complete practical folded diamond.

[0077]

As described above, in the train timetable creating apparatus of the present invention, a plurality of return routes in the return station yard are stored in the return route file with priorities, and the return trains are each part of the return route. Each memory stores the time conditions such as the route time interval, the minimum stop time, and the running time when the vehicle passes.

Therefore, the turn-back diagram showing the turn-up of the upward train and the streak of the downward train at the turn-back station should meet the route time interval, the minimum stop time, and each time condition of the running time, and the best turn-back route. Can be used to automatically create. As a result, even a user who is unfamiliar with creating diamonds can easily and surely create a turn-back diamond in a short time.

Further, since the user can easily set and change the stored contents in the return route file and each memory, even if the structure of the return station is changed, it can be easily dealt with. Furthermore, the user can arbitrarily modify the turn-back timetable that has been automatically determined once, if necessary.

[Brief description of drawings]

FIG. 1 is a book diagram showing a schematic configuration of a train schedule creation device according to an embodiment of the present invention.

FIG. 2 is a diagram for explaining route time intervals when a plurality of trains at a turnaround station pass through the same route.

FIG. 3 is a diagram showing a procedure for making a folded diamond in the apparatus of the embodiment.

FIG. 4 is a flowchart showing the operation of the apparatus of the embodiment.

FIG. 5 is a book diagram showing a schematic configuration of a train schedule creation device according to another embodiment of the present invention.

[Figure 6] General train diagram

[Fig. 7] A diagram showing the laid state of each line in the return station

[Fig. 8] Diagram of call-back schedules at the call-back station

[Fig. 9] Diagram of turnaround diagram when there is a passing train in the turnaround station

[Explanation of symbols]

1 ... Down main line, 2 ... Up line, 3 ... Down home, 4 ... Up home, 5a, 5b, 5c ... Divider, 6, 7, 8 ... Upline, 11 ... Return route selection part, 12 ... Return time diamond calculation Part, 13 ... turn-back time determining part, 14 ... control part, 1
5 ... User, 16 ... GUI, 17 ... Train timetable file, 18 ... Return route file, 19 ... Route interval memory, 20 ... On-premise stop time memory, 21 ... On-premise running hour memory, 22 ... Return route setting section, 23 ... Route time interval setting unit, 24 ... On-premises stop time setting unit, 25 ... On-premises running time / minute setting unit, 26 ... Competing section, 27 ... Diamond correction unit

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Yoshiro Rokutan 1-1-1, Shibaura, Minato-ku, Tokyo Inside Toshiba Headquarters Office

Claims (4)

[Claims] 1. A passing train at least at a turnaround station,
A train timetable file that stores timetables of each train such as the last train and the first train, and a turnback route file that stores a plurality of turnback routes at the turnaround station that has a branching device that connects between main lines and a plurality of pull lines. A route time interval memory that stores a route time interval indicating a minimum time interval when a plurality of trains use all or a part of the return route, and a minimum stop time on each line of the return train in the return station On-premises stop time memory, and a yard running time memory that stores each travel time required for a return train in the return station to move between the lines, and a final train stored in the train schedule file. On the other hand, a loopback route for selecting each loopback route stored in the loopback route file in a predetermined order. The selecting means and the route time interval, the minimum stop time, and the running time stored in each memory for each return route sequentially selected by the return route selecting means are used for each line of the corresponding return route. The turn-back timetable calculation means for sequentially calculating the arrival / departure time of the final train and the shortest time at which the turn-back operation can be started, and each shortest time sequentially calculated by the turn-back timetable calculation means and stored in the train timetable file. A train timetable creation device comprising a turnback timetable determining means for determining a turnback time and arrival / departure time of each line as a timetable from the departure time of the first train. 2. A passing train at least at a turnaround station,
A train schedule file that stores the schedules of each train, such as the last train and the first train, multiple turn-back routes at the turn-back station that has a branching device and multiple pull-up lines that connect the main lines to each other, and priority between these turn-back routes A return route file that stores the order, a route time interval memory that stores a route time interval indicating the minimum time interval when a plurality of trains use all or part of the return route, and a return train in the return station A station stop time memory that stores a minimum stop time on each of the lines, an on-premises travel time memory that stores each travel time required for a return train in the return station to move between the lines, and the train diagram Each return route stored in the aforementioned return route file for the final train stored in the file Return route selection means for selecting in descending order of priority, and route time intervals, minimum stop times and travels stored in the memories for each return route sequentially selected by the return route selection means. A turn-back timetable calculation means for sequentially calculating the arrival and departure time of the final train and the shortest time at which the turn-back operation can start on each line of the turn-back route using time and minutes, and the turn-back timetable calculation means successively calculates A train equipped with each shortest time and a turnaround route of a priority order that is earlier than the departure time of the first train stored in the train schedule file, and a turnaround timetable determining means for determining the arrival and departure time of each line as a turnaround timetable. Diamond creation device. 3. A route setting means for correcting, changing, deleting, and setting each return route stored in the return route file in accordance with an external operation input, the route time interval memory, the on-site stop time memory and the on-site traveling. Corrected time information such as route time interval, minimum stop time, and premises running time stored in the hour / minute memory according to external operation input. 3. A plurality of time information setting means for changing, deleting, and setting are provided.
Train schedule creation device described. 4. The train timetable creation device according to claim 1, further comprising a turnback timetable correction means for correcting the turnback timetable determined by the turnback timetable determination means in accordance with an external operation input.