JP2004001717A - Train schedule retrieval device and method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a train schedule retrieval device for automatically retrieving and displaying the recommended time for departure from a departure place along with utilizing train line information by specifying the desired time for arrival at a destination. <P>SOLUTION: Required train line schedule information is stored in a train line schedule information data base 12 beforehand. Then, at the time of retrieving a train line and the schedule, by inputting a departure station and a destination station, line/transfer station retrieval means 13 and 14 retrieve the information of the data base 12 and extract a passing line and a change station. By inputting the desired arrival date and time of the destination station, a train time retrieval means 16 performs tracing back from the destination station through the transfer station to the departure station and extracts the optimum boarding date and time of the departure station and a utilizing train kind and further, a fare and charge computing means 15 automatically calculates a fare and a charge. <P>COPYRIGHT: (C)2004,JPO

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a train time search device and a train time search method.
[0002]
[Prior art]
Conventionally, a train time search device accesses a timetable database in which train route map information, fare charge information, transfer station information, etc. are registered by inputting a departure place and a destination, and from a departure place to a destination. An automatic train search system that extracts and displays a used route, a transfer station, a required time, a fare, and a fare is widely known as a commercially available software application.
[0003]
However, in such a conventional train time search device, the time required from the departure point to the destination and the fare, fare, boarding line name, transfer station name, etc. can be easily known, but when to arrive at the destination It is not possible to get detailed information on what train to take at what time, and the fare and price at that time, and in order to obtain it, you must first refer to a commercially available timetable However, improvement in convenience has been desired.
[0004]
SUMMARY OF THE INVENTION The present invention has been made in view of such conventional problems. By inputting a departure point, a destination, and a desired arrival date and time, the departure point and the departure point are set to arrive at the destination at the time closest to the desired arrival date and time. It is an object of the present invention to provide a train time search device and a train time search method capable of notifying a train to be boarded and its departure date and time, a transfer station and a transfer train, and further notifying the fare and the fare.
[0005]
[Means for Solving the Problems]
A train time search device according to a first feature of the present invention includes a train line time information storage unit that stores train line time information including at least one of a station name, a transfer station, and a train departure / arrival time; Transfer station search means for searching train line time information to extract transfer stations by inputting the destination station, and train line time information and transfer station search by inputting the desired arrival date and time of the destination station And a train time search means for extracting an optimal boarding date and time of the departure station from the destination station to the departure station based on the search result by the means.
[0006]
A train time search device according to a second aspect of the present invention is a train time search device that includes at least one of a station name, a transfer station, and a train departure / arrival time stored in advance based on inputs of a departure station and a destination station. A transfer station search step of searching for information and extracting a transfer station, and based on the input of the desired arrival date and time of the destination station, based on the train route time information and the search result of the transfer station search step, the transfer station is searched from the destination station. And a train time search step of extracting an optimal boarding date and time of the departure station by going back to the departure station.
[0007]
BEST MODE FOR CARRYING OUT THE INVENTION
Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. FIG. 1 shows a functional configuration of an embodiment of the present invention. Here, a pen computer 1 is used as a hardware system. The train time search device according to the present embodiment is a software application, and can be registered in another type of computer. Conversely, the pen computer 1 can be configured as a specialized one for train time search.
[0008]
A hard disk storage device, a magneto-optical storage device, a PD storage device, and other large-capacity auxiliary storage devices 2 are mounted inside the pen computer 1, and a display processing unit 4 for displaying various information on a display 3; An input processing unit 6 for inputting information corresponding to an input operation performed using the electronic pen 5 on the display screen of the user, and registration and update management of train route / time master data registered in the auxiliary storage device 2 The system includes a CPU 7 for performing database management and train time search processing, and other hardware elements (not shown) such as a ROM and a RAM included in a normal computer.
[0009]
The configuration of various arithmetic processing functions executed by the CPU 7 will be described. The database management unit 11 performs registration and update management of train route / time master data registered in the auxiliary storage device 2, and input processing by an input operation with the electronic pen 5. A route search unit 13 that accesses the train route time master data storage unit 12 in the auxiliary storage device 2 to perform a route search for the input information of the departure station, destination station, and desired arrival date and time input via the unit 6; Transfer station search section 14 for searching for transfer stations, fare calculation section 15 for calculating fares and fares based on boarding distance and boarding train type, departure to get on the train arriving at the destination station at the date and time closest to the desired arrival date and time The train time search unit 16 searches for the train to be boarded at the station and the departure date and time, and the search processing control unit 17 controls the train route and time search processing. There.
[0010]
Next, the operation of the train time search device having the above configuration will be described. First, database management of the train route time master data storage unit 12 will be described. A route map described in a commercially available timetable, each station position on the route map, a timetable of each station, distance information of each station, fare data, train Price data for each type, route map as image data, each station position on the route as vector data corresponding to the image data, each station timetable, distance information as code data, and fare and train type fee Are also registered in the master data storage unit 12 as code data.
[0011]
Since this timetable is periodically revised, if there is any revision, the same type of timetable is purchased, and the necessary pages are read by the image scanner (step S1 in the flowchart of FIG. 2). In the reading process, the database management unit 11 reads the map information as it is as image data by designating that the map information is map information, and designates that it is each station timetable if it is each station timetable. Thus, the image data is converted into code data by character recognition, read, and temporarily stored in the auxiliary storage device 2.
[0012]
Next, the database management unit 11 compares the read image data and code data after the revision with the image data and code data of the corresponding page already registered in the master data storage unit 12 to extract the revised portion (step S1). S2, S3). Then, when the revised portion is extracted, if there is a change in the map information, the image data is updated, and if there is a revision in each station timetable, the code data is updated (step S4).
[0013]
In some cases, fares and charges may be revised. In such a case, open the relevant page of the timetable, read it with an image scanner, perform character recognition processing, and execute a code for the new fare system and fare system. The data is extracted, and the code data of the fare and fee system registered in the master data storage unit 12 is updated.
[0014]
It should be noted that reading the timetable and updating the master data of the timetable may require an enormous amount of work, so if update data can be obtained from JR or other companies through online services such as the Internet. It can be used, and it can be used once it is provided in the form of a CD-ROM.
[0015]
Next, the train route and time search processing will be described with reference to the flowcharts of FIGS. 3 to 6 and screen display examples of FIGS. 7 to 13. In the search processing, an initial screen 21 as shown in FIG. 7 is displayed on the display 3 through the display processing unit 4 by the search processing control unit 17, and input processing of search data is performed (step S11).
[0016]
First, to specify the departure date: Is designated by the electronic pen 5, the search processing overall processing unit 17 receives the information of the designated item from the input processing unit 6, and causes the numeric keypad 22 to be displayed on the screen 21 as shown in FIG. Enter the date sequentially. Then, if the input is correctly performed, the input of the departure date is completed by designating “OK” with the electronic pen 5.
[0017]
After the entry of the departure date is completed, or when it is not necessary to specify the departure date, 2. Is designated by the electronic pen 5 to perform the operation of designating the departure place. With this operation, the search processing general processing unit 17 reads out the image data of the map information from the master data storage unit 12, and displays the map screen 23 on the display 3 as shown in FIG. Then, on the map screen 23, the position of the departure station corresponding to the departure place is designated by the electronic pen 5. This causes the designated station name to be displayed. For example, if "Tokyo" is designated, the name of the route to which it belongs, such as "Tokaido Line", is displayed along with the character information "Tokyo Station". If the departure station name is correctly input, the departure station is registered by designating the "OK" button 24. In the designation of the departure station, since the vector data of each station is registered in the master data storage unit 12 together with the image data of the map information, the station name corresponding to the location specified on the map screen 23 by the electronic pen 5 is extracted. Will be displayed.
[0018]
Here, if it is necessary to display the area protruding on the display screen 23, and in the display example of FIG. 9, from western Japan to the Kyushu area, and also to the Tohoku and Hokkaido areas, the user specifies the scroll arrow buttons 25 and 26 with the electronic pen 5. Thus, the map screen 23 can be scrolled left or right to display a map of a target area. In the case where the departure station is a local station and the map reduction ratio is large and its position is not displayed, the "Enlarge" button 27 is used to press the corresponding area, for example, a suburban Tokyo map, a suburban Nagoya map, a suburban Osaka map, etc. Is displayed, a more detailed map is displayed, and a desired departure station can be designated. In addition, a display indicating which area is registered with the enlarged map information may be displayed on the map screen 23 in advance. Further, a station name list may be displayed together with the map information so that designation can be made from the station name list.
[0019]
When the departure station designation operation is completed, a destination designation map screen 28 shown in FIG. 10 is automatically displayed. Therefore, by specifying the position of the station to which the destination belongs on the map screen 28, the destination station is extracted by the same processing as the extraction of the departure station, and the station name and the line name are displayed as character information. In the example of FIG. 10, “Karuizawa Station” is designated, and “Shin-Etsu Karuizawa Station” is displayed. If the designation is correct, the "OK" button 24 is designated to register "Shinetsu Line Karuizawa Station" as the destination station.
[0020]
When the registration of the departure place and the destination is completed in this way, the display 3 displays the items 1. ~ 3. Is displayed on the display screen 29 indicating that is determined. Enter the desired arrival date and time of the item. In the input operation of the desired arrival date and time, If you have already registered the item, it is necessary to automatically register in advance the same date as the departure date in advance assuming that it arrives on the same month in advance and enter only the desired arrival time State. However, a long-distance trip may take two or more days, so if you want to automatically determine the departure date by specifying the desired arrival date and time, 1. This item 3. Use the method of specifying only the desired arrival date and time in the item specification operation. Even if a departure date is specified, this 4. If the designation operation is performed using the numeric keypad 22 while designating the desired arrival date and time of the item and the numeric keypad 22 is used, the departure date will be corrected and displayed if necessary from the result of a search process described later. .
[0021]
The operation of designating the desired arrival date and time is executed by designating the numeric keypad 22 with the electronic pen 5. If the input is correct, the input is determined by designating "OK". As a result, a list screen 30 of the determined search data is displayed as shown in FIG. If "OK" is specified after confirming the input data, the train route and time search processing will be executed. Before that, as an option for searching and extracting the train time, "Fares and charges are minimized" Candidate selection conditions, such as selection of a candidate, selection of the candidate with the shortest required time, or extraction of both candidates, are set in advance as options of this system (steps S12 and S13). For example, on routes where both the Shinkansen and conventional lines can be selected, whether to use the Shinkansen, whether to use the limited express even for short-distance travel, and select those with a small number of transfers Extraction conditions such as whether to extract candidates are set in advance.
[0022]
The corresponding train time search process is performed according to the procedure shown in the flowcharts of FIGS. Using the example of the screen 30 in FIG. 12, the corresponding train time search processing procedure will be described below. In this case, the departure station is "Tokaido Line Tokyo Station", the destination station is "Shinetsu Line Karuizawa Station", and the search condition is "I want to arrive at Karuizawa Station at 15:30 on December 15, 1995". It is.
[0023]
Looking at the timetable, this search condition shows that (1) "Tokyo Station"-"Ueno Station": use Yamanote Line or Keihin Tohoku Line, "Ueno Station"-"Karuizawa Station": use Takasaki Line, Shinetsu Line root. (2) "Tokyo Station"-"Takasaki Station": Joetsu Shinkansen use route, "Takasaki Station"-"Karuizawa Station": Shinetsu Line use route. There are two available routes.
[0024]
In this case, first, if the Shinkansen is used, "Takasaki Station" will be extracted as the transfer station closest to the destination "Karuizawa Station on the Shin-etsu Line" and "Tokyo Station on the Tokaido Line", and use the conventional line If so, "Ueno Station" is extracted (step S21).
[0025]
Next, the train arriving at the destination "Karuizawa Station" at the time closest to the desired arrival date and time is searched for and extracted. In this example, a common train is used between “Takasaki Station” and “Karuizawa Station” regardless of which of the above two routes is selected for “Karuizawa Station”. Therefore, first, the train 359M arriving at 15:11 is extracted (step S22). The departure time of the transfer station “Takasaki Station” of the ordinary train 359M is 14:06 (step S23).
[0026]
Next, a search is made as to whether any of the trains from the transfer station "Takasaki Station" to "Karuizawa Station" that have a later departure time than the 359M train and arrive at "Karuizawa Station" earlier (step S24). If there is a corresponding train, the train is replaced with a first candidate train. Here, the limited express "Asama No. 17" is found as such a train. The limited express "Asama 17" departs at the transfer station "Takasaki Station" at 14:11, which is later than the regular train 359M, but arrives at "Karuizawa Station" at 14:52. As the first candidate (step S25).
[0027]
And for this limited express "Asama 17", the departure time at the transfer station "Takasaki Station" is 14:11, and there is nothing that departs later and arrives at "Karuizawa Station" before the desired arrival time. Therefore, the limited express “Asama No. 17” is extracted as the first candidate (steps S23 and S24).
[0028]
Next, in step S26, it is determined whether there are a plurality of types of routes that can be changed in the direction going back to the departure station "Tokyo Station" at the transfer station "Takasaki Station" (step S26). Is selected (step S27). In the case of "Takasaki Station", it is possible to transfer to either the conventional line Takasaki Line or Joetsu Shinkansen, so that two routes can be selected.
[0029]
Therefore, in step S27, the conventional Takasaki line is first selected as one of them, and the departure time 14 at the transfer station "Takasaki Station" for the "Asama 17" extracted as the first candidate is selected. : Search for a train that arrives immediately before 11 (step S28).
[0030]
As for the conventional line, the same limited express "Asama 17" leads to the transfer station "Ueno Station" earlier than that, so we extracted the arrival time 14:11 for this "Asama 17" A transfer station "Ueno Station" closer to a certain "Tokyo Station" is found (step S29), and the process returns to step S26 to determine whether or not the "Ueno Station" has a plurality of transfer routes.
[0031]
At Ueno Station, there are Shinkansen and Yamanote Line or Keihin Tohoku Line E-dens that can be used as a return line to "Tokyo Station", but here we set in advance the conditions that the Shinkansen is not used for short distances, The E-den is automatically selected (step S27), and at the same time, the departure time 12:36 of "Ueno Station" of the limited express "Asama 17" is extracted (step S28).
[0032]
Since there is no station that can be changed before "Ueno Station", a search is made for the Shinkansen, which is another connecting line at "Takasaki Station" which is left when entering step 26 for the first time (step S29, S30, S27).
[0033]
In this case, since the Joetsu Shinkansen connects between "Tokyo Station" and "Takasaki Station" without transfer, the arrival time of the Shinkansen "Takasaki Station" is retrieved and extracted in step S28. Since the time of departure from "Takasaki Station" of the limited express "Asama 17" was 14:11, when searching for a Shinkansen train with an arrival time that can be transferred to it, 13: departure from "Tokyo Station" In 08, the Shinkansen limited express "Asahi 317" arrives at Takasaki Station at 14:00. In the case of this Shinkansen, since it is the departure station "Tokyo Station" going back from "Takasaki Station", there is no other transfer station closer to the departure point in step S29, and the process branches to "NO". Since there is no other connecting line at the "station", the process branches to "YES" and proceeds to step S31.
[0034]
In step S31, when the conventional Takasaki line is used, since the train is connected to the E-den at "Ueno station", a train that arrives at "Departure station" at "Ueno station" at 12:36 The timetable data of the E-density is searched to extract 12:11 (taking the transfer time for Ueno Station into account of 10 minutes) as the departure from "Tokyo Station" (step S31). Then, for this first candidate, if the use line name, ride train, transfer station and time data are extracted, finally the use train type (in this case, limited express use between "Ueno Station" and "Karuizawa Station"), boarding A distance of 145.9 km and an express service distance of 100 to 150 km are determined from the route distance data to obtain a fare of 2470 yen and an express charge of 2250 yen. As the required time, 2 hours 41 minutes from “Tokyo Station” departure at 12:11 and “Karuizawa Station” arrival at 14:52 is calculated (step S32). Then, the first candidate is temporarily stored (step S33).
[0035]
In step S31, the departure time 13:08 of the departure station "Tokyo Station" is extracted from the search result when the Shinkansen is selected in the connection determination of the transfer station "Takasaki Station". Further, in step S32, "Tokyo Station" -Using the Shinkansen between "Takasaki Station", the Shinkansen fare is 2,680 yen, the limited express fare between "Takasaki Station" and "Karuizawa Station", the limited express fare is 1220 yen, and the fare is 2470 yen between "Tokyo Station" and "Karuizawa Station" Ask for a circle. Also, as the required time, 13 hours 08: departure from Tokyo Station and arrival 14:52 to Karuizawa Station, 1 hour and 44 minutes are calculated. Then, this is stored as a second candidate (step S33).
[0036]
Next, for the first and second candidates extracted in this way, the corresponding train route and time are selected under predetermined selection conditions. For example, if a route with a lower fare is selected, the first candidate using a conventional line will be selected, and the route with the slowest departure time at the departure station and therefore the route with the shortest travel time will be selected. If so, the second candidate using the Shinkansen is selected (step S34).
[0037]
The information on the train line, time, fare, and fare thus searched, extracted, and selected is displayed on the display 3 as shown in FIG. 13 (step S14 in the flowchart of FIG. 3). FIG. 13 shows the result of extraction under the condition that priority is given to a route with a low fee. In addition, since a plurality of candidates have been extracted, a “next candidate” button is displayed, and by specifying this button, a second candidate using the Shinkansen is displayed in the above case.
[0038]
In this manner, according to the above-described embodiment, it is possible to automatically search and present route selection, time information, fares, charges, etc. by setting operations of the departure station, destination station, desired arrival date and time. it can.
[0039]
In addition, if the condition that the required time is the shortest is set as the search extraction condition for the train route and time, a route using the second candidate Shinkansen is selected and displayed in the above search. Also, it is possible to set conditions for displaying a plurality of routes at the same time.
[0040]
Furthermore, as information to be registered in the master data storage unit 12, if information such as subway trains and private railways in the metropolitan area is added as well as JR timetable data, it is possible to know the transportation method to be used for short-distance travel, which is convenient. It will be even better.
[0041]
In the train time search device according to the embodiment of the present invention, the train route time information storage means stores train route time information such as train route, station name, transfer station, train departure / arrival time, train type, fare, and fare in advance. deep. When searching for the train route and time, by inputting the departure station and the destination station, the route / transfer station search means searches the storage information of the train route time information storage means to extract the transit route and the transfer station. In addition, by inputting the desired arrival date and time of the destination station, the train time search means passes from the destination station to the transfer station based on the information stored in the train route time information storage means and the search result by the route / transfer station search means. To the departure station to extract the optimal boarding date and time and the type of train to be used at the departure station. Further, the fare charge calculation means stores the information stored in the train route time information storage means, the route / transfer station search means, and the train time search means. The fare and charge are calculated based on each search result.
[0042]
By entering the departure station, destination station, and desired arrival date and time, a train that can automatically arrive at the destination station at a time close to the desired arrival date and time is determined, the departure date and time of the departure station, the transfer station, and the transfer It can calculate the trains to be transferred at the station, and calculate and output the fare from the departure station to the destination station, as well as the charges for the Shinkansen, limited express and express trains.
[0043]
Further, the train time search means selects a train with the latest train time from the candidates that can arrive before the desired arrival date and time as the optimal boarding date and time at the departure station.
[0044]
By inputting the departure station, the destination station and the desired arrival date and time, the train time search means selects the optimal departure station from the candidates that can arrive before the desired arrival date and time, from the candidates that can arrive before the desired arrival date and time. Therefore, it is possible to select the train with the shortest required time, thereby further improving the convenience of the train time search.
[0045]
Furthermore, by inputting the departure station, the destination station, and the desired arrival date and time, the most suitable departure station departure date and time can be selected from the candidates that can arrive before the desired arrival date and time with the latest departure train time. As a result, the convenience of train time search when making an efficient travel plan is further improved.
[0046]
Furthermore, since the train route time information stored in the train route time information storage means is updated and managed, the train route and time search processing based on the latest information can be performed, and the reliability of the train route and the time search result can be improved. Can be improved.
[0047]
As described above, the train route time information such as the train route, station name, transfer station, train departure / arrival time, train type, fare, fare, etc. is stored in the train route time information storage means in advance. By entering the departure station, destination station and desired arrival time, the information stored in the train route time information storage means is searched to calculate the transit route, transfer station, optimal boarding date and time, type of train used, and fares and fares Therefore, if the destination and the desired arrival date and time are determined prior to a business trip or travel, an appropriate train and departure time can be easily known based on the destination and desired arrival date and time.
[0048]
Furthermore, by inputting the departure station, the destination station, and the desired arrival date and time, the most suitable departure station departure date and time can be selected from the candidates that can arrive before the desired arrival date and time with the latest departure train time. As a result, the convenience of train time search when making an efficient travel plan is further improved.
[0049]
Furthermore, since the train route time information stored in the train route time information storage means is updated and managed, the train route and time search processing based on the latest information can be performed, and the reliability of the train route and the time search result can be improved. Can be improved.
[0050]
【The invention's effect】
According to the present invention, if a destination and a desired arrival date and time are determined prior to a business trip or travel, an appropriate train or departure time can be easily known based on the destination and desired arrival date and time.
[Brief description of the drawings]
FIG. 1 is a functional block diagram of one embodiment of the present invention.
FIG. 2 is a flowchart of timetable data update registration processing according to the embodiment.
FIG. 3 is a main flowchart of a train route time search process according to the embodiment.
FIG. 4 is a flowchart of a first half of a train route time search routine in a main routine of a train route time search process according to the embodiment.
FIG. 5 is a flowchart of an intermediate part of the train route time search routine.
FIG. 6 is a flowchart of the latter half of the train route time search routine.
FIG. 7 is an explanatory diagram showing an initial screen for inputting search data in the embodiment.
FIG. 8 is an explanatory diagram showing a departure date input screen as search data in the embodiment.
FIG. 9 is an explanatory diagram showing a departure place input screen as search data in the embodiment.
FIG. 10 is an explanatory diagram showing a destination input screen as search data in the embodiment.
FIG. 11 is an explanatory diagram showing a desired arrival time input screen as search data in the embodiment.
FIG. 12 is an explanatory diagram showing a screen in a state where all of a departure date and time, a departure place, a destination, and a desired arrival date and time are input and confirmed as search data in the embodiment.
FIG. 13 is an explanatory diagram showing a display screen of a train route and a time search result in the embodiment.
[Explanation of symbols]
1 pen computer
2 Auxiliary storage device
3 Display
4 Display processing unit
5 Electronic pen
6 Input processing unit
11 Database Management Department
12 Master data storage
13 Route search section
14 Transfer Station Search Department
15 Fare calculation section
16 Route time search section

Claims (17)

Train line time information storage means for storing train line time information including at least one of a station name, a transfer station, and a train departure / arrival time;
A transfer station search means for searching for the train line time information and extracting a transfer station by inputting a departure station and a destination station,
By inputting the desired arrival date and time of the destination station, based on the train line time information and the search result by the transfer station search means, the route goes back from the destination station to the departure station via the transfer station, and A train time search device comprising: a train time search means for extracting an optimum boarding date and time of a departure station. 2. The train time search unit according to claim 1, wherein a train that departs latest is selected from candidates that can arrive before the desired arrival date and time as the optimal boarding date and time at the departure station. 3. Train time search device. The train time search means searches the train line time information and extracts a first train that arrives at a destination station at the desired arrival date and time and arrives at a time closest to the desired arrival time, When there is a second train that departs from the transfer station at a later time than the first train and that arrives at the destination station earlier than the first train among trains going from the transfer station to the destination. 2. The train time search according to claim 1, wherein, based on the second train, the train travels back from the destination station to the departure station via the transfer station, and extracts an optimal boarding date and time of the departure station. apparatus. The said train time search means searches the said train route time information, and selects the thing of the train which departs latest from the candidate which can arrive at the time near the said desired arrival time. 1. The train time search device according to 1. The train time search means searches the train route time information, extracts a first train arriving at a time closest to the desired arrival time, and selects a first train arriving from a transfer station to a destination. If there is a second train that departs from the transfer station at a later time than the first train and arrives at the destination station earlier than the first train, based on the second train, 2. The train time search device according to claim 1, wherein the train travels back to the departure station via the transfer station and extracts an optimal boarding date and time of the departure station. The train line time information storage means further stores a train line as the train line time information,
The train time search device according to any one of claims 1 to 5, wherein the train time search means searches for a train in consideration of the train route, and further extracts the train route of the train. The train route time information storage means further stores a train type as the train route time information,
The train time search device according to any one of claims 1 to 6, wherein the train time search means searches for a train in consideration of the train type and further extracts the train type. The train line time information storage means further stores at least one of a fare and a charge as the train line time information,
8. The method according to claim 1, further comprising a fare calculation unit configured to calculate at least one of a fare and a fare based on the train route time information and a search result of the transfer station search unit. The train time search device according to claim 1. The train time search device according to any one of claims 1 to 8, further comprising a database management unit that updates and manages the train line time information stored in the train line time information storage unit. Based on the input of the departure station and the destination station, a pre-stored station name, a transfer station, a transfer station search step of searching for the train line time information including any one or more of the train departure and arrival times and extracting the transfer station; ,
Based on the input of the desired arrival date and time of the destination station, based on the train line time information and the search result at the transfer station search step, go back from the destination station to the departure station via the transfer station, and A train time search step for extracting an optimal boarding date and time of a station. 11. The train time search step according to claim 10, wherein the train that departs latest is selected from the candidates that can arrive before the desired arrival date and time as the optimal boarding date and time of the departure station. Train time search method. The train time search step searches the train route time information, and extracts a first train that arrives at a target station at the desired arrival date and time and arrives at a time closest to the desired arrival time, When there is a second train that departs from the transfer station at a later time than the first train and that arrives at the destination station earlier than the first train among trains going from the transfer station to the destination. 11. The train time search according to claim 10, further comprising: going back to the departure station from the destination station via the transfer station based on the second train, and extracting an optimal boarding date and time of the departure station. Method. The said train time search step searches the said train route time information, and selects the thing of the train which departs latest from the candidate which can arrive at the time near the said desired arrival time. 10. Train time search method described in 10. The train time search step searches the train route time information to extract a first train arriving at a time closest to the desired arrival time, and among the trains going from the transfer station to the destination, If there is a second train that departs from the transfer station at a later time than the first train and arrives at the destination station earlier than the first train, based on the second train, The train time search method according to claim 10, further comprising: returning to the departure station via the transfer station, and extracting an optimal boarding date and time of the departure station. A train route is further stored as the train route time information,
The train time search method according to any one of claims 10 to 14, wherein in the train time search step, a train is searched in consideration of the train line, and the train line of the train is further extracted. A train type is further stored as the train line time information,
The train time search method according to any one of claims 10 to 15, wherein in the train time search step, a train is searched in consideration of the train type, and the train type is further extracted. The train line time information storage step further stores at least one of a fare and a charge as the train line time information,
17. A fare charge calculating step for calculating at least one of a fare and a fare based on the train route time information and the search result of the transfer station search step. The train time search method according to item 1.

Images