GB2524157A - Train timetable generation system, train timetable generation device, and train timetable generation method - Google Patents
Train timetable generation system, train timetable generation device, and train timetable generation method Download PDFInfo
- Publication number
- GB2524157A GB2524157A GB1501759.3A GB201501759A GB2524157A GB 2524157 A GB2524157 A GB 2524157A GB 201501759 A GB201501759 A GB 201501759A GB 2524157 A GB2524157 A GB 2524157A
- Authority
- GB
- United Kingdom
- Prior art keywords
- timetable
- client devices
- proposed
- timetables
- generation device
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
- B61L27/10—Operations, e.g. scheduling or time tables
- B61L27/12—Preparing schedules
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
Multiple client devices 0102, 0103 generate desired timetables preferred by respective service operators and a timetable generation device 0101 generates a proposed timetable there-from. The timetable generation device receives the desired timetables transmitted from the client devices; supplements any undesignated portion in the desired timetables with candidate values; aggregates the supplemented timetables; uses stored line failure information to calculate a number of reschedulings required if any line were to become unusable; and transmits to the client devices a proposed timetable that minimizes the rescheduling count. Each client device displays the proposed timetable to acquire approval or rejection thereof for transmission to the timetable generation device. The client devices may also propose timetable amendments. Thus where railway operations are divided into two layers, a railway infrastructure operator may generate an optimised timetable from the desired timetables of multiple service operators who use a common railway network.
Description
TITLE OF THE INVENTION
TRRTN TIMETABLE GENERPTION SYSTEM, TRPIN TIMETABLE GENERATTON DEVICE, AND TRAIN TTMETABLE GENERATION METHOD
BACKGROUND OF THE II'WENT ION
Field of the Invention
The present invention relates to a train timetable generation system, a train timetable generation device, and a train timetable generation method.
Description of the Related Art
In operating trains, the railway business operator needs to generate train timetables. In the past, the work to generate a train timetable has been done manually because it reguires taking into consideration such diverse factors as the convenience of passengers, the availability of crew and train cars, and the ease of dealing with train delays that may occur. Since the timetable generation work have to be carried out by experts and it takes a long time, there have been developed techniques for supporting timetable generation with computers. For example, JP-2007- 237948-A (hereinafter referred to as Patent Document 1) discloses techniques for calculating passenger costs as evaluation values representing the losses such as opportunity losses and discomfort incurred by passengers and operational costs of trains as evaluation values representing such losses as personnel expenses and power cost incurred by the business operator, thereby determining from among solution candidate timetables the one having the smallest sum of the calculated passenger costs and operational costs as the response timetable.
SUMMARY OF THE TNVEMTION
In some countries including the United Kingdom, the railway business operator is divided into two layers: an infrastructure operator, and service operators. The infrastructure operator provides infrastructure such as train tracks and signals to let trains run. There are multiple service operators each operating trains on the infrastructure thereby offering services to their customers. In this case, the infrastructure operator needs to generate a timetable for operating trains by aggregating the timetables created by the multiple service operators.
However, Patent Document 1 has no mention of techniques for aggregating the timetables created by multiple service operators. Where there exist multiple service operators, it is difficult, with the techniques of Patent Document 1, to generate an optimum timetable taking into account the intentions of these operators.
To solve the above problem, the present invention discloses a timetable generation system including at least one client device that generates a desired timetable preferred by a service operator, and a timetable generation device that generates a proposed timetable by taking a plurality of the desired timetables into consideration.
The timetable generation device includes: a reception part that receives the desired timetables transmitted from a plurality of the client devices; a timetable supplement part that supplements any undesignated portion in the desired timetables with a plurality of candidate values; a failure history storage part that stores information about past line failures; a simulation execution part which, after the desired timetables thus supplemented have been aggregated, calculates on the basis of the line failure information the number of reschedulings required if any line has become unusable, thereby determines the proposed timetable that minimizes the rescheduling count; and a transmission part that transmits the proposed timetable to the client devices. The client devices each include: a display part that displays the proposed timetable to acquire approval or rejection thereof; and a transmission part that transmits approval information indicative of whether or not to approve the proposed timetable to the timetable generation device.
According to the present invention, where there are multiple business operators, it is possible to generate an optimum timetable that takes their intentions into account.
The invention may further include operating train services over a railway network according to the approved
timetable.
BRIEF DESCRIPTION OF THE DRANINGS
Fig. 1 is a diagram showing a device configuration of a timetable generation system.
Fig. 2 is a diagram showing an overall sequence of timetable generation.
Fig. 3 is a diagram showing a module configuration of a timetable generation server.
Fig. 4 is a diagram explaining data items included in a train timetable.
Fig. 5 is a diagram explaining a conflict between
train timetables.
Fig. 6 is a diagram showing formats in which train timetables are retained.
Fig. 7 is a flowchart showing a flow of a timetable management server uniquely determining a timetable through simulation.
Fig. 8 is a flowchart showing a specific example of the flow of the timetable management server uniguely determining a timetable through simulation.
Fig. 9 is a continuation from Fig. 8.
Fig 10 is a diagram showing formats of data used in the timetable management server.
Fig. 11 is a diagram showing an inter-device sequence of the process for amending a timetable.
Fig. 12 is a diagram explaining specific examples of additional draft amendments proposed by the timetable management server to offset the effects involved.
Fig. 13 is a diagram explaining a specific example of the process of matching between draft amendments performed by the timetable management server.
Fig. 14 is a diagram showing a timetable input screen displayed on a timetable generation client.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
First Embodiment Fig. 1 shows a device configuration of a timetable generation system.
A timetable generation server 0101 and a timetable generation client A 0102 are interconnected via a network 0104. Where the railway business is divided into two layers, the infrastructure operator may correspond to the timetable generation server 0101 while the service operators may correspond to the timetable generation client A 0102 and a timetable generation client B 0103, for example. In the example of Fig. 1, the timetable generation client A 0102 corresponds to a service operator A and the timetable generation client B to a service operator B. Although one timetable generation server is shown connected with two timetable generation clients via the network in Fig. 1, there may be more timetable generation clients configured.
The overall hardware configuration of the timetable generation server 0101 is made up of a processing unit (CPU) 0111, a storage device (memory, hard disk) 0112, an input device (keyboard, mouse) 0113, a display device (display) 0114, and a communication device 0115. The storage device 0112 includes an application program that aggregates timetable data received from multiple clients so as to generate an optimum timetable, a software program that communicates with other devices such as the timetable generation client A 0102, the data to be used by application programs, and a software program that manages databases accommodating the data. These programs and data are processed by the processing unit 0111. The input device 0113 admits input regarding the processes carried out by the processing unit 0111. The display device 0114 displays the results of prooessing by the processing unit 0111 as well as the data stored in the storage device 0112.
The communication device 0115 communicates with the timetable generation client A 0102 via the network.
The overall hardware configuration of the timetable generation client A 0102 is made of a processing unit (CPU) 0121, a storage device (memory, hard disk) 0122, an input device (keyboard, mouse) 0123, a display device (display) 0124, and a communication device 0125. The storage device 0122 includes an application program that displays the data received from the timetable generation server 0101, a software program that communicates with other devices such as the timetable generation server 0101, the data to be used by application programs, and a software program that manages databases accommodating the data. These programs and data are processed by the processing unit 0121. The input device 0123 admits input regarding the processes performed by the processing unit 0121. The display device 0124 displays the results of processing by the processing unit 0121 as well as the data stored in the storage device 0122. The communication device 0125 communicates with the timetable generation server 0101 via the network. The hardware configuration of the timetable generation client B 0103 is the same as that of the timetable generation client A 0102.
Fig. 2 shows an overall sequence of timetable generation.
The principal processing entities involved are the timetable generation server 0101, the timetable generation client A 0102, and the timetable generaticn client B 0103.
On the basis of the user's input acguired from the input device, the timetable generation client A 0102 generates a timetable of which one portion has no value designated or has multiple values designated therein (step 0221) . The timetable generation client A 0102 transmits the generated timetable to the timetable generation server 0101 (step 0222) . The input screen used at this point will be explained later with reference to Fig. 14.
Likewise, on the basis of the user's input obtained from the input device, the timetable generation client B 0103 generates a timetable of which one portion has no value designated or has multiple values designated therein (step 0231) . The timetable generation client B 0103 transmits the generated timetable to the timetable generation server 0101 (step 0232) . The formats for timetable data transmission at this point will be explained later with reference to Fig. 6.
The timetable generation server 0101 aggregates the timetables received from the timetable generation clients A 0102 and B 0103 (step 0211), supplements any one undesignated timetable portion with multiple candidate values by referencing equipment information, and stores the aggregated timetable into a temporary timetable database (step 0212) . The format of timetable data in the temporary timetable database will be explained later with reference to Fig. 6.
With regard to each of all combinations of multiple candidate values designated and included in the timetable held in the temporary timetable database, the server simulates rescheduling as many times as needed when a line section becomes unusable, generates the combination having the smallest number of reschedulings as a proposed timetable, and stores the generated timetable into the timetable database (step 0213) . If there are multiple combinations each having the smallest number of reschedulings, the server selects the combination having the smallest number of reschedulings involving high-priority trains such as limited express trains. The format of timetable data in the timetable database at this point will be explained later with reference to Fig. 6. A detailed flow of processing in step 0213 will be explained later with reference to Fig. 7.
In step 0214, the server transmits the proposed timetable to the timetable generation clients A 0102 and B 0103. Upon receipt of the proposed timetable, the timetable generation clients A 0102 and B 0103 each display the proposed timetable on the display device (steps 0223 and 0233) . The service operators A and B give approval to the proposed timetable being displayed. When approved, the proposed timetable is registered in the timetable generation server 0101 as the scheduled timetable. If the proposed timetable is not approved at this point (suppose that the service operator A does not approve the proposed timetable) , step 0224 is reached.
The timetable generation client A 0102 generates a draft timetable amendment and transmits the generated proposal to the timetable generation server 0101 (step 0224) . Upon receipt of the draft amendment, the timetable generation server 0101 calculates through simulation the effects that the amendment may have on each service operator (step 0215) . The server proceeds to transmit the draft amendment and the results of the simulations to the timetable generation clients A 0102 and B 0103 (step 0216) Explained below with reference to Fig. 11 is a flow of steps performed when the effects on each service operator as calculated in step 0215 turn out to be significant.
The timetable generation clients A 0102 and B 0103 each display the received draft amendment and results of the simulations on the display device (steps 0225 and 0234) . The timetable generation clients A 0102 and B 0103 ii transmit their responses to the draft amendment to the timetable management server 0101 (steps 0226 and 0235) If the responses received by the timetable generation server 0101 are both approval," the draft amendment is reflected in the timetable database (step 0217) . The timetable in question is then distributed to the timetable generation clients A 0102 and B 0103 (step 0218) . Upon receipt of the timetable, the timetable generation clients A 0102 and B 0103 each display the received timetable on the display device (steps 0227 and 0236) When the above-described timetable amendment sequence 0241 is carried out repeatedly, the timetable ultimately used in traffic control is generated.
Fig. 3 shows a module configuration of the timetable generation server 0101.
A failure history database 0301 stores a history of failures on the line sections handled by the timetable generation system. The formats of the data stored in the database will be explained later with reference to Fig. 10.
A rescheduling count storage database 0302 stores the number of reschedulings required when a given line is interrupted with regard to any one of all combinations of the lines in the timetable. The formats of the data stored in the database will be explained later with reference to Fig. 10.
A timetable database 0303 stores the timetables used ultimately in traffic control. The formats of the data stored in the database will be explained later with reference to Fig. 6.
A temporary timetable database 0304 aggregates the timetables received from the timetable generation clients 0102 and 0103, and stores timetable data supplemented with multiple candidate values for any one undesignated timetable portion therein in reference to the eguipment information. The formats of the data stored in the database will be explained later with reference to Fig. 6.
A timetable display part 0305 displays on the display device the data stored in the timetable database 0303 and temporary timetable database 0304.
With regard to the timetable in the temporary timetable database 0304, a simulation execution part 0306 calculates the nllmber of reschedulings carried out when any one of the lines read from the failure history database 0301 as highly likely to fail has been interrupted, and stores the result of the calculation into the rescheduling count storage database 0302. Also, given the draft timetable amendment received from a service operator through a message management part 0307, the simulation execution part 0306 calculates the effects of the proposal on each service operator, a possible additional draft amendment that can offset the effects, and another draft amendment offsetting the effects; and returns the results of the calculation to the message management part 0307.
The message management part 0307 receives through a communication processing part 0309 the draft timetable amendment or the response thereto from the timetable generation client A 0102 or B 0103, and starts the simulation execution part 0306 accordingly.
A timetable management part 0308 distributes the timetables stored in the timetable database 0303 and temporary timetable database 0304 to the timetable generation clients A 0102 and B 0103 through the communication processing part 0309. Also, the timetable management part 0308 receives the timetables from the timetable generation clients A 0102 and B 0103 through the communication processing part 0309, supplements any undesignated timetable portion with multiple candidate values in reference to an eguipment information database 0310, and stores the supplemented timetables into the temporary timetable database 0304.
The communication processing part 0309 communicates with the timetable generation clients A 0102 and B 0103 via a communication medium 0103.
The equipment information database 0310 is a database that defines the lines that can be used when a given train travels from a platform of a given station to a platform of the next station. The data format of the equipment information database 0310 will be discussed later with reference to Fig. 10.
An equipment information input part receives input from the input device of the timetable generation server, and sets values to the equipment information database 0310.
Fig. 4 explains the data items included in the timetables generated and transmitted by the timetable generation clients as well as the data items found in the timetable database 0303 and temporary timetable database 0304.
Reference character A(TR) denotes a train on a line.
In the drawing, the train is shown stopped at platform 1 of station a. The train A(TR) is assumed to be bound for platform 1 of station b. At this point, the train A(TR) can go to platform 1 of station b using one of two routes 0412 and 0413. In such a case, the two routes running in parallel to each other are named line a (0414) and line /3 (0415) so that one of these two routes can be set for use.
The border (0416) of the line used by the train going from station a to station b is set in the timetable.
A timetable 0421 shows the timetable data items of a given train dealt with by the present invention. The timetable includes station names, platform numbers, arrival times, departure times, arrival lines, and departure lines.
The station names are the names of the stations that the train in question stops at or passes by; the platform numbers are the numbers of the platforms that the train stops at or passes by; the arrival times are the times at which the train arrives at the respective stations; the departure times are the times at which the train departs from the respective stations; the arrival lines are the lines on which the train arrives at the respective stations; and the departure lines are the lines on which the train departs from the respective stations. If a train A(TR) (0411) in the drawing is to use the route 0412, the value (Y is set to the departure line of station a and to the arrival line of station b; if the train is to use the route 0413, the value / is set to the departure line of station a and to the arrival line of station b.
Fig. 5 is a diagram explaining a conflict between train timetables generated and transmitted by the timetable generation olients, or between multiple train timetables included in the timetable database 0303 and temporary timetable database 0304.
A train A(RE) (0511) departs from platform 1 of station a and goes to platform 1 of station b using the line k -The timetable for the train A(TR) (0511) at this point is indicated by reference numeral 0521. A train B(TR) (0512) departs from platform 2 of station a and goes to platform 2 of station b using the line [3. The timetable for the train B(TR) (0512) at this point is indicated by preference numeral 0522. Since both trains A(TR) and B(TR) depart from station a at 10:05 using the line 5, the two trains cannot go simultaneously to station b; one train must wait for the other train to finish using a line section 0513 of the line [3 before going ahead. When two trains attempt to use the same line in the same time slot as described above, the situation is called a train
timetable conflict.
Fig. 6 is a diagram showing formats in which train timetables are retained.
The data formats of the timetable data generated by the timetable generation clients (0102 and 0103) and transmitted to the timetable generation server are indicated by reference numerals 0601 and 0602. A train timetable is composed of train information 0601 and station information 0602. The train information 0601 includes a train number and an owner company. The station information 0602 includes station names, platform numbers, arrival times, departure times, arrival lines, and departure lines.
With regard to each of the arrival and departure lines, there exist three cases: one in which only one value is set (0621) , another in which at least two values are set (0622) , and another in which no value is set (0623) The formats in which train timetables are held in the temporary timetable database 0304 are indicated by reference numerals 0603 and 0604. The train timetable is composed of train information 0603 and station information 0604. The items included in such information are the same as those in the information 0601 and 0602. With regard to each of the arrival and departure lines, there exist two cases: one in which only one value is set (0641), and another in which at least two values are set (0642) The formats in which train timetables are held in the timetable database 0303 are indicated by reference numerals 0605 and 0606. The train timetable is composed of train information 0605 and station information 0606. The items included in such information are the same as those in the information 0601 and 0602. with regard to each of the arrival and departure lines, only one value can be set (0661) Fig. 7 is a flowchart showing a flow of the timetable management server uniquely determining a timetable through simulation.
Loop processing is performed on each of all sections between the stations in the timetable (step 0701) For the section of interest, the lines presumed likely to fail are acquired from the failure history database 0301 (step 0702) -Loop processing is performed on each of all combinations of the lines that can be taken by trains over the section of interest (step 0703) It is then determined whether there are overlapping trains using the same line in the same time siot. If such trains are determined to exist, control is returned to step 0703 and loop processing is continued on the next combination (step 0704) . If the overlapping trains are determined not to exist, loop processing is performed on each of all lines acquired in step 0702 as the lines presumed likely to faii (step 0705) One of the trains using the iine presumed likely to fail is selected. In step 0707, it is determined whether the line used by the selected train can be changed to another line.
If the changing to another line is determined to be impossible, control is returned to 0703 and loop processing is continued on the next combination (step 0706) . If the changing is determined to be possible, the line used by the selected train is changed to another selectable line (step 0708) -With regard to the combination following the changing, it is determined whether there are overlapping trains using the same line in the same time siot. If no such trains are determined to exist, the number of necessary reschedulings is counted and the result is stored into the rescheduling count storage database 0302 (step 0709) If the overlapping trains are determined to exist, the train for which the line has yet to be changed is selected, and step 0707 is carried out (step 0711) If there is no combination made operable by rescheduling (step 0712), the set value for each train over the line section of interest is incremented, and control is returned to step 0703 (step 0713) . If there exists at least one combination made operable by rescheduling, the combination having the smallest number of reschedulings is extracted, and the timetable utilizing the line in question is stored into the timetable database 0303 (step 0714) . Here, if there exist multiple combinations each having the smallest number of reschedulings, one of the combinations may be selected by, say, calculating the trains to be rescheduled for each service operator and by finding the combination in which the number of trains to be rescheduled is made equal for the service operators involved.
Fig. 8 is a flowchart showing a specific example of the flow of the timetable management server 0101 uniquely determining a timetable through simulation.
Explained here as the example is a flow in which a timetable 0811 for the train A(TR) and a timetable 0812 for the train B(TR) are aggregated so as to determine the traveling route uniguely. Both trains A(TR) and B(TR) travel from station a to station b. The routes to be traveled in this case are set as a and [3 The times taken by the trains A(TR) and B(TR) occupying the line between station a and station b are shown, for ease of understanding, by a graphic representation whose vertical axis indicates the lines to be used and whose horizontal axis represents the times during which the lines between station a and station b are used by the trains A(TR) and B(TR) . In this graph, reference numeral 0821 stands for the time during which the line a is used, 0822 for the time during which the line 13 is used, and 0833 for the time during which a line y is used. Where there are multiple incoming and outgoing lines being set, the use time is stated for each of all lines.
To determine the traveling route uniguely, all combinations of the lines that can be taken by the trains A(TR) and B(TR) between station a and station b are first extracted. A line combination 1 (0831) involves the train A(TR) using the line a and the train B(TR) using the line [3. A line combination 2 (0832) involves the train A(TR) using the line a and the train B(TR) using the line y. A line combination 3 (0833) involves the train A(TR) using the line [3 and the train B(TR) using the line y. A line combination 4 (0834) involves the train A(TR) using the line ? and the train B(TR) also using the line [3. The line combination 4 (0834) is excluded from the solution candidates because it entails a timetable conflict between the trains A(TR) and B(TR) -The line combinations 1 (0831), 2 (0832) and 3 (0833) as the remaining solution candidates are further processed as will be explained with reference to Fig. 9.
Fig. 9 is a continuation from Fig. 8.
Given the line combinations 1 (0831), 2 (0832) and 3 (0833) as the ultimately remaining solution candidates at the end of Fig. 8, the number of reschedulings reguired if one of the lines becomes unusable is calculated for each of the combinations. Normally, the lines with high frequency of failure are extracted from the failure history database 0301, and the number of reschedulings required when each of the extracted lines becomes unusable is calculated. In this case, however, all lines are assumed likely to fail, so that the number of reschedulings required when each of all lines becomes unusable is calculated. The drawing shows an example in which the line a becomes unusable so that the line combinations need to be rescheduled. With regard to the line combination 1 (0831), if the line a becomes unusable, the line a used by the train A(TR) first needs to be changed to the line /3 through rescheduling (0911) . When the train A(TR) is to use the line /3, there occurs a conflict with the train B(TR) that was set to use the line [3 in the first place. Thus the line for the train B(TR) is changed to the line y through rescheduling (0912).
With regard to the line combination 2 (0832), the line for the train A(TR) that has used the line a needs to be changed to the line /3 through rescheduling (0913) . With regard to the line combination 3 (0833), there is no train using the line a so that no rescheduling is reguired. A table 0914 shows the results of these simulations carried out on all cases in which each of all lines has become unusable. According to the table 0914, the number of required reschedulings is the smallest for the line combination 2 (0832), so that this combination is adopted.
Fig 10 is a diagram showing formats of data used in the timetable management server 0101.
A table 1001 shows the format of data stored in the rescheduling count storage database 0302. The data items of this table include line combinations; required rescheduling counts each representing the number of reschedulings required when one of the lines presumed likely to fail has become unusable; total values each representing the sum of the requested rescheduling counts totaled for each service operator to which the rescheduled trains belong; and sum totals each representing the sum of the numbers of rescheduled trains.
A table 1002 shows the format of data stored in the eguipment information database 0310. The data items of this table include departure stations, departure platform numbers at departure stations, arrival stations, arrival platform numbers at arrival stations, and multiple lines usable from each of the departure stations to each of the arrival stations.
A table 1003 shows the format of data stored in the failure history database 0301. The data items of this table include departure stations, arrival stations, lines used from departure stations to arrival stations, and failure counts each representing the number of failures on each line.
Fig. 11 is a diagram showing an inter-device sequence of the process for amending a timetable.
The timetable generation client A 0102 generates a draft timetable amendment and sends it to the timetable generation server 0101 (step 1121) . Upon receipt of the draft timetable amendment, the timetable generation server 0101 calculates the effects of the amendment on the service operators involved through simulation. Tn step 1112, the timetable generation server 0101 proposes an additional draft amendment that will offset the effects, and sends it to the timetable generation client A 0102 (step 1111) -Upon receipt of the additional draft amendment, the timetable generation client A 0102 transmits the response to the amendment to the timetable generation server 0101 (step 1122) Upon receipt of the response constituting a rejection, the timetable generation server 0101 transmits the draft amendment received from the timetable generation client A 0102 and the results of the simulations to the timetable generation clients A 0102 and B 0103; if the received response is an approval, the timetable generation server 0101 transmits the draft amendment including the additional draft amendment and the results of the simulations tc the timetable generation clients A 0102 and B 0103 (step 1113) The timetable generation clients A 0102 and B 0103 each display on the display device the draft amendment and the simulation results received from the timetable generation server 0101 (steps 1123 and 1131) The timetable generation client B 0103 generates a draft timetable amendment and sends it to the timetable generation server 0101 (step 1132) -Upon receipt of the draft timetable amendment, the timetable generation server 0101 calculates the effects of the amendment on the service operators involved (step 1114) The timetable generation server 0101 proceeds to perform a matching process between the draft amendment received from the timetable generation client B 0103 and the draft timetable amendment previously received from the timetable generation client A 0102 so as to extract therefrom a combination that can offset the differences between the draft amendments (step 1115) . The timetable generation server 0101 transmits the result of the matching process to the timetable generation clients A 0102 and B 0103 (step 1116) Upon receipt of the result of the matching, the timetable generation clients A 0102 and B 0103 each input a response to the result and transmit the response to the timetable generation server 0101 (steps 1124 and 1133) -If the matching is approved, the timetable generation server 0101 gets the draft timetable amendment reflected in the timetable database (step 1117) and transmits the updated timetable to the timetable generation clients A 0102 and B 0103 (step 1118) . The timetable generation clients A 0102 and B 0103 receive the transmitted timetable and have it displayed on the display screen (steps 1125 and 1134) Fig. 12 is a diagram explaining specific examples of additional draft amendments proposed by the timetable generation server 0101 to offset the effects involved.
After receiving a draft amendment from a timetable generation client, the timetable generation server 0101 calculates the difference between the number of reschedulings performed on the original timetable and the number of reschedulings required for the amended timetable.
The results of the calculation are given in a table 1201.
The table 1201 shows that with the draft amendment, the number of reschedulinqs required of the trains belonging to the service operator A is reduced by two and that the number of resohedulings required of the trains belonging to the service operator B is increased by one. If the results of the calculation indicate an increased number of reschedulings required of the trains belonging to any service operator other than the service operator that proposed the draft amendment, the timetable generation server 0101 acquires an additional draft amendment that would reduce the rescheduling count by referencing the rescheduling count storage database 0302. An example of the additional draft amendment is given in a table 1202.
The table 1202 shows that with the additional draft amendment, the number of reschedulings required of the trains belonging to the service operator A is increased by one and that the number of reschedulings required of the trains belonging to the servioe operator B is reduced by one. When the timetable amendment 1201 received from the timetable generation client is combined with the additional draft amendment 1202, the effects of the amendment on the service operator B can be offset.
Fig. 13 is a diagram explaining a specific example of the process of matching between draft amendments performed by the timetable generation server 0101.
Given draft amendments from multiple service operators, the timetable generation server 0101 calculates, regarding each amendment, the difference between the number of reschedulings reguired of the original timetable and the number of reschednlings reguired of the amended timetable, and extracts a combination of draft amendments that can offset the difference between the service operators. Fig. 13 shows the example in which the process of matching is carried out between the draft amendments generated by the service operators A and B. According to the draft amendment 1301 proposed by the service operator A, the number of reschednlings reguired of the trains belonging to the service operator A is rednced by two while the number of reschedulings reguired of the trains belonging to the service operator B is increased by two. According to the draft amendment 1302 proposed by the service operator B, the number of rescheduiings reguired of the trains belonging to the service operator B is reduced by two while the number of reschedulings required of the trains belonging to the service operator A is increased by two.
When the draft amendment 1301 is combined with the draft amendment 1302, it is possible to offset the number of reschedulings required of the trains belonging to the service operator A with the number of reschedulings required of the trains belonging to the service operator B. Fig. 14 is a diagram showing a timetable input screen displayed on the timetable generation clients A 0102 and B 0103.
When generating a timetable, the timetable generation client displays an input screen 1301. Train information is input to the input screen 1301 one train at a time. The train number of an input target train is input to an input form 1311. The name of the operator to which the input target train belongs is input to an input form 1312. The names of the stations at which the input target train stops are input to an input form 1313. The numbers of the platforms at the stations at which the input target train stops are input to an input form 1314. The arrival times at the stations at which the input target train stops are input to an input form 1315. The departure times at the stations at which the input target train stops are input to an input form 1316. check boxes 1317 are each set to determine whether or not to use specific lines between two adjacent stations at which the input target train stops. Input to an input form 1318 are multiple lines to be used between the stations at which the input target train stops when the corresponding check box 1317 is set.
Pressing a button 1319 causes the input train timetable to be registered. After all train timetables have been input, a button 1320 is pressed to transmit the timetables to the timetable generation server.
Claims (12)
- What is claimed is: 1. A timetable generation system comprising at least one client device that generates a desired timetable preferred by a service operator, and a timetable generation device that generates a proposed timetable by taking a plurality of the desired timetables into consideration, wherein the timetable generation device includes: a reception part that receives the desired timetables transmitted from a plurality of the client devices; a timetable supplement part that supplements any undesignated portion in the desired timetables with a plurality of candidate values; a failure history storage part that stores information about past line failures; a simulation execution part which, after the desired timetables thus supplemented have been aggregated, calculates on the basis of the line failure information the number of reschedulings required if any line has become unusable, thereby determines the proposed timetable that minimizes the rescheduling count; and a transmission part that transmits the proposed timetable to the client devices, wherein the client devices each include: a display part that displays the proposed timetable to acquire approval or rejection thereof; and a transmission part that transmits approval information indicative of whether or not to approve the proposed timetable to the timetable generation device.
- 2. The timetable generation system according to claim 1, wherein the client devices each include a transmission part which, if the proposed timetable is not approved, further transmits an amended timetable in response to the proposed timetable; and wherein the simulation execution part of the timetable generation device calculates the effects of the amended timetable received on each of the operators that generate timetables and, if the amended timetable is approved by all operators, causes a draft amendment associated therewith tc be reflected in the timetable.
- 3. The timetable generation system according to claim 2, wherein, if the effects of the draft amendment are greater than a predetermined value, the simulation execution part of the timetable generation device further generates a second draft amendment that will make the effects less than the predetermined value and transmits the draft amendment and the second draft amendment to the client devices.
- 4. The timetable generation system according to claim 2, wherein, if the effects of the draft amendment are greater than a predetermined value, the simulation execntion part of the timetable generation device compares the draft amendments received from the client devices, extracts therefrom a combination of the draft amendments that will make the effects less than the predetermined value, and transmits the combination to the client devices.
- 5. A timetable generation device comprising: a reception part that receives desired timetables transmitted from a plnrality of client devices; a timetable supplement part that supplements any undesignated portion in the desired timetables with a plnrality of candidate values; a failure history storage part that stores information about past line failures; a simulation execution part which, after the desired timetables thus supplemented have been aggregated, calculates on the basis of the line failure information the number of reschedulings reguired if any line has become unusable, thereby determines the proposed timetable that minimizes the rescheduling count; and a transmission part that transmits the proposed timetable to the client devices, wherein the client devices each include: a display part that displays the proposed timetable to acquire approval or rejection thereof; and a transmission part that transmits approvai information indicative of whether or not to approve the proposed timetable to the timetable generation device.
- 6. The timetable generation device according to claim 5, wherein the simulation execution part calculates the effects of an amended timetable received further from any of the client devices on each of a plurality of operators and, if the amended timetable is approved by all operators, causes a draft amendment associated therewith to be reflected in the timetable.
- 7. The timetable generation device according to claim 6, wherein, if the effects of the draft amendment are greater than a predetermined value, the simulation execution part further generates a second draft amendment that will make the effects less than the predetermined value and transmits the draft amendment and the second draft amendment to the client devices.
- 8. The timetable generation device according to claim 7, wherein, if the effects of the draft amendment are greater than the predetermined value, the simulation execution part compares the draft amendments received from the client devices, extracts therefrom a combination of the draft amendments that will make the effects less than the predetermined value, and transmits the combination to the client devices.
- 9. A timetable generation method for use with at least one client device that generates a desired timetable preferred by a service operator, and a timetable generation device that generates a proposed timetable by taking a plurality of the desired timetables into consideration, wherein the timetable generation device is caused to perform: storing information about past line failures beforehand; receiving the desired timetables transmitted from a plurality of the client devices; supplementing any undesignated portion in the desired timetables with a plurality of candidate values; after the desired timetables thus supplemented have been aggregated, calculating on the basis of the line failure information the number of reschedulings required if any line has become unusable, thereby determining the proposed timetable that minimizes the rescheduling count; and transmitting the proposed timetable to the client devices, and wherein the client devices are each caused to perform: displaying the proposed timetable to acquire approval or rejection thereof; and transmitting approval information indicative of whether or not to approve the proposed timetable to the timetable generation device.
- 10. The timetable generation method according to claim 9, wherein the client devices each include a transmission part which, if the proposed timetable is not approved, is further caused to transmit an amended timetable in response to the proposed timetable, and wherein the timetable generation device is caused to calculate the effects of the amended timetable received on each of the operators that generate timetables and, if the amended timetable is approved by all operators, the timetable generation device is caused to have a draft amendment associated therewith reflected in the timetable.
- 11. The timetable generation method according to claim 10, wherein, if the effects of the draft amendment are greater than a predetermined value, the timetable generation device is further caused to generate a second draft amendment that will make the effects less than the predetermined value and to transmit the draft amendment and the second draft amendment to the client devices.
- 12. The timetable generation method according to claim 11, wherein, if the effects of the draft amendment are greater than the predetermined value, the timetable generation device is caused to compare the draft amendments received from the client devices, extract therefrom a combination of the draft amendments that will make the effects less than the predetermined value, and transmit the combination to the client devices.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2014049596A JP6298665B2 (en) | 2014-03-13 | 2014-03-13 | Train diagram creation system, train diagram creation device, and train diagram creation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| GB201501759D0 GB201501759D0 (en) | 2015-03-18 |
| GB2524157A true GB2524157A (en) | 2015-09-16 |
Family
ID=52705670
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| GB1501759.3A Withdrawn GB2524157A (en) | 2014-03-13 | 2015-02-03 | Train timetable generation system, train timetable generation device, and train timetable generation method |
Country Status (2)
| Country | Link |
|---|---|
| JP (1) | JP6298665B2 (en) |
| GB (1) | GB2524157A (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112541265B (en) * | 2020-12-08 | 2024-01-19 | 北京交通大学 | High-speed rail running chart modeling method combining period and non-period of stop adjustment |
| JP7146203B1 (en) * | 2022-03-23 | 2022-10-04 | 東日本旅客鉄道株式会社 | Traffic vehicle operation status analysis device, information terminal, computer program |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006027555A (en) * | 2004-07-21 | 2006-02-02 | Hitachi Ltd | Traffic schedule formation control system |
| JP4719534B2 (en) * | 2005-08-31 | 2011-07-06 | 株式会社日立製作所 | Operation schedule cooperation plan creation system and method |
| JP5911694B2 (en) * | 2011-10-19 | 2016-04-27 | 株式会社東芝 | Train diagram editing system and train diagram editing method |
-
2014
- 2014-03-13 JP JP2014049596A patent/JP6298665B2/en active Active
-
2015
- 2015-02-03 GB GB1501759.3A patent/GB2524157A/en not_active Withdrawn
Non-Patent Citations (1)
| Title |
|---|
| None * |
Also Published As
| Publication number | Publication date |
|---|---|
| GB201501759D0 (en) | 2015-03-18 |
| JP2015174461A (en) | 2015-10-05 |
| JP6298665B2 (en) | 2018-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10984349B2 (en) | Travel advisory notifications | |
| Nisar et al. | Trains and Twitter: Firm generated content, consumer relationship management and message framing | |
| Stelzer et al. | Improving service quality in public transportation systems using automated customer feedback | |
| Liu et al. | Integrated public transport timetable synchronization with vehicle scheduling | |
| CN106611223B (en) | Online ordering system and method for hotel business | |
| van de Velde | Learning from the Japanese railways: Experience in the Netherlands | |
| CN112257883A (en) | Joint ticket business determination method and device and electronic equipment | |
| CN105303245B (en) | Traffic analysis system and traffic analysis method | |
| US20220020281A1 (en) | Improved system, device and method for sequencing modes of transportation or items and the like | |
| GB2524157A (en) | Train timetable generation system, train timetable generation device, and train timetable generation method | |
| Galadíková et al. | Simulation-based methods to support the real-time management of railways nodes | |
| JP6639792B2 (en) | Information processing apparatus, information processing system, route map information generation program, data structure, and route map information generation method | |
| Stelzer et al. | Using customer feedback in public transportation systems | |
| CN103607401A (en) | Internet of things system based on central control tower | |
| JP2017154536A (en) | Crew operation management system and crew operation management method | |
| US20180365599A1 (en) | Updating an entire itinerary based on modifying a single travel reservation | |
| JP7426688B2 (en) | Information processing system, information processing program, information processing device, and information processing method | |
| Shebalov | Practical overview of demand-driven dispatch | |
| US20190197591A1 (en) | System and Methods for Providing and Calculating Relocation Estimates | |
| WO2023175852A1 (en) | Transportation service cooperation assistance device, transportation service cooperation assistance method, and transportation service cooperation assistance system | |
| JP7146203B1 (en) | Traffic vehicle operation status analysis device, information terminal, computer program | |
| Eklund | The Reservisor automated airline reservation system: combining communications and computing | |
| Kumsila et al. | Jerney: A peer-to-peer shared public transit on fixed routes | |
| KR20140124267A (en) | System for scheduling protocol service and the method thereof | |
| Rudolph et al. | Collaborative airport passenger management with a virtual control room |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| WAP | Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1) |