JP5001328B2 - Route search system, route search server, and route search method - Google Patents

Description

  The present invention relates to a route search system that searches for and guides an optimum route including a route section using a transportation facility from a departure place to a destination, and a candidate route. In particular, the route can be changed to a route section using a transportation facility. In a route search system that can guide vehicles suitable for boarding when included, if there are multiple transfers in the route, board at the departure station (the nearest station of departure) or at each transfer station The present invention relates to a route search system in which the number of a train to be trained (vehicle position from the head) is specified and guided at a plurality of transfer stations for vehicles that are convenient for transfer.

  2. Description of the Related Art Conventionally, navigation devices and navigation systems that search for a route from a desired departure place to a destination by using map data and road data and guide a user are known. As such a navigation device and navigation system, a car navigation device that is installed in an automobile and guides the route to the driver, a route search request is sent from the terminal device to the route search server via the network, and the result is received. Communication-type navigation systems that receive route guidance have been put into practical use.

  In particular, the communication-type navigation system is a system that uses a mobile terminal such as a mobile phone as a navigation terminal, and is also used as a navigation system for pedestrians. The route search server uses the road (route) of the map data as the node, the position of the inflection point as the node, the route connecting each node as the link, and the cost information (distance and travel time) of all the links in the database As prepared. Then, the route guidance server refers to the database, sequentially searches for links from the departure node to the destination node, and traces the node and link with the smallest cost information of the link to obtain a guidance route. The shortest route can be guided to the navigation terminal. As such a route search method, a method called label determination method or Dijkstra method is used.

  Furthermore, as a navigation system for pedestrians, it is preferable to add a route guidance function including transportation, and in addition to walking route search and guidance, the route search server accumulates transportation route and operation time data. In addition, there is a navigation system having a function of guiding a route from a desired departure station to a desired destination station (boarding candidate train) in addition to searching for a walking route and guidance.

  A route search system for searching for a route using such a transportation system includes an operation time database in which operation time data of each transportation facility is databased as route search data, an in-vehicle navigation system, and a pedestrian navigation system. Similar to the road network data in, in addition to the data that networked each station of the traffic route as a node and a two-way link between stations, the operation time of each link for each means of transportation operated on each traffic route, It has a database of traffic networks with travel time added as link cost data. Furthermore, there is a system in which fare data is added and the fare of the searched guide route is guided together.

  Then, based on the route search request such as departure date / time, departure place, destination, arrival time specified by the user, refer to these databases and use the connection to connect the departure place and the destination including transfer (transfer) Follow each possible means of transportation (individual trains and buses) as a route, and select one guide route (departure station, destination station, route, train, etc.) that matches the route search conditions. It is configured to present multiple items. As route search conditions, it is generally possible to specify conditions such as travel time, number of transfers, and fare.

  From such a technical background, a technique for selecting the optimum route to the destination in consideration of factors that greatly affect the optimum route to the actual destination such as connection and station exit is disclosed in, for example, Patent Document 1 below. (Japanese Patent Laid-Open No. 10-318770) is disclosed as an “optimum route search system”. The system disclosed in Patent Document 1 includes station transfer information, station exit information, escalator information, elevator information, station-related information indicating the relationship between a station and the location of a geographical target property, and a timetable for transportation.・ Get the shortest route in addition to price information.

  And according to this optimal route search system, the vehicle near the stairs or escalator for the transfer is indicated, the exit close to the destination is guided together with the map around the station, and the optimal route considering the transfer and the destination is displayed. It is configured as follows.

  In addition, when the route to the destination needs to be changed, the technology for providing the moving route information of the moving device in consideration of the moving time at the transfer station is disclosed in, for example, the following Patent Document 2 (Japanese Patent Laid-Open No. 8-263786). No.) is disclosed as a “movement route guidance device”.

  The moving route guidance device disclosed in Patent Document 2 is configured such that when a destination is input by a user who uses moving means for boarding a user at a first point, the first storage means stores the first information. The departure time of the first moving means that can be boarded at this point and the arrival time at which the first moving means arrives at the transfer point are read, and the second storage means is stored at the arrival time of the first moving means at this transfer point. The transfer required time at the transfer point stored in is added. Then, based on the added addition time, the departure time of the second moving means that can be boarded at the transfer point and the arrival time when the second moving means arrives at the destination are read from the first storage means, and the guiding means This guides the moving means and arrival time to the user. That is, in this travel route guidance device, when a route to the target station needs to be changed, the route search is performed in consideration of the transfer travel time required for moving to the transfer platform at the transfer station, and the route guidance is performed. is there.

  Further, in the route search with the shortest transfer time, a technique for guiding the position of the boarding vehicle with the shortest transfer time is disclosed in the following Patent Document 3 (Japanese Patent Laid-Open No. 2003-182579) as an invention of “optimum route search device” It is disclosed as.

  The optimum route search device disclosed in Patent Document 3 is based on the combination of the incoming line and incoming direction, and the outgoing route and outgoing direction for each station that can transfer between routes in the route network data of the transportation system. And an optimal transfer vehicle position information table in which one vehicle position number on the one train is the shortest transfer time from the train on one route to the station node number. After determining the incoming line and incoming direction and the outgoing line and outgoing direction, the optimal transfer vehicle position information on the incoming line is searched and added to the optimal route information. .

  Furthermore, in route search and route guidance considering transfer in a transportation facility, a vehicle position that is convenient for transfer is also guided at a transfer station. For example, in the following Patent Document 4 (Japanese Patent No. 2861974), the vehicle number of the second train that stops at the nearest position of the ticket gate of the target station is determined, and the departure station departs from the departure station. Thus, a railway transfer navigation system is disclosed in which the vehicle number of the first train that stops at the optimum position for transferring to the second train is determined and guided.

Japanese Patent Laid-Open No. 10-318770 (FIG. 1, paragraphs [0006] to [0012]) JP-A-8-263786 (FIG. 1, paragraphs [0011] and [0012]) JP 2003-182579 A (FIG. 3, FIG. 6, paragraphs [0008] to [0011], [0028]) Japanese Patent No. 2861974 (FIG. 1, paragraphs [0021], [0031] to [0034])

Here, I will organize the optimal car for changing trains. There are two ways of thinking about the optimal car when considering the shortest route that minimizes the route cost.
(1) A set of a getting-off vehicle and a boarding vehicle that displays the shortest route during transfer is displayed.
In this case, since the boarding position is not necessarily the next optimum getting-off vehicle, it is required to move the vehicle while getting on. It may not be possible depending on the time of congestion or train organization (in the case of trains that cannot pass, women-only cars, green cars, etc.). The optimum route searching apparatus of the above-mentioned patent document 3 is based on this.
(2) Based on the premise that the platform is moved to the vehicle that is most suitable for getting off when getting on.
Usually, there is room for transfer time before boarding, so the user should move around the platform considering the next disembarkation before boarding. The railway transfer navigation system of Patent Document 4 is based on this concept.

  By the way, the guidance of the boarding vehicle position in the transfer in the navigation system etc. which were disclosed by the said patent documents 3 and 4 is displaying the car number by referring the table which memorize | stored the optimal car for every combination of transfer. This method is correct if it is limited to only one transfer station. However, when there are a plurality of transfer stations on the searched route, there is a case where it is not always possible to provide guidance on the position of the boarding vehicle that the user can understand.

  Such a case occurs when the optimum car number is not fixed to one. A specific example is a case where a transfer occurs on the same line or the same platform. For example, when changing to a line on the opposite side of the platform, if the vehicle is in a positional relationship where the vehicles face each other in both vehicle formations, the transfer is the same for any car. There are unexpectedly many such transfer stations (it is considered that the station was designed in such a way for the convenience of passengers). In this case, a display such as “3rd, 4th, 5th and 6th cars from the front” become. Alternatively, the same guidance can occur when changing to the next train on the same number line that got off (same number line). In addition, even when using stairs for transfer, there are multiple stairs, some of which have the same optimal conditions, and multiple vehicle numbers such as “5th and 8th cars from the front” It may be indicated.

  Such guidance for a boarding vehicle can be said to be correct only for one transfer, but if there is a further next transfer, all of the boarding vehicle positions that were guided by the first transfer will be the same for the next transfer. It is not always the optimal boarding vehicle position. FIG. 10 is a diagram illustrating an example of the optimal boarding vehicle position when there are a plurality of transfers. FIG. 10 shows an example in which there are two transfers of 1 (A station) and 2 (B station) to the optimal route from the departure station (the nearest station to the departure place) to the destination station (the nearest station to the destination). ing.

  The route at transfer 1 (station A) 9 arrives at the X-ray up train TRX1, and transfers to the Y line up train TRY2 that arrives at the opposite side of the same platform. In this case, from the front of the train TRX1 Since the 1st to 6th vehicles from the front of the train TRY2 stop on the opposite side of the 4th to 9th vehicles, get on any of the 4th to 9th vehicles from the front of the X-ray train TRX1 However, it is possible to transfer to the train TRY2 (vehicles 1 to 6) on the Y line in the shortest time, and the optimum position of the vehicle on the X-ray train TRX1 to be guided is "4th to 9th from the front". The optimum boarding vehicle position of the Rino train TRY2 is “the first to sixth cars from the front”. There is no problem with this.

  However, the route at transfer 2 (station B) arrives on the Y-line ascending train TRY2 boarded at transfer 1 (station A), and uses the a stairs or b stairs of the arrival platform to go up to the Z line and down to the platform. c Move on the stairs and transfer to the train TRZ3 going down the Z line, for example. In this case, if the staircase position of the Y-line arrival platform is at the position shown in the figure, the second, third, and fourth cars from the front of the Y-line up train TRY2 are the optimal boarding vehicle positions, and the Z-line down The eighth vehicle (the last vehicle) from the front of the train TRZ3 is the optimum boarding vehicle position. This guidance is also correct if you pay attention only to transfer 2 (B station). Conventional transfer vehicle position guidance is within this range.

  By the way, the optimal boarding vehicle position of transfer 2 (B station) is the 2nd to 4th cars from the front of the train going up the Y line. To realize this transfer, change to the previous transfer 1 (station A). When going back, it is necessary to get on the 2nd to 4th cars from the front of the train TRY2 on the Y line at transfer 1 (A station). For this purpose, at transfer 1 (A station), it is necessary to get on the fifth to seventh cars from the front of the arriving X-ray rising train TRX1. In addition, the train TRY2 after the transfer that departs at transfer 1 (A station). Therefore, if you guide "4-9th from the front" in the transfer 1 (A station) guidance, transfer at the 4th, 8th, and 9th cars As a result, the shortest transfer cannot be realized at 2 (B station), and it is not necessarily the guide for the optimal boarding vehicle position for the user. Similarly, when the optimal boarding vehicle position of the train TRY2 starting at transfer 1 (A station) is “1st to 6th car from the front”, transfer 2 (B station) at the 1st car, 5th car and 6th car ) Cannot achieve the shortest transfer. Therefore, in such a case, the optimal boarding vehicle position when arriving on the X-ray rising train TRX1 at transfer 1 (A station) is guided from the front to the fifth to seventh cars, and at transfer 1 (A station) on the Y line It is preferable that the optimal boarding vehicle position when departing from the train TRY2 is guided from the front to the second car to the fourth car.

  The reason why such a problem occurs is that, when the table storing the optimal cars for each combination of transfers at the transfer station includes a plurality of optimal cars, the influence of subsequent transfers is not taken into consideration. Then, it is not so if we should prepare a table for combinations of subsequent transfers. For example, as the number of transfer stations increases by 1 (the number of transfers increases by 1), the table becomes huge in 3 dimensions, 4 dimensions,... N dimensions. Therefore, it is not practical to create such a table in consideration of all combinations that can be changed.

  As a result of various studies to solve such problems, the inventor of the present application has found that there are a plurality of transfers on the optimal route from the departure station to the destination station, and a plurality of optimal boarding vehicle positions for the transfer route at a certain transfer station. If there is, change back from the transfer station closest to the destination station to the transfer station on the departure station side, and find the optimal transfer vehicle number at a transfer station and the optimal transfer vehicle number at the transfer station just before the departure station. If the optimal boarding vehicle number of the same train is extracted, the optimal boarding vehicle number of the same train is checked, and the optimal boarding vehicle number at the previous transfer station is determined based on the matching optimal boarding vehicle number. The present invention has been completed by conceiving that the boarding vehicle number can be guided.

  That is, the present invention aims to solve the above-mentioned problems, and in a route search system that guides the optimal boarding vehicle position at a transfer station when there is a transfer in a route section using transportation, it is continuous with the route. An object of the present invention is to provide a route search system capable of specifying and guiding an appropriate optimum boarding vehicle number when there are a plurality of boarding routes and there are a plurality of optimum boarding vehicle positions in a transfer route at a certain transfer station. To do.

In order to solve the above-mentioned problem, the invention according to claim 1 of the present application is
In a route search system for searching for a route including a route using a transportation facility as necessary with reference to network data for route search based on a route search request including a set starting point and destination,
The route search system associates an optimum boarding vehicle number of an arrival-side train and an optimum boarding vehicle number of a departure-side train satisfying predetermined transfer conditions for each combination of routes and directions that can be transferred at each transfer station. A transfer information database storing the transfer information, a transfer point extraction means, and an optimal boarding vehicle number determination means,
When the route searched by the route search means includes a plurality of transfers, and there are a plurality of optimum boarding vehicle positions in the transfer route at a transfer station, the transfer point extraction means is 1 for the transfer station and the departure station side. The nearest transfer station is extracted as a transfer point, and the optimal boarding vehicle number determination means refers to the transfer information database, and arrives at the transfer station optimal boarding vehicle number and the transfer station one before the departure station side. The departure-side optimal boarding vehicle number at the station is extracted, the extracted optimal boarding vehicle numbers are compared to check the matching of the optimal boarding vehicle number of the same train, and based on the matching optimal boarding vehicle number, The optimal boarding vehicle number of the train at the transfer station is determined.

The invention according to claim 2 of the present application is the route search system according to claim 1,
The optimal boarding vehicle number determination means extracts the optimal boarding vehicle number at a certain transfer station and the optimal boarding vehicle number at the transfer station immediately before the departure station, and compares the extracted optimal boarding vehicle number. When the matching optimal boarding vehicle number of the same train is examined, when the matching optimal boarding vehicle number is not obtained, the optimal boarding vehicle number determination means is based on the transfer information at the previous transfer station. The optimum boarding vehicle number of the train at the previous transfer station is determined.

  The invention according to claim 3 of the present application is the route search system according to claim 1 or claim 2, wherein the transfer information stored in the transfer information database includes the optimal boarding vehicle number of the arrival side train at the transfer station. Information associated with the optimal boarding vehicle number of the departure side train is stored for each combination of route and vertical line.

  Further, the invention according to claim 4 of the present application is the route search system according to claim 1 or claim 2, wherein the transfer information stored in the transfer information database is such that a transfer required time at the transfer station is minimized, Or it is the information which matched the optimal boarding vehicle number of the arrival side train, and the optimal boarding vehicle number of the departure side train which satisfy | fills the conditions which the getting-out vehicle position at the time of arrival becomes the optimal.

  The invention according to claim 5 of the present application is the route search system according to any one of claims 1 to 4, wherein the transfer point extracting means transfers from the transfer station closest to the destination station side to the departure station side. The transfer point is extracted by tracing back to the station.

Further, the invention according to claim 6 of the present application is the route search system according to claim 5, wherein the determined optimal boarding vehicle number at the previous transfer station is determined as the arrival-side optimal boarding vehicle number at the certain transfer station. This processing is repeated until the transfer station closest to the departure point side, and the optimum boarding vehicle number at each transfer station is determined.

The invention according to claim 7 of the present application is
Based on a route search request including a departure point and a destination set in the terminal device, the route device includes a route including a route using a transportation facility as needed by referring to network data for route search, and the terminal device In the route search server that sends the searched route information to
The route search server associates the optimum boarding vehicle number of the arrival side train and the optimum boarding vehicle number of the departure side train satisfying predetermined transfer conditions for each combination of routes and directions that can be changed at each transfer station. A transfer information database storing the transfer information, a transfer point extraction means, and an optimal boarding vehicle number determination means,
When the route searched by the route search means includes a plurality of transfers, and there are a plurality of optimum boarding vehicle positions in the transfer route at a transfer station, the transfer point extraction means is 1 for the transfer station and the departure station side. The nearest transfer station is extracted as a transfer point, and the optimal boarding vehicle number determination means refers to the transfer information database, and arrives at the transfer station optimal boarding vehicle number and the transfer station one before the departure station side. The departure-side optimal boarding vehicle number at the station is extracted, the extracted optimal boarding vehicle numbers are compared to check the matching of the optimal boarding vehicle number of the same train, and based on the matching optimal boarding vehicle number, The optimal boarding vehicle number of the train at the transfer station is determined.

Further, the invention according to claim 8 of the present application is the route search server according to claim 7, wherein the optimum boarding vehicle number determination means transfers the optimum boarding vehicle number at a certain transfer station and the transfer one before the departure station side. When the optimal boarding vehicle number at the station is extracted, and when the optimal boarding vehicle number of the same train is examined by comparing the extracted optimal boarding vehicle numbers, the matching optimal boarding vehicle number is not obtained, The optimal boarding vehicle number determination means determines the optimal boarding vehicle number of the train at the previous transfer station based on the transfer information at the previous transfer station.
The optimal boarding vehicle number of the arrival side train and the optimal boarding vehicle number of the departure side train are determined.

  The invention according to claim 9 of the present application is the route search server according to claim 7 or claim 8, wherein the transfer information stored in the transfer information database includes an optimal boarding vehicle number of an arrival side train at the transfer station. Information associated with the optimal boarding vehicle number of the departure side train is stored for each combination of route and vertical line.

  Further, in the invention according to claim 10 of the present application, in the route search server according to claim 7 or claim 8, the transfer information stored in the transfer information database is a condition that minimizes the required transfer time at the transfer station, Or it is the information which matched the optimal boarding vehicle number of the arrival side train, and the optimal boarding vehicle number of the departure side train which satisfy | fills the conditions which the getting-out vehicle position at the time of arrival becomes the optimal.

  The invention according to claim 11 of the present application is the route search server according to any one of claims 7 to 10, wherein the transfer point extracting means transfers from the transfer station closest to the destination station side to the departure station side. The transfer point is extracted by tracing back to the station.

In the invention according to claim 12 of the present application, in the route search server according to claim 11, the determined optimal boarding vehicle number at the previous transfer station is determined as the arrival-side optimal boarding vehicle number at the certain transfer station. This processing is repeated until the transfer station closest to the departure point side, and the optimum boarding vehicle number at each transfer station is determined.

The invention according to claim 13 of the present application is
A route search method in a route search system for searching for a route including a route using a transportation facility as necessary by referring to network data for route search based on a route search request including a set starting point and destination In
The route search system associates an optimum boarding vehicle number of an arrival-side train and an optimum boarding vehicle number of a departure-side train satisfying predetermined transfer conditions for each combination of routes and directions that can be transferred at each transfer station. A transfer information database storing the transfer information, a transfer point extraction means, and an optimal boarding vehicle number determination means,
When the route searched by the route search means includes a plurality of transfers, and there are a plurality of optimum boarding vehicle positions in the transfer route at a transfer station, the transfer point extraction means is 1 for the transfer station and the departure station side. The nearest transfer station is extracted as a transfer point, and the optimal boarding vehicle number determination means refers to the transfer information database, and arrives at the transfer station optimal boarding vehicle number and the transfer station one before the departure station side. The departure-side optimal boarding vehicle number at the station is extracted, the extracted optimal boarding vehicle numbers are compared to check the matching of the optimal boarding vehicle number of the same train, and based on the matching optimal boarding vehicle number, The optimal boarding vehicle number of the train at the transfer station is determined.

  Further, the invention according to claim 14 of the present application is the route search method according to claim 13, wherein the optimum boarding vehicle number determination means transfers the boarding number of the boarding vehicle at an optimum boarding station number and the one before the departure station side. When the optimal boarding vehicle number at the station is extracted, and when the optimal boarding vehicle number of the same train is examined by comparing the extracted optimal boarding vehicle numbers, the matching optimal boarding vehicle number is not obtained, The optimal boarding vehicle number determination means determines the optimal boarding vehicle number of the train at the previous transfer station based on the transfer information at the previous transfer station.

  The invention according to claim 15 of the present application is the route search method according to claim 13 or claim 14, wherein the transfer information stored in the transfer information database includes the optimal boarding vehicle number of the arrival side train at the transfer station. Information associated with the optimal boarding vehicle number of the departure side train is stored for each combination of route and vertical line.

  The invention according to claim 16 of the present application is the route search method according to claim 13 or claim 14, wherein the transfer information stored in the transfer information database has a condition that the transfer required time at the transfer station is minimized, Or it is the information which matched the optimal boarding vehicle number of the arrival side train, and the optimal boarding vehicle number of the departure side train which satisfy | fills the conditions which the getting-out vehicle position at the time of arrival becomes the optimal.

  The invention according to claim 17 of the present application is the route search method according to any of claims 13 to 16, wherein the transfer point extracting means transfers from the transfer station closest to the destination station to the departure station. The transfer point is extracted by tracing back to the station.

Further, the invention according to claim 18 of the present application is the route search method according to claim 17, wherein the determined optimal boarding vehicle number at the previous transfer station is determined as the arrival-side optimal boarding vehicle number at the certain transfer station. This processing is repeated until the transfer station closest to the departure point side, and the optimum boarding vehicle number at each transfer station is determined.

In the invention according to claim 1, the route search system is configured such that, at each transfer station, for each combination of routes and directions that can be transferred, the optimum boarding vehicle number of the arrival train satisfying a predetermined transfer condition and the departure train A transfer information database in which transfer information associated with an optimal boarding vehicle number is stored, a transfer point extraction unit, and an optimal boarding vehicle number determination unit;
When the route searched by the route search means includes a plurality of transfers, and there are a plurality of optimum boarding vehicle positions in the transfer route at a transfer station, the transfer point extraction means is 1 for the transfer station and the departure station side. The nearest transfer station is extracted as a transfer point, and the optimal boarding vehicle number determination means refers to the transfer information database, and arrives at the transfer station optimal boarding vehicle number and the transfer station one before the departure station side. The departure-side optimal boarding vehicle number at the station is extracted, the extracted optimal boarding vehicle numbers are compared to check the matching of the optimal boarding vehicle number of the same train, and based on the matching optimal boarding vehicle number, Determine the optimal number of vehicles for the train at the transfer station.

  According to such a configuration, when there are a plurality of continuous transfers on the route, and there are a plurality of optimal boarding vehicle positions on the transfer route at a certain transfer station, the influence of the transfer at the subsequent transfer point is taken into consideration. Since the optimum boarding vehicle at the transfer point is determined, an appropriate optimum boarding vehicle number can be specified and guided.

  In the invention according to claim 2, in the invention according to claim 1, the optimum boarding vehicle number determination means includes an optimum boarding vehicle number at a certain transfer station and an optimum boarding vehicle number at the transfer station immediately before the departure station. When the matching optimal boarding vehicle number of the same train is examined by comparing the extracted optimal boarding vehicle number and the matching optimal boarding vehicle number is not obtained, the optimal boarding vehicle number determination is performed. The means determines an optimal boarding vehicle number of the train at the previous transfer station based on the transfer information at the previous transfer station.

  According to such a configuration, when there are a plurality of continuous transfers on the route, and there are a plurality of optimal boarding vehicle positions on the transfer route at a certain transfer station, the optimal boarding vehicle number at a certain transfer station and the departure station side When the optimal boarding vehicle number in the previous transfer station is extracted, and the extracted optimal boarding vehicle number is compared to check the matching of the optimal boarding vehicle number of the same train, the matching optimal boarding vehicle number is obtained. If not, the optimal boarding vehicle number is determined based on the transfer information of the transfer station, and it is possible to perform boarding vehicle position guidance similar to that when there is only one transfer.

  In the invention according to claim 3, in the invention according to claim 1 or claim 2, the transfer information stored in the transfer information database includes the optimal boarding vehicle number of the arrival side train and the optimal boarding of the departure side train at the transfer station. Information associated with the vehicle number is stored for each combination of route and vertical line. According to such a configuration, it is possible to determine the optimum boarding vehicle position at each transfer station by distinguishing the upper and lower lines.

  In the invention according to claim 4, in the invention according to claim 1 or claim 2, the transfer information stored in the transfer information database is based on the condition that the time required for transfer at the transfer station is the minimum or when it arrives. This is information in which the optimal boarding vehicle number of the arrival side train and the optimal boarding vehicle number of the departure side train are associated with each other so that the position of the getting-off vehicle is optimal. According to such a configuration, it is possible to guide the optimal boarding vehicle number that minimizes the time required for transfer or the optimal boarding vehicle number that provides the optimal getting-off position.

  In the invention according to claim 5, in the invention according to any one of claims 1 to 4, the transfer point extracting means traces back from the transfer station closest to the destination station side to the transfer station on the departure station side. Extract transfer points. Accordingly, it is possible to appropriately determine and guide the optimal boarding vehicle number of the train arriving at each transfer station on the route.

In the invention according to claim 6, in the invention according to claim 5, the process of setting the determined optimal boarding vehicle number at the previous transfer station as the arrival side optimal boarding vehicle number at the certain transfer station Repeat until the transfer station closest to the ground side, and determine the optimal boarding vehicle number at each transfer station. Therefore, it is possible to appropriately determine and guide the optimal boarding vehicle number of the train arriving at each transfer station on the route, and also to optimally ride the train arriving at the first transfer station, that is, the train that gets on at the departure station. The vehicle position can be appropriately determined and guided.

  In the inventions according to claims 7 to 12, it is possible to provide route search servers constituting the route search system according to claims 1 to 6, respectively. In the invention according to 18, the route search method for realizing the route search system according to claims 1 to 6 can be provided.

1 is a system configuration diagram illustrating a configuration of a route search system according to an embodiment of the present invention. It is a block diagram which shows the detailed structure of the route search system in the Example of this invention. It is a figure which shows an example of the data structure of the transfer route stored in the transfer information database concerning the Example of this invention, and a transfer cost. It is a schematic diagram for demonstrating the concept of the transfer process in the route search system concerning the Example of this invention. It is a figure which shows the external appearance of the mobile telephone as a terminal device concerning the Example of this invention. It is a screen block diagram which shows an example of the input screen of the route search conditions concerning the Example of this invention. It is a conceptual diagram explaining the road network data used for the route search of this invention. It is a conceptual diagram explaining the traffic network data used for the route search of this invention. It is a flowchart which shows the procedure of the transfer process in the route search system concerning the Example of this invention. It is a schematic diagram which shows the concept of the conventional transfer process.

  Hereinafter, specific examples of the present invention will be described in detail with reference to examples and drawings. However, the embodiment described below exemplifies a route search system for embodying the technical idea of the present invention, and is not intended to identify the present invention as this route search system. The present invention is equally applicable to route search systems of other embodiments included in the scope of claims.

  As shown in FIG. 1, a route search system 10 according to an embodiment of the present invention includes a terminal device 20 using a portable terminal such as a mobile phone, a PDA, or a music player, and a route search server 30 including a network 12 such as the Internet. It is configured to be connected via. The route search server 30 includes a database (DB1) in which road network data for route search is stored, a database (DB2) in which traffic network data based on timetable data is stored as traffic network data, and trains of transportation facilities. Timetable based on service schedules, timetable / fare data database (DB3) that accumulates fares, transfer links based on the station structure of each transfer station in transportation, link costs, optimal trains for arrival and departure trains A transfer information database (DB4) that stores transfer information including numbers and the like, and a database (DB5) that stores map data for display are provided. The timetable / fare data can be acquired from the information distribution server 50 via the network.

  This route search system 10 includes a POI information distribution server 50 that provides detailed information such as the location of POIs (Points of Interest) that belong to various categories, service contents, advertisements, map data, traffic route data, and operation times. Table data, contents such as music and various images, and various information distribution servers 51 that provide other information can be connected. The route search server 30 is connected to the POI information distribution server 50 and other information distribution servers 51 via the network 12. You can then get the data you need and add it to your database. Similarly, a search request can be transmitted to the POI information distribution server 50 or another information distribution server 51 to obtain a desired search result.

  The route search system 10 according to the present invention is not limited to the above-described configuration, and the route search server 30 may have a function of a map distribution server that distributes a map of a POI location together with a navigation service function. The terminal device 20 can also use a mobile phone, and may be a portable device such as a PDA, a music player, a portable game machine, or a personal computer (PC).

  The transfer information data stored in the database (DB4) will be described later in detail. At each transfer station, the optimal number of vehicles on the arrival side train that satisfies the optimal transfer time for each combination by route and direction. And the optimum boarding vehicle number of the departure side train.

  When the terminal device 20 requests a route search from the route search server 30 and receives a route guidance service, the terminal device 20 sets route search conditions such as a desired departure place and destination and sends the route search server 30 with the route search condition. Send a route search request.

  When there is a route search request from the terminal device 20, the route search server 30 searches for a route with reference to road network data, traffic network data, timetable / fare data in the databases D1 to D3. Then, the guide route (recommended route) obtained from the route search result is transmitted to the terminal device 20. Further, when there is a request for obtaining map data by designating a desired point or POI from the terminal device 20, the corresponding map data is read out with reference to the map data in the database DB 5 and distributed to the terminal device 20.

  In the route search, when there is a route section using transportation and there is a transfer in the route section, the transfer cost is minimized by referring to the transfer information data in the database DB4 (satisfying the optimum transfer required time). A transfer route (for example, a passage including a transfer staircase from the arrival platform to the departure platform), an arrival-side train and an optimum boarding vehicle number of the departure-side train are added to the route information for guidance. The optimal boarding vehicle number here is a number indicating which number is the optimal boarding vehicle counting from the front of the traveling direction of the train, and is different from the car number posted in the timetable or the like. The car number listed in the timetable is fixedly assigned regardless of whether it is up or down, and the first car on the top is the first car even on the down.

  When there is only one transfer station (transfer point) in the route, there is no problem as described above. However, when there are a plurality of transfer stations (transfer points), as described with reference to FIG. 10, the optimal boarding vehicle number guided at the first transfer station is not the optimal boarding vehicle number at the next transfer station. Cases arise. Therefore, in the present invention, when there are a plurality of transfer points, the route is reversed, i.e., the route transfer point is traced backward from the arrival station, and the optimal ride of the arrival side train and the departure side train at the last transfer point Based on the vehicle number, the optimum boarding vehicle number of the arrival side train and the departure side train at the previous transfer point is determined. In addition, when the optimal boarding vehicle number is determined and guided here, at the transfer station, either the train arriving at the transfer station and / or the train leaving the transfer station may be used, but at least transfer It is preferable to guide the optimum boarding vehicle number for the train leaving the station.

  By repeating this process sequentially for a plurality of transfer points, an appropriate optimal boarding vehicle number at the first transfer point can be finally guided. When the optimal boarding vehicle number cannot be determined at the transfer point on the way, a message to that effect is notified in the guidance of the optimal boarding vehicle number, and the optimal boarding vehicle number when there is one transfer point is Guide at every transfer point). This process will be described in detail later.

  Hereinafter, a route search system 10 according to an embodiment of the present invention will be described based on specific examples, but before that, a detailed configuration of the route search system 10 according to the present invention will be described. FIG. 2 is a block diagram showing a detailed configuration of the route search system 10 of FIG.

  The terminal device 20 sets a route search condition such as a departure point and a destination to the route search server 30 and transmits a route search request. The route search server 30 performs road network data, traffic network data, The optimum route is searched with reference to the timetable / fare data and transfer information data, and the optimum route is edited into guide route data and distributed to the terminal device 20.

  The terminal device 20 includes a control unit 201, a communication unit 21, a position information acquisition unit 22 including a GPS receiver, a route search request unit 23, a guide route data storage unit 24, a display unit 25, an operation input unit 26, and a terminal ID storage. Means 27 and the like are provided. Although not shown, the control unit 201 is a microprocessor having a RAM, a ROM, and a processor, and controls the operation of each unit by a control program stored in the ROM. The communication means 21 is a communication interface for transmitting and receiving communication data with the route search server 30 and the like via the network 12.

  The position information acquisition means 22 includes a GPS receiver, receives signals from a plurality of GPS satellites, measures the current position with latitude and longitude, and acquires position information of the terminal device 20. The operation input means 26 consists of numbers, alphabet keys, other function keys, selection keys, scroll keys (up / down / left / right arrow keys), etc., and performs input for operating the terminal device 20, as well as the departure place, purpose It is also used as an input function for route search conditions such as ground. The display means 25 is composed of a liquid crystal display panel or the like, and is used for displaying a guidance route, a recommended route, or a map distributed (transmitted) from the route search server 30. The display unit 25 also functions as an input unit for displaying the menu screen and operating the terminal device 20.

  The route search request unit 23 creates a route search request based on the route search conditions such as the departure point and destination set by the operation input unit 26 or the display unit 25 and transmits the route search request to the route search server 30. Since it is necessary to identify the requesting terminal device 20 in the route search server 30, the terminal ID stored in the terminal ID storage means 27 is added to a processing request such as a route search request and transmitted.

  The guide route data storage unit 24 temporarily stores guide route data that is a route search result distributed from the route search server 30, and guide routes and recommended routes transmitted from the route search server 30 to the terminal device 20. Is stored in the guide route data storage unit 24 together with the map data, and the guide data and map data such as the guide route stored in the guide route data storage unit 24 are read out as necessary and displayed. 25.

  When a map is displayed on the display unit 25, generally, a guide route and a map of the terminal device 20 are displayed on a map of a certain scale and a certain range including the current position of the terminal device 20 measured by the position information acquisition unit 22. A mark indicating the current position is superimposed and displayed so that the current position mark is at the center of the display screen. Since the measured position information includes an error, route matching processing is performed to correct the current position on the guide route when the current position is deviated from the guide route. In addition, when voice guide data is added to the guidance route data distributed from the route search server 30, for example, when the terminal device 20 approaches an intersection or a branch point (guidance point), “Further, 300m Play a voice message such as “Turn left at the intersection. Please turn left” and guide the user.

  The route search server 30 includes control means 301, communication means 31, search request storage means 32, route search means 33, road network data (database DB1), traffic network data (database DB2), timetable / fare data (database) DB3. , Transfer information data (database) DB4, map data (database DB5), transfer point extracting means 37, optimum boarding vehicle number determining means 38, guide route data editing means 39, and the like.

  In the route search server 30, the control unit 301 is a microprocessor having a RAM, a ROM, and a processor (not shown), and controls the operation of each unit by a control program stored in the ROM. The communication unit 31 is an interface for communicating with the terminal device 20, the POI information distribution server 50, and other information distribution servers 51 via the network 12.

  The search request storage means 32 is for temporarily storing a route search condition included in a route search request transmitted from the terminal device 20.

  The route search means 33 is based on the route search conditions such as the departure point and the destination transmitted from the terminal device 20 and the current position information, the road network data DB1, the traffic network data DB2, the timetable / fare data DB3, and the transfer. A route search from the departure place to the destination is performed with reference to a database such as the information data DB 4. As such a route search method, a method called label determination method or Dijkstra method is used. Such a configuration is the same as that of a general route search system.

  Vector map data is stored in the database DB5 storing map data. This map data is composed of unit map data divided by a predetermined latitude / longitude range. The guide route data as the route search result is delivered to the terminal device 20 together with the vector map data.

  Databases DB1 and DB2 store road network data for searching for a travel route by foot or car and traffic network data for searching for a travel route using public transportation. Specifically, these data are roads (routes) whose nodes are nodes and the positions of inflection points are nodes, routes that connect each node are links, node data, link data, and cost information (distance) of all links. Or the required time) and is made into a database.

  Transport network data is also stored in stations as nodes, links between stations, and timetable data (departure time, arrival time, required time, transfer time) of each vehicle such as trains that are linked as link cost data. It is a thing.

  The road network data in the pedestrian route search system and the route search system for vehicles has the end points, intersections, and inflection points of the roads as nodes, and the roads connecting the nodes are represented by directional links. (Link latitude / longitude of the node), link data (link number), and link cost data using link cost (link distance or time required for traveling the link) of each link as data.

  When a route search is performed using such road network data, a link connected from the starting node to the destination node is traced, and the link cost is accumulated to search for a route that minimizes the accumulated link cost. invite. In other words, since there are actually multiple routes from the departure node to the destination node, each route is searched in the same way, and the route with the lowest link cost is determined as the optimum route. To do. This method is performed by, for example, a known method called the Dijkstra method.

  On the other hand, the traffic network data for route search of transportation means that each station (each airport on an aircraft route) provided on each traffic route is a node, and a section connecting each node is directed. It is represented by a link, and node data (latitude / longitude) and link data (link number) are network data. The link cost of a transportation network is a fixed and static link cost in a road network, whereas a train or an aircraft operating a traffic route (hereinafter, each route such as an individual train or an aircraft is referred to as a transportation means). ) Are variable and dynamic.

  That is, the time of departure from a node in each means of transportation and the time of arrival at the next node are fixed (specified by timetable data and operation data), and each route is not necessarily linked to an adjacent node. May not. This is the case, for example, with express trains and trains that stop at each station. In such a case, a plurality of different links exist on the same traffic route, and the required time between nodes may differ depending on the transportation means. For this reason, the timetable / fare data is referred to and incorporated in the traffic network data. Of course, on routes that connect different routes, transfers occur at transfer stations (transfer points). At transfer stations, transfer information data is referenced, and transfer routes that minimize transfer costs (for example, passages that include transfer stairs from the arrival platform to the departure platform), and optimal arrival and departure trains The boarding vehicle number is added to the route information for guidance.

  In general, a route search in a car navigation system or the like usually searches for an optimum route with the lowest route cost (the shortest required distance distance or the shortest required time), but a route including a route section using a transportation facility. In the search, it is also required to compare various routes such as the route with the lowest charge or the route with the fewest number of transfers, and the route search referred to in this specification is often configured to search for a plurality of candidate routes. Any of them may be used.

  FIG. 3 is a diagram illustrating a data configuration of transfer information data stored in the database DB4 of the route search server 30 in the navigation system according to the embodiment of the present invention. This transfer information data includes the optimal number of arrival vehicles and the optimal number of departure trains for each transfer station combination included in the traffic network data for each combination of routes and directions that can be transferred. The transfer information in which the boarding vehicle number is associated is accumulated.

  In the transfer information stored in the transfer information database, information in which the optimal boarding vehicle number of the arrival side train at the transfer station and the optimal boarding vehicle number of the departure side train are associated with each other is stored for each combination of route and vertical line. In addition, the transfer information includes the optimal boarding vehicle number and departure of the arriving train that satisfy the conditions that minimize the time required for transfer at the transfer station, or that the position of the getting-off vehicle when it arrives is optimal. It is the information which matched the optimal boarding vehicle number of the side train.

  FIG. 3 shows transfer information between the A station and the B station shown in FIG. At station A, it is possible to change between the vertical direction of route X and the vertical direction of route Y. For example, when arriving by an upward train on route X and transferring to an upward train on route Y, route Y For each combination that can be transferred, such as when arriving by a down train and transferring to an up train on line X , The transfer route, and the transfer cost are stored.

  For example, when arriving on the X-ray upward train TRX1 and transferring to the Y-line upward train TRY2, the transfer route changes to the Y-line upward train TRY2 arriving on the opposite side of the same home. In this case, the train TRX1 The first to sixth cars from the front of the train TRY2 stop on the opposite side of the fourth to ninth cars from the front, so the optimal boarding position on the arrival side is "4 to 9 from the front". The vehicle numbers “1 to 6 from the front” are stored in association with each other. The transfer cost is “0”, and the transfer route is “same home”. The information regarding other combinations is also data.

  In addition, an example is shown in which station B can be switched between the vertical direction of route Y and the vertical direction of route Z. Similar to the transfer information of station A, for example, when arriving on the up train on route Y and transferring to the up train on route Z, or arriving on the down train on route Z and transferring to the up train on route Y For each combination that can be transferred, the data that correlates the optimal boarding vehicle number of the arrival train and the optimal boarding vehicle number of the departure train with the minimum transfer cost, the transfer route, and the transfer cost are It is remembered.

  For example, if you arrive on the Y-line up train TRY2 and transfer to the Z-line I down train TRZ3, use the a stairs or b stairs of the arrival platform and use the c stairs to go up and down the Z line It becomes a transfer route to move to the home and change to the train TRZ3 going down the Z line. In this case, the vehicle position of the Y-line descending train TRY2 that stops near the a stairs and b stairs of the arrival platform is the second to fourth cars from the front, and the Z-line descending train TRZ3 that stops near the c stairs of the Z-line platform The vehicle position is the eighth car (the last car) from the front. Accordingly, the arrival-side optimal boarding vehicle number is stored in association with the second through fourth vehicles from the front, and the departure-side optimal boarding vehicle number is stored in association with the eighth vehicle from the front. The transfer route is a-step to c-step or B-step to c-step, and “1 minute” is stored as the transfer cost, for example.

  In route search, if there is only one transfer from the departure station (the nearest station to the departure point) to the destination station (the nearest station to the destination), refer to the transfer information for the corresponding station in Fig. 3 Information on the best transfer route and the optimal boarding vehicle position. As long as this is the case, this is the same as the conventional transfer boarding vehicle position guidance. However, when there are a plurality of transfers in the route, the following processing is performed in the present invention.

  When a route search is performed by the route search means 33 according to the route search conditions, and there is a route section using transportation facilities in the searched route, and there are a plurality of transfer stations (transfer points) in the route section, a transfer point extraction means 38 is the reverse transfer point from the arrival station, and when there are multiple optimal vehicles for the arrival and departure trains at the previous transfer point, the arrival and departure trains at the last transfer point Based on the optimum number of vehicles on the train, the optimum number of vehicles on the arrival side and departure side trains at the transfer station one before the departure station is determined.

  For example, departure from the departure station by X-ray ascending train TRX1, transfer to Y-line ascending train TRY2 at the first transfer point (Station A), arrive at the next transfer point (Station B), and go to train ZR descending at TRZ3 In the case of a route that leads to a transfer or destination station, the transfer point extraction means 37 extracts transfer stations in the order of transfer station B and transfer station A. Next, the optimum boarding vehicle number determination means 38 refers to the transfer information data and determines whether there are a plurality of optimum boarding vehicles for the arrival train TRX1 and the departure train TRY2 at the station A. The optimal train number of the train arriving at the B station on the corresponding route and the train departing from the B station is temporarily stored. In this example, the optimal boarding vehicle number of the arrival-side train TRY2 is “2-4th from the front”, and the optimal boarding vehicle number of the departure-side train TRZ3 is “8th from the front”.

  Next, the optimum boarding vehicle number determining means 38 refers to the transfer information data of the next transfer point (station A) extracted by the transfer point extracting means 37, that is, the transfer point of the previous one returning to the departure station side, The optimal boarding vehicle number of the train arriving at A station and the train leaving A station is acquired. In this case, the optimal boarding vehicle number of the arrival-side train TRZ1 is “fourth to ninth cars from the front”, and the optimal boarding vehicle number of the departure-side train TRY2 is “first to sixth cars from the front”.

  The optimal boarding vehicle number determination means 39 stores the optimal boarding vehicle number of the arrival-side train TRY2 at station B, which is temporarily stored, as “the second and fourth cars from the front” and the optimal boarding vehicle of the departure-side train TRZ3. The number is based on “8th from the front”, the optimal boarding vehicle number for the arrival side train TRZ1 at station A is “4th to 9th from the front”, and the optimal boarding vehicle number for the departure side train TRY2 is “front” To 1st to 6th cars ”, the corresponding train (the same train), in this example, the matching (AND) of the optimal boarding vehicle number of TRY2 is determined, and the matching optimal boarding vehicle number“ the 2nd to 4th cars from the front ” The optimal boarding vehicle numbers of the arrival train TRX1 and the departure train TRY2 at the first transfer point (A station) are determined.

  In this example, “the second to fourth cars from the front” is determined as the optimal boarding vehicle at the A station of the train TRY2. Based on this, the optimum boarding vehicle number corresponding to the arrival-side train TRX1 at station A is determined. In this example, at station A, the arrival side train TRX1, the departure side train, and TRY2 are in the same platform, and the arrival side train and TRY2 stop opposite to the "2nd to 4th cars from the front". Since the vehicle number of the side train TRX1 is "5th to 6th from the front", this vehicle number is determined as the optimal boarding vehicle number of the train TRX1 arriving at the A station and the departing train TRY2.

  Thus, by repeating this process sequentially for a plurality of transfer points, it is possible to finally guide an appropriate optimum boarding vehicle number at the first transfer point. In the course of this process, at the transfer point in the middle, the arrival side train extracted at the transfer point just before the departure station side, the optimal transfer vehicle number and the optimal transfer vehicle number of the arrival side train at the transfer station extracted. When compared with the optimal boarding vehicle number and the optimal boarding vehicle number, the same optimal boarding vehicle number of the same train does not exist and the optimal boarding vehicle number may not be determined.

  In that case, in the guidance of the optimal boarding vehicle number of the first transfer station or the guidance of the optimal boarding vehicle number of each transfer station, a message to that effect is notified, and there is only one transfer station on the route The same optimal boarding vehicle number is guided. Also, in this case, when the optimal boarding vehicle number for the same train does not exist and the optimal boarding vehicle number cannot be determined without going back to the first transfer point, this processing is terminated, and the optimal boarding vehicle at each transfer station You may comprise so that the determination of a number may take the method similar to the past performed based on the transfer information in the said transfer station.

  In other words, in the present invention, when a plurality of transfers are included in the route section using the transportation facility searched by the route search means 33, the transfer point extraction means 37 refers to the transfer information data (DB4) and determines the end point. The transfer station is extracted in order from the station side to the departure station side, and the optimal boarding vehicle number and the optimal boarding vehicle number of the arrival side train at the extracted transfer station are extracted. Then, every time the transfer point extraction unit 37 extracts a transfer station, the optimal boarding vehicle number determination unit 38 sequentially outputs the optimal boarding vehicle number and the optimal boarding vehicle number of the arrival side train at the transfer station extracted. Compared with the optimal boarding vehicle number and the optimal boarding vehicle number of the arrival side train extracted at the transfer point just before the station side, the same optimal boarding vehicle number of the same train is determined, and the same optimal boarding vehicle number of the same train Based on the above, the optimal boarding vehicle number of the train at the previous transfer station is determined (determined). Thereby, it becomes possible to guide the optimum boarding vehicle number on the route having a plurality of transfers.

  FIG. 5 is a diagram illustrating an appearance of a mobile phone as the terminal device 20 according to the embodiment of the present invention. When the terminal device 20 is a mobile phone, as shown in FIG. 5, the terminal device 20 has a display means 25 such as a liquid crystal display panel, a numeric keypad and a scroll key SK (launcher key), a clear key, a display, etc. Operation input means 26 to which a mode switching key is assigned is provided. Map data and guide route data transmitted from the route search server 30 are stored in the guide route data storage unit 24, read out from the guide route data storage unit 24 as necessary, and displayed on the display screen 251 of the display unit 25. The

  FIG. 6 is a diagram showing an example of a route search condition input screen 700 displayed on the display screen 251. As shown in FIG. When making a route search request to the route search server 30, the terminal device 20 selects and sets predetermined conditions from various pull-down menus displayed on the display unit 25 as shown in FIG. Then, a desired condition is input and transmitted to the route search server 30.

  The route search condition input screen 700 includes a departure point input field 701, a destination input field 702, a use date input field 703, a time input field 704, a time type input field 705, a moving means input field 706, and a route display order input field. 707, a walking setting input field 708, a used route input field 711, a search start button 709 based on the current time, and a search start button 712 based on setting conditions.

  The starting point and destination are set by inputting an address, a telephone number, a station name, a point name such as a building name, a latitude / longitude, or the like in the starting point input field 701 and the destination input field 702. That is, in this input field, free word input is possible in principle, but it can be set by address, telephone number, POI name, and the like. Further, the current position of the terminal device 20 measured by the position information acquisition unit 22 can be used for the input of the departure place. Furthermore, a method may be used in which a map is displayed on the display unit 25 of the terminal device 20, a point is designated on the displayed map, and converted into latitude and longitude information.

  The setting of the use date and time is set by inputting the date and time of actually using a transportation facility such as a train in the use date input field 703 and the time input field 704 in order to perform a search according to the operation timetable data. In the use date input field 703 and the time input field 704, the date and time when the route search condition input screen 700 is displayed are set as initial values.

  In the time type input field 705, the conventional “departure”, “arrival”, “last train”, and “first departure” conditions can be selected and set from the pull-down menu 705-1 for the type of time input in the time input field 704. is there. As a result, when “departure” or “arrival” is selected as the time input in the time input field 704, it can be set whether it is departure time or arrival time. The “last train” is the route that can delay the departure most, and the “first departure” requires the route that can start the day and reach the destination earliest.

  In the moving means input field 706, it is possible to select and set moving means at the time of route search. When “Vehicle + Walk” is selected, a vehicle (airplane, Shinkansen, express line, route bus, etc.) permitted in the use route column 711 can be set.

  In the route display order input field 707, the conventional order of the route display is “in order of shortest required time”, “in order of low fare”, “in order of decreasing number of transfers”, “in order of less walking (distance of walking route is short)” These conditions can be selected and set using a pull-down menu 707-1.

  Here, in "Short order of required time", the specified departure time range is satisfied and the route is found in the order of shorter required time. In "Lowest fare order", the specified departure time range is satisfied, and the route is in ascending order of fare. Is obtained. In addition, the route with the specified departure time is satisfied in the order of the least number of transfers and the route is obtained in the order of the smaller number of transfers, and the route in the order of the smaller distance of the walking section is satisfied with the specified departure time range. Routes are found in ascending order. In the route display order input field 707, “the order in which the required time is short” is set as an initial value.

  In the walking setting input field 708, it is possible to select and set the conventional “skeka”, “standard”, and “slow” conditions for the walking speed from the pull-down menu 708-1. Here, the time cost of the walking section is estimated at 6 km / h for “Saseka”, 5 km / h for “standard”, and 4 km / h for “slow”.

  Then, the terminal device 20 transmits a route search request to the route search server 30 when the necessary condition setting is completed and the search start button 709 or 712 is operated. Further, the terminal device 20 transmits the terminal ID stored in the terminal ID storage unit 27 together with the route search request to the route search server 30.

  The terminal ID storage means 27 is for accumulating the terminal ID of the own terminal as information for identifying each user. As the terminal ID, a terminal MAC address, a telephone number, a mail address, or the like can be used as a unique identification number.

  Further, the terminal device 20 displays a guide route to the user based on the route search result distributed from the route search server 30. The user starts moving to the destination according to this guidance route.

  Here, a general search method for a route including a travel route by transportation will be described. The road network data for route search by foot or car is configured as follows. For example, when the road is composed of roads A, B, and C as shown in FIG. 7, the end points, intersections, and inflection points of the roads A, B, and C are nodes, and the roads connecting the nodes are directed links. Link cost data with node data (node latitude / longitude), link data (link number) and link cost of each link (link distance or time required to travel the link) as data Composed.

  That is, in FIG. 7, Nn (◯ mark) and Nm (◎ mark) indicate nodes, and Nm (◎ mark) indicates a road intersection. Directional links connecting the nodes are indicated by arrow lines (solid line, dotted line, two-dot chain line). As for the links, there are links facing in the upward and downward directions of the road, but in FIG. 7, only the links in the direction of the arrows are shown for the sake of simplicity.

  When route search is performed using such road network data as a route search database, links linked from the starting node to the destination node are traced to accumulate the link cost, thereby minimizing the accumulated link cost. Search and guide the route. That is, in FIG. 7, when a route search is performed with the departure point as the node AX and the destination as the node CY, the road travels from the node AX along the road A, turns right at the second intersection, enters the road C, and reaches the node CY. The link cost is accumulated sequentially, and a route that minimizes the accumulated link cost is searched for and guided.

  Although other routes from the node AX to the node CY are not shown in FIG. 7, there are actually other such routes, so that a plurality of routes that can be reached from the node AX to the node CY are displayed. A search is performed in the same manner, and a route with the lowest link cost is determined as the optimum route. This is performed, for example, by a well-known method called the Dijkstra method.

  On the other hand, the traffic network data for route search using a transportation system is configured as follows. For example, as shown in FIG. 8, in the case of traffic routes A, B, and C, each station (each airport on an aircraft route) provided on each traffic route A, B, and C is a node, and the nodes are connected. A section is represented by a directional link, and node data (latitude / longitude) and link data (link number) are network data. In FIG. 8, Nn (◯ mark) and Nm (◎ mark) indicate nodes, Nm (◎ mark) indicates a transit point (such as a transfer station) on a traffic route, and a directional link that connects each node. It is indicated by an arrow line (solid line, dotted line, two-dot chain line). As for the links, there are links facing in the upward and downward directions of the traffic route, but in FIG. 8, only the links in the direction of the arrows are shown for the sake of simplicity.

  However, the traffic network basically has a different link cost compared to the road network. In other words, in the road network, the link cost is fixed and static. However, in the traffic network, as shown in FIG. 8, trains and airplanes (hereinafter referred to as individual trains and airplanes) that operate traffic routes are used. A plurality of means of transportation). When the time to depart from one node and the time to arrive at the next node are determined for each means of transportation (specified by timetable data and operation data), and each route does not necessarily link to an adjacent node There is. This is the case, for example, with express trains and trains that stop at each station. In such a case, a plurality of different links exist on the same traffic route, and the required time between nodes may differ depending on the transportation means.

  In the transportation network illustrated in FIG. 8, a plurality of transportation means (routes) Aa to Ac... Exist on the same link of the transportation route A, and a plurality of transportation means (routes) Ca to Cc. Will do. Therefore, unlike a simple road network, the transportation network of a transportation facility has a data amount proportional to the total number of transportation means (routes of individual aircraft, trains, etc.).

  In order to search for a route from a certain departure point to a certain destination using such traffic network data, all the means of transportation that can be used (ride) when arriving from the departure point to the destination are searched. It is necessary to specify the means of transportation that matches the search conditions.

  For example, in FIG. 8, when a specific departure time is designated with the departure point as the node AX of the traffic route A and a route search is performed with the node CY of the traffic route C as the destination, the route operates on the traffic route A. Of the transportation means Aa to Ac..., All transportation means after the departure time are sequentially selected as the departure route. Based on the arrival time at the transit node on the transit route C, among all the transit means Ca to Cc... Operating on the transit route C, all combinations of transit means after the time that can be boarded at the transit node. And the required time of each route, the number of transfers, etc. are accumulated and guided.

  The route search server 30 uses such network data, searches for a plurality of candidate routes from the departure point to the destination in accordance with the route search conditions, and sets the results as candidate routes. Minimize the transfer cost at the transfer station if the departure time of the departure place is specified in the route search conditions, and if the transfer section is included in the route section using transportation The transfer route, the arrival train at the transfer station, and the optimum boarding vehicle number of the train departing from the transfer station are guided.

  Next, the procedure of the transfer process described above will be described. FIG. 9 is a flowchart showing the procedure of the transfer process in the route search system according to the embodiment of the present invention. In FIG. 9, the route search means 33 searches for a route from the departure point to the destination according to the route search condition set in the terminal device 20 (step S101). The route to be searched may be a predetermined number of candidate routes or an optimal route.

  As a result of the search, it is determined whether there is a route section using the transportation system in the obtained route (step S102). If there is no route section using the transportation system, the route search server 30 searches the terminal device 20 for the route information searched. Is transmitted (step S103), and the process is terminated. If there is a route section using transportation, the transfer point extraction means 37 reverses the route from the destination (the nearest station to the destination) to the departure place (the nearest station to the departure point). Then, a transfer point (transfer station) is extracted, and it is determined whether there is a transfer point (transfer station) in front of the (departure point) (step S104). If there is no transfer point in front (no multiple transfers), the process proceeds to step S107, and the optimal boarding vehicle number determination means 38 determines the optimal boarding vehicle number stored in the transfer information data (database DB4). And return.

  In the determination of step S104, if there is a transfer point in front (a plurality of transfer points), the optimal boarding vehicle is referred to with reference to the transfer information of the extracted transfer station (for example, station A in FIG. 4). The number determination means 38 determines whether there are a plurality of optimal boarding vehicle numbers (step S105). If there are not a plurality of optimum boarding vehicle numbers, the process proceeds to step S106, the transfer point is further moved forward, and the process returns to the process by the transfer point extraction means 37 in step S104.

  If it is determined in step S105 that there are a plurality of optimal boarding vehicle numbers, the optimal boarding vehicle number determination means 38 refers to the transfer information of the transfer point (B station in FIG. 4) extracted first. Then, temporarily store the optimal train number of the arrival and departure trains at the transfer point (B station), refer to the transfer information data of the previous transfer point (A station), and refer to the transfer point (A station). ) Is obtained and compared, and it is determined whether or not there is an optimal boarding vehicle number that matches (the AND condition is satisfied).

  In this determination process, if there is a matching vehicle number, the train vehicle number corresponding to the vehicle number is determined at the previous transfer point. In the case of the example shown in FIG. 4, “5-7th from the front” of the arrival side train TRX1 corresponding to “2-4th from the front” of the departure train TRY2 at the A station is determined as the optimum boarding vehicle number. . In the conventional guidance method of the optimal boarding vehicle number when there are no multiple transfers, the optimal boarding determined by the present invention is compared with the “fourth to ninth cars from the front” (see FIG. 10) of the arrival side train TRX1 at station A. The difference from the vehicle number can be easily understood.

  As described above in detail, according to the route search system according to the present invention, there are a plurality of transfers on the optimum route from the departure station to the destination station, and a plurality of optimum boarding vehicles for the transfer route at a certain transfer station. If there is a position, go back from the transfer station closest to the destination station to the transfer station on the departure station side, and detect the optimal boarding vehicle number at one transfer station and the optimal boarding vehicle number at the transfer station one before it. Then, the matching of the detected optimum boarding vehicle number is checked, and the optimum boarding vehicle number in the previous transfer station is determined based on the matching optimum boarding vehicle number, whereby an appropriate optimum boarding vehicle number is determined. You will be able to guide.

  The guidance of the optimal boarding vehicle number at the transfer station according to the present invention can be similarly applied not only to the route search system but also to route guidance, transfer guidance, and the like of transportation facilities.

DESCRIPTION OF SYMBOLS 10 ... Route search system 12 ... Network 20 ... Terminal device 201 ... Control means 21 ... Communication means 22 ... Position information acquisition means 23 ... Search request Means 24... Guidance route data storage means 25... Display means 26... Operation input means 27... Terminal ID storage means 30. ··· Communication means 32 ··· Search request storage means 33 ··· Route search means 34 ··· Map database 35 · · · Route search network database 36 · · · Transfer information database 37 · · · ··· Transfer point extracting means 38 ··· Optimal boarding vehicle number determining means 39 ··· Guide route data editing means 50 ··· POI information distribution server 51 ··· Information distribution server

Claims (18)

In a route search system for searching for a route including a route using a transportation facility as necessary with reference to network data for route search based on a route search request including a set starting point and destination,
The route search system associates an optimum boarding vehicle number of an arrival-side train and an optimum boarding vehicle number of a departure-side train satisfying predetermined transfer conditions for each combination of routes and directions that can be transferred at each transfer station. A transfer information database storing the transfer information, a transfer point extraction means, and an optimal boarding vehicle number determination means,
When the route searched by the route search means includes a plurality of transfers, and there are a plurality of optimum boarding vehicle positions in the transfer route at a transfer station, the transfer point extraction means is 1 for the transfer station and the departure station side. The nearest transfer station is extracted as a transfer point, and the optimal boarding vehicle number determination means refers to the transfer information database, and arrives at the transfer station optimal boarding vehicle number and the transfer station one before the departure station side. The departure-side optimal boarding vehicle number at the station is extracted, the extracted optimal boarding vehicle numbers are compared to check the matching of the optimal boarding vehicle number of the same train, and based on the matching optimal boarding vehicle number, A route search system for determining an optimal number of vehicles for a train at a transfer station.   The optimal boarding vehicle number determination means extracts the optimal boarding vehicle number at a certain transfer station and the optimal boarding vehicle number at the transfer station immediately before the departure station, and compares the extracted optimal boarding vehicle number. When the matching optimal boarding vehicle number of the same train is examined, when the matching optimal boarding vehicle number is not obtained, the optimal boarding vehicle number determination means is based on the transfer information at the previous transfer station. The route search system according to claim 1, wherein an optimum boarding vehicle number of a train at the transfer station immediately before is determined.   In the transfer information stored in the transfer information database, information that associates the optimal boarding vehicle number of the arrival side train and the optimal boarding vehicle number of the departure side train at the transfer station is stored for each combination of route and vertical line. The route search system according to claim 1, wherein the route search system is provided.   The transfer information stored in the transfer information database includes an optimum boarding vehicle number of the arrival side train that satisfies the condition that the time required for the transfer at the transfer station is minimum, or the condition that the position of the getting-off vehicle when arriving is optimal. The route search system according to claim 1, wherein the route search system is information in which an optimum boarding vehicle number of a departure-side train is associated.   5. The transfer point extracting unit extracts a transfer point by tracing back from the transfer station closest to the destination station side to the transfer station on the departure station side. 6. The described route search system. The process of setting the determined optimal boarding vehicle number at the previous transfer station as the arrival-side optimal boarding vehicle number at the certain transfer station is repeated until the transfer station closest to the departure side, and the optimal boarding vehicle at each transfer station 6. The route search system according to claim 5, wherein a number is determined. Based on a route search request including a departure point and a destination set in the terminal device, the route device includes a route including a route using a transportation facility as needed by referring to network data for route search, and the terminal device In the route search server that sends the searched route information to
The route search server associates the optimum boarding vehicle number of the arrival side train and the optimum boarding vehicle number of the departure side train satisfying predetermined transfer conditions for each combination of routes and directions that can be changed at each transfer station. A transfer information database storing the transfer information, a transfer point extraction means, and an optimal boarding vehicle number determination means,
When the route searched by the route search means includes a plurality of transfers, and there are a plurality of optimum boarding vehicle positions in the transfer route at a transfer station, the transfer point extraction means is 1 for the transfer station and the departure station side. The nearest transfer station is extracted as a transfer point, and the optimal boarding vehicle number determination means refers to the transfer information database, and arrives at the transfer station optimal boarding vehicle number and the transfer station one before the departure station side. The departure-side optimal boarding vehicle number at the station is extracted, the extracted optimal boarding vehicle numbers are compared to check the matching of the optimal boarding vehicle number of the same train, and based on the matching optimal boarding vehicle number, A route search server for determining an optimal boarding vehicle number of a train at a transfer station.   The optimal boarding vehicle number determination means extracts the optimal boarding vehicle number at a certain transfer station and the optimal boarding vehicle number at the transfer station immediately before the departure station, and compares the extracted optimal boarding vehicle number. When the matching optimal boarding vehicle number of the same train is examined, when the matching optimal boarding vehicle number is not obtained, the optimal boarding vehicle number determination means is based on the transfer information at the previous transfer station. The route search server according to claim 7, wherein an optimum boarding vehicle number of a train at the transfer station immediately before is determined.   In the transfer information stored in the transfer information database, information that associates the optimal boarding vehicle number of the arrival side train and the optimal boarding vehicle number of the departure side train at the transfer station is stored for each combination of route and vertical line. The route search server according to claim 7 or 8, wherein the route search server is configured.   The transfer information stored in the transfer information database includes an optimum boarding vehicle number of the arrival side train that satisfies the condition that the time required for the transfer at the transfer station is minimum, or the condition that the position of the getting-off vehicle when arriving is optimal. The route search server according to claim 7 or 8, wherein the route search server is information in which an optimum boarding vehicle number of a departure side train is associated.   11. The transfer point extracting unit extracts a transfer point by tracing back from the transfer station closest to the destination station side to the transfer station on the departure station side, according to any one of claims 7 to 10. The described route search server. The process of setting the determined optimal boarding vehicle number at the previous transfer station as the arrival-side optimal boarding vehicle number at the certain transfer station is repeated until the transfer station closest to the departure side, and the optimal boarding vehicle at each transfer station The route search server according to claim 11, wherein a number is determined. A route search method in a route search system for searching for a route including a route using a transportation facility as necessary by referring to network data for route search based on a route search request including a set starting point and destination In
The route search system associates an optimum boarding vehicle number of an arrival-side train and an optimum boarding vehicle number of a departure-side train satisfying predetermined transfer conditions for each combination of routes and directions that can be transferred at each transfer station. A transfer information database storing the transfer information, a transfer point extraction means, and an optimal boarding vehicle number determination means,
When the route searched by the route search means includes a plurality of transfers, and there are a plurality of optimum boarding vehicle positions in the transfer route at a transfer station, the transfer point extraction means is 1 for the transfer station and the departure station side. The nearest transfer station is extracted as a transfer point, and the optimal boarding vehicle number determination means refers to the transfer information database, and arrives at the transfer station optimal boarding vehicle number and the transfer station one before the departure station side. The departure-side optimal boarding vehicle number at the station is extracted, the extracted optimal boarding vehicle numbers are compared to check the matching of the optimal boarding vehicle number of the same train, and based on the matching optimal boarding vehicle number, A route search method characterized by determining an optimal boarding vehicle number of a train at a transfer station.   The optimal boarding vehicle number determination means extracts the optimal boarding vehicle number at a certain transfer station and the optimal boarding vehicle number at the transfer station immediately before the departure station, and compares the extracted optimal boarding vehicle number. When the matching optimal boarding vehicle number of the same train is examined, when the matching optimal boarding vehicle number is not obtained, the optimal boarding vehicle number determination means is based on the transfer information at the previous transfer station. 14. The route search method according to claim 13, wherein an optimum boarding vehicle number of a train at the transfer station immediately before is determined.   In the transfer information stored in the transfer information database, information that associates the optimal boarding vehicle number of the arrival side train and the optimal boarding vehicle number of the departure side train at the transfer station is stored for each combination of route and vertical line. 15. The route search method according to claim 13, wherein the route search method is performed.   The transfer information stored in the transfer information database includes an optimum boarding vehicle number of the arrival side train that satisfies the condition that the time required for the transfer at the transfer station is minimum, or the condition that the position of the getting-off vehicle when arriving is optimal. 15. The route search method according to claim 13, wherein the route search method is information in which an optimum boarding vehicle number of a departure-side train is associated.   17. The transfer point extracting means extracts a transfer point by tracing back from the transfer station closest to the destination station side to the transfer station on the departure station side, according to any one of claims 13 to 16. The described route search method. The process of setting the determined optimal boarding vehicle number at the previous transfer station as the arrival-side optimal boarding vehicle number at the certain transfer station is repeated until the transfer station closest to the departure side, and the optimal boarding vehicle at each transfer station The route search method according to claim 17, wherein a number is determined.

Images