JP2003072555A - Altered shunting plan preparing information, storage medium and altered shunting plan preparing system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To automatically prepare an altered shunting plan. SOLUTION: Case data which meet the prescribed conditions are retrieved from the case data on the shunting plans which were previously carried out, on the basis of special train data. A new altered shunting plan is prepared according to the retrieved case data and the special train operation data. When the new altered shunting plan is inconsistent with the prescribed operable conditions, the new altered shunting plan is amended.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a change replacement plan creation information for automatically creating a change replacement plan, a storage medium for storing the change replacement plan creation information, and a change replacement plan creation system.

[0002]

2. Description of the Related Art Regular trains run daily according to the train schedule. In addition to regular trains, temporary trains are sometimes operated to meet seasonal transport demand and individual transport demands such as groups on school excursions.

In principle, temporary trains are set so as not to affect the operation schedule of regular trains as much as possible. However, if it is impossible due to the high operating density of regular trains, etc., Arrival / departure times and arrival / departure numbers of regular trains may be changed. At this time, the station premises replacement plan (hereinafter referred to as the “premises replacement plan”) also needs to be changed.

[0004] The yard replacement plan uses train schedules such as arrival and departure times of trains, arrival and departure numbers, and train turnback plans as inputs.
For trains that need to be replaced, determine the time of replacement and the pull-up line to be used so that trains that need to be replaced do not conflict with other trains and routes, with constraints related to equipment such as station wiring. ,
It is defined as a schedule for replacing vehicles at railway stations.

The premises replacement plan includes a basic replacement plan and a modified replacement plan. The basic replacement plan is created in accordance with the timetable revision and defines the schedule for the replacement work of regular trains at stations. The modified replacement plan is created by modifying the basic replacement plan of the replacement plan of the day according to the operation of the temporary train.

Conventionally, most of these premises replacement plans are created mainly by humans, and a computer draws the created premises replacement plan on a diagram or the like to check whether or not there is a contradiction. Stays in.

[0007] Further, a method for automatically creating a basic replacement plan by a computer is proposed by an on-site replacement plan creation algorithm (Japanese Unexamined Patent Publication No. 2000-177590) that combines probabilistic local search and PERT (scheduling method). However, there is no automatic creation algorithm for the change replacement plan, and at present, it is created by hand.

[0008]

However, since the frequency of operation of temporary trains is extremely high, it requires a great deal of labor to create a change replacement plan each time. On the other hand, it is very difficult to automatically create a change replacement plan by computer. In other words, the arrival and departure number line of the regular train is determined in consideration of the convenience of transfer (time required for movement, moving distance, etc.) and connection with other trains. Computers do not store information about how much inconvenience will be caused to users if the operation plan is changed, so it is impossible for the computer to evaluate and determine changes in the operation plan of regular trains. Is. Further, even if the information is stored, it is unclear that the evaluation criteria are ambiguous because the computer determines which method should be adopted when changing the operation plan of a regular train. Very difficult.

[0009] For example, whether or not the arrival / departure time of a regular train can be changed cannot be determined only by the circumstances of the station in question for which a change / exchange plan is created.
For example, if you change the arrival time or departure time at a certain station,
Normally, it is also necessary to change the time at nearby stations, verify the validity of time changes at all stations related to that station,
You must decide if you can change the time.

As described above, the automatic creation of the change replacement plan by the computer has not been realized because of lack of information, ambiguity of the judgment standard, and the fact that the target station cannot be judged only.

An object of the present invention is to store change replacement plan creation information for automatically creating a change replacement plan without manually modifying the replacement replacement plan, and a storage medium for storing the change replacement plan creation information. , And to provide a change replacement plan creation system.

[0012]

In order to solve the above problems, the invention according to claim 1 relates to a first storage means for storing basic replacement plan data (for example, basic replacement plan DB in FIG. 3).
34) and a second storage unit (eg, the change replacement plan case DB 33 in FIG. 3) that cumulatively stores the case data related to the executed change replacement plan (eg, the change replacement plan case DB 33).
Input means (for example, CP of FIG. 2) for inputting operation data of the temporary train to the change replacement plan creation system of FIG.
U30; step S11 in FIG. 7) and case data that matches a predetermined search condition based on the operation data of the temporary train input by the input means (for example, the temporary train operation data in FIG. 4). Search means for searching from a plurality of case data stored in the storage means (for example, FIG.
CPU 30; step S12 to step S21 in FIGS. 7 and 8, temporary data creating means for temporarily creating a new change replacement plan based on the case data searched by the searching means, and the operation data (for example, a temporary creating means). , CPU3 in FIG.
0; step S23 in FIG. 8) and whether or not there is a contradiction in the temporarily created new change replacement plan according to a predetermined enablement condition. When it is determined that there is no contradiction, the temporarily created new change replacement plan is determined. Main decision means for finalizing the replacement plan (for example,
CPU30 of FIG. 2; step S28 of FIG. 9) and change replacement plan creation information for making the functions.

The invention according to claim 7 relates to a first storage means for storing basic replacement plan data (for example, the basic replacement plan DB 34 in FIG. 3) and a case relating to an already executed change replacement plan. Second storage means for accumulating data (for example,
A change replacement plan creation system (for example, the change replacement plan creation system of FIG. 3) including the change replacement plan case DB 33 of FIG. 3 and input means (eg, FIG. 2) for inputting operation data of a temporary train. CPU 30; step S1 in FIG.
1) and operation data of the temporary train (for example, the temporary train operation data of FIG. 4) input by the input means, case data matching a predetermined search condition is stored in the second storage means. A search means (for example, the CPU 30 in FIG. 2; steps S12 to S21 in FIGS. 7 and 8) for searching from the plurality of case data, the case data searched by the search means, and the operation data. Temporary creating means for temporarily creating a new change replacement plan based on this (for example, CPU 30 in FIG. 2; step S23 in FIG. 8)
According to a predetermined enablement condition, it is determined whether or not there is a contradiction in the temporarily created new change replacement plan, and when it is determined that there is no contradiction, the final decision is made to make a final decision on the temporarily created new change replacement plan. Means (for example, the CPU 30 in FIG. 2; step S28 in FIG. 9).

According to the first and seventh aspects of the present invention, the case data similar to the input operation data of the temporary train is searched from the case data of the executed change replacement plan according to a predetermined search condition, A new change replacement plan is provisionally created from the retrieved case data that has been executed and the input operation data of the temporary train. If there is no contradiction in train operation in the provisionally created new change replacement plan, the new change replacement plan is determined to be a feasible change replacement plan. As a result, it is possible to automatically create a change replacement plan for the operation of the temporary train without human intervention, and the labor for creating the change replacement plan is reduced.

According to a second aspect of the present invention, in the change / replacement plan creation information according to the first aspect, when the final decision means determines that there is a contradiction, the temporarily created new change entry is at least once. Modification of replacement plan (for example, CPU3 in FIG. 2)
0; step S25 in FIG. 9) and re-determination of the contradiction with respect to the corrected new change replacement plan (for example, FIG. 2).
CPU 30 of FIG. 9; step S26 in FIG. 9) is included.

According to the second aspect of the present invention, the case data used for temporarily creating the new change replacement plan and the input operation data of the temporary train have, for example, slightly different times, Even if there is a contradiction such as a numbered line or a route conflict, the temporarily created new change replacement plan is corrected at least once. Then, with respect to the new change replacement plan after the correction, the presence or absence of contradiction is discriminated again.
Therefore, even if the same case data does not exist, it is possible to create a consistent change replacement plan by correction.

According to a third aspect of the present invention, in the change replacement plan creation information according to the first or second aspect, the searching means includes the input temporary train operation data.
Also as change replacement plan creation information including information for causing the function to execute the search, with the degree of coincidence between each case data stored in the second storage means and the operation data of the temporary train as a search condition. Good.

Further, as in the invention described in claim 4, in the change replacement plan creation information according to any one of claims 1 to 3, the search means is the temporary train arrival number, departure train number, Arrival train number competing train number, departure train competing train number, arrival train pattern train number, departure train pattern train number, arrival train number line competing train pattern train number, and departure train number line competing train pattern train The change replacement plan creation information including the information for causing the search to be executed may be realized with the search condition that at least one of the numbers matches.

According to the invention described in claims 3 and 4, it is possible to retrieve the case data similar to the input operation data of the temporary train from the case data of the executed change replacement plan. That is, for example, according to the invention of claim 4, as the search condition of, the arrival train number, the departure train number, the number of competing trains of the arrival train, the number of competing trains of the departure train, the pattern train number of the arrival train, Since the condition is that at least one of the train pattern train number, the arriving train lane competing train pattern train number, and the departing train lane competing train pattern train number matches, the entered temporary train In addition to the case data in which the arrival and departure train numbers match, the case data in which the time and the like are the same but the train numbers are different from the operation data of 1 can be searched under the search conditions of and. Also,
With respect to the input temporary train operation data, it is possible to search for case data having different train numbers and times but having the same change pattern under the search conditions of and.

According to the invention of claim 5, in the change replacement plan creation information of claim 4, the search means is
Among the items (1) to (3) above, the change replacement plan creation information may include information for causing the case data that matches the item having the highest priority to be searched in order.

According to the invention of claim 5, when the case data is searched from the case data of the executed change replacement plan, the items (1) to (3) are selected from the case data which match the items of high priority. Search for. That is, it is possible to search from case data having a high degree of coincidence with the input temporary train operation data. As a result, for example, when temporarily creating a new change replacement plan from case data that matches high-priority items and the input operation data of a temporary train, inconsistencies in train operation may occur. A low new change replacement plan can be provisionally created.

The invention according to claim 6 is characterized in that it is a storage medium (for example, the storage medium 32 in FIG. 2) for storing the change replacement plan creation information according to any one of claims 1 to 5.

According to the invention described in claim 6, it is possible to realize a storage medium having the effect of the invention described in any one of claims 1 to 5.

[0024]

BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, with reference to the drawings, first, a relationship between a basic replacement plan and a modified replacement plan will be described, and then a modified replacement plan creation system to which the present invention is applied will be described in detail.

[Relationship between Basic Replacement Plan and Change Replacement Plan] FIG. 1 is a diagram showing an example of wiring of a line at a certain station. In this figure, platforms P1, P2 and P3 are platforms on which passengers get on and off the train.
Tracks 0, 1, 2, ..., 7 are trains that can be stopped directly from outside the station. The ascending pull-up line 8 and the descending pull-up line 9 are used for temporarily detaining the train when the train arriving at the track is operated by turning back.
The train tracks at the station are routed in the U, V and W directions. The arrows on the wiring of the tracks indicate the traveling direction of the train, respectively, and the track displayed with the two arrows facing each other (for example, the track toward the W direction) is a single track.

FIG. 2 (a) is an example of a basic replacement plan for a regular train operating at the station shown in FIG. 1, and shows a case where the operation data of the temporary train X is further added. FIG. 2B shows an example of a change replacement plan created by making necessary changes to FIG. 2A in order to enable the operation of the temporary train X. 2A and 2B are referred to as a working diagram.

2 (a) and 2 (b) show the movement of the train between the number 0 to number 6 and the down pulling line 9 with the vertical axis as the number line and the horizontal axis as the time. The information on the number line 7 and the upward pulling line 8 is also shown in the figure, but is omitted because it is not used for this replacement work. The squares in FIGS. 2 (a) and 2 (b) indicate that the train is stopped at the track for that time. Also, the line segment attached to the upper left of the square indicates that the train arrives from the upward direction (U direction), and the lower right line segment directs the train to the downward direction (V direction or W direction). It indicates that it will start. Similarly, the lower left line segment represents arrival from the downward direction, and the upper right line segment represents departure from the upward direction.

In FIG. 2 (a), the parallelogram indicating the operation of the temporary train X corresponds to the operating data of the temporary train which is the input of the change replacement plan. That is, the temporary train X is 1
At 0:09, arrive at U.S. No. 3 and at 10:31 depart for V or W towards No. 1 In this case, since the arrival number line and the departure number line are different, it is necessary to replace the temporary train X.

At the stage of creating the change replacement plan of FIG. 2B based on the basic replacement plan of FIG. 2A and the operation data of the temporary train X, another regular train is operated by the operation of the temporary train X. It is determined whether or not there is a contradiction in the operation of the train A, train B, train C, and train D in FIG. 2A. First, since the sufficient time cannot be secured between the departure time of the train A and the arrival time of the temporary train X, it is determined that the number lines of the train A and the temporary train X are in conflict with each other. Further, the replacement work of the temporary train X and the replacement work of the train A to the train B compete on the down pulling line 9.

In contrast to such a contradiction in the operation of the regular train caused by the replacement work of the temporary train X, as shown in FIG.
Change the basic replacement plan of. When the arrival time or arrival line of the temporary train X cannot be changed in the numbered race between the temporary train X and the train A, it is necessary to change the departure time or the arrival number line of the train A. In the case of FIG. 2B, the arrival number line of train A is number 3
It has been changed from No. 6 to No. 6. As a result, the replacement work for train A is no longer necessary, so the replacement work is canceled.
The conflict between the temporary train X and the train A on the down line 9 also disappears.

Furthermore, when the temporary train X moves from the descending pull-up line 9 to the numbering line 1 which is the numbering line after the train D departs from the numbering line 1 for a certain time, the train C moves from the direction V to the numbered line 6.
There is a high possibility that a route conflict will occur because the vehicle arrives at. At the branch point of the track, the turnout determines the progress of either one of the tracks. Therefore, when the above-mentioned route competition occurs, the arrival time of the train C or the replacement time of the temporary train X is delayed. , It leads to the disorder of the train schedule. Therefore,
By delaying the arrival time of the train C by about 2 minutes and moving the temporary train X to the track 1 first, the occurrence of route competition is prevented.

As described above, by determining the operational conflict between the regular trains A, B, C and D and the temporary train X, and adjusting the schedule to avoid the conflict, FIG.
A change replacement plan such as

[Structure] Next, the structure of the change replacement plan creation system to which the present invention is applied will be described. FIG. 3 is a block diagram showing the internal configuration of the change replacement plan creation system. The change replacement plan creation system includes a CPU (Central Processing Unit) 30, a RAM (Random
Access memory) 31, storage medium 32, change replacement plan case database (hereinafter referred to as “change replacement plan case DB”) 33, basic replacement plan database (hereinafter referred to as “basic replacement plan DB”). ) 34, input unit 35, display unit 3
6, and each unit is connected by a bus 37.

The CPU 30 has various application programs designated from among various application programs corresponding to the change replacement plan creation system stored in the storage medium 32, and various types corresponding to various instruction signals input from the input unit 35. Data and the like are stored in the RAM 31, various processes are executed in accordance with the application program stored in the RAM 31 according to the input instruction and the input data, and the processing result is stored in the RAM 31 and displayed on the display unit 36. . Then, the CPU 30
The processing result stored in the AM 31 is stored in the storage destination of the storage medium 32 input from the input unit 35.

Further, the CPU 30 responds to the instruction signal input from the input unit 35, and stores the change replacement plan creating program (see FIGS. 7 to 9) stored in the storage medium 32. 321 or the change replacement plan determination program 322 related to the change replacement plan determination processing (see FIG. 10) or the basic replacement plan creation program 323 related to the basic replacement plan creation processing is read, and according to the read program. , Execute each process.

Although a detailed description of each processing will be given later, the CPU
30 executes a change replacement plan creation process (see FIG. 7 to FIG. 9), and based on the operation data of the temporary train stored in the temporary train operation data storage area 311, the change replacement is performed according to a predetermined search condition. The case data is retrieved from the planned case DB 33 to determine a new change replacement plan. Further, the change replacement plan determination processing (see FIG. 10) read and executed by the CPU 30 in the process of executing the change replacement plan creation processing is performed by using the operation data of the temporary train stored in the temporary train operation data storage area 311. A new change replacement plan is provisionally created based on the case data stored in the similar case data storage area 312, and it is determined whether or not there is a contradiction. The basic replacement plan creation process that is read and executed by the CPU 30 in the process of executing the change replacement plan determination process is described in, for example, Japanese Patent Laid-Open No. 2000-17
The known technique described in Japanese Patent No. 7590 is used to correct the contradiction of the temporarily created new change replacement plan.

The RAM 31 is used as a work area of the CPU 30, and temporarily stores programs and numerical values. In the present embodiment, as the areas, in particular, a temporary train operation data storage area 311, a similar case data storage area 312, and a change replacement plan data storage area 313 are provided.

The temporary train operation data storage area 311 stores the operation data of the temporary train input from the input unit 35. The similar case data storage area 312 stores the data of the change replacement plan case DB 33 searched based on the operation data of the temporary train stored in the temporary train operation data storage area 311. The change replacement plan data storage area 313 is
The determined new change replacement plan is stored.

The storage medium 32 stores a program for realizing the change replacement plan creation system,
The storage medium 32 is composed of a hard disk, a CD-ROM or the like. In the present embodiment, the storage medium 32
Stores a change replacement plan creation program 321, a change replacement plan determination program 322, and a basic replacement plan creation program 323. Although not shown, the change replacement plan creation system is provided with a storage medium reading device for reading the storage medium 32.

The change-replacement plan case DB 33 stores and stores data of change-replacement plans that have been implemented in the past and are consistent with the operation as shown in FIG. 2B, for example.

The basic replacement plan DB 34 is, for example, as shown in FIG.
Data regarding the basic replacement plan created by the timetable revision as shown in (a) is stored.

The input unit 35 is composed of, for example, a keyboard, and outputs the temporary train operation data input by the operator to the CPU 30.

The display unit 36 is, for example, a CRT (Cathode Ray Tube) or LCD (Liquid Crystal Screen: Li).
quid Crystal Display), etc., and displays the data and operation results necessary for the operation of the change replacement plan creation system.

FIG. 4 shows the temporary train operation data storage area 31.
It is a figure showing the data structure of temporary train operation data stored in 1. Items include train numbers, arrival / departure times, arrival / departure numbers, interchange numbers, interchange times, numbered trains, pattern trains, route-competitive trains, and return trains, and each item can be handled by the operator operating the input unit 35. The entered data is entered for each train number. The data is CPU3
The value 0 is stored in the temporary train operation data storage area 311.

The type of the item is an example, and the present invention is not limited to this as long as there is an item for which the operation plan of the temporary train can be grasped. For example, the item includes the starting station, the ending station, the type of vehicle and the number of cars. But it's okay.

In FIG. 4, the data of each item is shown in FIG.
The operation data of the temporary train X shown in (a) is taken as an example, and is the operation data regarding the train X that is the arrival train and the train Y that is the departure train.

First, the train number field stores the train number of the temporary train to be operated. In the item of arrival and departure time,
When the temporary train is the arrival train, the time of arrival at the station is stored, and when the temporary train is the departure train, the time of departure from the station is stored. In the item of arrival / departure number line, the number of the arriving train is stored when the special train is the arrival train, and the number of the departure train is stored when the special train is the departure train.

In the item of the replacement number line, the number of the number line used for the replacement work when the temporary train requires the replacement work is stored. The item of the replacement time stores the time to start the replacement work when the temporary train is the arrival train, and the time to move to the departure line when the temporary train is the departure train. The line number competing train item stores the train numbers of the trains with which the numbered line is used in the operation of the temporary train. The pattern train item stores the train numbers of trains that are operated with a delay of a certain period (for example, 1 hour, 2 hours, etc.) in the temporary train. The item of the route competing train stores the train numbers of the trains whose routes compete at the time of arrival, replacement work, and departure of the temporary train.

The return train item stores the train number of the departure train when the temporary train is the arrival train and the train number of the arrival train when the temporary train is the departure train. Here, the train number is different between the train number before the replacement work (when the train arrives) and the train number after the replacement work (when the train departs) when the train is replaced.

FIG. 5 is a diagram showing the data structure of the replacement plan of each train contained in the basic replacement plan DB 34. For each train, there are train numbers, interchange lines, interchange times, pattern trains and return trains for each train, and a basic interchange plan was created by timetable revision, etc., and the basic interchange plan was converted into data. The item is the basic replacement plan DB 34.

In FIG. 5, the data described in correspondence with each item exemplify the operation data of the trains A, B and C of FIG. 2 (a). The train number is stored in the item of train number, and the number of the line used in the exchange work is stored in the exchange number line if the train of the number stored in the train number needs to be replaced. It As the replacement time, the start time of the replacement work of the train with the number stored in the train number is stored. The item of pattern train stores the train number of the train having the number stored in the train number, which is operated with a constant cycle (for example, one hour, two hours, etc.). In the return train item, the train number of the departure train is stored when the train with the number stored in the train number is the arrival train, and the train number of the arrival train is stored when the train is the departure train. .

FIG. 6 is a diagram showing the data structure of the case data included in the change replacement plan case DB 33. The items are roughly divided into three parts: an event part, a condition part and a change part. In this figure, the data described in correspondence with each item are for the same replacement replacement plan as the replacement replacement plan of FIG.

In the event section, operation data of a temporary train is stored, and items include arrival train number, arrival time, arrival line, departure train number, departure time and departure line. The arrival train number item stores the train number when the temporary train arrived at the station, and the arrival time item stores the time when the temporary train arrived at the station. The item of the numbered line stores the number of the line on which the temporary train arrived. The departure train number item stores the train number when the temporary train leaves the station. The departure time item stores the time when the temporary train leaves the station, and the departure line item stores the number of the departure line of the temporary train.

The condition section stores whether the operating day on which the change replacement plan is performed is a weekday or a holiday. This is stored as one piece of data of the change replacement plan because the weekday train schedule and the holiday train schedule are different.

The changing unit stores the change contents of the basic replacement plan changed by the creation of the replacement replacement plan. The items of the change unit include suspension, replacement cancellation, replacement setting, replacement time change, replacement number change, number change, time change, merge work generation, divided work generation, merge work cancellation, and divided work cancellation.

In the suspension item, the train number of the regular train that has been suspended due to the operation of the temporary train having the number stored in the destination train number item is stored. In the item of replacement stop, the arrival train number and the departure train number of the regular train whose replacement work is canceled due to the operation of the temporary train having the number stored in the arrival train number item are stored. The item of the replacement setting stores the contents of the replacement work when the replacement work is required for the temporary train of the number stored in the item of the arrival train number. The contents stored in this item are the departure / arrival train number, the name of the pulling line to be used, the time to move to the detention line to be detained, and the time to move to the numbering line.

In the item of change time of replacement, the train number and the time of change of the regular train whose change time is changed by the operation of the temporary train having the number stored in the item of the arrival train number are stored, The replacement number line change item stores the train number and the replacement number line of the regular train whose replacement number line is changed by the operation of the temporary train whose number is stored in the destination train number item.

In the track number change item, the train number and track number of the regular train whose track number has been changed by the operation of the temporary train having the number stored in the item of the arrival train number are stored. In the item of time change, the train number of the regular train whose arrival and departure time has been changed by the operation of the temporary train having the number stored in the item of the arrival train number and the time after the change are stored.

In the respective items of the combined work generation and the divided work generation, the trains of the regular trains are merged (connected) or divided by the operation of the temporary train having the number stored in the item of the arrival train number. In this case, the train number of the regular train, the number of the working track number, the merging, and the work execution time of the division are stored. When the merger or division of the planned scheduled train is canceled due to the operation of the temporary train with the number stored in the item of the arrival train number The train numbers of the regular trains are stored.

[Operation] Next, the operation of the change replacement plan creation system will be described. FIG. 7, FIG. 8 and FIG. 9 are flowcharts showing the operation of the change replacement plan creation processing relating to the execution of the change replacement plan creation program 321. First, the operator operates the input unit 35 to input the operation data of the temporary train (step S11). The contents to be input follow the items shown in the data structure of the temporary train operation data in FIG. The input data is stored in the temporary train operation data storage area 311 by the CPU 30 and used for the subsequent processing.

Next, the CPU 30 determines the change replacement plan case DB.
Of all the case data stored in 33, the case data including the arrival train number of the temporary train operation data input in step S11 in the event part is searched (step S1).
2). If there is case data that includes the arrival train number of the temporary train operation data in the event part (step S12: Yes), CP
U30 stores the case data in the similar case data storage area 31.
2 and reads the change replacement plan determination program 322 to execute the change replacement plan determination process (step S1).
3).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S14). The return value is f =
In the case of 1 (step S14: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, when there is no case data including the arrival train number of the temporary train operation data in the event part (step S12:
No), and when the return value of the change replacement plan determination process is not f = 1 (step S14: No), the CPU 30
From all the case data stored in the change replacement plan case DB 33, the case data including the departure train number of the temporary train operation data input in step S11 in the event part is searched (step S15). When there is case data including the departure train number of the temporary train operation data in the event part (step S15: Yes), the CPU 30 stores the case data in the similar case data storage area 312 and executes the change replacement plan determination process. Yes (step S16).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S17). The return value is f =
In the case of 1 (step S17: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, when there is no case data including the departure train number of the temporary train operation data in the event part (step S15:
None), and when the return value of the change replacement plan determination process is not f = 1 (step S17: No), the CPU 30
From all of the case data stored in the change / exchange plan case DB 33, the case data including the train number of the competing train on the numbered line of the arriving train of the temporary train operation data input in step S11 is searched for ( Step S18). When there is case data that includes the train number of the competing train of the arriving train in the temporary train operation data in the change unit (step S18:
Yes), the CPU 30 stores the case data in the similar case data storage area 312, and executes the change replacement plan determination process (step S19).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S20). The return value is f =
In the case of 1 (step S20: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, when there is no case data including the train number of the competing train of the arriving train in the temporary train operation data in the change section (step S18: No), the return value of the change replacement plan determination process is f = If not 1 (step S20: N
o), the CPU 30 selects step S11 from all the case data stored in the change replacement plan case DB33.
The case data including the train number of the departing train competing train of the departure train of the temporary train operation data input in step S21 is searched (step S21). If there is case data that includes the train number of the starting line competing train of the departure train of the temporary train operation data in the change unit (step S21: Yes), the CPU 30 stores the case data in the similar case data storage area 312 and inputs the change. The replacement plan determination process is executed (step S22).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S23). The return value is f =
In the case of 1 (step S23: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, when there is no case data including the train number of the competing train of the departure train of the temporary train operation data in the change section (step S21: No), the return value of the change replacement plan determination process is f = If not 1 (step S23: N
o), the CPU 30 selects step S11 from all the case data stored in the change replacement plan case DB33.
Pattern of arrival train of temporary train operation data input in step S24 is searched for case data including the train number of the train in the event part (step S24). Pattern of arrival train of temporary train operation data When there is case data including the train number of the train in the event part (step S24: Yes), the CPU 30 stores the case data in the similar case data storage area 312 and replaces it with another. A plan determination process is executed (step S25).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S26). The return value is f =
In the case of 1 (step S26: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, if there is no case data including the train number of the arriving train of the temporary train operation data in the event part (step S24: none), the return value of the change replacement plan determination process is f = 1. If not (step S26: N
o), the CPU 30 selects step S11 from all the case data stored in the change replacement plan case DB33.
Pattern of departure train of temporary train operation data input in step S1 is searched for case data including the train number of the train in the event part (step S27). Pattern of departure train of temporary train operation data When there is case data including the train number of the train in the event portion (step S27: Yes), the CPU 30 stores the case data in the similar case data storage area 312 and replaces it with another. A plan determination process is executed (step S28).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S29). The return value is f =
In the case of 1 (step S29: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, if there is no case data that includes the train number of the departure train of the temporary train operation data in the event part (step S27: No), the return value of the change replacement plan determination process is f = 1. If not (step S29: N
o), the CPU 30 obtains the operation data of the numbered train competing train of the arrival train of the temporary train operation data from the basic replacement plan DB 34 (step S30), and of all the case data stored in the change replacement plan case DB 33. From inside, step S
Based on the operation data acquired in 30, the pattern data of the competing train of the arriving train of the temporary train operation data is searched for the case data including the train number of the change train (step S3).
1). When there is case data that includes the train number of the arriving train and the pattern of the competing train of the arriving train in the temporary train operation data (step S31: Yes), the CPU 30 stores the case data in the similar case data storage area 312. The change replacement plan determination process is executed (step S32).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S33). The return value is f =
In the case of 1 (step S33: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, when there is no case data that includes the train number of the arriving train and the pattern train of the competing train in the temporary train operation data in the change section (step S31: No), the return value of the change replacement plan determination process Is not f = 1 (step S33: No), the CPU 30 acquires the operation data of the numbered train competing train of the departure train of the temporary train operation data from the basic replacement plan DB 34 (step S34), and the change replacement plan example Based on the operation data acquired in step S34 from all the case data stored in DB33,
Pattern of the lane competing train of the departure train of the temporary train operation data The case data including the train number of the train in the change unit is searched (step S35). If there is case data that includes the train number of the departing train of the departure train of the temporary train operation data in the change unit (step S35: Yes), the CPU
30 stores the case data in the similar case data storage area 312.
Then, the change replacement plan determination process is executed (step S36).

Next, the CPU 30 determines the return value of the change replacement plan determination process (step S37). The return value is f =
In the case of 1 (step S37: Yes), the CPU 30 shifts the processing to step S39.

On the other hand, if there is no case data that includes the train number of the departing train of the departure train of the temporary train operation data and the train number of the train in the change section (step S35: No), the return value of the change replacement plan determination process Is not f = 1 (step S37: No), the CPU 30 does not have case data similar to the operation data of the temporary train input in step S11 in the change replacement plan case DB 33 or can execute a new change input. Judging that the replacement plan could not be created,
Display an error message on the display unit 36 (step S
38), the program ends.

On the other hand, in step S39, the CPU 30 displays on the display unit 36 the data stored in the change replacement plan data storage area 313, assuming that the new executable change replacement plan has been created. finish.

FIG. 10 shows the change replacement plan determination program 3
22 is a flowchart showing an operation of a change replacement plan determination process related to execution of 22.

First, the CPU 30 substitutes 0 into the discrimination flag f (step S101), and creates a new change replacement plan based on the data stored in the temporary train operation data storage area 311 and the similar case data storage area 312. Temporarily created,
The data is stored in the change replacement plan data storage area 313 (step S102).

Next, the CPU 30 determines whether or not there is a contradiction in the temporarily created new change replacement plan (step S).
103). If there is a contradiction (step S103:
Yes, the CPU 30 reads the basic replacement plan creation program 323 for the new replacement replacement plan and executes the basic replacement plan creation process to correct the contradiction of the new replacement replacement plan (step S104).

Then, the CPU 30 determines again whether or not there is a contradiction in the corrected new change replacement plan (step S105). If there is a contradiction (step S105:
Yes), the CPU 30 sets the return value to f = 0, and ends the change replacement plan determination process.

On the other hand, if there is no contradiction in the temporarily created new change replacement plan in step S103 (step S).
103: None), and when there is no contradiction in the new change replacement plan corrected in step S104 (step S105:
No), the CPU 30 substitutes 1 into f (step S10).
6) Then, the return value is set to f = 1 and the change replacement plan determination process is ended.

Here, in the change replacement plan determination process,
If the CPU 30 determines that there is a contradiction in the temporarily created new change replacement plan, the basic change plan creation process corrects the contradiction in the new change replacement plan once, but it may be performed multiple times. .

Further, based on the operation data of the temporary train,
The case data is searched from the change replacement plan case DB 34 according to a predetermined search condition, but the search condition is not limited to the above search condition. Similarly, based on the operation data of the temporary train, the priority is attached to a predetermined search condition and the change is made.
The case data is searched from No. 4, but the priority of the search condition is not limited to the above priority.

FIG. 11 shows the train numbers of temporary trains that have occurred in a predetermined period at the station shown in FIG. 1, the number of operating days, the number of replacement work changes per temporary train, and the number of transfers within a predetermined period. It is a figure showing the total number of changes of replacement work. The number of replacement work changes per temporary train is, for example, the cancellation of replacement work that occurred due to the operation of temporary trains, the change of replacement time, and the number of regular trains that occurred in connection with these change work. It shows the number of changes such as number change and time change.

In FIG. 11, it can be seen that the number of changes due to the operation of a small number of temporary trains, such as the temporary trains 9531M and 9627D, accounts for a large proportion of the total number of changes of 924. In addition, the change contents of these replacement works were the same as the change contents of the replacement work if the train number of the temporary train was the same, so the change replacement plan carried out in the past is used as case data. When the change replacement plan case DB 34 is stored and stored, and when a change replacement plan for a newly operated temporary train is created, the case data accumulated under predetermined search conditions is stored based on the operation data of the temporary train. A method of searching and creating a change replacement plan based on the searched case data is effective.

FIG. 12 shows that the station shown in FIG. 1 accumulates case data from the change and replacement plan carried out in a certain predetermined period, and changes and changes to the operation of the temporary train occurred in another predetermined period. It is the figure which showed the evaluation result at the time of creating a replacement plan by applying the change replacement plan creation system of this Embodiment.

According to FIG. 12, the case data searched based on the train number of the temporary train was applied to the creation of the new change replacement plan at 80 cases, and the search was performed based on the train number of the conflicting train on the temporary train. 11 cases were applied to create the new change replacement plan, and 6 cases were applied to create the new change replacement plan based on the train number of the temporary train pattern train. A contradiction occurred in the created new change replacement plan, and the number of new change replacement plans in which the contradiction was corrected in the basic replacement plan creation process was 0. That is, the total number of cases in which a new feasible change replacement plan could be created based on the case data of the implemented change replacement plan was 97 in total.

The number of cases in which a new change replacement plan could not be created was 11 due to the absence of applicable change replacement plan case data, and the replacement work that occurred with the operation of the temporary train The number of changes such as the occurrence and cancellation of, and number change was 108.

As a result, the success rate of creation of the new change replacement plan was 89.8%. From this, in creating a new change replacement plan to which the present invention is applied, a new change replacement plan that can be executed with a probability of about 90% can be automatically created, and the effort in creating the change replacement plan can be increased. Can be reduced.

Further, based on the operation data of the temporary train,
As a search condition for searching the case data of the implemented change replacement plan, for example, adding various items other than the train number of the temporary train, such as the train number of the temporary train competing train, is a new change replacement. It is effective for retrieving case data that is effective in making plans.

[0093]

According to the invention described in claims 1 and 7, the case data similar to the input operation data of the temporary train is input,
The case data of the executed change replacement plan is searched according to a predetermined search condition, and a new change replacement plan is provisionally created from the searched executed case data and the input temporary train operation data. If there is no contradiction in train operation in the provisionally created new change replacement plan, the new change replacement plan is determined to be a feasible change replacement plan. As a result, it is possible to automatically create a change replacement plan for the operation of the temporary train without human intervention, and the labor for creating the change replacement plan is reduced.

According to the second aspect of the present invention, the case data used for temporarily creating the new change replacement plan and the input operation data of the temporary train have, for example, a slight difference in time or the like, or a track number. Even if there is a contradiction such as a conflict in the path or a route, the temporarily created new change replacement plan is corrected at least once. Then, with respect to the new change replacement plan after the correction, the presence or absence of contradiction is discriminated again. Therefore, even if the same case data does not exist,
The modifications can create a consistent change replacement plan.

According to the invention described in claims 3 and 4, it is possible to retrieve the case data similar to the input operation data of the temporary train from the case data of the executed change replacement plan. That is, for example, according to the invention as set forth in claim 4, as the search condition, the arrival train number, the departure train number, the numbered competing train number of the arrival train, the competition train number of the departure train, the pattern train number of the arrival train, and the departure train Pattern train number,
Since at least one of the pattern train number of the arriving train's lane competing train and the pattern train number of the departing train's lane competing train must match, the input temporary train operation data In addition to the case data in which the arrival and departure train numbers are the same, the case data in which the time and the like are the same but the train numbers are different can be searched under the search conditions of and. In addition, with respect to the input temporary train operation data, it is possible to search for case data having different train numbers and times but having the same change pattern under the search conditions of and.

According to the invention of claim 5, when the case data is searched from the case data of the executed change replacement plan, the items (1) to (3) are searched from the case data which matches the high priority items. To do. That is, it is possible to search from case data having a high degree of coincidence with the input temporary train operation data. As a result, for example, when temporarily creating a new change replacement plan from case data that matches high-priority items and the input operation data of a temporary train, inconsistencies in train operation may occur. A low new change replacement plan can be provisionally created.

According to the invention of claim 6, claims 1 to
It is possible to realize a storage medium that achieves the effect of the invention described in any one of 5 above.

[Brief description of drawings]

FIG. 1 is a diagram showing wiring of a railway line of a station.

FIG. 2 is a diagram showing a diagram of a basic replacement plan and a diagram of a modified replacement plan.

FIG. 3 is a block diagram showing an internal configuration of a change replacement plan creation system.

FIG. 4 is a diagram showing a data structure of a temporary train operation data storage area.

FIG. 5 is a diagram showing a data structure of a basic replacement plan DB.

FIG. 6 is a diagram showing a data structure of a change replacement plan case DB.

FIG. 7 is a flowchart showing the operation of a change replacement plan creation process.

FIG. 8 is a flowchart showing the operation of a change replacement plan creation process subsequent to FIG. 7;

9 is a flowchart showing the operation of a change replacement plan creation process following FIG. 8. FIG.

FIG. 10 is a flowchart showing the operation of a change replacement plan determination process.

FIG. 11 is a diagram showing the operating status of a temporary train and the number of changes accompanying the operation.

FIG. 12 is a diagram showing evaluation when a change replacement plan is created by applying the present invention.

[Explanation of symbols]

30 CPU 31 RAM 311 Temporary train operation data storage area 312 Similar case data storage area 313 Change Replacement Plan Data Storage Area 32 storage media 321 Change Replacement Plan Creation Program 322 Basic replacement plan creation program 33 Change Replacement Plan Case DB 34 Basic replacement plan DB 35 Input section 36 Display 37 bus

   ─────────────────────────────────────────────────── ─── Continued front page    (72) Inventor Zhou Riken             1-7-23 Kita, Kunitachi, Tokyo 3F National Building               JR Research Institute, Inc. Information System             Within F-term (reference) 5H161 AA01 JJ31 JJ40

Claims (7)

[Claims] Claim: What is claimed is: 1. A temporary train for a computer, comprising: a first storage means for storing basic replacement plan data; and a second storage means for cumulatively storing case data related to an executed change replacement plan. A plurality of case data stored in the second storage means based on the operation data of the temporary train input by the input means Search means for searching from among, the case data searched by the search means, the temporary creation means for temporarily creating a new change replacement plan based on the operation data, according to a predetermined enablement condition, To determine whether or not there is a contradiction in the provisionally created new change replacement plan, and when it is determined that there is no contradiction, the deciding means for making the final decision of the tentatively created new change replacement plan, and Further replacement planning information. 2. The change replacement plan creation information according to claim 1, wherein when the main determination unit determines that there is a contradiction, the temporary replacement newly created replacement replacement plan is corrected at least once, and , Change replacement plan creation information including information for causing the function to perform re-determination of the presence or absence of inconsistency with respect to the new change replacement plan after the correction. 3. The change replacement plan creation information according to claim 1 or 2, wherein the search means stores the input operation data of the temporary train and the case data stored in the second storage means. Change replacement plan creation information including information for causing the search to function by using the degree of coincidence with the operation data of the temporary train as a search condition. 4. The change replacement plan creation information according to any one of claims 1 to 3, wherein the search means includes an arrival train number, a departure train number, a numbered train competing train number of the arrival train, and a departure train. At least one of the competing train number, the arrival train pattern train number, the departure train pattern train number, the arrival train number line competing train pattern train number, and the departure train number line competing train pattern train number Change replacement plan creation information including information for causing the function to execute the search, with the above as a search condition. 5. The change-replacement plan creation information according to claim 4, wherein the search means functions to search in order from case data that matches a higher priority item among the items from to. Change replacement plan creation information including information. 6. A storage medium for storing the change replacement plan creation information according to claim 1. 7. A change replacement plan creation system comprising: a first storage means for storing basic replacement plan data; and a second storage means for cumulatively storing case data relating to an executed change replacement plan. There is input means for inputting operation data of the temporary train, and case data matching a predetermined search condition is stored in the second storage means based on the operation data of the temporary train input by the input means. A searching means for searching from a plurality of case data, a temporary creating means for temporarily creating a new change replacement plan based on the case data searched by the searching means, and the operation data; According to a possible condition, it is determined whether or not there is a contradiction in the temporarily created new change replacement plan, and if it is determined that there is no contradiction, a final determination means for making a final determination of the temporarily created new change replacement plan is provided. Change replacement planning system, characterized in that.