JP2002032443A - Method and system for route guidance - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a system and a method for.route retrieval which permit return retrieval, free-time retrieval, etc. SOLUTION: This system is equipped with a setting means (101) for setting a starting point, the starting time at the starting point, at least one destination, and a final destination, a database (108) which stores information including a timetable and a mean time needed for movement, and retrieving and outputting means (103, 105, 107) which retrieve an optimum route from the starting point to the final destination and its fare according to the set values set by the setting means and the information stored in the database by using an optimum route retrieval process and output the retrieval result.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system for searching for an optimum route using an optimum route search process based on conditions such as a departure place, a departure time, a destination, a final destination and a final arrival time. .

[0002]

2. Description of the Related Art By using a database storing timetable information and operation time information of several stations existing on a railway line, a user can input a boarding station, alighting station and boarding time on a search screen. A system for searching and outputting the departure time of the boarding station and the arrival time of the getting off station using an optimal route search process based on the inputted boarding time and the timetable data of the boarding station and the getting off station in the database is known. ing.

[0003] The above-mentioned system is used for "getting off from a boarding station".
It is a system for searching for the optimal route up to. This is a search for "one way" in the concept of "round trip" which is the basis of going out. For example, if the estimated time of arrival at the final destination (it does not need to be the same as the departure point) is determined (the last route using the last train is also possible), input and condition setting are 2
And search for the outbound and return trips one way at a time.
Therefore, the information retrieved earlier is stored somewhere in a recording medium (including a search screen window, a handwritten memo, etc.), and after the other retrieval is completed, the two are analyzed. Also, the route to calculate the local time based on that must be done using another medium. On the other hand, according to the present technology, it is possible to search for the optimal round-trip route to be obtained and the free time (including travel time by train or the like) on the spot with a single condition setting.

[0004]

As described above, in the past, a route could be searched for only one way in a round trip with a single input. Then, "round trip" is the basis of going out
If you try to get a route at, go and return
Must be searched twice. In addition, to compare the results, you need to store the results for "one way" searched earlier in another medium, search for "one way" for the other, and then compare the results. There was a problem that did not become.

The present invention provides a route search system and a route search method capable of not only searching for an optimal route for moving from one place to another place, but also performing round-trip search, free time search, and the like. It is intended to provide.

[0006]

According to the present invention, the following means have been taken in order to solve the above-mentioned problems.

[0007] The following retrieval system is known.
It has a database that stores timetable information and operation required time information of several stations existing on the railway line, and when the boarding station, getting off station and boarding time are input on the search screen, the boarding station, It is determined whether there is timetable data corresponding to the disembarkation station, and if there is timetable data, the departure time of the departure station and the departure time of the departure station based on the input departure time, the departure station of the database, and the departure station timetable data Confirm and display the arrival time of the getting off station. If there is no timetable data, the departure time of the departure station and the departure station are determined based on the timetable data of the previous station on the route including the departure station and the time required to get on and off the departure station. Is calculated, and an estimated display at that time is displayed. Using the system described above, the following search was enabled.

[0008] A first route guidance system and method according to the present invention include a departure place, a departure time of the departure place, and at least one departure time.
Two destinations and a final destination, and based on information in a database storing information including a timetable and information on an average required time required for movement, and the set value set by the setting means, an optimal route search process. Is used to search for the optimal route and fare from the departure point to the final destination, and output the search results. Here, (1) the final arrival time of the final destination may be set, and the free time at the destination other than the travel time by means of transportation such as a train may be calculated and output based on the set value. .

(2) In (1), the final arrival time may be set to, for example, the time of the last train on a train.

[0010] A second route guidance system and method according to the present invention include a departure point, at least one destination, free time at the destination, a final destination, a departure time and a final arrival time. One time is set, and based on the information of the database storing information including the timetable and the average required time required for the movement and the set value set by the setting means, from the departure point using the optimum route search process. In addition to searching for the optimal route and fare to the final destination, search for the final arrival time if the departure time is set, and search for the departure time if the final arrival time is set. , And output the search results. Here, when neither the departure time nor the final arrival time is set, the final arrival time may be set to, for example, the time by the last train on a train.

A third route guidance system and method according to the present invention sets a departure point, a departure time, free time, a final destination, and a final arrival time, and sets a timetable and an average required time for traveling. Based on the information of the database storing the information including the time and the set value set by the setting means, the optimum route from the departure place to the final destination is searched using the optimum route search process, and the set route is set. Searches for destinations that can be reached based on free time, and outputs the search results. Here, when neither the departure time nor the final arrival time is set, the final arrival time may be set to, for example, the time by the last train on a train.

[0012] A fourth route guidance system and method according to the present invention include a departure place, a departure time, a free time, a destination attribute which is action information at a destination, a final destination, and a final arrival time. Based on the information including the timetable and the average required time required for the movement, the information of the database storing the entertainment information and the spot information and the set value set by the setting means, using the optimum route search process In addition to searching for the optimal route and fare from the departure point to the final destination, search for the destination, desired entertainment and spot, and the nearest station name that can be reached based on the set destination attribute, and search for them Output result. Here, when neither the departure place nor the final destination is set, the final arrival time may be set to, for example, the time by the last train on a train.

In a fifth route guidance system and method according to the present invention, a departure place, a departure time at a departure place, and a final destination are set, and a route search based on the set departure time is a last train route. Or, when the departure time is after the last train, based on the timetable and information including the average required time required for movement, the information of the database storing entertainment information and spot information, and the set value set by the setting means. In order to search for the optimal route and fare from the departure point to the final destination using the optimal route search process, and to output or output the route by the first departure of transportation in the next morning and the spot information that can be spent from the last train to the first departure Output link information.

[0014]

Embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing the configuration of the route search system of the present invention.

The input unit 101 is a device for receiving an input of a condition from a user. The input unit 101 has a button, a keyboard, a touch panel, an OCR, and the like, and includes a desktop computer, a portable computer, a mobile phone, a television, and the like. And devices capable of inputting and outputting data.

The MMI unit 102 passes the conditions (parameters) input by the input unit 101 to the route search control unit 103. Further, the MMI unit 102 causes the output unit 107 to output the search result passed from the route search control unit 103. The input unit 101 and the MMI unit 102 and the output unit 107 and the MMI unit 102 may be connected to each other via a communication line, a network, or another connection method as long as data can be exchanged. However, the connection may be made in any form, whether wired or wireless.

The route search control unit 103 includes the MMI unit 102
This is a part that controls the route search based on the parameters passed from. Specifically, the route search control unit 103 stores the parameters in the input buffer 104, causes the route search engine unit 105 to process the parameters,
The control is performed such that the data is read from the data path and compared with the read path, and the result is stored in the output buffer 106. In addition, the path search control unit 103 also performs control of passing the contents in the output buffer 106 to the MMI unit 102 when all the processing is completed.

The input buffer 104 is a buffer for temporarily storing input data. Based on the control of the route search control unit 103, the input buffer 104 temporarily stores the data passed from the route search control unit 103 or sends the temporarily stored data to the route search engine 105.

The route search engine unit 105 is a known search engine for performing a route search. The route search engine unit 105 receives parameters required for a search such as “riding station / disembarking station” and “departure / arrival time” from the input buffer 104 based on the control of the route search control unit 103. A search is performed, and the search result is sent to the route search control unit 103.

The output buffer 106 is provided for the route search control unit 1
Based on the control of step S03, data to be output to the output unit 107 is temporarily stored.

The output unit 107 is a screen display device such as a CRT or an LCD, or a printer for outputting to paper or the like, and is a device for outputting search results and the like.

An information DB (database) 108 is a database for storing various information such as a timetable, an average time required for movement, and entertainment. The required information is passed to the route search control unit 103 based on the control of the route search control unit 103. In addition, this information DB
108 may be built into the system or function as an independent database. In addition, the database used to store the information used for the route search and the information related to entertainment may be separate databases or one database.

Each embodiment of the route search system according to the present invention will be described below. However, since the configuration is all the same as that of FIG. 1, the configuration diagram is omitted.

A first embodiment of the present invention will be described with reference to FIG. FIG. 2 is a flowchart showing the flow of the processing of the route search system according to the first embodiment of the present invention.

First, the input buffer 104 and the output buffer 106 are initialized (step S20).
1).

When search conditions such as a departure place, a departure time, a destination, a final destination, and a final destination arrival time are input from the input unit 101 (step S202), those data are stored in M.
The route search control unit 103 receives from the MI unit 102 and temporarily stores it in the input buffer 104 (step S20).
3). In step S202, the description of the present embodiment proceeds assuming that entertainment search and free time search are not performed.

The route search control unit 103 performs “entertainment search” in which the search is compared with information such as entertainment.
Is determined (step S204). Since "entertainment search" is set so as not to be performed, next, the route search control unit 103 determines whether to search for "free time" (step S205).

Here, since "free time search" is not performed,
Next, the route search control unit 103 reads “departure place”, “departure date and time”, and “destination” from the input buffer 104, passes the read conditions to the route search engine unit 105, and performs a forward search by “designation of departure time”. (Step S20)
6). When the result is returned to the route search control unit 103 after the route search engine unit 105 searches the outward route, the search control unit 103 temporarily stores the search result in the output buffer 106 (step S207).

Similarly, "destination", "final destination", and "date and time of final destination" are read from the input buffer 104, passed to the route search engine unit 105, and searched by specifying the arrival time (step S208). . The route search control unit 103 temporarily stores the search result in the output buffer 106 (Step S209).

After the two searches, the route search control unit 103 outputs the "outgoing arrival time" and "returning flight departure time" from the output buffer 106.
Is read, and a time X during the reading is obtained (step S21).
0), and stores the result in the output buffer (step S21)
1) together with the shortest time (from the destination,
(At least required time) is determined (step S212).

In step S212, if Yes, the route search has been completed, and the route search control unit 103
Data is read from the output buffer 106, and the MMI unit 1
The search result is output from the output unit 107 (step S213).

In the case of No at step S212,
Since a route could not be created under these conditions, an "error message" is displayed (step S214).

Thereafter, the route search control unit 105 initializes each of the input buffer 104 and the output buffer 106 (step S215), and ends the processing.

In the present embodiment, the output of the result is displayed on the screen. However, the present invention is not limited to this, and it goes without saying that the output form is appropriately changed according to the output unit 107.

As described above, by one condition input,
Round-trip route information such as the outbound route and the return route and the amount of money specified, and also free time at the destination can be obtained. If the departure time and final arrival time are not set,
You can also search for only return routes.

The operation of the second embodiment of the present invention will be described with reference to FIG. FIG. 3 is a flowchart showing a flow of processing of the route search system according to the second embodiment of the present invention. In the second embodiment, an embodiment in which a free time is specified will be described.

The processing up to step S301 is the same as the processing from step S201 to step S204 in the first embodiment, so that the description and illustration are omitted.

The route search control unit 103 determines whether or not the departure time is specified (step S301). If the departure time is specified, the "departure point", "departure time", and "destination" are read from the input buffer 104. , Route search engine 105
To perform a forward search by "designation of departure time" (step S302). Note that the processing in the case where the emission time is not specified in step S301 will be described in the third embodiment.

After the route search engine unit 105 searches the route and returns the result to the route search control unit 103, the search control unit 103 stores the search result in the output buffer 106 (step S303). After that, "free time data" is read from the input buffer 104, and "destination departure time X" is obtained in addition to "outbound arrival time" obtained by the outward route search.

Before starting the return route search, it is determined whether or not "the arrival time is designated" (step S305).

In step S305, if Yes,
The route search control unit 103 reads the data of “final destination arrival time”, “last destination”, and “destination” from the input buffer 104, passes the data to the route search engine unit 105, and performs route search by “designation of return route arrival time”. (Step S30)
7). The route search engine unit 105 returns the search result to the route search control unit 103.

In step S305, if No (when the arrival time is not specified), it is determined whether the last route is specified (step S308). If Yes, the input buffer 104 is selected.
From the "final destination" and "destination" data,
It is passed to the route search engine unit 105 to search for the last train route (step S309). The route search engine unit 105 returns the result to the route search control unit 103.

In the case of "designation of arrival time" or "designation of final train route", since the return departure time may be a time longer than X, Y is obtained (step S310) and is 0 or more. (Step S311), and if Yes (after the time), it is stored in the output buffer (Step S314). If No in step S311, the process (2) described in the first embodiment is performed.

If the determination in step S308 is No (not "designation of arrival time" or "designation of final train route"), X
The route search engine 105 is caused to perform a route search with the time of departure (step S313). Route search engine unit 1
When the result is returned to the route search control unit 103, the search control unit 103 determines whether or not the route has been created, and when Yes (the route has been created), stores the result in the output buffer 106 (step S314). . If a route cannot be created in No, the processing is the processing of the fifth embodiment.

The processing after the output after the processing in step S314 is the same as the processing in step S213 in FIG. 2 of the first embodiment, so that illustration and description are omitted.

In this way, a route search can be performed by designating the departure time and free time.

A third embodiment of the present invention will be described with reference to FIG. FIG. 4 is a flowchart illustrating a processing flow of the route search system according to the third embodiment. In the present embodiment, an embodiment in which the free time is not specified in the free time specification will be described. That is, in the present embodiment, since the entertainment search and the free time are not searched and the departure time is not specified, the final destination arrival time is specified.

The processing up to step S401 is the same as the processing from step S201 to step S204 in the first embodiment and step S301 in the second embodiment, so that illustration and description are omitted.

The route search control unit 103 includes the input buffer 10
4, the destination, the final destination, and the arrival time of the final destination are read, and the data is sent to the route search engine unit 105.
A search is performed by specifying the arrival time (step S401).

When the route search engine unit 105 returns the search result to the route search control unit 103, the search control unit 103
The result is stored in the output buffer 106 (step S
402).

The route search control unit 103 includes the input buffer 10
Read the data of starting point, destination and free time from 4,
The "free time" is subtracted from the "return time" and the value is stored in the output buffer 106 as the destination arrival time X (step S404).

Subsequently, the route search control unit 103 passes the departure place, destination, and arrival time X to the destination to the route search engine unit 105, and performs "route search by X arrival time" (step S405). The route search engine unit 105 returns the search result to the route search control unit 103.

The route search control unit 103 determines "whether a route has been created" (step S406).

If Yes (the route has been created) in step S406, the route search control unit 103 stores the data in the output buffer 106 (step S4).
07). Thereafter, step S2 in FIG. 2 of the first embodiment is performed.
Since the same processing as output 13 is performed, illustration and description are omitted. Note that if it is determined in step S406 that the route has not been created (No in step S406), the process of the fifth embodiment, which will be described in detail later, is performed.

In this way, the round trip route can be searched from the arrival time at the final destination and the free time at the destination, and the departure time can also be searched.

The operation of the fourth embodiment of the present invention will be described with reference to FIGS. FIG. 5 and FIG. 6 are flowcharts showing the processing flow of the route search system according to the fourth embodiment of the present invention. In the fourth embodiment, an embodiment in which an entertainment search is performed will be described.

The processing up to step S501 is the same as that of steps S201 to S203 in FIG. 2 of the first embodiment.
Since it is the same as that of FIG.

The route search control unit 103 determines whether or not the departure time has been designated (step S501).
The time of departure, the destination, etc. are read and the route search engine unit 10
5 is searched for a route (step S502). When the route search engine unit 105 passes the search result to the route search control unit 103, the search control unit 103 outputs the result to the output buffer 1
06 (step S503). The route search control unit 103 obtains the name of the destination from the input buffer 104, searches the information DB 108 relating to the name (step S504), and stores the result in the output buffer (step S505).

The route search control unit 103 is provided with the input buffer 1
04, parameters are extracted, and it is determined whether or not to perform “final search” (step S506). Step S5
If 06 is Yes, the "destination time on the outward route" and the "entertainment information" are read from the output buffer 106, and it is determined whether or not the time is optimal (step S508). If Yes in step S508, the process moves to the next process (step S509). If No, a time in time is calculated (step S507), and a forward search is performed based on the calculated time (step S502).

In step S506, if No,
The following processing is performed without determining whether or not it is optimal (step S5)
09). The forward arrival time is added to the entertainment time to obtain X, or the end time of the entertainment is obtained from the information DB 108 to obtain X.
And

The route search control unit 103 has the input buffer 10
4 to read parameters and determine whether or not the arrival time is designated (). In step S510, when the answer is Yes, a route search is performed from the input buffer 104 using X as the departure time (step S511). In step S510, N
In the case of o, the data of the final destination time is input into the input buffer 10.
4 is read, and a return route search is performed using the read time as the arrival time (step S512).

Based on the search result in step S511 or S512, it is determined whether a route has been created (step S513). If Yes, the route is written to the output buffer 106 (step S514). Subsequent processing is the same as step S213 in FIG. 2, so illustration and description are omitted.

If the determination in step S501 is No, since the departure time is specified, the route search control unit 103
The destination, the final destination, the final arrival time, etc. are read from the input buffer 104 and passed to the route search engine unit 105 to search for a route (step S60).
1). When the route search engine unit 105 passes the search result to the route search control unit 103, the search control unit 103 stores the result in the output buffer 106 (Step S602).
The route search control unit 103 obtains the destination attribute from the input buffer 104, searches the information DB 108 for the destination attribute (step S603), and stores the result in the output buffer (step S604).

The route search control unit 103 is provided with the input buffer 1
04, parameters are extracted, and it is determined whether or not to perform “optimal search” (step S605).
From the output buffer 106, "Destination time on the outbound route"
"Amusement information" is read, and it is determined whether or not the time is optimal (step S606). If Yes in step S660, the process proceeds to the next process (step S608).
If No, calculate the time in time (step S607)
Then, an outbound route search is performed based on the time (step S601).

If No in step S605,
The following processing is performed without determining whether or not it is optimal (step S608).

The route search control unit 103 obtains the time obtained by subtracting the entertainment time from the return departure time, and the outward arrival time X (step S608).

The route search control unit 103 has the input buffer 1
From 04, the data of the departure place and the destination is read and passed to the route search engine unit 105 together with X to search for a route in which X is the outward arrival time (step S609). The route search engine unit 105 converts the search result into the route search control unit 103
To return.

The subsequent processing is the same as the processing after step S513 in FIG. 5, so illustration and description are omitted.

According to the present embodiment, an optimum route including entertainment information can be searched.

The operation of the fifth embodiment of the present invention will be described with reference to FIG. FIG. 6 is a flowchart showing the flow of the processing of the route search system according to the fifth embodiment of the present invention.

In the fifth embodiment, basically, when the route to the final destination cannot be searched on the same day according to the result of the route search in the first to fourth embodiments. FIG.

It is determined whether or not "first guidance" has been requested (step S701), and if Yes, the route search control unit 103 causes the route search engine unit 105 to search for a route using the last train (step S702). ) And store it in the output buffer 106 (step S703). Further, the route search engine unit 105 also searches for the first route (route based on the first train) (step S704), and stores the route search result in the output buffer 106 (step S70).
5). The route search engine unit 105 searches the information DB 108 for information such as “spots that can be spent until the first train (such as movie theaters with all-night screenings)” and “hotel information” near the station based on the destination station name. (Step S706), it is stored in the output buffer 106 (Step S707). After the search, the route search control unit 103
An output is instructed to the unit 102, the data of the output buffer 106 is passed, and a search result is displayed on the output unit 107.

When the determination in step S701 is No, the same processing as in step S214 and subsequent steps in FIG. 2 is performed, so that illustration and description are omitted.

FIG. 8 is a diagram showing an example of an input screen of the input unit 101 of the route guidance system according to the present invention and an example of a display screen of a search result in the output unit 107. FIG. 8A shows an input screen, and FIG. 8B shows an output screen.

For example, in FIG. 8A, the information of the departure place (departure place and departure time), the information of the destination (departure time or arrival time of the destination and destination), and the information of the final destination (final departure) Destination, final arrival time, and last train guidance) can be entered. In this input screen, there is only one destination, but it is needless to say that a plurality of destinations can be input.

In the above screen, the departure place is "Hamamatsucho"
And the departure time is “17:30”. Then, when the final destination is “Yokohama”, the final arrival time is “23:00”, and the destination is “Shinjuku”, a search result as shown in FIG. 8B is obtained. According to this search result,
You will have about 4 hours and 26 minutes of free time in Shinjuku, and you can get to Yokohama at 23:00 by taking the train at 22:18 in Shinjuku.

As described above, according to the present invention, the optimum route and free time from the departure point including the destination to the final destination can be searched by performing only one input, so that it is extremely easy to use. The system is obtained.

According to the present embodiment, in the case of the route based on the time after the last train, information such as the route by the first generator and the place (spot) where time can be spent until the first departure can be obtained.

In this embodiment, the case where the route search to the final destination cannot be performed during the day in the first to fourth embodiments has been described. However, the present invention is not limited to this. It can be applied to the case where the last train is just before or the last train.

The present invention is not limited to the above embodiment of the present invention. In the above embodiment, as a description method, a route search using a train is mainly performed, but all available transportation means such as an aircraft, a bus, and a ferry can be included. Furthermore, the entertainment information includes all kinds of entertainment information such as meals, movies, plays, and the like.
Includes bookstores and other things. In addition, in the configuration of FIG. 1, the input unit 101 and the output unit 107 are separately described, but the input / output unit includes a desktop computer, a portable computer, a mobile phone, a television, and the like as described above. An integrated device may be used as long as the device can input and output information. In this case, the device is connected to, for example, the MMI unit 102 via a communication line so that data communication is possible.

Further, it goes without saying that various modifications can be made without departing from the scope of the present invention.

[0082]

According to the present invention, the following effects can be obtained.

As in the above embodiment, according to the present invention, once a condition is set, a round-trip route, a round-trip fee, and a condition input that have been required to be searched twice have been hitherto required. The user can search for free time at the destination.

By setting the destination and the free time there, and inputting the expected conditions such as the departure place and the final destination, the time at which the departure should be made or the time at which the final destination should be made You can search at once to see if you can arrive, and you can easily search for an outing schedule.

Since the information search is performed by combining the route information and the entertainment information, the entertainment information corresponding to the searched round-trip route can be searched, and conversely, the round-trip route matching the entertainment information can be searched.

The first route is displayed together with the output of the last train route or the information that the last train has left. Also,
The place where you can spend from the last train to the first train is shown.

[Brief description of the drawings]

FIG. 1 is a block diagram showing the configuration of a route search system according to the present invention.

FIG. 2 is a flowchart showing a processing flow of the route search system according to the first embodiment of the present invention.

FIG. 3 is a flowchart showing a processing flow of a route search system according to a second embodiment of the present invention.

FIG. 4 is a flowchart showing a processing flow of a route search system according to a third embodiment of the present invention.

FIG. 5 is a flowchart showing a processing flow of a route search system according to a fourth embodiment of the present invention.

FIG. 6 is a flowchart showing a flow of processing of a route search system according to a fourth embodiment of the present invention.

FIG. 7 is a flowchart showing a processing flow of a route search system according to a fifth embodiment of the present invention.

FIG. 8 shows an input unit 101 of the route guidance system according to the present invention.
FIG. 7 is a diagram showing an example of an input screen of the search result and a display screen of a search result in the output unit 107.

[Explanation of symbols]

 101: input unit, 102: MMI unit, 103: route search control unit, 104: input buffer, 105: route search engine unit, 106: output buffer, 107: output unit, 108: information DB (database).

 ────────────────────────────────────────────────── ─── Continuing on the front page (72) Inventor Yuhei Tokumae 3-3-1 Shinmachi, Ome-shi, Tokyo Toshiba Digital Media Engineering Co., Ltd. In-house F-term (reference) 5B049 BB32 CC02 DD01 EE05 EE31 FF01 5B075 ND20 PQ02 PQ32

Claims (6)

[Claims] 1. A setting means for setting a departure place, a departure time of a departure place, at least one destination, and a final destination, and a database storing information including a timetable and an average travel time required for travel. Based on the set values set by the setting means and the information stored in the database, an optimal route and a fee are searched for from the starting point to the final destination using an optimal route searching process, and the search result is obtained. And a search output means for outputting the information. 2. A departure point, at least one destination,
Setting means for setting a free time at the destination, a final destination, and either one of the departure time and the final arrival time; a database storing information including a timetable and an average required time required for movement; Based on the set value set by the setting means and the information stored in the database, an optimum route from the departure place to the final destination is searched using an optimum route search process, and the departure time is set. If the last arrival time is set, a search output means for searching for the departure time if the last arrival time is set and outputting the search result is provided. Route guidance system. 3. A setting means for setting a departure place, a departure time, a free time, a final destination, and a final arrival time, and a database for storing information including a timetable and an average travel time required for movement. Based on the set values set by the setting means and the information stored in the database, an optimum route from the starting point to the final destination is searched using an optimum route search process, and the set free route is set. And a search output means for searching for a destination to which the user can go based on time and outputting the search result. 4. A setting means for setting a departure place, a departure time, a free time, a destination attribute which is action information at a destination, a final destination, and a final arrival time; A database storing entertainment information and spot information including a required average required time; and a departure point using an optimal route search process based on the set values set by the setting means and the information stored in the database. Search for the optimal route and fare from the destination to the final destination, search for destinations and desired entertainments and spots that can be reached based on the set destination attributes, and the name of the nearest station, and search the search results. And a search output unit for outputting. 5. A setting means for setting a departure place, a departure time of the departure place, and a final destination, a database storing information including a timetable and an average time required for movement, entertainment information and spot information. When the route search by the set departure time is the last route, or when the departure time is after the last train, based on the set value set by the setting means and the information stored in the database, Using the optimal route search process, search for the optimal route and fare from the departure point to the final destination, and output or output the route by the first departure of the next morning transportation or the spot information that can be spent from the last train to the first departure And a search output means for outputting the information. 6. A departure place, a departure time of the departure place, at least one destination, and a final arrival place are inputted, and the set value set by the setting means, a timetable, and an average required time required for movement. Based on information stored in a database storing information including time, searching for an optimum route and a fare from a departure place to a final destination using an optimum route search process, and outputting the search result. A route guidance system characterized by: