JP6460800B2 - Itinerary search system and itinerary search program - Google Patents

Description

  Embodiments described herein relate generally to an itinerary search system and an itinerary search program.

  With recent information communication technology, various information is provided via a communication network such as the Internet. One of them is transit guidance information for transportation. By entering the departure point, the destination, the time at which the user wants to arrive at the destination, the departure time from the departure point, etc. It provides train transfer information such as whether to transfer at a station.

  In a route search service that provides transfer guidance information, various methods for providing optimal transfer guidance information to users have been proposed. As a basic service in this route search, guidance is given when departing at a designated time or arriving at a designated time.

  In the current route search, guidance when the departure point or arrival point is designated, or guidance that is optimal for the required time of the route is performed. The optimum guidance is a route search result that minimizes an evaluation value such as a short required time, a low price, and a small number of transfers. However, as an actual form of human behavior, such as when there is room in the time from the current time to the destination when going out, etc. You may want it. For example, we know that we can go to the destination in about 30 minutes, but there are about 2 hours before the meeting time, so there are some facilities that are interested in the direction of the destination, and when to use it If you want a schedule such as whether to arrive at.

JP 2003-139553 A JP 2000-168939 A Japanese Patent No. 5026945

  In searching for a route within an allowable time by combining public transportation and facilities, it has been difficult to search for a plurality of routes that satisfy a condition within a practical time from the viewpoint of computational complexity.

  The problem to be solved by the present invention is to provide an itinerary search system and an itinerary search program that realize this by minimizing the number of nodes and the number of arcs constituting the search network.

  In order to achieve the above object, an itinerary search system according to an embodiment includes a first storage unit that stores network data of public transportation, a facility table that stores facility attributes, and a station that stores movement information between stations. A second storage means for storing at least a facility movement table and an inter-facility movement table for storing movement information between facilities; and the first storage means is searched based on input information of a starting point, a landing point, and an allowable time. The basic network generating means for generating a basic network from the starting point to the landing point within the allowable time, and the second storage means, and connected to each station corresponding to the searched basic network A facility network generating means for dynamically generating a facility network; and combining the basic network and the facility network to obtain the starting point And having a path generating means for generating a movable facility network path within the allowable time until the deposition point.

  The itinerary search system according to the embodiment includes an input unit, a first storage unit that stores network data of public transportation, a facility table that stores facility attributes, and a station facility that stores movement information between stations. A second storage unit that stores at least a movement table and an inter-facility movement table that stores movement information between facilities; and the first information based on input information indicating a starting point, a landing point, and an allowable time from the input unit. A plurality of basic networks searched with reference to the second storage means; and basic network generation means for searching the storage means and generating a plurality of basic networks from the starting point to the landing point within the allowable time. Facility network generating means for dynamically generating a facility network connected to each station according to the network, the basic network, and the facility network Route generation means for generating a plurality of facility network routes that can move within the allowable time from the starting point to the destination point, and a user based on the plurality of facility network routes And an output means for outputting a facility route guidance list that can be provided.

  The itinerary search program according to the embodiment includes a first storage unit that stores network data of public transportation, a facility table that stores facility attributes, a station facility movement table that stores movement information between stations, and An itinerary search program for an itinerary search system having at least a second storage means for storing an inter-facility movement table for storing movement information between facilities based on input information of a departure point, a landing point, and an allowable time A function to search the first storage means and generate a basic network from the starting point to the landing point within the allowable time, and according to the searched basic network with reference to the second storage means The function of dynamically generating a facility network connected to each station, and the basic network and the facility network are combined, from the starting point A function of generating a plurality of facility network paths movable within the allowable time until serial attachment point, characterized in that realized by a computer.

  Further, the itinerary search program according to the embodiment includes a first storage unit that stores network data of public transportation, a facility table that stores facility attributes, a station facility movement table that stores movement information between stations, and An itinerary search program for an itinerary search system having at least a second storage means for storing movement information between facilities for storing movement information between facilities, and an input indicating a starting point, a landing point, and an allowable time from a user A function of receiving information, a function of searching the first storage means based on the input information, and generating a plurality of basic networks from the starting point to the landing point within the allowable time, and the second storage Means for dynamically generating a facility network connected to each station corresponding to the searched plurality of basic networks, and the basic network A function that generates a plurality of facility network paths that can be moved within the allowable time from the starting point to the landing point by combining a work and the facility network, and is used based on the plurality of facility network paths And a function of outputting a facility route guidance list that can be provided to a person is realized by a computer.

  According to the embodiment, the user can specify the starting point, the landing point, and the allowable time, and the allowable time can be effectively utilized by dynamically guiding the facility that stops within the allowable period.

It is a block diagram which shows the structure of the itinerary search system which concerns on embodiment. The facility DB according to the embodiment is a diagram illustrating an example of a facility table, a station facility movement table, and an inter-facility movement table. It is a flowchart which shows operation | movement of the itinerary search system which concerns on embodiment. An example of the basic network produced | generated by the basic network production | generation part of the itinerary search system which concerns on embodiment is shown. The figure which shows an example of the facility network of the 1st path | route searched in FIG. 4, and the station facility movement table and inter-facility movement table in a 1st path | route are shown. The figure which shows an example of the facility network of the 2nd path | route searched in FIG. 4, and the station facility movement table and inter-facility movement table in a 2nd path | route are shown. It is a figure which shows an example of the facility route guidance list produced in the output part. It is a figure which shows an example which displayed the movement route corresponding to the path | route 674 of FIG. 6 on the map. It is a figure which shows an example of the path | route list | wrist of four moving routes shown in FIG. It is a figure which shows the example which searched the facility network simultaneously using the 1st path | route and the 2nd path | route. It is the figure which created the tour course by setting the same place as a starting point and a landing point.

  Hereinafter, an itinerary search system and an itinerary search program according to embodiments of the present invention will be described with reference to the drawings.

  The basic idea of the itinerary search system and the itinerary search program according to the embodiment is to first search for a core part of a route network based on public transportation. This uses the route search of public transportation such as trains, buses, and airplanes currently being performed. However, when the departure point and the arrival point are close, a basic route by foot may be created. Next, a facility where a derived route can be created is extracted from this backbone. As an extraction method, the nearest station for the facility can be calculated in advance. Alternatively, it can be dynamically calculated from position information. Route search is performed in the route network that combines the derived route of the extracted facility and the route of the main part of public transportation. Here, although the shortest route is a route that does not stop at any of the derived facilities, by searching up to the n-th route, a route that can be used within the allowable time can be searched within a practical time.

  FIG. 1 is a block diagram illustrating a configuration of an itinerary search system according to an embodiment.

  In FIG. 1, an input unit 10 inputs a starting point, a landing point, an allowable time, a narrowing-down condition described later, and the like for a route search from a user. The input unit 10 receives a search request from an application such as a portable terminal owned by a user or an office personal computer, and a starting point, a landing point, and an allowable point for a route search input via a network (not shown). It may have a function of receiving time and the like. The allowable time is the time from the departure point including the free time to the arrival at the arrival point. The starting point and the landing point may be any place (address), station, facility, etc., and are arbitrarily set by the user.

  The basic network generation unit 20 accesses the public transport network data 30 based on the starting point, the landing point, and the allowable time input from the input unit 10, and public transportation between the starting point and the landing point (destination). Perform one or more route searches using. That is, it is a route search engine that guides routes using general public transportation. Here, it is assumed that all the schedule information of trains, buses, airplanes, etc. of necessary public transportation is stored in the network data 30 of public transportation, but retrieved and retrieved from the database of individual transportation The result data may be stored. The shortest route obtained here is a route that does not stop anywhere. And, route according to the type of vehicle (for example, rapid, special rapid, express, express, express), if there are multiple routes to reach the destination (destination), route for each route, transfer A route (route) that can be moved within a permissible time from the starting point to the landing point, such as a route in, is searched. However, it is desirable that the number of routes to be searched is determined in advance and adopted in order from the main route.

  The facility network generation unit 40 refers to the facility DB (database) 50 and creates a network of facilities adjacent to each station on the route searched and created by the basic network generation unit 20. The facility DB 50 includes a facility table 50a, a station facility movement table 50b, and an inter-facility movement table 50c.

  FIG. 2 shows an example of a facility table 50a, a station facility movement table 50b, and an inter-facility movement table 50c stored in the facility DB (database) 50. The facility table 50a includes “facility ID”, “facility name”, “coordinates”, “required time”, “type”, “evaluation”, and the like. In this example, the above-mentioned “facility ID”, “facility name”, “coordinates”, “required time”, “type”, and “evaluation” data of the Sky Tree Tower, Oedo Castle, Toyo Museum, and Noyama Zoo are stored in the facility table 50a. An example is shown. By referring to this facility table 50a, the attribute information of each facility registered there can be known.

  The station facility movement table 50b includes “station ID”, “facility ID”, “time”, and the like. “Time” indicates a travel time on foot between the station indicated by “Station ID” and the facility indicated by “Facility ID”. Here, the travel time is determined by walking, but it may be travel time using a vehicle such as a bus or taxi. Moreover, what stored "time" for every moving means, such as a walk, a bus, and a taxi, may be used. Instead of this “time”, the distance between the station indicated by the “station ID” and the facility indicated by the “facility ID” may be stored, or both of the data may be stored. When “distance” is stored, if it is a movement by walking, for example, 1 minute may be converted to 60 m. In the case of movement by car, it is preferable to provide position information and obtain travel time from car navigation technology or the like.

  By referring to this station facility movement table 50b, the required time (or required distance) between each station registered there and each facility can be known. However, it is desirable to minimize the number of registered data by adding restrictions to the data to be registered depending on the required time (or required distance) between the station and the facility.

  The inter-facility movement table 50c includes “starting facility ID”, “ending facility ID”, “time”, and the like. “Time” indicates a travel time on foot between the facility indicated by “starting facility ID” and the facility indicated by “end facility ID”. Here, the travel time is determined by walking, but it may be travel time using a vehicle such as a bus or taxi. Moreover, what stored "time" for every moving means, such as a walk, a bus, and a taxi, may be used. Instead of this “time”, the distance between the station indicated by the “starting facility ID” and the facility indicated by the “ending facility ID” may be stored, or both may be stored. Similarly, when “distance” is stored, if it is a movement by walking, for example, 1 minute may be converted to 60 m. In the case of movement by car, it is preferable to provide position information and obtain travel time from car navigation technology or the like.

  By referring to the inter-facility movement table 50c, the required time (or required distance) between each facility registered in each facility and each facility can be known. However, it is desirable to minimize the number of registered data by adding restrictions on the data to be registered according to the required time (or required distance) between the facilities.

  Returning to FIG. 1, the route generation unit 60 combines the basic network created by the basic network generation unit 20 and the facility network created by the facility network generation unit 40 within an allowable time from the starting point to the landing point. Create a moving facility network route. The route generation unit 60 creates a facility network route of the route list that satisfies the search condition, and deletes the route list that does not satisfy the route list. Further, referring to “evaluation” in the facility table 50a, an evaluation value is assigned to each route list. Those with a high evaluation value may be provided to the user as one of the recommended courses. Moreover, you may provide to a user as one of the judgment of popularity degree or congestion degree using an evaluation value.

  The route list narrowing unit 70 uses, for example, a facility network based on facility narrowing conditions (for example, the type of facility desired by the user) input from the input unit 10 from the facility network route created by the route generation unit 60. The route is narrowed down and the result is output to the output unit 80.

  The output unit 80 outputs a facility route guidance list that can be guided to the user based on the route list from the route list narrowing unit 70, a map showing a stop-by route, and the like. The output unit 80 may have a function of transmitting a search result to an application such as a mobile terminal owned by a user who has made a search request or an office personal computer.

  FIG. 3 is a flowchart of the itinerary search program showing the operation of the itinerary search system according to the embodiment. 4 to 7 are diagrams specifically showing the basic operation of the itinerary search system by the itinerary search program. The basic operation of the itinerary search system by the itinerary search program will be described below with reference to FIGS.

  First, when the input unit 10 receives a route search request from a user, the input unit 10 passes to the basic network generation unit 20 search conditions such as a departure point, a landing point, and an allowable time included in the route search request. (Step S10 in FIG. 3). Then, the basic network generation part 20 accesses the network data 30 of public transport, performs route search, and produces | generates one or more basic networks (step S20 of FIG. 3).

  FIG. 4 shows an example of a basic network created by the basic network generation unit 20. In FIG. 4, S is a starting point and G is a landing point. Nodes 1 to 5 are the nearest stations between the departure point and the arrival point, and the first route passing through the node 1 -node 2 -node 3 by the basic network generation unit 20. , Node 1 -node 4 -node 2 -node 3 indicates that the second route is retrieved.

  Next, the facility network generation unit 40 creates a network of facilities that can be visited from each station (node) of each route created by the basic network generation unit 20 with reference to the facility DB (database) 50 (FIG. 3). Step S30).

  5A illustrates an example of the facility network of the first route illustrated in FIG. 4 created by the facility network generation unit 40. FIG. 5B shows an example of the station facility movement table 50b at this time. FIG. 5C shows an example of the inter-facility movement table 50c at this time. Here, the station ID “801” of the station facility movement table 50b indicates the station of the node 1 of FIG. 4, the station ID “802” indicates the station of the node 2 of FIG. 4, and the station ID “803” indicates that of FIG. It is assumed that the station of node 3 is shown.

  The facility network generation unit 40 refers to the station facility movement table 50b and the inter-facility movement table 50c to create the facility network shown in FIG. In addition, attributes of each facility on the facility network are defined by the facility table 50a. That is, the facility network generation unit 40 arc connects the facility IDs “201” and “202” to the station ID “801”, arcs the facility ID “250” to the station ID “802”, and sets the station ID “803”. A facility network of the first route in which facility IDs “280” and “281” are arc-connected is created. That is, the dynamically related facility can be combined with the first route searched by the basic network generation unit 20.

  FIG. 5A illustrates an example of the facility network of the second route illustrated in FIG. 4 created by the facility network generation unit 40. FIG. 5B shows an example of the station facility movement table 50b at this time. FIG. 5-2 (c) shows an example of the inter-facility movement table 50c at this time. However, the description of the table contents overlapping with FIG. 5A is omitted. The station ID “804” in the station facility movement table 50b indicates the station of the node 4 in FIG. 4, and the other points are the same as those in FIG. The facility network generation unit 40 refers to the station facility movement table 50b and the inter-facility movement table 50c, and creates the facility network shown in FIG. That is, the dynamically related facility can be combined with the second route searched by the basic network generation unit 20. Although the facility network is separately searched for the first route and the second route here, the facility network may be simultaneously searched for two routes as will be described later.

  Next, the route generation unit 60 combines the basic network created by the basic network generation unit 20 and the facility network created by the facility network generation unit 40 to create a facility network route and a route list based on the facility network route. At this time, the route generation unit 60 can also assign an evaluation value for each route list with reference to “evaluation” in the facility table 50a (step S40 in FIG. 3).

  Next, the route list narrowing unit 70 selects, for example, facility narrowing conditions (for example, the facility desired by the user or the type of facility or a high evaluation value) from the route list created by the route generating unit 60. Based on this, the facility network route is narrowed down (step S50 in FIG. 3). Then, the output unit 80 creates and outputs a facility route guidance list that can be used by the user (step S60 in FIG. 3).

  Next, time calculation between the station and the facility will be described. In the basic network generation unit 20, the required time between stations in a route obtained by route search using existing public transportation is obtained. Therefore, if the required time between the station and the facility and between the facility and the facility is known, it is possible to create a course within the allowable time requested by the user.

  For example, in FIG. 5A, facility IDs “201” and “202” exist as facilities connected to the station node 801, and this facility is visited. By referring to the station facility movement table 50b and the inter-facility movement table 50c, the movement time between the station node 801 and the facility ID “201” is 10 minutes, and the movement time between the station node 801 and the facility ID “202” is Information of 25 minutes is obtained for the movement time between the facility ID “201” and the facility ID “202” for 15 minutes. Similarly, a facility ID “250” exists as a facility connected to the station node 802, and it is assumed that this facility is stopped. Then, information of 22 minutes is obtained for the travel time between the station node 802 and the facility ID “250”. Similarly, facility IDs “280” and “281” exist as facilities connected to the station node 803, and it is assumed that these facilities are stopped. The travel time between the station node 803 and the facility ID “280” is 28 minutes, the travel time between the station node 803 and the facility ID “281” is 17 minutes, and the travel between the facility ID “280” and the facility ID “281”. Information about 40 minutes can be obtained. By adding the travel time and the required time at the facility obtained by referring to the facility table 50a, a route list indicating the facility guidance route that can be visited within the allowable time set from the input unit 10 can be created. it can.

  The time required for the facility may be incorporated within the travel time (travel cost). For example, the travel time between the station node 801 and the facility ID “201” is 10 minutes, but a value (10 + 30/2 = 25) obtained by adding 1/2 of the required time 30/30 of the facility ID “201” is the travel time. It is also good. For example, in the case of a round trip between the station node 801 and the facility ID “201”, a total time of 50 minutes is calculated. Also, the node numbers may be divided by entering and leaving the same station. For example, by setting the station ID when leaving the station node 802 as the station node 802a and the station ID when returning as the station node 802b, the network for performing the route search can be simplified.

  In the itinerary search system of the embodiment, the route list is created by the depth-first search. During the creation of the route list, the search for the route that visited the same node as the route exceeding the allowable time for the second time was terminated. Note that a known route search algorithm may be applied instead of the depth-first search. For example, a Yen algorithm (Jin Y. Yen 1971) or the like may be used as a known algorithm for extracting the k-th route search (K Shortest Path: KSP).

  FIG. 6 is a diagram illustrating an example of the facility route guidance list created by the output unit 80. As shown in FIG. 6, the facility route guidance list is time-series according to the search route from the departure point to the destination (destination) by public transportation, the walking time, and the stopping facility stay time. Is shown in

  The example of FIG. 6 shows an example in which a route search is performed by setting “Nishiazabu” as the starting point, “Ginza” as the landing point, and “120 minutes” as the allowable time. Here, in order to simplify the calculation, it is assumed that the stay time (stop time) of each facility is 20 minutes.

  In the route 674 on the left side of FIG. 6, after stopping at (1) Aoyama Park-(2) Roppongi Hills Sky Deck around the departure point, take the Toei Oedo Line and move to Daimon-Hamamatsucho (3) An example of a route that stops at the World Trade Center building and moves to Yurakucho on the JR Yamanote Line. The required time for this route is “105 minutes”, of which the travel time on foot is “34 minutes”.

  FIG. 7 shows an example of a map showing a stop-by route, in which a travel route corresponding to the route 674 created by the output unit 80 is displayed on the map. Here, the transition diagram of the moving route (FIG. 6) and the map showing it (FIG. 7) are shown separately because of the size of the drawing, but the transition diagram of the moving route and the map showing it are shown. Are displayed simultaneously, it is possible to provide a route search result that is easier for the user to understand.

  In the route 139 on the left side of the center of FIG. 6, after taking the Toei Oedo Line from the starting point, move to Daimon-Hamamatsucho, and then take the JR Yamanote Line to Yurakucho. (1) Mitsu Aida Museum-(2 ) Mitsubishi Ichigokan Museum-(3) Shows examples of routes to stop at each facility in Yomiuri Hall. The required time for this route is “118 minutes”, of which the travel time on foot is “47 minutes”.

  In the route 444 on the right side of the center in FIG. 6, from the starting point, take the Toei Oedo Line to Daimon-Hamamatsucho, (1) Stop at the World Trade Center Building facility, and take the JR Yamanote Line to Yurakucho. Later, (2) Mitsuo Aida shows an example of a route to stop at each facility in the museum-(3) Yomiuri Hall. The required time for this route is “112 minutes”, of which the travel time on foot is “41 minutes”.

  In the route 149 on the right side of FIG. 6, (1) Aoyama Park around the departure point from the departure point, then take the Toei Oedo Line and move to Daimon-Hamamatsucho. (2) Former Shiba Rikyu Garden (3) An example of a course that stops at the Imperial Hotel after traveling to Yurakucho on the JR Yamanote Line. The required time for this route is “118 minutes”, of which the travel time on foot is “47 minutes”.

  FIG. 8 shows a route list of the four route search routes shown in FIG. 6 created by the route generator 60.

  The route list 100 includes items such as a route number, a required time, the number of stop-off facilities, a walking time (minutes), a facility / walking time, variation, a departure point / destination point closeness, and a shortest similar route. Since the route number, the required time, the number of stop-off facilities, and the walking time (minutes) are as described above, redundant description is omitted.

  “Facilities / walking time” indicates the ratio of facilities that can be visited per unit time in walking movement. The calculation formula is obtained as facility / walking time = number of facilities / total walking time.

  For example, the facility / walking time of route 674 is 3/34 = 0.088. Similarly, 3/47 = 0.064 in the path 139, 3/41 = 0.073 in the path 444, and 3/47 = 0.064 in the path 149.

  The calculated facility / walking time can be used for narrowing down route search routes (step S60 in FIG. 3). For example, if the user wants to travel efficiently with less walking time, a larger value of facility / walking time may be selected. On the other hand, if you want to increase the walking time in order to eliminate the lack of exercise, you should select a smaller value for the facility / walking time.

  Next, “variation” is a value indicating whether or not the facilities that stop by exist uniformly in the route or are concentrated in one place. For example, if “variation” = total number of movements between stations / facilities / total number of movements, the value increases if there is a uniform number, and the value decreases if concentrated. In the four route search routes described above, the route 139 shows the smallest value, and it can be seen that the drop-in facilities are concentrated. This calculated variation value can be used to narrow down the route search route. For example, if the user concentrates and wants to drop in at the facility, a value with a small variation value may be selected. Also, if the user wishes to have a variation in the facility, a value with a large variation value may be selected. Note that other calculation formulas than the above calculation formulas may be used as long as they represent concentration and variation.

  Next, “close to the departure point / arrival point” is a value indicating whether the facility to stop by is near the arrival point (destination) or near the departure point. For example, “starting point / close to landing point” = (total number of arcs where arrival is a facility (arc appearance order−total number of arcs of path / 2)) / total number of arcs of path. Here, the appearance order of arcs indicates the order in which the arcs appear when the arrival point of the route is connected to the arrival point. For example, if there is a route of A → B → C, A → B is first and B → C is second. In the above formula, the value is positive if the facility is near the destination (destination) and negative if the facility is near the departure point.

  For example, a calculation example of “starting point / coming point close” on the route 674 is shown below.

The route pattern of route 674 is departure point-a-facility-b-facility-c-station-d-station-e-facility-f-station-g-station-h-arrival point. Lower case letters are expressed as moving parts.
Total movement = {a, b, c, d, e, f, g, h}
Total number of arcs in the path = 8, Total number of arcs in the path / 2 = 4
The order of arcs where arrival is a facility = {a: 1, b: 2, e: 5}
The arrival of the arc that is the facility (appearance of the arc−total number of arcs of the path / 2) = {1−4, 2−4, 5−4}
= {-3, -2, 1}
The total number of arcs where the arrival is a facility (appearance of arcs—total number of arcs in the path / 2) = − 3 + −2 + 1 = −4

  Finally, a value obtained by dividing the calculated value by the total number of arcs of the route = −4 / 8 = −0.5 is a value of “close to starting point / ending point”. As a result, since the obtained value is “negative”, it can be determined that it is closer to the starting point.

Similarly, when calculating the value of “starting / ending point” of the route 149,
The route pattern of route 149 is departure point-a-facility-b-station-c-station-d-facility-e-station-f-station-g-facility-h-arrival point.
Total movement = {a, b, c, d, e, f, g, h}
Total number of arcs in the path = 8, Total number of arcs in the path / 2 = 4
The order of arcs where arrival is a facility = {a: 1, d: 4, g: 7}
The arc whose arrival is the facility (appearance of arc-total number of arcs of the path / 2) = {1-4, 4-4, 7-4}
= {-3, 0, 3}
The total number of arcs whose arrival is a facility (appearance of arcs—total number of arcs in the path / 2) = − 3 + 0 + 3 = 0

  Finally, a value obtained by dividing the calculated value by the total number of arcs on the route = 0/8 = 0 becomes a value of “close to starting point / landing point”. As a result, since the obtained value is “0”, it can be determined that the vehicle is neither near the starting point nor near the landing point.

  In the four route search routes described above, the route 674 has a negative value, so it can be seen that there is a stop-by facility near the departure point. In addition, since the route 139 and the route 444 are positive values, it is understood that there is a stop-by facility near the arrival point (destination). The calculated “starting point / coming point close” value can be used to narrow down the route search route. For example, if the user wants to stop at the facility near the landing point, a positive value may be selected as the value of “starting point / close to landing point”. On the other hand, if you want to stop by the facility near the starting point, you should select a negative value for the “starting point / coming point” value. On the other hand, if it is desired to drop in all over, it is better to select “0” as the value of “starting point / coming point”. Other than the above-described calculation formulas, other calculation formulas may be used as long as they represent the same contents.

  Next, “Similar among similar routes” refers to routes that stop at the same facility group as similar routes, and when there are multiple similar routes, the route generation unit 60 selects only the route with the shortest required time. , A predetermined symbol is given. Thus, for example, if the user specifies that “If the user passes through the same facility group, the route other than the one with the shortest time will be deleted”, the route will be narrowed down to only those with the “Similar route shortest” mark. Can be provided as a search result of route search.

  An operation for narrowing down other routes using the route list 100 described above by the route list narrowing unit 70 will be described. For example, when other conditions are the same, when it is desired to select a shorter required time (the required time in this case means the time from the starting point to the landing point), the “required time” in the route list 100 is small. The narrowing may be set to extract time. As a result, the time difference between the allowable time and the required time at the time of input becomes large, and even if an accident is encountered during the movement, the user can act with a margin, so the user can act with peace of mind. Here, the direction with the shorter required time is selected, but the present invention is not limited to this. For example, a route with a low cost or a route with a high evaluation may be selected.

  Further, when the user desires a larger number of visiting facilities, the narrowing may be set so as to extract a route having a larger “number of visiting facilities” in the route list 100.

  By performing such a narrowing process by combining a plurality of narrowing elements according to the user's wishes, it is possible to search for a desired stop route.

  When the route list narrowing unit 70 provides the user with a route list obtained as a result of the above-described narrowing, the user designates (clicks) the desired route number, whereby the route search shown in FIG. The itinerary search system provides the display data of the route or the display data of the route search route and the map shown in FIGS. 6 and 7 at the same time.

  Next, a modified example of the itinerary search system of the above-described embodiment will be described.

  FIG. 9 shows an example in which the facility network is searched simultaneously using the first route and the second route. In FIGS. 5A and 5B, the facility network is searched separately. However, the facility network generation unit 40 may search for the facility network simultaneously using a plurality of routes. In this case, a new third route can be created as shown in FIG. That is, in searching for the individual facility networks of the first route and the second route, a route in which the facility ID “556” is connected to the node 22 and the facility ID “723” is connected to the node 25 is extracted. In searching the facility network for the first route and the second route at the same time, the connection between the facility ID “556” and the facility “723” is established, and the third route is created. Thereby, the search result of the facility network in the first route to the third route can be provided to the user, and the service of the user can be further improved.

  FIG. 10 shows a diagram in which a tour course is created by setting the same starting point and landing point. In FIG. 10, a course that goes around the facility group A, the facility group B, and the facility group C from the departure point and returns to the arrival point (departure point) is a one-day excursion course. Also, a course that goes around the facility group A and the facility group B from the departure point and returns to the arrival point (departure point), or goes around the facility group A and the facility group C from the departure point to the arrival point (departure point). The returning course, or the course returning from the departure point to the arrival point (departure point) around the facility group B and the facility group C, is a half-day excursion course. Of course, the reverse course of the above-described course may be searched. In order to realize such a tour course, the station facility moving table 50b and the inter-facility moving table 50c shown in FIG. 2 may be prepared. Then, when the starting point and the landing point are the same place, the route generation unit 60 recognizes that a tour course has been created, and performs a route search around a plurality of facility groups that stop by the starting point. To provide.

  In this case, the starting point (landing point) may not be a station, but may be another facility, a bus stop, or another designated place. Moreover, the required time in each facility group A thru | or facility group C may set a part or all as free time, and may define the total required time for every facility group.

  Although several embodiments of the present invention have been described, these embodiments are presented by way of example and are not intended to limit the scope of the invention. These novel embodiments can be implemented in various other forms, and various omissions, replacements, and changes can be made without departing from the scope of the invention. These embodiments and modifications thereof are included in the scope and gist of the invention, and are included in the invention described in the claims and the equivalents thereof.

DESCRIPTION OF SYMBOLS 10 ... Input part 20 ... Basic network generation part 30 ... Public transport network data 40 ... Facility network generation part 50 ... Facility database 50a ... Facility table 50b ... Station facility movement table 50c ... Inter-facility movement table 60 ... Route generation part 70 Route list filtering unit 80 Output unit

Claims (20)

First storage means for storing public transport network data;
A second storage means for storing at least a facility table for storing facility attributes, a station facility movement table for storing movement information between stations, and an inter-facility movement table for storing movement information between facilities;
Basic network generation means for searching the first storage means based on input information of a starting point, a landing point, and an allowable time, and generating a basic network from the starting point to the landing point within the allowable time;
Facility network generation means for dynamically generating a facility network connected to each station corresponding to the searched basic network with reference to the second storage means;
Itinerary search characterized by comprising route generation means for combining the basic network and the facility network to generate a facility network route that can move within the allowable time from the starting point to the landing point system. Input means;
First storage means for storing public transport network data;
A second storage means for storing at least a facility table for storing facility attributes, a station facility movement table for storing movement information between stations, and an inter-facility movement table for storing movement information between facilities;
The first storage means is searched based on the input information indicating the starting point, landing point, and allowable time from the input means, and a plurality of basic networks from the starting point to the landing point within the allowable time are generated. Basic network generation means to
A facility network generating unit that dynamically generates a facility network connected to each station according to the searched plurality of basic networks with reference to the second storage unit;
Route generation means for combining the basic network and the facility network to generate a plurality of facility network routes that can move within the allowable time from the starting point to the landing point;
An itinerary search system, comprising: an output unit that outputs a facility route guidance list that can be provided to a user based on the plurality of facility network routes. First storage means for storing public transport network data is searched based on input information of starting point, landing point, and allowable time, and a basic network from the starting point to the landing point within the allowable time is generated. Basic network generation means to
With reference to a second storage means for storing at least a facility table for storing facility attributes, a station facility movement table for storing movement information between stations and a facility, and an inter-facility movement table for storing movement information between facilities, Facility network generation means for dynamically generating a facility network connected to each station according to the searched basic network;
Route generating means for combining the basic network and the facility network to generate a facility network route that can move within the allowable time from the starting point to the landing point;
An itinerary search system characterized by comprising: Input means;
First storage means for storing network data of public transportation is searched based on input information indicating a starting point, a landing point, and an allowable time from the input means, and the landing point is determined from the starting point within the allowable time. Basic network generation means for generating a plurality of basic networks up to
With reference to a second storage means for storing at least a facility table for storing facility attributes, a station facility movement table for storing movement information between stations and a facility, and an inter-facility movement table for storing movement information between facilities, Facility network generating means for dynamically generating a facility network connected to each station according to the plurality of basic networks searched;
Route generation means for combining the basic network and the facility network to generate a plurality of facility network routes that can move within the allowable time from the starting point to the landing point;
Output means for outputting a facility route guidance list that can be provided to a user based on the plurality of facility network routes;
An itinerary search system characterized by comprising: The path generation unit, the facility network required time to the deposition point at least from the starting point based on the route, drop number of facilities, among claim 1, characterized in that to create a route list indicating the time walk 4 The itinerary search system according to any one of the above. The itinerary search system according to claim 2 or 4 , further comprising narrowing means for narrowing down the plurality of facility network routes. The setting element of the narrowing-down means depends on one or a combination of facility type, facility evaluation, required time, number of stop-in facilities, walking time, facility / walking time, facility variation, departure point / arrival point The itinerary search system according to claim 6 , wherein the itinerary is a thing. The facility network generation means, according to any one of claims 1 to 4, characterized in that to create reference to the second storage means separately for each of the basic network separately the facility network Itinerary search system. 5. The itinerary search system according to claim 2, wherein the facility network generation unit simultaneously creates the facility network with reference to the second storage unit by using the plurality of basic networks simultaneously. In the station facility movement table, a movement distance or a movement time by a moving means including walking between each station and one or a plurality of facilities connected to the station is stored,
Wherein the inter-facility moving table, any one of the preceding claims, characterized in that the moving distance or travel time is stored by the moving means including a foot between the plurality of facility connected to each station 4 Itinerary search system described in the section . The facility route guidance list is shown in time series according to the search route, the travel time by public transportation from the departure point to the arrival point, the travel time by foot, and the stay time of the stop-off facility The itinerary search system according to claim 2 or 4 , characterized in that. 12. The itinerary search system according to claim 11 , wherein the output means simultaneously provides the facility route guidance list and a diagram showing the corresponding search route on a map. The route generating means treats the total number of nodes obtained from the basic network and the number of facilities connected to the station obtained from the facility network as the total number of nodes, and the facility and the nearest station. The itinerary search system according to any one of claims 1 to 4, wherein the total number of arcs is handled as the total number of arcs. In the synthesis of the basic network and the facility network, the route generation means creates the facility network route by assigning a different node number when returning from the station and returning from the station when returning from the station. The itinerary search system according to any one of claims 1 to 4 , characterized in that: The route generation means considers routes that stop at the same facility group as similar routes, and if there are a plurality of similar routes, selects a route with the shortest required time, a route with a low cost, or a route with a high evaluation value. 5. The itinerary search system according to any one of claims 1 to 4, wherein the facility network route is created. When the starting point and the landing point are the same place, the route generation unit recognizes that a tour course has been created, and performs a route search around a plurality of facility groups that stop by the starting point. The itinerary search system according to any one of claims 1 to 4 . The route list item further includes variation,
6. The itinerary search system according to claim 5 , wherein the variation indicates whether the facilities that stop by exist uniformly in the route or are concentrated in one place. The route list item further includes a departure point / end point approach,
6. The itinerary search system according to claim 5 , wherein the departure point / arrival point approach indicates whether the facility to stop by is near the arrival point (destination) or near the departure point. First storage means for storing network data of public transportation, a facility table for storing facility attributes, a station facility movement table for storing movement information between stations, and a facility for storing movement information between facilities An itinerary search program for an itinerary search system having at least second storage means for storing a movement table,
A function of searching the first storage means based on input information of a starting point, a landing point, and an allowable time, and generating a basic network from the starting point to the landing point within the allowable time;
A function of dynamically generating a facility network connected to each station according to the searched basic network with reference to the second storage means;
A function of combining the basic network and the facility network to generate a plurality of facility network routes that can move within the allowable time from the starting point to the landing point is realized by a computer. Itinerary search program. First storage means for storing network data of public transportation, a facility table for storing facility attributes, a station facility movement table for storing movement information between stations, and a facility for storing movement information between facilities An itinerary search program for an itinerary search system having at least second storage means for storing a movement table,
A function of receiving input information indicating a starting point, a landing point, and an allowable time from a user;
A function of searching the first storage means based on the input information and generating a plurality of basic networks from the starting point to the landing point within the allowable time;
A function of dynamically generating a facility network connected to each station corresponding to the searched plurality of basic networks with reference to the second storage means;
A function of synthesizing the basic network and the facility network to generate a plurality of facility network paths that can move within the allowable time from the starting point to the landing point;
An itinerary search program characterized in that a function of outputting a facility route guidance list that can be provided to a user based on the plurality of facility network routes is realized by a computer.