JP2003182579A - Optimum route searching device and its method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To change tramcars in a short time. <P>SOLUTION: Route network data included in time table data in a CD-ROM2 contains optimum change vehicle positional information on an incoming side route in each of combinations of the incoming side route and an incoming direction and an outgoing side route and an outgoing direction per station for change between routes. When an operation part 6 specifies searching conditions composed of a departure point, a destination point and a departure scheduled time and date and instructs to search them, an optimum route searching part 3 uses road data for the CD-ROM2 and the time table data for traffic means to search the optimum route in combination of a walk and the traffic means to allow shortest-time movement from the departure point to the destination point depending on the specified searching conditions, and a storage part 4 stores that result. When there is a station for change on the optimum route, the incoming side route and the incoming direction and the outgoing route and the outgoing direction at the station for change on the optimum route are determined from the route network data and then the optimum change vehicle positional information on the incoming side route is searched and added to the optimum route information. <P>COPYRIGHT: (C)2003,JPO

Description

Detailed Description of the Invention

[0001]

TECHNICAL FIELD The present invention relates to an optimum route search device,
Related to the optimal route search method, especially the optimal route search device and optimal route that search for the optimal route connecting the departure station or the departure place to the destination station or the destination in the shortest travel time, including transit connections Regarding the search method.

[0002]

2. Description of the Related Art From a desired departure place (or departure station) to a desired destination (or destination station), including transit connections
There is an optimum route search device that searches for an optimum route that connects the above with the shortest travel time. If you want to know the optimal route from the desired departure station to the desired destination station (here, transit route of transportation), specify the departure station, the destination station, the scheduled departure date or the estimated arrival date and time, and instruct the search, The optimum route search device searches the optimum route that can be moved from the departure station to the destination station in the shortest time according to the specified search conditions by using the timetable data of the transportation facility, and displays the searched optimal route information. Notify the user by printing, sending by communication to an external information terminal, or the like.

Further, when it is desired to know the optimum route which can be traveled from an arbitrary starting place to an arbitrary destination by a combination of walking and transportation in the shortest moving time, the starting place, the destination, the scheduled departure date and time of the starting place or When the expected arrival date and time is specified and the search is instructed, the optimal route search device uses the road data including the station location information of the transportation and the timetable data of the transportation to specify the combination of walking and transportation. Informs the user by searching for the optimum route that can move from the departure place to the destination in the shortest time according to the search conditions, and displaying, printing, or transmitting the searched optimum route information to an external information terminal. .

[0004]

By the way, there is a transfer station from one route to another route while traveling by transportation according to the optimal route information including the transportation searched by the optimal route search device. In this case, when the vehicle position of the former train on a certain train was away from the platform stairs at the transfer station, it sometimes took time to change trains on another train and was impatient. The present invention has been made in view of the above problems of the prior art, and an object thereof is to provide an optimum route search device and an optimum route search method capable of shortening the transit time of transportation facilities.

[0005]

According to the invention as set forth in claim 1, storage means for storing timetable data including route network data of transportation means, departure station, destination station, scheduled departure date or scheduled arrival date and time. According to the designated search condition consisting of, the transportation means is used to search for an optimum route that can be moved in the shortest time from the departure station to the destination station according to the designated search condition. In the optimum route searching device, the storage means stores in the route network data of the transportation system, for each station that can transfer between routes, for each combination of the line and the direction of the line and the line and the direction of the line of exit. Optimal transfer on the route is stored including the vehicle position information, and the search means uses the route network data of the transportation system to determine the optimum route when there is a station to be transferred between the routes on the searched optimum route. It is necessary to determine the line and direction of the incoming line and the route and line of the outgoing line at the transfer station above, search for the optimal transfer vehicle position information on the incoming line, and add it to the optimal route information. It is characterized by According to the invention described in claim 2, from the road data and the storage means that stores the timetable data including the route network data of the transportation facility, the departure place, the destination, the departure date and the scheduled departure date and time, or the destination and the estimated arrival date and time. According to the specified search conditions, using the road data and the timetable data of the transportation system, the combination of walking and transportation will search for the optimal route that can travel from the origin to the destination in the shortest time according to the specified search conditions. In the optimum route searching device provided with a search means, the storage means stores, in the route network data of the transportation system, for each station that can be transferred between the lines, an incoming line and an incoming line direction, and an outgoing line and an outgoing line. For each combination of directions, the optimal transfer vehicle position information on the incoming line is stored and stored, and the search means uses the route of the transportation system when there is a station on the optimal route to transfer between routes. Optimal on the input line by referring to the optimal transfer vehicle position information by determining the input line and the input line and the output line and the output direction at the transfer station on the optimal route from the network data. Searching the transfer vehicle position information, adding it to the optimum route information, and outputting it.
Is characterized by. According to the third aspect of the invention, the designated search is performed by the transportation facility using the timetable data including the route network data of the transportation facility according to the designated search condition including the departure station, the destination station, the scheduled departure date and time or the estimated arrival date and time. In the optimal route search method that searches for the optimal route that can move from the departure station to the destination station in the shortest time according to the conditions,
In the route network data of the transportation system, for each station that can transfer between lines, including the optimal transfer vehicle position information on the incoming line for each combination of incoming line and incoming direction and outgoing line and outgoing direction When there is a station to transfer between lines on the optimum route searched, the route and the direction of the line at the transfer station and the line at the line of departure at the relevant route on the optimal route from the route network data of the transportation system. And the direction of outgoing line,
The feature is that the optimum transfer vehicle position information on the incoming line is searched and added to the optimum route information. According to the invention as set forth in claim 4, the timetable data including the road data and the route network data of the transportation system is used in accordance with the designated search condition including the departure place, the destination, the departure date scheduled departure date or the destination arrival scheduled date and time. By using the combination of walking and transportation, using the optimal route search method that searches for the optimal route that can travel from the origin to the destination in the shortest time according to the specified search conditions, in the route network data of the transportation, For each station where transfer between lines occurs, the optimal transfer vehicle position information on the incoming line is included according to the combination of the incoming line and the incoming direction and the outgoing line and the outgoing direction, and the optimal route searched When there is a station to transfer between lines, the line and direction of the line at the transfer station and the line and line of the line at the transfer station on the optimal route from the route network data of the transportation system. Discriminated, searches the optimum transfer vehicle position information on the incoming side line, it has to be added to the optimum route information, is characterized in.

[0006]

BEST MODE FOR CARRYING OUT THE INVENTION Next, one embodiment of the present invention will be described with reference to FIG. FIG. 1 is a block diagram showing the configuration of an optimum route search device embodying the optimum route search method according to the present invention. Of the optimum route searching device 1, 2 is CD-
ROM, map data, road data for route search,
Timetable data including route network data for public transportation is stored for route searching. Map data is data for map display for each geographically divided area, and here,
It is used to display the walking route connecting the departure point to the departure station and the walking route connecting the destination station to the destination on the map. The route network data is a station node table that defines all station nodes, with each station on each route as a station node (for each station node, the station node number, station center position coordinates, station name, route number, route name, and other routes). Data indicating whether or not transfer is possible, including transfer data of transfer destination line number and transfer destination station node number when transfer is possible to other routes), route data for each route (route number, route name, route) (Including the station node number column to configure). In addition, in the route network data, a station entrance / exit position information table that collects station entrance / exit position information for each station having one or more entrances / exits, and an optimal exit vehicle position information by station entrance / exit that collects optimal exit vehicle position information by station entrance / exit A table and an optimum transfer vehicle position information table in which optimum transfer vehicle position information is collected are stored for each station that allows transfer between lines. Road data and public transportation timetable data can be searched by user-specified search conditions (departure point, departure point,
It is used to search for an optimal route that can travel from the departure place to the destination in the shortest time according to the destination, the departure date scheduled departure date or the destination arrival scheduled date).

The station entrance / exit position information table is constructed as shown in FIG. 2, and when the station has only one entrance / exit, the position coordinates and name (“South Exit”, “A1”, etc.) of the entrance / exit are station nodes. It is stored in association with a number, and when a station has a plurality of doorways, the position coordinates and names of each doorway are stored in association with a station node number. For example, in the case of the XX line XX station in FIG. 9, the name of the entrance is "A.
There are four "1" to "A4" ... In the case of a line ... station, there are two entrances named "North Exit" and "South Exit". If the station has multiple entrances / exits, the position coordinates for each entrance / exit are used to pull the station position of the departure station candidate to the entrance that can be reached fastest on foot from the departure point, and the station position of the destination station candidate is the destination. Used to pull in to the doorway that can be reached the fastest on foot.

The optimum transfer vehicle position information table is shown in FIG.
It is configured as follows, and for each station where transfer between lines occurs on each line, the optimum transfer vehicle position number on the input line for each combination of the input line and the input direction and the output line and the output direction It is configured by associating (the vehicle position number on the one train with the shortest transfer time from the train on one route to the train on the other line) with the station node number. For example, if the transfer station is the XX station on the XX line in Figure 4,
On the ○○○ line, enter from the ○○○ line × ○ station, get off at the ○○○ line ○○ station, and change to the △△ line at the △△ line ○○ station and board the △△ line △ × Considering the case of exiting to the station, the station node number SN _b of the transfer station, the entry side route number RN _X , the entry side adjacent station node number SN _a indicating the entry direction, the departure side route number RN _Y , the exit Adjacent station node number S indicating the line direction
A combination of N _f and the optimum transfer vehicle position number 1 constitutes one optimum transfer vehicle position information. Also, on the ○○○ line, enter from the ○○○ line ○ × station, get off at the ○○○ line ○○ station, transfer to the △△ line at the △△ line ○○ station, and board the △
△ Line △ × Considering the case of exiting to the station, the station node number SN _b of the transfer station, the entry side route number RN _X , the entry side adjacent station node number SN _c indicating the entry direction, the exit side route number RN
One optimum transfer vehicle position information is formed by a combination of _{Y 1} , an output line side adjacent station node number SN _f indicating the output line direction, and an optimum transfer vehicle position number 4.

On the XX line, enter the XX line from the XX station, get off at the XX station at XX station, and leave at the ∆ △ line at XX station.
Considering the case of transferring to the △ line and boarding, and going out toward the △ △ line × △ station, the station node number SN _b of the transfer station, the entry side route number RN _X , the entry side adjacent station node number indicating the entry direction One optimum transfer vehicle position information is configured by a combination of SN _a , output line side route number RN _Y , output line adjacent station node number SN _d indicating the output line direction, and optimum transfer vehicle position number 1. Also, on the ○○○ line, enter from the ○○○ line ○ × station, get off at the ○○○ line ○○ station, and change to the △△ line at the △△ line ○○ station and board the △△ line. Considering the case of going out toward the line × △ station, the station node number SN _b of the transfer station, the line number RN _{X on} the incoming line, and the adjacent station node number S on the incoming line indicating the incoming direction
One optimum transfer vehicle position information is configured by a combination of N _c , the output line side route number RN _Y , the output line side adjacent station node number SN _d indicating the output line direction, and the optimum transfer vehicle position number 4 (see FIG. 3). ).

Similarly, in the case where the transfer station is the △△ line ○○ station in Fig. 4, the △△ line is entered from the △△ line × △ station, and the passenger is alighted at the △△ line ○○ station and then ○○. Consider the case where you transfer to the ○○○ line at the ○○○○ station and get on the ○○○○○ station.
Station node number SN _e of transfer station, line number R on the incoming line
N _Y , the entrance-side adjacent station node number SN _d indicating the entrance direction,
One optimum transfer vehicle position information is configured by a combination of the output line side route number RN _X , the output line side adjacent station node number SN _c indicating the output line direction, and the optimum transfer vehicle position number 3. Also, on the △△ line, enter the △△ line △ × from the station, and then enter the △△ line ○
Considering the case of getting off at ○ station, transferring to ○○○ line at ○○ station and getting on at ○○○ line, and going out toward ○○○ line ○ × station, station node number SN _e of the transfer station, Entry side route number RN _Y
1 in combination of the entry-side adjacent station node number SN _f indicating the entry direction, the exit-side route number RN _X , the departure-side adjacent station node number SN _c indicating the exit direction, and the optimum transfer vehicle position number 3
One optimal transfer vehicle position information is configured (see FIG. 3).

Further, on the △△ line, enter from the △△ line × △ station, get off at the △△ line ○○ station, and at the ○○○ line ○○ station ○○○
Take in transfer lines, consider the case of outgoing towards ○○○ lines × ○ station, transfer station node number SN e _station, incoming line side route number RN _Y, incoming side neighbor station node number indicating the incoming direction One optimum transfer vehicle position information is formed by a combination of SN _d , output line side route number RN _X , output line side adjacent station node number SN _a indicating the output line direction, and optimum transfer vehicle position number 3. Also, on the △△ line, enter the △△ line △ × from the station,
Considering the case where you get off at the △ ○○ station of the △ line, change to the ○○○ line at the ○○○ line ○○ station, and board the train, and go out toward the ○○○ line × ○ station, the station node number of the transfer station SN _e , line number R on the entry side
N _Y , the entry-side adjacent station node number SN _f indicating the entry direction,
One optimum transfer vehicle position information is configured by a combination of the output line side route number RN _X , the output line adjacent station node number SN _a indicating the output line direction, and the optimum transfer vehicle position number 3 (FIG. 3).
reference).

The optimal exit vehicle position information table for each station entrance / exit is configured as shown in FIG. 5, and for each station where there are multiple exits / entrances on each route, the optimal exit vehicle in the entry direction is classified according to the combination of the entry direction and the entrance / exit. Position number (vehicle position number that can get off the train and reach the desired entrance / exit the earliest)
Is associated with the station node number. For example, in the case where the station having a plurality of entrances / exits is the △△ line △△ station in Fig. 6, the △△ line is entered from the △△ line □ × station, and the △△ line △
△ Considering the case of getting off at the station and exiting from the entrance B1 of the entrance number 1, the station node number SN _h , the route number RN _Y , the entrance side adjacent station node number SN _g indicating the entrance direction, the entrance number 1, the optimum exit vehicle position The combination of the number 1 constitutes one optimal getting-off vehicle position information. In addition, consider the case where you enter from the △△ line to the △△ line □ × station, get off at the △△ line to the △△ station, and exit from the entrance B2 of the entrance / exit number 2, station node number SN _h , line number RN. One optimum getting-off vehicle position information is formed by a combination of _{Y 1} , the entrance-side adjacent station node number SN _g indicating the entering direction, the exit number 2 and the optimum getting-off vehicle position number 6. In addition, consider the case where you enter from the △△ line to the △△ line × □ station, get off at the △△ line and △△ station, and exit from the exit B1. Station node number SN _h , route number RN _Y , and the direction The adjacent station node number SN _i , the entrance number 1
A combination of the optimal getting-off vehicle position number 6 constitutes one optimal getting-off vehicle position information. Also, with △△ line △△ line × □
Enter from the station, get off at the △△ line △△ station, and exit B
Considering the case of going out from 2, the station node number SN _h , the route number RN _Y , and the admission side adjacent station node number S indicating the admission direction
A combination of N _i , entrance / exit number 2, and optimum dismounting vehicle position number 6 constitutes one optimum dismounting vehicle position information (FIG. 5).
reference).

Returning to FIG. 1, reference numeral 3 denotes an optimum route search unit, which specifies a search condition including a departure place, a destination, a scheduled departure date and time of a departure place or a scheduled arrival date and time of a destination by an operation unit described later. After that, when a search instruction operation is performed, the timetable data including the road data stored in the CD-ROM 2 and the route network data of public transportation is used to identify one or more departure station candidates near the departure place. Optimally searched for by finding one or more destination station candidates near the destination and searching for the optimal route that can travel from the departure place to the destination in the shortest time according to the specified search conditions by combining the walking and transportation The route information is stored in the storage unit 4.
The optimum route information stored in the storage unit 4 is character information indicating an outline of the optimum route (optimum route outline character information), departure point-departure station walking route data in the optimum route, and destination station-destination This is walking route data (see FIG. 7).

When a certain departure station candidate has a plurality of entrances / exits, the optimum route searching unit 3 uses the road data and the route network data of public transportation (station entrance / exit information table) to find each entrance / exit. , One exit that can be reached fastest on foot from the departure place is searched, and the position of the searched exit is the station position of the departure station candidate. Similarly, when the destination station candidate has multiple entrances, Using the data and the route network data of public transportation, one of the doorways that can reach the destination earliest on foot is searched, and the position of the searched doorway is set as the station position of the target station candidate. , Find the optimal route that allows you to travel from the starting point to the destination in the shortest time.

Further, when the optimum route search unit 3 has a station on which an optimum route should be changed between lines, the optimum route search unit 3 uses the route network data (station node table,
From the route data, etc.), the optimal transfer line is determined by determining the route and the direction of the incoming line (the adjacent station on the incoming line) and the route and the outgoing line (the adjacent station on the incoming line) at the transfer station on the optimal route. By referring to the vehicle position information table, the optimum transfer vehicle position on the incoming line at the transfer station is searched and added to the optimum route outline character information. When the destination station on the optimal route has a plurality of doorways, the optimal route search unit 3 determines the destination station on the optimal route from the route network data of the transportation system (station node table, route data, etc.). Entry side line that targets one exit and exit that has been determined as the station position of the target station by determining the entry side line and the entry direction (adjacent station on the entry side), and referring to the optimal exiting vehicle position information table by station entrance and exit The optimum position and name of the vehicle to be dismounted is searched and added to the optimum route information. Further, when the departure station of the optimal route has a plurality of doorways, the optimal route search unit 3 retrieves the name of the doorway which is the station position of the departure station and adds it to the optimal route information.

Reference numeral 5 displays the optimum route outline character information indicating the outline of the optimum route, and displays the walking route portion of the optimum route on the map. An operation unit 6 specifies a search condition including a departure place, a destination, a scheduled departure date and time of a departure place or a scheduled arrival date and time of a destination desired by a user, and performs a search instruction operation. Further, after the search, a display instruction operation of a walking route between the departure place and the departure station or a walking route between the destination station and the destination is performed among the optimum routes. A display control unit 7 causes the display unit 5 to display the optimum route outline character information stored in the storage unit 4 when the search is completed. In addition, the starting point-
When the display of the walking route between the departure stations is instructed, the walking route data between the departure place and the departure station stored in the storage unit 4 and the CD-
Using the map data around the departure place stored in the ROM 2, a map image around the departure place is drawn together with the walking route between the departure place and the departure station and displayed on the display unit 5. Similarly, when the operation unit 6 is instructed to display the walking route between the destination station and the destination, the walking route data between the destination station and the destination stored in the storage unit 4 and the departure stored in the CD-ROM 2 are stored. Using the map data around the ground, a map image around the destination station is drawn together with the walking route between the destination station and the destination and displayed on the display unit 5.

FIG. 8 is an explanatory diagram showing an example of a geographical relationship between a departure place and a destination, and FIG. 9 is an explanatory diagram of a method of determining a departure station candidate.
FIG. 10 is an explanatory diagram of a method of deciding a destination station candidate, FIG. 11 is an explanatory diagram of optimum route outline character information displayed on the display unit 5, and FIG.
2 is the starting point on the map around the starting point displayed on the display unit 5
FIG. 13 is an explanatory diagram of an image in which the walking route between the departure stations is overlapped, and FIG. 13 is an explanatory diagram of an image in which the walking route between the destination station and the destination is superimposed on the map around the destination station displayed on the display unit 5. The operation of the above-described embodiment will be described with reference to these drawings.

When the user specifies a search condition consisting of a desired departure place, destination, scheduled departure date and time or expected arrival date and time on the operation unit 6 and performs a search instruction operation, the optimum route search unit 3 causes the CD Using the timetable data including the road data stored in the ROM 2 and the route network data of public transportation, an optimum route that can travel from the starting point to the destination in the shortest time according to the specified search condition is searched. For example, when the user specifies the desired departure place, destination, and scheduled departure date and time as shown in FIG. 8 at 10:00 am on December 14, 2001, the optimum route searching unit 3 first sets Refer to the station entrance / exit location information table shown in
Find all stations that have at least one entrance position coordinate within a certain distance R ₀ (for example, 4 km) from the departure place.
Here, XX line XX station and line ... station 2 in Figure 9
If one of them applies, these two stations are considered as departure station candidates. Then, for each departure station candidate, when there is only one entrance, the position coordinates of the entrance is used as the station position coordinates of the departure station candidate. For departure station candidates with multiple exits, use the road data to search for the route that connects the departure point to the exit with the shortest distance for each exit, and calculate the distance and the time required for walking on each route. To do. The position coordinates of the entrance / exit with the shortest distance (shortest required time) are set as the station position coordinates of the departure station candidate, and the time required from the departure point to the entrance / exit of the departure station and the departure station The entrance / exit number (see FIG. 2) of the entrance / exit set as the station position is stored in the optimum route searching unit 3 in association with the departure station candidate.

For example, the XX line XX station has four entrances from the first to the fourth (the names of the entrances are "A1" to "A").
4)) When there is, "A1" to "A" from the place of departure
RT1 is the shortest route that connects each of the 4 "s along the road.
There are four, RT4, but because RT4 is the shortest, the position coordinate of the entrance "A4" is one of the departure station candidates ○○○
Line XX The station position coordinates of the station. From the place of departure ○○○ Line × ×
The time required for walking between the positions of the stations (here, “A4”) is t ₁ . In addition, when there are two entrances and exits for the line ... station (the names of each entrance are "North Exit" and "South Exit"), the road runs from the departure point to the North Exit and the South Exit. The shortest route along the route is RV1 and RV2, but because RV1 is shorter, the position coordinates of the "North Exit" is another candidate for departure station ... Line ... Use the station position coordinates. From the point of departure ... The time required for walking between the line and the station position (here, “North Exit”) is t ₂ .

In the same manner, the station entrance / exit position information table shown in FIG. 2 is referred to, and all the stations having at least one entrance / exit position coordinate within a certain fixed distance R ₀ from the destination are found. Here, if it is assumed that two stations of the ΔΔ line ΔΔ station and the ■■ line ■■ station of FIG. 10 correspond, these two stations are set as the target station candidates. Then, if there is only one entrance / exit for each destination station candidate, the position coordinates of the entrance / exit are used as the station position coordinates of the destination station candidate. For destination station candidates that have multiple entrances and exits, using road data, for each entrance and exit, while searching for a route that connects the entrance to the destination with the shortest distance,
Calculate the distance and walking time for each route. And
The position coordinates of the entrance / exit with the shortest distance (shortest required time) are used as the station position coordinates of the target station candidate, and the time required from the entrance / exit to the destination as the station position of the target station and the destination station The entrance / exit number (see FIG. 2) of the entrance / exit set as the station position is stored in the optimum route searching unit 3 in association with the target station candidate.

For example, at the ΔΔ line ΔΔ station, there are two entrances, the first and second entrances (see symbols B1 and B2 in FIG. 9).
1 and B2 are named "East Exit" and "West Exit"), the shortest route connecting the destination and each of the entrances and exits B1 and B2 along the road is RP1 and RP2. RP
Since 2 is shorter, the position coordinate of the entrance / exit B2 is set as the station position coordinate of the ΔΔ line ΔΔ station which is one of the target station candidates. △
The time required for walking between the entrance B2 of the △ line △ △ station and the destination is t ₃ . In addition, the ■■ line ■■ station has a north exit.
And "South Exit" (name), the shortest route along the road from the point of departure to "North Exit" and "South Exit" is R
There are two, F1 and RF2, but because RF1 is shorter,
The location coordinates of the “North Exit” is another one of the destination station candidates.
Line ■■ The station position coordinates of the station. ■■ Line ■■ "North Exit" of the station
The time required between the destination and the destination is t ₄ .

Next, the optimum route searching unit 3 operates the CD-ROM 2
Refer to the public transport timetable data stored in
Departure place Assuming that the train arrives at one of the departure station candidates, XX line XX, after t ₁ from the scheduled departure date and time, XX line XX
To explore the train transit route from the station to the △△ line △△ station, which is one of the purposes station candidate, the destination arrival date and time T ₁₃ which is obtained by adding the t ₃ to the scheduled arrival date and time of the △△ line △△ station Ask.
In addition, 1 of the departure station candidate after t ₁ from the starting point scheduled departure date and time
Assuming that you have arrived at the station where the XX line is XX
Line ×× Station is one other purpose station candidate is from ■■ line ■■ ■■ ■■ line destination arrival by adding a t ₄ to the scheduled arrival date and time of the station at the time that Noritsui the train to the station date and time T _Ask for ₁₄ . In addition, it is assumed from the departure point scheduled departure date and time to have arrived to the other is one ... line ... station of departure station candidate after t _2, one of the purposes station candidate from ... line ... Station The △△ line △△ is a line search for the transit route of the train to the △△ line △△
The estimated arrival date / time T _{23 of the} destination is calculated by adding t ₃ to the estimated arrival date / time of the station. In addition, it is one of the departure station candidates after t ₂ from the scheduled departure date and time ... Assuming that the train arrives at the line ... station, and another one of the destination station candidates from the line. ■■ Line ■■ When changing trains to the station ■■ Line ■
(3) Obtain the scheduled arrival date and time T _{24 of the} destination by adding t ₄ to the scheduled arrival date and time of the station. When the scheduled departure date and time is specified, the route that can reach the destination earliest is the best, so the earliest route out of T ₁₃ , T ₁₄ , T ₂₃ , and T ₂₄ is searched. When T ₁₃ applies, the departure station is ○○
○ Line XX is confirmed as a station, and the target station is confirmed as a △△ line △△ station. Then, from the ○○○ line XX station that I searched earlier △
Stores information about transit routes for trains to the △ line △ △ station.

When searching for a transit route for a train, the optimum route search unit 3 uses the timetable data to determine the station node number, station name, route number, route name, and departure point of the departure station. Doorway number of the nearest doorway to (Fig. 2
), Departure time, station node number of the transfer station, station name, line number on the side of the line at the transfer station, line name on the line at the side of arrival, arrival time, line on the line at the line at the transfer station. Station node number of the station just before (close to the departure point) (adjacent station node number on the entrance side), line number on the exit line at the transfer station,
Departure side line name, departure time, station node number of the station one destination ahead of the departure line (destination side) (department side adjacent station node number), station node number for the target station, station name, purpose The entrance number and the arrival time of the nearest entrance / exit to the destination set as the station position of the station are determined, and these pieces of information are also stored in the transit route information of the train. Further, the name of the entrance / exit designated as the station position of the departure station is searched, the name of the entrance / exit designated as the station position of the destination station is searched, and this information is also stored in the transit route information of the train.

When the relationship between the departure place, the destination, the XX line, and the △△ line is as shown in FIG. 8, the departure station is the XX line XX station (see FIG. 9), and the departure station is the station. The entrance and exit located is "A4" (name). The destination station is the △△ line △△
It becomes a station (see FIGS. 10 and 6), and the entrance and exit that is the station position of the destination station is the “West Exit” (name) of B2.

[0025] In addition, the transfer station becomes a ○○○ line ○○ station (see Fig. 4), the train transit route information, transfer station of station node number SN _b, station name ○○ station, transfer incoming line side and a train station Line number RN _X , line name on the entry side ○○○ line, arrival time,
Station node number of the station immediately before (on the departure point) on the transfer line at the transfer station (adjacent station node number on the transfer side, indicating the direction of transfer at the transfer station) SN _a , exit at the transfer station Line-side route number RN _Y , line-out side line name △△ line, departure time, station node number of station one ahead (destination-side) on line out-line (outline-side adjacent station node number, SN _f, which indicates the outgoing line direction at the transfer station) is included.

After that, the optimum route searching unit 3 refers to the road data to search for the shortest walking route connecting the departure point to the entrance "A4" set as the station position of the previously determined departure station, and starts from the departure point. -Stored internally as walking route data between departure stations. Similarly, by referring to the road data, a shortest walking path connecting the destination B2 set as the station position of the destination station previously determined to the destination is searched for and stored internally as the walking route data between the destination station and the destination. To do.

Further, the optimum route searching unit 3 selects the optimum transfer vehicle position information table (see FIG. 3) from the route network data of the transportation system.
Refer to), for the ○○○ line to be transferred in the transfer route information of the train that was searched earlier, the line number on the entrance side, the adjacent station node number on the entrance side, and the line number on the exit side From the adjacent station node number on the line side, enter the line on the incoming line ○ ○ ○ line ×
○ When entering from the station direction and exiting toward the exit side line △△ △ × station direction, you can change to the ○○○ line ○○ station fastest and search for the optimal transfer vehicle position of the ○○○ line, It is added to the transit route information and stored. In the case of FIGS. 3 and 4, the optimum transfer vehicle position is 1.

Further, the optimum route search unit 3 refers to the optimum exiting vehicle position information table for each station entrance / exit in the route network data of the transportation system (see FIG. 5), and finds among the transfer route information of the train previously searched. About the △△ line △△ station which is the destination station of
From the entrance side line number, the entrance side adjacent station node number, and the entrance / exit number (2), enter the entrance side line △△ line from the × □ station direction and go to the entrance / exit B2 at the △△ line △△ station first The optimum dismounting vehicle position of the movable ΔΔ line is searched for and added to the transfer route information and stored. In the case of FIG. 5 and FIG. 6, the optimum dismounting vehicle position is 6.

As described above, when the optimum route searching unit 3 completes the search for the optimum route connecting the starting point to the destination in the shortest time by walking and transportation, it stores between the departure station and the starting point stored in the inside. The walking route data and t ₁ are associated with each other and stored in the storage unit 4, and the destination station-destination walking route data and t ₃ are associated with each other and stored in the storage unit 4. In addition, the outline of the optimum route is shown in letters based on the transit route information, the scheduled departure date and time, t ₁ , t _3, etc., according to the means of transportation.
The optimum route outline character information is created as in 1 and stored in the storage unit 4.

When the optimum route search unit 3 completes the search for the optimum route, the display control unit 7 first causes the display unit 5 to display the optimum route outline character information stored in the storage unit 4 (see FIG. 1).
1). This allows the user to walk from the departure point to the departure station, the station name of the departure station, the route name, the name of the gateway closest to the departure point at the departure station, the departure time at the departure station, and the train at the departure station. Vehicle location suitable for boarding (vehicle location where it is convenient to transfer at the next transfer station), station name of the transfer station,
Line name and station name of transfer destination, departure time on transfer destination line, station name of destination station, line name, arrival time at destination station, name of gateway closest to destination at destination station, from destination station to destination You can find out the time required by walking on.

Here, since the name of the entrance / exit of the departure station closest to the departure place is known, even if the departure station has a plurality of entrances / exits, after departure on foot from the departure place, You can easily find the nearest doorway to the ground, eliminating the danger of making a detour to the departure station. Similarly, since the name of the entrance / exit of the nearest destination station to the destination is known, even if the destination station has multiple entrances / exits, it is possible to easily find the entrance / exit closest to the destination among the entrances / exits of the destination station. It can be done and there is no fear of making a detour to the destination. In addition, from the one route (see RB in FIG. 8) to the other route (R in FIG. 8)
If you have a station to transfer to (see C), you can find in advance the convenient vehicle position for quick transfer on one of the routes,
When getting on a train on one of the routes, it is possible to shorten the time required for changing trains by getting to the convenient vehicle position. Similarly, you can get off the last train to the destination station and find the convenient vehicle position that can quickly go to the nearest doorway to the destination among the gateways of the destination station, so take the train on the last train At this time, by getting on the convenient vehicle position, it is possible to quickly reach the destination at the destination station at the destination.

When the user wants to confirm the walking route between the departure place and the departure station on the map, the user operates the operation unit 6 to display the walking route between the departure place and the departure station. Then, the display control unit 7 refers to the departure place-departure station walking route data in the storage unit 4, reads the map data around the departure place from the CD-ROM 2, and displays the map image centered on the departure place. It is drawn and overlaid on the map image.
(Refer) with a particular color in bold and emphasized, and then draw and display the starting point mark and the ending point mark on the map image at the points corresponding to the starting point and the end point of the walking route between the departure point and the departure station. It is displayed on the section 5 (see FIG. 12). This allows the user to confirm the optimum walking route from the departure place to the departure station on the map. Even if the departure station has multiple entrances / exits, the optimum walking path from the departure point to the nearest entrance / exit is searched, so that the user selects the highlighted walking path on the map (see reference numeral RA ′ in FIG. 12). ) To head to the departure station, you can quickly reach the departure point,
Eliminates the danger of accidentally heading to the doorway farther from the place of departure within the departure station.

When the user wants to confirm the destination station-destination walking route on the map, the user operates the operation unit 6 to display the destination station-destination walking route display instruction. Then, the display control unit 7
Refers to the destination station-destination walking route data in the storage unit 4, reads the map data around the destination station from the CD-ROM 2, draws a map image centered on the destination station, and draws the map image. Overlap on top of and walk route between destination station and destination (Fig. 8
(Refer to RD of), and draw with a particular color thickly emphasized.
In the map image, the starting point mark and the ending point mark are overlapped and drawn at the positions corresponding to the starting point and the ending point of the destination station-destination walking route and displayed on the display unit 5 (see FIG. 13). As a result, the user can confirm the optimum walking route from the destination station to the destination on the map. Even if the destination station has multiple entrances and exits, the optimum walking route toward the destination is searched from the nearest entrance to the destination, so the user can select the highlighted walking route on the map (reference numeral in FIG. 12). (Refer to RD ')
You can quickly reach the destination by exiting the destination station from the exit corresponding to the starting point and following the emphasized walking path, and make a mistake from the exit of the destination station far from the destination. There is no longer a risk of exiting and making a detour to the destination.

According to this embodiment, when there is a transfer station from one line to another line in the middle of the optimum route searched by the optimum route search unit 3, the transfer station is the earliest transfer line. Since it is possible for the user to know the boarding vehicle position on the train of the certain route that can be performed, it is possible to avoid wasteful time for transfer. Regarding the destination station of the optimal route searched by the optimal route search unit 3, get off at the destination station from the last train on the route that got on to the destination station, and quickly go to the closest gateway to the destination among the destination gateways. Since you can know in advance the convenient vehicle position, you can quickly reach the destination at the destination station by getting on the convenient vehicle position when you take the train on the last route. it can. Further, when the optimum route searching unit 3 searches for one or a plurality of departure station candidates near the departure place, and a certain departure station candidate has a plurality of entrances and exits, the nearest one to the departure place is obtained.
If one destination station candidate has multiple entrances / exits when one or more destination station candidates near the destination are searched by setting one entrance / exit to the station position of the departure station candidate, Since one of the nearest entrances and exits is set to the station position of the target station candidate and the optimum route is searched, finally, the route between the departure point and the destination and the route with the shortest travel time by transportation are selected. You can definitely search. Then, when the departure station on the finally searched optimum route has a plurality of entrances and exits, the user can know the name of one of the most optimum entrances and exits closest to the departure place, so You can easily find the entrance and exit, and you do not have to make a roundabout trip to enter the departure station. Similarly, when the destination station on the optimal route that you finally searched for has multiple entrances and exits, the nearest Since the user can know the name of the most optimal entrance / exit, the nearest entrance / exit to the destination can be easily found and it is not necessary to make a detour to the destination.

In the above embodiment, the departure place,
Although the explanation has been given by taking the case of specifying the destination and the departure point scheduled departure time as the search conditions, the same applies to the case of specifying the departure point, the destination, and the destination arrival scheduled time as the search conditions. it can. When the estimated arrival time of the destination is specified, the optimum route search unit selects the departure place from the combination of one or more departure station candidates near the departure place and one or more destination station candidates near the destination. The combination of the departure station candidate and the destination station candidate of the combination that can depart latest can be determined as the departure station and the destination station.

Further, in the above-mentioned embodiment, the case where the departure place and the destination are separated from the station has been described, but a certain desired station is set as the departure place and another certain desired station is set as the destination. , The scheduled departure date and time of the departure station or the scheduled arrival date and time of the destination station may be specified. In this case, the optimum route search unit 3 does not use the road data, but simply uses the timetable data in accordance with the designated search condition. It is only necessary to search for an optimal transfer route that allows the user to move from the departure station to the destination station in the shortest time. At this time, if there is a station to be changed, the optimum transfer vehicle position is obtained in the same manner as described above. The optimum exit vehicle position and entrance name at the destination station should be obtained by targeting the first entrance and exit of the destination station, and the name of the departure station should be
The first exit of the departure station should be the target.

In the above embodiment, the road data and the timetable data of the transportation facility are stored in the CD-ROM 1, but they are stored in the IC memory card so that the optimum route searching device can be carried. Is also good. In addition, an optimum route search device is installed on the network so that it can communicate with the outside, and a search condition is specified from the mobile phone, portable computer, etc. via the network, and the optimum route search device is instructed to search. When the search is instructed,
After the optimum route search unit searches for the optimum route in accordance with the specified search condition, the delivery unit (not shown) returns the optimum route outline character information to the requesting mobile phone, mobile computer, etc. to enable screen display. When a walk route between departure points and departure stations (or a destination station-walk route between destinations) is requested from a mobile phone, mobile computer, etc., map image data around the departure point with an emphasized walk route drawn by the display control unit. The distribution unit (not shown) may reply (or map image data around the target station with an emphasized walking route) to the requesting mobile phone, mobile computer, or the like so that the screen can be displayed.

[0038]

According to the present invention, when there is a transfer station from a certain route to another route in the middle of the searched optimum route, the transfer of the certain route can be performed earliest at the transfer station. Since the user can know the position of the boarded vehicle on the train, it is possible to avoid wasting time when changing trains.

[Brief description of drawings]

FIG. 1 is a configuration diagram of an optimum route search device according to an embodiment of the present invention.

FIG. 2 is an explanatory diagram showing the contents of a station entrance / exit information table included in the route network data in FIG.

FIG. 3 is an explanatory diagram showing the contents of an optimal transfer vehicle position information table included in the route network data in FIG.

FIG. 4 is an explanatory diagram illustrating a data configuration of an optimum transfer vehicle position information table.

5 is an explanatory diagram showing the contents of a station entrance / exit optimum dismounting vehicle position information table included in the route network data in FIG. 1. FIG.

FIG. 6 is an explanatory diagram illustrating a data structure of an optimal exiting vehicle position information table for each station entrance / exit.

7 is an explanatory diagram of contents stored in a storage unit in FIG. 1. FIG.

FIG. 8 is an explanatory diagram of an optimum route search method.

FIG. 9 is an explanatory diagram of an optimum route search method.

FIG. 10 is an explanatory diagram of an optimum route search method.

FIG. 11 is an explanatory diagram of optimum route outline character information displayed on the display unit.

FIG. 12 is an explanatory diagram of a walking route connecting a departure place to a departure station, which is displayed on the display unit in an overlapping manner on the map.

FIG. 13 is an explanatory diagram of a walking route connecting a destination station to a destination, which is displayed on the display unit in an overlapping manner on the map.

[Explanation of symbols]

1 Optimal route search device 2 CD-ROM 3 Optimal route search unit 4 Storage unit 5 Display 6 Operation 7 Display control section

Continued front page    F term (reference) 5B075 ND02 PQ32 PQ75 UU16                 5H161 AA01 CC20 GG14 GG15 GG17                       GG22

Claims (4)

[Claims] 1. A storage means for storing timetable data including route network data of transportation means, and a designated search condition including a departure station, a destination station, a scheduled departure date and time or an estimated arrival date and time,
An optimum route search device equipped with a search means for searching an optimal route that can travel from a departure station to a destination station in the shortest time according to a specified search condition by using the timetable data of the transportation facility, As means, in the route network data of the transportation system, for each station that can transfer between lines, the line on the entrance side and the direction of the line,
For each combination of the outbound route and the outbound route, the optimum transfer vehicle position information on the inbound route is stored and stored, and the search means has a station to transfer between the routes on the optimal route searched. At this time, after determining the line and the direction of the incoming line and the line and the direction of the outgoing line at the transfer station on the optimal route from the route network data of the transportation system, the optimal transfer vehicle position on the line of the incoming line An optimum route search device characterized in that information is searched and added to the optimum route information. 2. A storage means for storing road data and timetable data including route network data of transportation means, and a designated search condition consisting of a departure place, a destination, a departure date scheduled departure date or a destination arrival scheduled date and time. , A search means that searches for an optimal route that can travel from the place of departure to the destination in the shortest time according to the specified search condition by combining the road data and the timetable data of the transportation system with the combination of walking and transportation. In the optimal route search device provided, the storage means, in the route network data of the transportation, for each station that can transfer between routes, the entrance side line and the entrance direction,
For each combination of the route on the outgoing line and the direction of the outgoing line, the optimal transfer vehicle position information on the route on the incoming line is stored and stored, and the search means, when there is a station to be transferred between the routes on the optimal route, After determining the line and the direction of the line at the transfer station and the line and the direction of the line at the transfer station on the optimal route from the route network data of the transportation system, the optimal transfer vehicle position information on the line at the line of arrival is calculated. An optimum route search device characterized by being searched and added to the optimum route information. 3. Departure according to designated search conditions by means of transportation using timetable data including route network data of transportation according to designated search conditions consisting of departure station, destination station, scheduled date of departure or scheduled date of arrival. In the optimal route search method that searches for the optimal route that can move from the station to the destination station in the shortest time, in the route network data of the transportation system, for each station that can transfer between routes, the entry side route and the entry direction, Optimal transfer vehicle position information on the incoming line is included for each combination of outgoing line and outgoing direction, and when there is a station to transfer between lines on the searched optimal route, the route network of the transportation system After determining the line and the direction of the incoming line and the line and the direction of the outgoing line at the transfer station on the optimal route from the data, search for the optimal transfer vehicle position information on the incoming line , The optimum route searching method for it has to be added to the optimum route information, a features. 4. According to a designated search condition consisting of a departure place, a destination, a departure date scheduled departure date or a destination arrival scheduled date,
Using timetable data including road data and route network data of transportation facilities, a combination of walking and transportation facilities is used to search for an optimal route that can travel from the origin to the destination in the shortest time according to the specified search conditions. In the optimal route search method described above, in the route network data of the transportation system, for each station where a transfer between lines occurs, the line on the input side and the line in the direction Including the optimal transfer vehicle position information, when there is a station to transfer between routes on the searched optimum route, the route line data at the transfer station on the optimum route from the transportation route network data After determining the incoming line direction, the outgoing line and the outgoing line direction, the optimal transfer vehicle position information on the incoming line route is searched and added to the optimal route information. Suitable route search method.