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

Abstract

PROBLEM TO BE SOLVED: To provide a technique for a route search which enhances transfer information by walking and can realize more practical route search.SOLUTION: A route search tool 110 dynamically executes a search for route candidates on receiving search conditions including a departure station, a destination station, and a walking allowable time indicating an allowable time for which a user can allow movement by walking. At that time, if a user can walk to an intermediate station and an inter-stations required time associated with the station is equal to or less than the walking allowable time, the tool 110 can search for route candidates including walking sections connecting the station and neighboring stations. When walking sections are included in the route candidates determined by the route search, the tool 110 clearly indicates and outputs the walking sections in map information of the station circumference.

Description

  The present invention relates to a route search technique for efficiently searching for a route from a departure station to a destination station (planned arrival station) while responding to the needs of a user who wants to move between stations by walking.

As a route search system that provides users with the optimal route of operation in public transportation networks such as trains, it is equipped with the route search software “Station Spago” (registered trademark, see Non-Patent Document 1) developed by the present applicant. There are many similar products (software / systems) including personal computers (PCs). For these route search systems, many improvements and improvements have been attempted in order to improve the search accuracy and the convenience of those who use the public transportation network. As one of the improved and improved route search techniques, there is a method of searching for a candidate route that connects a departure station to a destination station in consideration of walking movement between stations.
For example, JR Hibiya Line "Akihabara" Station-Toei Line "Iwamotocho Station", JR "Ochanomizu" Station-Chiyoda Line "New Ochanomizu" Station, JR Line "Itabashi" Station-Toei Mita Line New "Shin Itabashi" Station In this way, by moving to a nearby station on a different route on foot, it may be possible to move from the departure station to the destination station in a shorter time. On the other hand, if walking between stations is not taken into consideration, a large detour route may be answered as a search result.

  For this reason, some of the conventional route search systems require inter-station requirements for information on walking sections, for example, stations that are on different routes but can be moved on foot, that is, where there are nearby stations that can be moved by the required time between stations. In some cases, time is associated with each other, and a walking section expressed by a combination of the station, a nearby station, and a required time between stations is reflected in a route search answer when the route is searched.

  For example, Patent Document 1 discloses a route information presentation device that performs a search including a route as necessary when there is a route (an example of a walking route) that can be moved between stations on foot. (Patent Document 1, paragraph 0046, etc.).

"Electrical Spa" Fuunroku Amagasaki and others Nikkei Business Publications, Inc. March 20, 2006

JP 2010-126028 A

The conventional route search system represented by the route information presentation device described in Patent Document 1 performs a search so that the walking section is as short as possible.
However, recently, there has been a tendency to prioritize walking from the viewpoint of health, and there are an increasing number of users who dare to move between the stations on foot even between stations that take a long time to transfer (assumed). Even if the station is not guided as a transfer station on the public transport network, it is possible to avoid transfer at a transfer station that is crowded with many users, or to move to other stations on foot depending on the time of day. If you change to a different station, you may arrive at the destination station earlier as a result.
Further, even when a non-communication section occurs due to an unexpected accident or the like, if there is guidance information for a nearby station that can be changed by walking between stations, it is expected that the user will not be confused greatly.
On the other hand, when walking for the first time or when the distance between stations is long, it may be difficult to get directions to nearby stations, but walking on the map is easy by displaying the map between stations and the walking route on the map. The motivation of walking is expected to increase.

  In view of such a background, an object of the present invention is to provide a route search technique capable of realizing a more practical route search by enhancing the transfer information by walking.

In order to solve the above problems, the present invention provides a route search system, a route search method, and a computer program.
The route search system provided by the present invention is an operation network data that represents a connection between stations for getting on and off a train, a train or a bus, and is associated with the time required for walking between stations for a station that can be moved to a nearby station on another route. Operation network data holding means for holding information, access means for accessing map information holding means capable of acquiring map information for each station periphery, and walking allowance representing the time at which the departure station, destination station and user are allowed to walk on foot A receiving means for receiving a search condition including time, and a route from the departure station to the destination station in the operation network data based on the search condition received by the receiving means by accessing the operation network information holding means through the access means Candidates are dynamically searched, and the previous station and the destination station are If there is a midway station that can be moved to a nearby station on foot, and the required time between stations associated with the midway station is less than or equal to the allowable walking time, the walking section that connects the midway station and the neighboring station If the walking section is included in the route candidate specified by the route search, the map information holding unit is accessed to access the map information around the intermediate station And map information editing means for clearly indicating the walking section in the acquired map information and outputting it.

In one embodiment, the route search system further includes a walking section registration unit that registers a walking section including a station that can be walked to the neighboring station and the time required between the stations starting from the station, The route search means performs a route search by including the walking section registered by the walking section registration means in the operation network data held by the operation network data holding means.
The registration means also records the reliability flag quantitatively representing the reliability of the registered walking section in association with the walking section, and can be updated freely, and the latest reliability flag indicates a predetermined quantitative value. Whether the walking section is held in the operation network holding means as a part of the operation network data when a predetermined quantitative value is indicated.
The reason why the reliability flag is recorded is that it is possible to objectively confirm and verify the reliability because the registration of the walking section alone may affect the overall route search accuracy.

  The route search method provided by the present invention is an operation network data that represents a connection between stations for getting on and off a train, train, or bus and is associated with the time required for walking between stations for a station that can be moved to a nearby station on another route. , And a route search method executed by an apparatus having access means for accessing map information that can be acquired for each station area, wherein the departure permission, the destination station, and the time allowed for the user to walk are allowed to walk. Upon receipt of a search condition including time, the operation network data is accessed, and based on the received search condition, a route candidate from the departure station to the destination station in the operation network data is dynamically searched, and There is a midway station that can be reached on foot between the departure station and the destination station, and it is associated with the midway station. If the required time between stations is equal to or shorter than the allowable walking time, it is possible to search for a route candidate including a walking section connecting the intermediate station and the neighboring station, and the route candidate specified by the route search When a walking section from the intermediate station to the neighboring station is included, the map information is accessed to obtain map information around the intermediate station, and the route that explicitly outputs the walking section in the acquired map information This is a search method.

  A computer program provided by the present invention is a computer program for operating a server connected to a user terminal via a public line network as a route search system that performs a route search in response to a route search request from the user terminal. The station stores operation network data indicating the connection between stations on which trains, trains or buses get on and off, as well as stations that can be walked to nearby stations on different routes, associated with the time required for walking between stations. Access network data holding means, and access means for accessing map information holding means capable of acquiring map information for each station periphery; including a departure station, a destination station, and an allowable walking time indicating a time during which the user can move on foot Receiving means for receiving search conditions; through the access means, the operation network information; The holding means is accessed, and based on the search condition accepted by the accepting means, a route candidate from the departure station to the destination station in the operation network data is dynamically searched. At that time, the departure station and the destination station are If there is a halfway station that can move on foot to the neighboring station and the required time between the stations associated with the middle station is less than the allowable walking time, the middle station and the neighboring station Route searching means that enables searching for route candidates including a walking section that connects to; if the walking section is included in the route candidates specified by the route search, the map information holding means is accessed to access the intermediate station It is a computer program that functions as map information editing means for acquiring surrounding map information and explicitly outputting the walking section in the acquired map information.

According to the present invention, it is possible to search for route candidates by including a walking section from a certain station to a nearby station on a different route as one of the sections existing between the departure station and the destination station in the operation data network data. Therefore, it is possible to perform a route search in accordance with the actual situation of the route network that increases the diversity of use by using walking sections and the user's intention to walk even if the distance between stations is long (it may walk) .
In addition, since the walking section can be incorporated as a part of the operation network data as appropriate, the result of the route search can be tuned to reflect the user's intention.

1 is an overall configuration diagram of a route search system according to an embodiment. It is a figure which shows the outline | summary of the conventional route search process. It is a figure which shows the outline | summary of the route search process by the route search tool of this embodiment. It is a figure which shows the example of the content of operation information DB. It is a figure which shows the example of the content of walk area DB. It is a figure which shows the example of the content of map information DB. It is a figure which shows the example of a display of the route search result of this embodiment. It is the example figure which specified the walk area in the map information. It is another example figure which specified the walk area in map information. It is a figure which shows the process sequence example of a route search tool. It is a figure which shows the example of a process sequence of a map information edit part.

Hereinafter, an embodiment in the case where the present invention is applied to a network type route search system that enables a route search service for portable terminals will be described.
FIG. 1 is an overall configuration diagram of the route search system of this embodiment, and only characteristic portions are shown.

  The route search system 1 includes one or a plurality of information terminal service servers 20 (examples shown) that perform bidirectional communication between a route search server 10 connected to a public communication network N such as the Internet and a user terminal 50. 1).

  The user terminal 50 is a portable terminal having a data communication and data processing function, a personal computer (PC), or the like. This portable information terminal includes one connected to the public communication network N via the mail server 60.

[Route search server]
The route search server 10 is realized by the cooperation of the server body and the computer program of the present invention. That is, when the server body reads and executes the computer program of the present invention, the server body functions as the data communication interface 100, the route search tool 110, and the map information registration tool 120, and information for route search is obtained. Make the process executable.

The data communication interface 100 enables bidirectional communication with the user terminal 50 having data communication and data processing functions, and provides a hierarchical page screen that can be browsed by these information terminals. This hierarchical page screen is for performing a route search Web service. An environment in which a route search satisfying the user can be performed by interactively specifying the route search condition interactively between the system side and the user. provide.
The route search result information can also be displayed on this page screen.

  In addition to the route search engine 111, the route search tool 110 has an operation information DB (DB is an abbreviation of a database, the same applies hereinafter) 112 and a walking section DB 113 built in an external storage device (not shown). It has a function of the walking section registration unit 114 for registering the section in the walking section DB 113 later.

The operation information DB 112 stores operation information such as station, train, train, bus route network, station connection, latitude / longitude of each station, timetable, and the like. In addition, about the station which can move on foot to the vicinity station of another route, the information (two station names, required time between stations, etc.) of a walk section is linked | related and stored. In addition, the walking section DB 113 stores information on the walking section registered by the user after the fact. These pieces of information held in the operation information DB 112 and the walking section DB 113 serve as operation network data referred to when specifying a route candidate in the route search.
The information in the operation information DB 112 and the walking section DB 113 is stored in a data table format. This will be described later.

When the route search engine 111 receives a search condition including a departure station and a destination station, the route search engine 111 dynamically searches for a route candidate from the departure station to the destination station based on the operation network data. In that case, the information of the walking section is also taken into consideration. “Dynamic search” is a search for the next section where the route operation cost is the lowest starting from the departure station, that is, the next station or stop (in the following explanation, the stop is also included in the station). For example, if it turns out that it becomes an unrealistic route during the search, the next station on that route Stop further searches. 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.
In the search conditions, the route search engine 111, when the time that is allowed to move to a nearby station on another route on foot, that is, the allowable walking time is specified, between the departure station and the destination station The time required between the stations associated with the station, that is, the intermediate station, is compared with the allowable walking time. If the required time between stations is shorter than the allowable walking time, a route candidate including a walking section starting from the intermediate station and ending at a nearby station is searched.

  The operation cost considered when searching for a route candidate is usually time. That is, a route candidate having the shortest time in the next section (between stations, walking section) is searched. However, in addition to time, distance, fare, or a combination thereof may be used as the operation cost.

  The route search engine 111 also calculates a total operation cost of the route, for example, a total required time, for each of the plurality of routes searched based on the operation cost. You can also sort the routes. Furthermore, when a walking section is included in the route search result, information on the station that is the starting point and the end point of the walking section is sent to the information terminal service server 20 (a map information editing unit 211 described later).

The walking section registration unit 114 registers the walking section information input by the user or the administrator of the route search server 10 in the walking section DB 113. However, since the required time between stations in the registered walking section is information based on the subjectivity of the user, etc., an updatable reliability flag that represents the reliability of the required time between stations as a quantitative value is displayed. Record in association with.
The reliability flag is, for example, “0” representing unverified information, and is information that can be used only by the registered user. After the predetermined verification by the administrator or the like, it is considered that the reliability has increased, and the reliability flag is updated to “1”, that is, information indicating verification.

  The walking section registration unit 114 appropriately updates the reliability flag and monitors the latest reliability flag, and when it is “1”, the walking section registration section 114 appropriately stores the walking section as part of the operation network data. Alternatively, it may be recorded as it is in the walking section DB 113 without being incorporated as part of the operation network data in the operation information DB 112, and the recorded information may be released as information that can be used by a plurality of users when searching for a route.

  In addition, when the information on the walking section is not associated with the intermediate station that exists between the departure station and the destination station, information on the transfer station by walking within the allowable walking time accepted by the user is newly created. It is also possible to add a walking section information creation function to register the walking section information created thereby in the walking section DB 114. That is, regardless of registration by the user, the route search server 10 may independently create a walking section based on the latitude / longitude information of the intermediate station and its neighboring stations recorded in the operation information DB 112.

  The map information registration tool 120 includes a map information DB 121 and a map information registration unit 122. For each station, the map information registration unit 122 registers, in the map information DB 121, map information that maps geographical information such as road names, building names, and intersection names around the station, and information for forming a walking route. , Modify and delete already stored map information. The map information can be created and held by itself, or the link destination information of the map information service provided on the public communication network (Internet) N can be held.

  An outline of a general route search process by the route search tool 110 of the route search server 10 configured as described above, that is, a route search between the departure station and the destination station will be described. For comparison, FIG. 2 shows an outline of a conventional route search considering a walking section, and FIG. 3 shows an outline of a route search by the route search tool 110 of this embodiment.

  In the conventional route search, as shown in FIG. 2, the first walk on the way to the neighboring station (other station on the other route) on the way from the middle station from the departure station to the destination station is a 5 minute walk. If there is a section but there is no 9-minute second walking section, the second walking section is not a candidate for a search for the next section. That is, even if the total operation cost of the route including the second walking section is actually the minimum, the route including the first walking section connected by the thick solid line is specified as the optimum route. .

On the other hand, in the route search of the present embodiment, the second walking section, which has not existed before, can be registered in the walking section DB 113, and the route candidate is dynamically searched under the search condition including the walking allowable time. Therefore, for example, by specifying the allowable walking time as 10 minutes, for example, a route including the second walking section (when registered) can be specified as shown in FIG. As a result, it is possible to search for an optimum route in accordance with the actual situation.
Regardless of the total operating cost, for example, the user may walk for 10 minutes, or the user who wants to actively walk specifies the allowable walking time as 10 minutes, and intends the route including the second walking section. Can also be identified.
In order to realize such a characteristic route search and also enable a conventional route search, data tables stored in the operation information DB 112 and the walking section DB 113 will be described below.

  FIG. 4 is a diagram illustrating an example of a data table related to a transfer station that can be walked to a nearby station, which is stored in the operation information DB 112. This table is referred to as an “operation information table”. In the operation information table 200, for example, in addition to station information (including latitude / longitude information) for each route, information on walking sections already incorporated as part of the operation network data, that is, two stations, inter-station requirements Time and registration date are recorded.

Specifically, the information on the walking section is “first station code” that is information on one of the two stations, “first station name” corresponding thereto, and “second station” that is information on the other station. “Station code” and “second station name” corresponding thereto are recorded in association with each other, so that the route search tool 110 can specify that the station can be changed by walking. .
Between the station specified by the “first station code” and the station specified by the “second station code”, it is possible to walk from both sides, so if one of the stations is on the way, This is a relationship in which the other one is a nearby station on another route. The “time required between stations” records the time required to move between stations on foot. In the “registration date”, the registration date of the information is recorded.

FIG. 5 is a diagram showing an example of a data table related to a walk section registered later, which is stored in the walk section DB 113. This table is referred to as a “walking section specifying table”. In the walking section identification table 201, information on the station that is the starting point and the terminal point of the walking section registered by the walking section registration unit 114, the required time between stations, the registration date, the reliability flag, and the user ID are recorded. .
The walking section specifying table 201 has basically the same configuration as that of the operation information table 200. The difference is that the above-described “reliability flag” and “user ID” are added. In “User ID”, an ID (Identification) of a user who has registered information of a transfer station by walking is recorded.

  The walking section specifying table 201 can also register a walking section that is not a search target in the conventional route search, for example, a walking section that takes 20 to 30 minutes if it is moved on foot. Thereby, it is possible to determine whether or not there is a station (including a nearby station on another route) that can be transferred by walking, regardless of the total operation cost, and it is possible to include this walking section as a search target. By configuring in this way, the user can save the trouble of collecting information on transfer stations anew or inputting and registering information from scratch.

A part of the map information stored in the map information DB 121 is also stored in a data table format.
FIG. 6 is a diagram showing an example of a data table for specifying map information used when clearly indicating a walking section. This table is referred to as a “map information specifying table”. The map information specifying table is referred to when a walking section is included in the route search result by the route search tool 110.
In the map information identification table 202, “station code” and “station name” corresponding to this are recorded, and in the “position”, latitude information and longitude information of the intermediate station transcribed from the operation information DB 112 are recorded. . Note that “position” may be omitted when the operation information DB 112 is used together. With these pieces of information, map information around two stations in the walking section can be specified. In the “registration date”, the registration date of the information is recorded.
The map information range (geographical area) around the station is a range surrounded by a circle with a radius of 2 km around the point specified by the latitude information and longitude information, or another route that can be transferred from the station. A nearby station may be in a range including a predetermined number.

  Since the map information specifying table 202 specifies the positions of two stations serving as walking sections by latitude information and longitude information, for example, the map information around each station is enlarged or reduced, and both stations are displayed on the display of the user terminal 50. It is also possible to edit so that the route connecting the two can be displayed. Further, information for generating a walking route between two stations serving as walking sections (information for creating a diagram or text) can be associated with a combination of station codes. Thereby, the time required for editing the map information can be shortened.

[Information Terminal Service Server]
Next, the information terminal service server 20 will be described. The information terminal service server 20 responds to a route search request from the mobile terminal 50 and other information terminals, and edits map information. The information terminal interface 200, the service control unit 210, the search condition The function of the input unit 220 is provided.

  The information terminal interface 200 has the same function as that of the data communication interface 100. However, the information terminal interface 200 is used for data communication in that bidirectional communication between the user terminal 50 and a service control unit 210 and a search condition input unit 220 described later is possible. It is distinguished from the interface 100.

The service control unit 210 controls various operations in the entire information terminal service server. For example, when the information terminal interface 200 detects that a request for a route search from the user terminal 50, that is, a search condition has been received, the search condition input unit 220 (to be described later) is controlled to input the search condition to the route search tool 110. Let
The service control unit 210 receives from the route search tool 110 information for specifying a route search result (including a walking section) and corresponding map information from the route search tool 110. When the received information includes a walking section and it is necessary to display a walking route, the map information editing unit 211 clearly indicates the walking route of the walking section in the map information and displays the user terminal 50. Edit the electronic information to a size that can be displayed with. Then, by controlling the portable terminal interface 220, the edited electronic information is returned to the user terminal 50 that is the transmission source of the route search request and displayed.

An example of the route search result displayed on the display of the user terminal 50 is shown in FIG.
In the example of FIG. 7, the search result screen 300 that is an example of a route search result from the Iidabashi that is the departure station to the Kita-Senju station that is the destination station is specified as a walking allowable time of 10 minutes in the search conditions. It is shown. Since the route search result includes a route including a 7-minute walk section, the search result screen 300 displays a distance between Ueno Okachimachi (station) and Yushima (station) as a walk section. . A walking route display 301 that functions as a selection button is displayed in the lower area of the walking section. When the user clicks the walking route display 301, the map information and the walking route of the walking section edited by the map information editing unit 211 are displayed on another screen.

  FIG. 8 is a display screen of the walking route in the walking section. In the example shown in the drawing, a walking route from Ueno Okachimachi (station) to Yushima (station) is displayed as map information around the station together with the required time between stations. Such a route is not specified unless the walking section is registered in advance. When the walking section is registered in the walking section DB 113 and the allowable walking time of 10 minutes is specified by the user, it becomes a search target and can be specified. Moreover, the map information including information for clearly indicating the walking route is registered in the map information DB 121, and the display is possible only after the map information around the two stations in the walking section is read.

FIG. 9 is a display screen example of map information and walking routes of other walking sections. In the example of FIG. 9, a walking route with a required travel time of 8 minutes with a walking section between Shin Itabashi (station) and Shimo Itabashi (station) is displayed together with map information around each station. As in this display screen example, each station, walking route, and route name (Toei Mita Line in FIG. 9) can be edited so that they are displayed in the display area of the display of the user terminal 50.
Regarding the display of the walking route, if there are a plurality of walking sections included in the route search result, the walking route display 301 corresponding to each walking section is displayed in the search result content 300, so that a specific walking section is displayed. It can also be configured such that only a walking route can be arbitrarily selected and displayed.
Note that a map information may be arbitrarily enlarged or reduced by a user operation, or a function for displaying a route search result and a walking route on the same screen may be added. This function itself can be easily realized by using a known technique.

  The search condition input unit 220 is for receiving a search condition from the user terminal 50 and has a rule table 221. The rule table 221 records rules for verifying the consistency of the accepted search conditions. For example, a rule for prompting confirmation when the name of the accepted station exists in a plurality of regions, or a rule for determining that the accepted allowable walking time is an input error (for example, a value exceeding 30 minutes is input. If so, a confirmation alert is displayed).

[Operational form]
Next, an operation mode example of the route search system 1 of the present embodiment will be described. Here, the user registers several walking sections in the route search server 10 through the user terminal 50, and specifies the departure station, the destination station, and the allowable walking time from the user terminal 50 as search conditions. An example will be described in which the search tool 110 searches for a route with a short total required time among route candidates from the departure station to the destination station.

The user accesses the route search server 10 from the user terminal 50 and through the walking section registration unit 114, the walking section recognized by the user, for example, the above-mentioned Yushima (station) -Ueno Okachimachi (station) or Shin Itabashi Enter a walking section such as (Station)-Shimoitabashi (Station) along with the required time between stations. When inputting, a route or station name candidate window is displayed, and the user can select one to simplify the input operation. The positions of the two stations (latitude information and longitude information) are automatically transferred from the operation information DB 112. The registration date is automatically created, and for the user ID, for example, identification information of the user terminal 50 is transcribed.
The walking section registration unit 114 adds a reliability flag of “0” to the input walking section, creates the walking section specifying table 201 having the contents shown in FIG. 5 in the new case, and already exists. In this case, it is added and registered in the walking section DB 113. Thereby, the said walk area can be referred as one of the object areas of route search with operation network data.

  The route search by the route search tool 110 is executed according to the procedure of FIG. That is, when the search condition including the departure station, the destination station, and the allowable walking time is received from the user terminal 50 (step S101: Yes), the route search tool 110 stores the operation network data and the walking section stored in the operation information DB 112. The information on the walking section stored in the DB 113 is accessed, and based on the received search condition, a dynamic search for a route candidate from the departure station to the destination station is started (step S102).

In the search process, it is determined whether there is a station that can be moved to a nearby station on foot between the departure station and the destination station, that is, a midway station or a transfer station (step S103). A search is performed (step S103: No, S104).
When there is an intermediate station or a transfer station, the required time between stations associated with the station is compared with the allowable walking time included in the search condition (steps S103: Yes, S105). If the required time between stations is equal to or less than the allowable walking time, a walking section connecting the intermediate station and the neighboring station is included in one of the search target sections as in the inter-station search (step S106). It is determined whether or not the destination station has been reached (step S107). If it has not arrived, the process returns to step S103 (step S107: No). On the other hand, if it has arrived, the dynamic search is terminated and the user terminal For example, the route search result is output to the search result screen 300 as shown in FIG. 7 on the display 50 (step S108: Yes, S109).

The procedure when it is detected that the walking route display 301 of the user terminal 50 is clicked is as shown in FIG.
That is, the route search tool 110 monitors whether or not the click operation has been performed after outputting the route search result (step S201). When it is detected that the click operation has been performed, the route search tool 110 stores in the walking section DB 113 and the map information DB 121. The information is acquired by accessing the two stations in the walking section, the map information around each station, and the information necessary for forming the walking route, and the acquired information is transmitted to the map information editing unit 211 (steps S201: Yes, S202).
The map information editing unit 211 edits the walking route so that the walking route is clearly shown in an appropriate size in the map information around the two stations in the walking section (step S203), and the edited map information is separated from the existing one. The screen information is output to the user terminal 50 (step S204).
Thereby, the map information and walking route of the said walk area like FIG. 8 or FIG. 9 are displayed on the display of the user terminal 50 on a screen different from the search result screen 300, for example.

  In addition, when editing the map information, the map information editing unit 211 can highlight the walking route connecting the middle station that is the starting point of the walking section and the neighboring station that is the ending point with a thick line or conspicuous coloring. It is preferable to do so.

  As described above, in the route search system 1 of the present embodiment, the walking section registered in the walking section DB 113 is used as one of the next sections from the intermediate station between the departure station and the destination station in the operation data network data. Since it can be incorporated, it is possible to perform a route search reflecting the actual situation that walking at a station on the way may arrive at the destination station earlier and the intention of the user who wants to walk (may walk). it can.

Since the walking section DB 113 stores walking section information based on the experience of many users using the route, it is possible to search the route according to the actual situation of the route network, and to improve the satisfaction of the user by using the system. it can.
Of the walking sections registered in the walking section DB 113, by updating the reliability flag of the frequently used walking section or the actually verified walking section from “0” to “1” at the time of registration, Since this walking section can be used for route search, the operation network data is prepared and the accuracy of identifying the optimum route candidate is improved.

Although the present embodiment is as described above, the present invention is not limited to the above-described embodiment, and various modifications can be made as follows.
(1) In the present embodiment, an example in which the search condition includes an allowable walk time has been described. However, even if the allowable walk time is not specified, the walking route of the walking section in the conventional route search may be displayed on the display. good.
(2) In the present embodiment, the search conditions input by the user are exemplified by the allowable walking time, the departure station and the destination station, but time information such as the scheduled departure time, the estimated arrival time, and the use time zone, or When the walking section can be specified, the search station may include a halfway station that is the starting point. In order to make the search result more accurate, it can be a preferable mode.
(3) When calculating the total required time from the departure station to the destination station when the optimal route candidate including the walking section is identified, the required time from the getting-off platform at the middle station to the starting point of the walking section It can also be calculated by adding the required time from the end point of the walking section to the boarding platform of a nearby station on another route. Thereby, a more accurate required time can be calculated. These times may be added to the time required for walking in advance.
(4) In the present embodiment, the operation information DB 112, the walking section DB 113, and the map information DB 121 have been described as existing independently. However, the operation information DB 112, the walking section DB 113, and the map information DB 121 may be replaced with one or a plurality of integrated DBs.
(5) Moreover, although this embodiment is provided with each of operation information DB112, walk area DB113, and map information DB121 in the route search server 10, it can access from the route search server 10 not only in this example. Any configuration may be used as long as it is configured. For example, only the map information DB 113 may exist in an external server on the Internet, or the map information display function may be realized by, for example, a link with a commercial DB. That is, in the processing of FIG. 11 (steps S202 and S203), the station code and latitude / longitude of two stations that are walking sections are transmitted to the commercial DB, and between the two stations from the commercial DB fits on exactly one screen. The map information of the size and the walking route on the map may be acquired, and the acquired information may be edited by the map information editing unit 211 of the route search server 10.
(6) Further, the route search server 10 may be provided with various functions of the information terminal service server 20.
(7) The reliability flags are not only two, “0” and “1”, but are quantified in multiple stages so that the reliability increases as the number increases, for example, “0” to “5”. May be incorporated as part of the operation network data (incorporation into the operation information DB 112 or opening of the walking section DB 113).

  DESCRIPTION OF SYMBOLS 10 ... Route search server, 20 ... Information terminal service server, 50 ... User terminal, 60 ... Mail server, 100 ... Data communication interface, 110 ... Route search tool, 111. .. Route search engine, 112... Operation information DB, 113... Walk section DB, 114... Walk section creation section, 115. ... Map information DB, 122 ... Registration unit, 200 ... Interface for information terminal, 210 ... Service control unit, 211 ... Map information editing unit, 220 ... Search condition input unit, 221 ... Rule table, 300 ... Search result screen, N ... Public communication network.

Claims (5)

An operation network data holding means for indicating the connection of stations where trains, trains or buses get on and off, and for the stations that can be walked to nearby stations on different routes, holding operation network data associated with the required time between stations by walking, and Access means for accessing map information holding means capable of acquiring map information for each station area;
An accepting means for accepting a search condition including an allowable walking time indicating a departure time of the departure station, the destination station, and a user allowable walking movement;
Accessing the operation network information holding means through the access means, based on the search conditions received by the reception means, dynamically search for a route candidate from the departure station to the destination station in the operation network data, If there is a midway station that can be moved to the neighboring station on foot between the departure station and the destination station, and the required time between stations associated with the midway station is less than the allowable walking time Route search means that enables searching for a route candidate including a walking section connecting the intermediate station and the neighboring station;
When the walking section is included in the route candidate specified by the route search, the map information holding means is accessed to acquire the map information around the station on the way, and the walking section is clearly indicated in the acquired map information. Comprising map information editing means for outputting,
Route search system. It further comprises a walking section registration means for registering a walking section including a station that can be walked to the neighboring station and the required time between the stations starting from the station,
The route search means performs a route search by including the walking section registered by the walking section registration means in the operation network data held by the operation network data holding means.
The route search system according to claim 1. The registration means records a reliability flag that quantitatively represents the reliability of the registered walking section in association with the walking section and is renewably recorded, and whether or not the latest reliability flag indicates a predetermined quantitative value The walking network holding means as a part of the operation network data when the predetermined walking distance is indicated,
The route search system according to claim 1 or 2. Represents the connection of stations where trains, trains or buses get on and off, and for stations that can be moved to nearby stations on different routes, it is possible to obtain operation network data associated with the time required for walking between stations and for each station area A route search method executed by an apparatus having an access means for accessing map information,
Access to the operation network data triggered by reception of a search condition including an allowable walking time indicating a departure time, a destination station, and a time when the user can allow walking movement,
Based on the received search condition, the route candidate from the departure station to the destination station in the operation network data is dynamically searched, and it is possible to move to the neighboring station on foot between the departure station and the destination station. If a halfway station exists and the required time between stations associated with the middle station is equal to or shorter than the allowable walking time, search for route candidates including a walking section connecting the middle station and the neighboring station Enable
When the route candidate specified by the route search includes a walking section from the intermediate station to the neighboring station, the map information is accessed to acquire map information around the intermediate station, and the acquired map information includes the map information Specify the walking section and output it.
Route search method. A computer program for operating a server connected to a user terminal via a public line network as a route search system that performs a route search in response to a route search request from the user terminal,
The server,
An operation network data holding means for indicating the connection of stations where trains, trains or buses get on and off, and for the stations that can be walked to nearby stations on different routes, holding operation network data associated with the required time between stations by walking, and Access means for accessing map information holding means capable of acquiring map information for each station area;
Accepting means for accepting a search condition including an allowable walking time indicating a departure time of the departure station, the destination station, and a user allowable walking movement;
Accessing the operation network information holding means through the access means, based on the search conditions received by the reception means, dynamically search for a route candidate from the departure station to the destination station in the operation network data, If there is a midway station that can be moved to the neighboring station on foot between the departure station and the destination station, and the required time between stations associated with the midway station is less than the allowable walking time Route search means for enabling search for route candidates including a walking section connecting the intermediate station and the neighboring station;
When the walking section is included in the route candidate specified by the route search, the map information holding means is accessed to acquire the map information around the station on the way, and the walking section is clearly indicated in the acquired map information. Map information editing means to output;
A computer program that functions as a computer program.