JP6144454B2 - Route search system, route search method and computer program - Google Patents

Description

  The present invention uses, for example, train and bus operation information, for example, a technique for searching for an optimum route from a departure station (a station includes a stop, the same applies hereinafter) to a destination station, and in particular, such as a station name. The present invention relates to a route search technique that can reduce the troublesomeness of correction and re-search even when there is an input error in route search conditions.

In a conventional general route search system, when searching for an optimum route, after confirming route search conditions such as a departure station, a destination station, and a use date and time on an input page, a route search process is executed, and the searched route is It was displayed on the result display page.
Then, the user cannot confirm the search result until a series of processes from determination of the route search condition, execution of the search process, and display of the search result are all executed. Therefore, if you notice a mistake in inputting the route search conditions for the first time after looking at the search results, return to the input page again to perform the search, enter the route search conditions, and execute the route search process. It was necessary to repeat. Also, if you feel that you need to correct route search conditions, such as searching for a detour route that passes through a specific transit station after confirming the search results, return to the input page again to perform a search again, It was necessary to execute the search by correcting the route search conditions.

As described above, various improvements have been made in order to reduce the troublesomeness of the re-search in the conventional route search system.
For example, in the system disclosed in Patent Document 1, by displaying a station timetable in which the times of a plurality of transportation means before and after the departure time of the transportation means such as the optimal bus, train, train, etc. that are guided are displayed, When the departure time is changed or the transportation method to be used is changed, re-searching is facilitated. However, it is the same as the prior art in that the search result cannot be confirmed until a series of processes from the determination of the route search condition, the execution of the search process, and the display of the search result are executed.

JP2007-1114030

  In this background, the present invention presents the search result in real time according to the input contents of the route search condition without waiting for the route search execution instruction from the user. The main problem is to provide a route search system that can reduce the inconvenience of re-searching by reducing the amount of troublesomeness of the re-search by reducing the amount of inconvenience of re-searching. To do.

The route search system of the present invention searches for a node corresponding to an input character when detecting input or deletion of a character for identifying a node of a public transport network such as a name of a station connected to a route. a node search unit, with the first node is identified, each time the input or deletion of characters already input Oite new character to the node searching means is detected, the execution instruction of the route search from a user Without waiting, route search means for starting a route search between the first node and the second node specified by the character input at that time, and accepting input or deletion of the new character Output means for outputting the search result of the route search means.

Thus, without waiting for execution instruction of the route search from Yu chromatography The so executes route searching, the user, even in the middle of the input of the route search conditions, since it is possible to confirm the search results in real time , Input errors can be reduced. In addition, while displaying the search result in real time, it is possible to accept input or deletion of characters related to the route search condition, so that it is possible to easily correct the route search condition due to input error, detour route search, etc. The troublesomeness of re-searching can be reduced. In addition to the station, the node may include a bus stop.

In certain embodiments, the route search unit, in the state where the first node and the second node is identified, the node first node that by the search means and the second node is different from the third node The search for the route via the third node may be started without waiting for the confirmation and the execution instruction .
In another embodiment, the route search unit, wherein in a state where the first node and the second node is identified, a third node different from the node that by the search means and the first node and the second node deterministic and without waiting for the execution instruction, it may start a search for a route between the first node and the third node via the second node. In such a configuration, it is possible to search for a detour route by adding a new node after the route search is performed, and also in this case, while confirming the search result in real time, the route search condition Can be entered.

In certain embodiments, the route search unit, when said third node is deleted, the path may be one that re-searching the between the first node and the second node. In such a configuration, even after a search for a detour route is made once, the original optimum route that does not limit the waypoint can be easily re-searched.

The above problem can also be solved by the following route search method and computer program. The route search method of the present invention is a method executed by a route search system that searches for an optimum route between nodes, and when an input or deletion of a character for specifying a node is detected, it corresponds to the input character. a node search processing for searching for a node, with the first node is identified, each time the input or deletion of characters already input Oite new character to the node searching means is detected, the route search from the user Without waiting for the execution instruction, a route search process for starting a route search between the first node and the second node specified by the character input at the time, and input of the new character or And output processing for outputting a search result of the route search means in a state where deletion can be accepted.

A computer program of the present invention is a computer program for causing a computer connected via a communication path to a user terminal device capable of displaying a route search search result to operate as a route search device. Upon detecting the input or deletion of characters for identifying the node searching means for searching for a node corresponding to the characters that are input, in a state where the first node is identified, Oite new character in the node searching means Each time a deletion of the input or deletion of the already input character is detected, the second node specified by the first node and the character input at that time without waiting for a route search execution instruction from the user; route search means for initiating a search for a route between the, in which can accept input or deletion of a new said character condition, outputs a search result of the route search means That the output means, to function as a computer program.

  Since the present invention executes a route search without waiting for a route search execution instruction from the user when the route search becomes possible, even if the user is in the middle of inputting a route search condition, Since the search results can be confirmed in real time, input errors can be reduced. In addition, while displaying the search result in real time, it is possible to easily correct the route search condition due to an input error, a detour route search, etc. in order to maintain a state in which input or deletion of characters related to the route search condition can be accepted. This can reduce the troublesomeness of the re-search.

1 is an overall configuration diagram of a route search system. The sequence diagram which showed the process sequence of the route search method. The figure which shows the example of an input window of the search condition of the path | route which connects a departure station and a destination station. (A) is an example of an input window when narrowing down target stations among search conditions, and (b) is a diagram showing an example of a result display window. (A) is an example of an input window when narrowing down a correct destination station among search conditions, and (b) is a diagram showing an example of a result display window. (A) is an example of an input window for determining a detour route, and (b) is a diagram showing an example of a result display window. (A) is an example of an input window when inputting a new destination station, (b) is a diagram showing an example of a result display window. (A) is an example of an input window when correcting an already input station, and (b) is a diagram showing an example of a result display window. (A) is an example of an input window when deleting an already input station, and (b) is a diagram showing an example of a result display window. (A) is an example of an input window when searching without restriction of the means of transportation used, and (b) is a diagram showing an example of a result display window. The figure which shows the example of a search condition setting window. (A) is an example of an input window when performing a search with restrictions on the means of transportation used, and (b) is a diagram showing an example of a result display window.

  Hereinafter, an example of an embodiment when the present invention is applied to route search between stations connected to a route of a public transportation network will be described. In this example, a “node” is a station (a stop in the case of a bus) that is an element constituting a public transportation network.

  FIG. 1 is an overall configuration diagram of a route search system to which the present invention is applied. This route search system is configured by connecting a route search device 10 to a user terminal device 20 such as a computer or a mobile phone via a digital network N such as the Internet.

[Route search device]
The route search device 10 functions as a station search engine 120 and a route search engine 130, which are examples of node search means, by a computer program being read and executed by a CPU (central processing unit). This information processing can be executed.
The route search apparatus 10 includes a station information DB 140 (DB is an abbreviation of a database, the same applies hereinafter) 140 and an operation information DB 150 in which operation information such as a route network, a timetable, and a map is recorded. Have. Further, the route search apparatus 10 has a data communication interface 110 and is connected via a digital network N to a user terminal apparatus 20 operated by a user.
In this embodiment, the station information DB 140 and the operation information DB 150 are built in the route search apparatus 10, but an external DB storing the station information and the operation information may be used.

  The station search engine 120 searches for a station name such as a departure station, a destination station, or a transit station in real time based on information stored in the station information DB 140. For example, when the user inputs one character “O” as the station name of the departure station in the route search conditions, “Osaka”, “Okayama”, “Okubo”, “Ogikubo”, etc. are candidates as real-time stations. To be explored. Further, when “O” is entered as the second character, “Osaka”, “Okubo” and the like are further narrowed down as candidates. When a plurality of candidate stations are searched by the station search engine 120, a list is displayed with priorities given from the search history of the user so far, the degree of relevance with other search conditions, and the like. One or a plurality of station names may be specified. In the following, it is assumed that the highest station is given the highest priority and that the station is regarded as the station designated by the user.

  The route search engine 130 dynamically inputs route candidates from the departure station to the destination station based on the information stored in the operation information DB 150 when the route search condition including the departure station and the destination station is input. Explore. When another station is input between the departure station and the destination station, the other station is recognized as a transit station or a midway station, and a route passing through the other station is dynamically searched.

“Dynamic search” refers to the search process for the next section with the lowest route operating cost starting from the departure station, that is, the next station, which is linked like a ripple when a stone is thrown on the surface of the water. If the route becomes unrealistic during the search, the search after the next station on the route is stopped. Such a method is different from the method of searching for a route with the optimum operation cost on the route after specifying the route from the departure station to the destination station.
“Operating cost” usually covers time. That is, a route candidate whose next section has the shortest time is searched. However, in addition to time, distance and fare may be used as operation costs, or a combination of these may be used as operation costs.

  As the functional part of the route search engine 130, for example, the route search software “Electric Spa” (registered trademark) provided by the present applicant can be used.

  The data communication interface 110 enables bidirectional communication with the user terminal device 20 having a data communication function.

[Route search method]
Next, a route search method executed by the route search system configured as described above will be described.
FIG. 2 is a sequence diagram showing the processing procedure of this route search method. 3 and 4 (a) to 10 (a) and 12 (a) are examples of route search condition input windows displayed on the user terminal device 20, FIGS. 4 (b) to 10 (b) and FIG. 12B is a diagram illustrating an example of a result display window of a route search for the input content.

[Route search between departure station and destination station]
The user operates the user terminal device 20 to access the route search device 10 and inputs characters that are route search conditions. Characters are input through the input window 210 shown in FIG.
The input window 210 is formed with a date / time setting field 211, a station name input field 212, and an execution button 213 that allows the user to instruct the execution of various processes manually, not automatically. In the date / time setting field 211, departure time, arrival time, current date / time, and the like can be input.

In the station name input column 212, station names such as a departure station, a destination station, and a transit station can be input. For example, by default, an input field of “departure station” is displayed, and when “not input” is clicked or input of “departure station” is confirmed, an input field of another station is automatically displayed. At this time, if the departure station already exists, it automatically becomes the input column for “Destination station”. If it is “Not entered” between the departure station and the destination station, “Via station” or “New station” It becomes the input column of. If it is “not input” next to the destination station, it becomes an input field for “new destination station”.
It should be noted that the input fields of these stations can be corrected afterwards from “via station” to “target station” or vice versa. In the present embodiment, the input is made from the “departure station”, but it is also possible to input from the “destination”.

  Of the execution buttons 213, “route station” is used to set whether to automatically determine the entry field of “route station” as described above or to fix in advance, and “search condition” The route search conditions are changed, “search” is a route search start instruction, and “round trip search” is a route search instruction when returning from the departure station to the departure station via the destination station.

  In the example of FIG. 3, the character “Koenji” in hiragana is input as the departure station in the station name input field 212 of the input window 210 (step S101). Thereby, the station search engine 120 of the route search device 10 accesses the station information DB 140 and starts searching for station candidates (step S102). As a result of the search, stations starting from “Koenji” that are station candidates are listed and displayed (step S103). At this time, the route search engine 130 regards the highest station as the departure station, and waits for input of the next route search condition, for example, the destination station.

  As described above, when the user inputs some characters of the station name in the station name input field 212, the station search engine 120 automatically displays a list of candidate stations, and the highest one is automatically selected by the user. Therefore, the user does not necessarily have to input all characters of the station name. For example, the station name can be input by selecting a desired station from the route map displayed on the user terminal device 20 (step S108). In this case, the station name of the text information is associated with the display area of each station on the route map, and the station name is automatically transferred to the station name input field 212 by clicking on the station on the route map. .

  When “uninput” in the station name input field 212 is clicked, the “target station” input field is displayed as described above. In this case as well as the departure station, every time the name of the destination station is entered, the station search engine 120 searches for a candidate station and displays it in a list, and the top station is regarded as the destination station. It is. For example, as shown in FIG. 4 (a), when the user inputs hiragana characters “shino” at the time when input of “target station” becomes possible, “new okubo”, Stations starting with “Shin-O” such as “Shin-Osaka” are displayed in a list as shown in the figure. If the highest station is the destination station, two or more nodes are input with the departure station (step S104: Yes), so the route search engine 130 satisfies the minimum route search condition. When “Shino” is input, a route between “Koenji” as a departure station and “Shin Okubo” regarded as a “target station” is searched in real time (step S105). Then, the search result is displayed as an optimum route on the result display window 220 shown in FIG. 4B (step S106).

  Here, “real-time search” refers to a search method in which a route search is started immediately without waiting for the station name to be determined each time a station name character is input.

  In such a real-time search, the displayed route is not necessarily what the user desires. For example, the destination station desired by the user may be “Shin Osaka” instead of “Shin Okubo”. In this case, the user changes the input content by continuing to input characters (step S107: Yes, S101). Then, as shown in FIG. 5A, when “Shinosa” is input, the station search engine 120 searches for a candidate station again (step S102). As a result, stations starting from “Shin-Osaka” are listed up as candidate stations (step S103). Since the departure station “Koenji” has already been input and two or more nodes have been input (step S104: Yes), the route search engine 130 displays a list without waiting for the input of the destination station to be confirmed. As a destination station, “Shin-Osaka”, which is the highest station of the station, is searched in real time for the route to the departure station “Koenji” (step S105), and the search result is shown in FIG. The result is displayed on the result display window 220 (step S106).

[Alternate route]
Next, an example of searching for a detour route will be described. One method for searching for a detour route is to click “not input” in the station name input field 212 or “via station” in the execution button to display a station name input field of the via station. The processing in this case is executed according to the procedure shown in FIG. 2 as in the case of the above example.
In the example shown in FIG. 6A, “Koenji” is input as the departure station, “Shin Osaka” is input as the destination station, and “Nagatacho” is additionally input as the transit station. “Nagatacho” is a character in which “Na” → “Naga” → “Nagata” is entered in the order, and “Nagatacho” is finally selected (steps S107: Yes, S101 to S103). Since two or more nodes have already been input (step S104: Yes), the route search engine 130 searches for a route between “Koenji” and “Shin-Osaka” via “Nagatacho” as a station in real time (step S104). The search result is displayed on the result display window 220 of FIG. 6B (S105) (step S106).

[Change from destination station to midway station]
An example in which a new destination station is additionally input while the departure station and the destination station are already input in the station name input field 212 will be described. The processing in this case is also executed by the procedure according to FIG.
For example, as shown in FIG. 7A, it is assumed that “Koenji” is input as the departure station, “Shin Osaka” is input as the destination station, and “Haka” is input as a new destination station (step). S101). At this time, the station search engine 120 displays a list of stations starting from “Hakata” as candidate stations (steps S102 and S103). If the top station “Hakata” is regarded as the destination station, since two or more nodes have already been input (step S104: Yes), the route search engine 130 immediately starts searching for the optimum route. “Shin-Osaka”, which was entered as a location, is in the middle of “Hakata”, so it is automatically changed to “Via Station”, the departure station “Koenji” and the new destination station “Hakata” The route between and is searched in real time (step S105), and the search result is displayed in the result display window 220 of FIG. 7B (step S106).

[Modify existing station]
Even when the characters in the station name input field 212 once entered are overwritten and deleted for correction, the route search result changes in real time.
For example, FIG. 8A shows an example in which the destination station is overwritten from “Shin Osaka” to “Nagoya”. After being overwritten, each time characters are added to the destination station in the order of “NA” → “NAGO” → “NAGOYA”, the station search engine 120 displays a list of candidate stations, and the route search engine 130 Each of the top stations is regarded as a destination station, and a real-time search is executed from the departure station “Koenji” via “Nagatacho” to the destination station as a destination station. In the result display window 220 of FIG. 8B, the search result of the route finally having “Nagoya” as the destination station is displayed.

  FIG. 9A shows an example in which “Nagatacho” which is a transit station is deleted when a route from “Koenji” to “Nagatacho” to “Nagoya” is displayed. . In this case, as shown in FIG. 9B, a route from “Koenji” to “Nagoya” that is not limited to a transit station is identified by real-time search and displayed in the result display window 220.

[Set detailed search conditions]
Next, an example in which a more detailed search condition is set in order to enable a route search according to the user's intention will be described.
In normal route search processing, there is often a request for a route that takes the shortest time without restrictions on the means of transportation used. However, for example, since a fare for an airplane generally increases, it may take some time. Sometimes you want to use the railway. In such a case, it is possible to search for a route that uses only the transportation means desired by the user by setting to restrict the transportation means to be used under detailed search conditions.
For example, as shown in FIGS. 10A and 10B, when a route from “Tokyo” to “Hakata” is searched without restriction on the means of transportation used, a search result of a route using an airplane is displayed. In this case, the user who does not wish to use the airplane further clicks “search condition” in the execution button 213 of the input window to open a search condition setting window 230 for setting more detailed search conditions. Can be displayed.
In the search condition setting window 230, as shown in FIG. 11, radio buttons capable of setting various items such as the means of transportation used, transfer, waiting time for departure at the departure station, use / non-use of the limited express station are displayed. For example, if you select "Use casually" in the items related to airplanes, you will preferentially search for routes that use airplanes, and if you select "Usually use", you will have an advantage over airplanes and other transportation facilities. A route is searched without attaching, and if “not use as much as possible” is selected, a route not using an airplane is preferentially searched. When the setting is changed in the search condition setting window, a real-time search is performed after reflecting the contents of the setting change, and a new route search result is displayed in the result display window 220.
For example, in the example of FIG. 11, the item related to the plane is set to “usually use”, but if the user changes this setting to “not use as much as possible”, the route not using the plane is preferentially real-time. The route search result is changed as shown in a result display window 220 in FIG.

As described above, in the route search system according to the present embodiment, when input or deletion of characters related to a departure station, a destination station, or the like is detected in the input window 210 without waiting for a search execution instruction from the user, Since the real-time search of the route is performed and the result is displayed in the result display window 220, the user does not need to input all the station names and press the execution button of the route search process, and the real-time search result is always displayed. Search conditions can be input while confirming.
As a result, the user can immediately notice an input error by looking at the unintended route search result, and the search result changes in real time just by correcting the input contents of the route search condition at that time. Work for searching can be reduced.

The input window 210 and the result display window 220 may be displayed on separate screens of the user terminal device 20, but are preferably displayed simultaneously on one screen from the viewpoint of reducing user operations.
In the present embodiment, an example in which the route search node is a station that is a component of the route network is shown, but the same applies to the case where the node is an airport, a ferry port, or a road base connected to a mesh. Applicable.

DESCRIPTION OF SYMBOLS 10 Route search apparatus 110 Data communication interface 120 Station search engine 130 Route search engine 140 Station information DB
150 Operation information DB
20 User terminal device 210 Input window 220 Result display window 230 Search condition setting window

Claims (6)

A node search means for searching for a node corresponding to the input character when detecting the input or deletion of the character for specifying the node;
With the first node is identified, the time the Oite input or deletion of characters already entered a new character is detected the node searching unit, without waiting for execution instruction of the route search from a user, the Route search means for starting a search for a route between the first node and the second node specified by the character input at the time ;
An output means for outputting a search result of the route search means in a state in which input or deletion of the new character can be accepted;
A route search system. The route search means does not wait for determination of the third node different from the first node and the second node by the node search means and the execution instruction in a state where the first node and the second node are specified. To start searching for the route via the third node,
The route search system according to claim 1. The route search means does not wait for determination of the third node different from the first node and the second node by the node search means and the execution instruction in a state where the first node and the second node are specified. Starting a search for a route between the first node and the third node via the second node;
The route search system according to claim 1. The route search means re-searches a route between the first node and the second node when the third node is deleted.
The route search system according to claim 2. A method executed by a route search system that searches for an optimum route between nodes,
A node search process for searching for a node corresponding to the input character when detecting the input or deletion of the character for specifying the node;
With the first node is identified, the time the Oite input or deletion of characters already entered a new character is detected the node searching unit, without waiting for execution instruction of the route search from a user, the A route search process for starting a search for a route between the first node and the second node specified by the character input at that time ;
An output process for outputting a search result of the route search means in a state in which input or deletion of a new character can be accepted;
The route search method characterized by performing. A computer program for operating a computer connected via a communication path with a user terminal device capable of displaying a route search search result as a route search device,
The computer,
A node search means for searching for a node corresponding to the input character when detecting the input or deletion of the character for specifying the node;
With the first node is identified, the time the Oite input or deletion of characters already entered a new character is detected the node searching unit, without waiting for execution instruction of the route search from a user, the Route search means for starting a search for a route between the first node and the second node specified by the character input at the time ,
An output means for outputting a search result of the route search means in a state in which input or deletion of the new character can be accepted;
As a computer program.

Images