JP2003182579A - Optimum route searching device and its method - Google Patents
Optimum route searching device and its methodInfo
- Publication number
- JP2003182579A JP2003182579A JP2001402774A JP2001402774A JP2003182579A JP 2003182579 A JP2003182579 A JP 2003182579A JP 2001402774 A JP2001402774 A JP 2001402774A JP 2001402774 A JP2001402774 A JP 2001402774A JP 2003182579 A JP2003182579 A JP 2003182579A
- Authority
- JP
- Japan
- Prior art keywords
- station
- route
- line
- departure
- destination
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims description 16
- 238000010586 diagram Methods 0.000 description 20
- 238000004891 communication Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 230000008685 targeting Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
【0001】[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】[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.
【0003】また、任意の出発地から任意の目的地まで
を徒歩と交通機関の組み合わせにより、最短の移動時間
で移動できる最適経路を知りたい場合、出発地、目的
地、出発地出発予定日時または目的地到着予定日時を指
定し、探索を指示すると、最適経路探索装置は、交通機
関の駅位置情報を含む道路データと、交通機関の時刻表
データを用いて徒歩と交通機関の組み合わせにより、指
定探索条件に応じて出発地から目的地まで最短時間で移
動できる最適な経路を探索し、該探索した最適経路情報
を表示、印刷、通信により外部の情報端末に送信するな
どしてユーザに告知する。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】[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】[0005]
【課題を解決するための手段】請求項1記載の発明によ
れば、交通機関の路線網データを含む時刻表データを記
憶した記憶手段と、出発駅、目的駅、出発予定日時また
は到着予定日時から成る指定探索条件に従い、交通機関
の時刻表データを用いて交通機関により、指定探索条件
に応じて出発駅から目的駅まで最短時間で移動できる最
適な経路を探索する探索手段と、を備えた最適経路探索
装置において、記憶手段には、交通機関の路線網データ
に、路線間の乗換えができる各駅につき、入線側路線及
び入線方向と、出線側路線及び出線方向の組み合わせ別
に、入線側路線での最適乗換え車両位置情報を含めて記
憶しておき、探索手段は、探索した最適な経路に路線間
で乗換えを行うべき駅があるとき、交通機関の路線網デ
ータから最適な経路上での当該乗換え駅での入線側路線
及び入線方向と、出線側路線及び出線方向を判別し、入
線側路線での最適乗換え車両位置情報を検索し、最適経
路情報に付加しするようにしたこと、を特徴としてい
る。請求項2記載の発明によれば、道路データと、交通
機関の路線網データを含む時刻表データを記憶した記憶
手段と、出発地、目的地、出発地出発予定日時または目
的地到着予定日時から成る指定探索条件に従い、道路デ
ータと、交通機関の時刻表データを用いて徒歩と交通機
関の組み合わせにより、指定探索条件に応じて出発地か
ら目的地まで最短時間で移動できる最適な経路を探索す
る探索手段と、を備えた最適経路探索装置において、記
憶手段には、交通機関の路線網データに、路線間の乗換
えができる各駅につき、入線側路線及び入線方向と、出
線側路線及び出線方向の組み合わせ別に、入線側路線で
の最適乗換え車両位置情報を含めて記憶しておき、探索
手段は、最適な経路に路線間で乗換えを行うべき駅があ
るとき、交通機関の路線網データから最適な経路上での
当該乗換え駅での入線側路線及び入線方向と、出線側路
線及び出線方向を判別し、最適乗換え車両位置情報を参
照して、入線側路線での最適乗換え車両位置情報を検索
し、最適経路情報に付加して出力するようにしたこと、
を特徴としている。請求項3記載の発明によれば、出発
駅、目的駅、出発予定日時または到着予定日時から成る
指定探索条件に従い、交通機関の路線網データを含む時
刻表データを用いて交通機関により、指定探索条件に応
じて出発駅から目的駅まで最短時間で移動できる最適な
経路を探索するようにした最適経路探索方法において、
交通機関の路線網データに、路線間の乗換えができる各
駅につき、入線側路線及び入線方向と、出線側路線及び
出線方向の組み合わせ別に、入線側路線での最適乗換え
車両位置情報を含めておき、探索した最適な経路に路線
間で乗換えを行うべき駅があるとき、交通機関の路線網
データから最適な経路上での当該乗換え駅での入線側路
線及び入線方向と、出線側路線及び出線方向を判別し、
入線側路線での最適乗換え車両位置情報を検索し、最適
経路情報に付加するようにしたこと、を特徴としてい
る。請求項4記載の発明によれば、出発地、目的地、出
発地出発予定日時または目的地到着予定日時から成る指
定探索条件に従い、道路データと、交通機関の路線網デ
ータを含む時刻表データを用いて徒歩と交通機関の組み
合わせにより、指定探索条件に応じて出発地から目的地
まで最短時間で移動できる最適な経路を探索するように
した最適経路探索方法において、交通機関の路線網デー
タに、路線間の乗換えが生じる各駅につき、入線側路線
及び入線方向と、出線側路線及び出線方向の組み合わせ
別に、入線側路線での最適乗換え車両位置情報を含めて
おき、探索した最適な経路に路線間で乗換えを行うべき
駅があるとき、交通機関の路線網データから最適な経路
上での当該乗換え駅での入線側路線及び入線方向と、出
線側路線及び出線方向を判別し、入線側路線での最適乗
換え車両位置情報を検索し、最適経路情報に付加するよ
うにしたこと、を特徴としている。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】[0006]
【発明の実施の形態】次に、本発明の一つの実施の形態
を図1を参照して説明する。図1は本発明に係る最適経
路探索方法を具現した最適経路探索装置の構成を示すブ
ロック図である。最適経路探索装置1の内、2はCD−
ROMであり、地図データ、経路探索用の道路データ、
経路探索用で公共交通機関の路線網データを含む時刻表
データが記憶されている。地図データは、地理的に分割
された領域毎の地図表示用のデータであり、ここでは、
出発地から出発駅までを結ぶ徒歩経路、目的駅から目的
地までを結ぶ徒歩経路を地図上に重ねて表示するために
用いられる。路線網データは、各路線の各駅を駅ノード
として、全駅ノードを定義した駅ノードテーブル(駅ノ
ード毎に、駅ノード番号、駅中心位置座標、駅名、路線
番号、路線名、他の路線に乗換え可か否かを示すデー
タ、他の路線に乗換え可の場合に乗換え先路線番号と乗
換え先駅ノード番号の組データを含む)、各路線毎の路
線データ(路線番号、路線名、路線を構成する駅ノード
番号列を含む)を含む。また、路線網データには、1ま
たは複数の出入口を有する各駅について駅出入口位置情
報を集めた駅出入口位置情報テーブルと、駅出入口別最
適降車車両位置情報を集めた駅出入口別最適降車車両位
置情報テーブル、路線間の乗換えが可能な各駅につい
て、最適乗換え車両位置情報を集めた最適乗換え車両位
置情報テーブルとが含めて記憶されている。道路データ
と公共交通機関の時刻表データは、徒歩と公共交通機関
の組み合わせにより、ユーザ指定の探索条件(出発地、
目的地、出発地出発予定日時または目的地到着予定日
時)に応じて出発地から目的地までを最短時間で移動で
きる最適経路を探索するために用いられる。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).
【0007】駅出入口位置情報テーブルは、図2の如く
構成されており、駅が1つの出入口しか有しない場合
は、該出入口の位置座標と名称(「南口」、「A1」な
ど)が駅ノード番号と対応付けて記憶されており、駅が
複数の出入口を有する場合は、各出入口の位置座標と名
称を駅ノード番号と対応付けて記憶されている。例え
ば、図9の○○○線××駅の場合、出入口は名称が「A
1」〜「A4」の4つ有り、・・・線・・駅の場合、出
入口は名称が「北口」と「南口」の2つ有る。駅が複数
の出入口を有する場合の各出入口毎の位置座標は、出発
駅候補の駅位置を出発地から徒歩で一番早く到達できる
出入口に引き込むために用い、目的駅候補の駅位置を目
的地まで徒歩で一番早く到達できる出入口に引き込むた
めに用いる。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.
【0008】最適乗換え車両位置情報テーブルは、図3
の如く構成されており、各路線上で路線間の乗換えが生
じる各駅につき、入線側路線及び入線方向と、出線側路
線及び出線方向の組み合わせ別に、入線側路線での最適
乗換え車両位置番号(一方の路線の電車から他方の路線
の電車への乗換え時間が一番短い当該一方の電車での車
両位置番号)を駅ノード番号と対応付けて構成されてい
る。例えば、乗換え駅が図4の○○○線○○駅の場合、
○○○線で○○○線×○駅の方から入線して、○○○線
○○駅で降車し、△△線○○駅で△△線に乗り換えて乗
車し、△△線△×駅の方へ出線する場合を考え、乗換え
駅の駅ノード番号SNb、入線側路線番号RNX、入線
方向を示す入線側隣接駅ノード番号SNa、出線側路線
番号RNY、出線方向を示す出線側隣接駅ノード番号S
Nf、最適乗換え車両位置番号1の組み合わせで1つの
最適乗換え車両位置情報が構成される。また、○○○線
で○○○線○×駅の方から入線して、○○○線○○駅で
降車し、△△線○○駅で△△線に乗り換えて乗車し、△
△線△×駅の方へ出線する場合を考え、乗換え駅の駅ノ
ード番号SNb、入線側路線番号RNX、入線方向を示
す入線側隣接駅ノード番号SNc、出線側路線番号RN
Y、出線方向を示す出線側隣接駅ノード番号SNf、最
適乗換え車両位置番号4の組み合わせで1つの最適乗換
え車両位置情報が構成される。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.
【0009】また、○○○線で○○○線×○駅の方から
入線して、○○○線○○駅で降車し、△△線○○駅で△
△線に乗り換えて乗車し、△△線×△駅の方へ出線する
場合を考え、乗換え駅の駅ノード番号SNb、入線側路
線番号RNX、入線方向を示す入線側隣接駅ノード番号
SNa、出線側路線番号RNY、出線方向を示す出線側
隣接駅ノード番号SNd、最適乗換え車両位置番号1の
組み合わせで1つの最適乗換え車両位置情報が構成され
る。また、○○○線で○○○線○×駅の方から入線し
て、○○○線○○駅で降車し、△△線○○駅で△△線に
乗り換えて乗車し、△△線×△駅の方へ出線する場合を
考え、乗換え駅の駅ノード番号SNb、入線側路線番号
RNX、入線方向を示す入線側隣接駅ノード番号S
Nc、出線側路線番号RNY、出線方向を示す出線側隣
接駅ノード番号SNd、最適乗換え車両位置番号4の組
み合わせで1つの最適乗換え車両位置情報が構成される
(図3参照)。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). ).
【0010】同様に、乗換え駅が図4の△△線○○駅の
場合、△△線で△△線×△駅の方から入線して、△△線
○○駅で降車し、○○○線○○駅で○○○線に乗り換え
て乗車し、○○○線○×駅の方へ出線する場合を考え、
乗換え駅の駅ノード番号SNe、入線側路線番号R
NY、入線方向を示す入線側隣接駅ノード番号SNd、
出線側路線番号RNX、出線方向を示す出線側隣接駅ノ
ード番号SNc、最適乗換え車両位置番号3の組み合わ
せで1つの最適乗換え車両位置情報が構成される。ま
た、△△線で△△線△×駅の方から入線して、△△線○
○駅で降車し、○○○線○○駅で○○○線に乗り換えて
乗車し、○○○線○×駅の方へ出線する場合を考え、乗
換え駅の駅ノード番号SNe、入線側路線番号RNY、
入線方向を示す入線側隣接駅ノード番号SNf、出線側
路線番号RNX、出線方向を示す出線側隣接駅ノード番
号SNc、最適乗換え車両位置番号3の組み合わせで1
つの最適乗換え車両位置情報が構成される(図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).
【0011】また、△△線で△△線×△駅の方から入線
して、△△線○○駅で降車し、○○○線○○駅で○○○
線に乗り換えて乗車し、○○○線×○駅の方へ出線する
場合を考え、乗換え駅の駅ノード番号SNe、入線側路
線番号RNY、入線方向を示す入線側隣接駅ノード番号
SNd、出線側路線番号RNX、出線方向を示す出線側
隣接駅ノード番号SNa、最適乗換え車両位置番号3の
組み合わせで1つの最適乗換え車両位置情報が構成され
る。また、△△線で△△線△×駅の方から入線して、△
△線○○駅で降車し、○○○線○○駅で○○○線に乗り
換えて乗車し、○○○線×○駅の方へ出線する場合を考
え、乗換え駅の駅ノード番号SNe、入線側路線番号R
NY、入線方向を示す入線側隣接駅ノード番号SNf、
出線側路線番号RNX、出線方向を示す出線側隣接駅ノ
ード番号SNa、最適乗換え車両位置番号3の組み合わ
せで1つの最適乗換え車両位置情報が構成される(図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).
【0012】駅出入口別最適降車車両位置情報テーブル
は、図5の如く構成されており、各路線上で出入口が複
数存在する各駅につき、入線方向と出入口の組み合わせ
別に、入線方向での最適降車車両位置番号(電車を降り
て所望の出入口まで一番早く到達できる車両位置番号)
を、駅ノード番号と対応付けて構成されている。例え
ば、複数の出入口を有する駅が図6の△△線△△駅の場
合、△△線で△△線□×駅の方から入線して、△△線△
△駅で降車し、出入口番号1の出入口B1から出る場合
を考え、駅ノード番号SNh、路線番号RNY、入線方
向を示す入線側隣接駅ノード番号SNg、出入口番号
1、最適降車車両位置番号1の組み合わせで1つの最適
降車車両位置情報が構成される。また、△△線で△△線
□×駅の方から入線して、△△線△△駅で降車し、出入
口番号2の出入口B2から出る場合を考え、駅ノード番
号SNh、路線番号RNY、入線方向を示す入線側隣接
駅ノード番号SNg、出入口番号2、最適降車車両位置
番号6の組み合わせで1つの最適降車車両位置情報が構
成される。また、△△線で△△線×□駅の方から入線し
て、△△線△△駅で降車し、出入口B1から出る場合を
考え、駅ノード番号SNh、路線番号RNY、入線方向
を示す入線側隣接駅ノード番号SNi、出入口番号1、
最適降車車両位置番号6の組み合わせで1つの最適降車
車両位置情報が構成される。また、△△線で△△線×□
駅の方から入線して、△△線△△駅で降車し、出入口B
2から出る場合を考え、駅ノード番号SNh、路線番号
RNY、入線方向を示す入線側隣接駅ノード番号S
Ni、出入口番号2、最適降車車両位置番号6の組み合
わせで1つの最適降車車両位置情報が構成される(図5
参照)。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).
【0013】図1に戻って、3は最適経路探索部であ
り、後述する操作部により、ユーザ所望の出発地、目的
地、出発地出発予定日時または目的地到着予定日時から
なる探索条件が指定されたのち、探索指示操作がされる
と、CD−ROM2に記憶された道路データと公共交通
機関の路線網データを含む時刻表データを用いて、出発
地近くの1または複数の出発駅候補と目的地近くの1ま
たは複数の目的駅候補を定めるとともに、徒歩と交通機
関の組み合わせにより、指定探索条件に応じて出発地か
ら目的地まで最短時間で移動できる最適な経路を探索
し、探索した最適経路の情報を記憶部4に記憶させる。
記憶部4に記憶される最適経路情報は、最適経路の概要
を示す文字情報(最適経路概要文字情報)と、最適経路
中の出発地−出発駅間徒歩経路データと、目的駅−目的
地間徒歩経路データである(図7参照)。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).
【0014】最適経路探索部3は、若し或る出発駅候補
が複数の出入口を有するときは、道路データと公共交通
機関の路線網データ(駅出入口情報テーブル)を用い
て、各出入口の内、出発地から徒歩で一番早く到達でき
る1つの出入口を探索し、該探索した出入口の位置を当
該出発駅候補の駅位置とし、同様に、目的駅候補が複数
の出入口を有するときは、道路データと公共交通機関の
路線網データを用いて、各出入口の内、目的地まで徒歩
で一番早く到達できる1つの出入口を探索し、該探索し
た出入口の位置を当該目的駅候補の駅位置として、出発
地から目的地まで最短時間で移動できる最適な経路を探
索する。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.
【0015】また、最適経路探索部3は、最適な経路に
路線間で乗換えを行うべき駅があるとき、最適経路探索
部3は、交通機関の路線網データ(駅ノードテーブル、
路線データなど)から最適な経路上での当該乗換え駅で
の入線側路線及び入線方向(入線側隣接駅)と、出線側
路線及び出線方向(入線側隣接駅)を判別し、最適乗換
え車両位置情報テーブルを参照して、当該乗換え駅での
入線側路線での最適乗換え車両位置を検索し、最適経路
概要文字情報に付加する。また、最適な経路上の目的駅
が複数の出入口を有するとき、最適経路探索部3は、交
通機関の路線網データ(駅ノードテーブル、路線データ
など)から最適な経路上での当該目的駅での入線側路線
及び入線方向(入線側隣接駅)を判別し、駅出入口別最
適降車車両位置情報テーブルを参照して、当該目的駅の
駅位置とされた1つの出入口を対象とする入線側路線で
の最適降車車両位置と名称を検索し、最適経路情報に付
加する。また、最適経路探索部3は、最適な経路の出発
駅が複数の出入口を有する場合に、出発駅の駅位置とさ
れた出入口の名称を検索し、最適経路情報に付加する。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.
【0016】5は最適経路の概要を示す最適経路概要文
字情報を表示したり、最適経路中の徒歩経路部分を地図
に重ねて表示したりする。6は操作部であり、ユーザ所
望の出発地、目的地、出発地出発予定日時または目的地
到着予定日時からなる探索条件を指定したり、探索指示
操作をしたりする。また、探索後、最適経路の内、出発
地−出発駅間の徒歩経路または目的駅−目的地間の徒歩
経路の表示指示操作をする。7は表示制御部であり、探
索が終わると記憶部4に記憶された最適経路概要文字情
報を表示部5に表示させる。また、操作部6で出発地−
出発駅間の徒歩経路の表示が指示されると、記憶部4に
記憶された出発地−出発駅間徒歩経路データと、CD−
ROM2に記憶された出発地周辺の地図データを用い
て、出発地周辺の地図画像を出発地−出発駅間の徒歩経
路とともに描画し、表示部5に表示させる。同様に、操
作部6で目的駅−目的地間の徒歩経路の表示が指示され
ると、記憶部4に記憶された目的駅−目的地間徒歩経路
データと、CD−ROM2に記憶された出発地周辺の地
図データを用いて、目的駅周辺の地図画像を目的駅−目
的地間の徒歩経路とともに描画し、表示部5に表示させ
る。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.
【0017】図8は出発地と目的地の地理的関係の一例
を示す説明図、図9は出発駅候補の決定方法の説明図、
図10は目的駅候補の決定方法の説明図、図11は表示
部5に表示される最適経路概要文字情報の説明図、図1
2は表示部5に表示される出発地周辺の地図に出発地−
出発駅間の徒歩経路を重ねた画像の説明図、図13は表
示部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.
【0018】操作部6でユーザが所望の出発地、目的
地、出発地出発予定日時または目的地到着予定日時から
なる探索条件を指定するとともに探索指示操作をする
と、最適経路探索部3は、CD−ROM2に記憶された
道路データと公共交通機関の路線網データを含む時刻表
データを用いて、指定探索条件に応じて出発地から目的
地まで最短時間で移動できる最適な経路を探索する。例
えば、ユーザが図8に示す所望の出発地と目的地及び出
発地出発予定日時として、2001年12月14日午前
10時00分を指定したとき、最適経路探索部3は、ま
ず、図2に示す駅出入口位置情報テーブルを参照して、
出発地から或る一定距離R0(例えば4km)内に1つ
でも出入口の位置座標が入っている全ての駅を見出す。
ここでは、図9の○○○線××駅と・・・線・・駅の2
つが該当したとすると、これら2つの駅を出発駅候補と
する。そして、各出発駅候補について、出入口が1つし
かない場合は該出入口の位置座標を出発駅候補の駅位置
座標とする。出入口が複数存在する出発駅候補について
は、道路データを用いて、各出入口毎に、出発地から出
入口までを最短距離で結ぶ経路を探索するとともに、各
経路の距離と徒歩での所要時間を計算する。そして、一
番距離が短い(一番所要時間が短い)出入口の位置座標
を当該出発駅候補の駅位置座標とし、出発地から出発駅
の駅位置とした出入口までの所要時間と、出発駅の駅位
置とした出入口の出入口番号(図2参照)を出発駅候補
に対応付けて最適経路探索部3の内部に記憶しておく。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 0 (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.
【0019】例えば、○○○線××駅は出入口が1番目
から4番目まで4つ(各出入口の名称は「A1」〜「A
4」とする)有ったとき、出発地から「A1」〜「A
4」の各々までを道路に沿って最短で結ぶ経路はRT1
〜RT4の4つになるが、RT4が一番短いので、出入
口「A4」の位置座標を出発駅候補の1つである○○○
線××駅の駅位置座標とする。出発地から○○○線××
駅の位置(ここでは、「A4」)の間の徒歩の所要時間
をt1とする。また、・・・線・・駅は出入口が1番目
と2番目の2つ(各出入口の名称は「北口」及び「南
口」とする)有ったとき、出発地から北口と南口までを
道路に沿って最短で結ぶ経路はRV1とRV2の2つに
なるが、RV1の方が短いので、「北口」の位置座標を
出発駅候補の他の1つである・・・線・・駅の駅位置座
標とする。出発地から・・・線・・駅の位置(ここで
は、「北口」)の間の徒歩の所要時間をt2とする。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 1 . 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 2 .
【0020】同様にして、図2に示す駅出入口位置情報
テーブルを参照して、目的地から或る一定距離R0内に
1つでも出入口の位置座標が入っている全ての駅を見出
す。ここでは、図10の△△線△△駅と■■線■■駅の
2つが該当したとすると、これら2つの駅を目的駅候補
とする。そして、各目的駅候補について、出入口が1つ
しかない場合は該出入口の位置座標を目的駅候補の駅位
置座標とする。出入口が複数存在する目的駅候補につい
ては、道路データを用いて、各出入口毎に、出入口から
目的地までを最短距離で結ぶ経路を探索するとともに、
各経路の距離と徒歩での所要時間を計算する。そして、
一番距離が短い(一番所要時間が短い)出入口の位置座
標を当該目的駅候補の駅位置座標とし、かつ、目的駅の
駅位置とした出入口から目的地までの所要時間と、目的
駅の駅位置とした出入口の出入口番号(図2参照)を目
的駅候補に対応付けて最適経路探索部3の内部に記憶し
ておく。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 0 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.
【0021】例えば、△△線△△駅は出入口が1番目と
2番目の2つ(図9の符号B1、B2参照。各出入口B
1、B2の名称は「東口」及び「西口」とする)有った
とき、目的地と出入口B1、B2の各々を道路に沿って
最短で結ぶ経路はRP1とRP2の2つになるが、RP
2の方がより短いので、出入口B2の位置座標を目的駅
候補の1つである△△線△△駅の駅位置座標とする。△
△線△△駅の出入口B2と目的地の間の徒歩の所要時間
をt3とする。また、■■線■■駅は出入口が「北口」
と「南口」(名称)の2つ有ったとき、出発地から「北
口」と「南口」までを道路に沿って最短で結ぶ経路はR
F1とRF2の2つになるが、RF1の方が短いので、
「北口」の位置座標を目的駅候補の他の1つである■■
線■■駅の駅位置座標とする。■■線■■駅の「北口」
と目的地の間の所要時間をt4とする。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 3 . 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 4 .
【0022】次に、最適経路探索部3はCD−ROM2
に記憶された公共交通機関の時刻表データを参照して、
出発地出発予定日時からt1後に出発駅候補の1つであ
る○○○線××駅に到着したと仮定して、○○○線××
駅から目的駅候補の1つである△△線△△駅までの電車
の乗り継ぎ経路を探索し、△△線△△駅の到着予定日時
にt3を加算した目的地到着予定日時T13を求める。
また、出発地出発予定日時からt1後に出発駅候補の1
つである○○○線××駅に到着したと仮定して、○○○
線××駅から目的駅候補の他の1つである■■線■■駅
まで電車を乗り継いだときの■■線■■駅の到着予定日
時にt4を加算した目的地到着予定日時T14を求め
る。更に、出発地出発予定日時からt2後に出発駅候補
の他の1つである・・・線・・駅に到着したと仮定し
て、・・・線・・駅から目的駅候補の1つである△△線
△△駅までの電車の乗り継ぎ経路を探索し、△△線△△
駅の到着予定日時にt3を加算した目的地到着予定日時
T23を求める。また、出発地出発予定日時からt2後
に出発駅候補の1つである・・・線・・駅に到着したと
仮定して、・・・線・・駅から目的駅候補の他の1つで
ある■■線■■駅まで電車を乗り継いだときの■■線■
■駅の到着予定日時にt4を加算した目的地到着予定日
時T24を求める。そして、出発地出発予定日時が指定
されている場合、目的地に一番早く到達できる経路が最
適なので、T13、T14、T23、T24の内、一番
早いものを探す。T13が該当するとき、出発駅は○○
○線××駅として確定し、目的駅は△△線△△駅として
確定する。そして、先に探索した○○○線××駅から△
△線△△駅までの電車の乗り継ぎ経路情報を内部に記憶
する。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 1 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 13 which is obtained by adding the t 3 to the scheduled arrival date and time of the △△ line △△ station Ask.
In addition, 1 of the departure station candidate after t 1 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 4 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 14 . 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 3 to the estimated arrival date / time of the station. In addition, it is one of the departure station candidates after t 2 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 4 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 13 , T 14 , T 23 , and T 24 is searched. When T 13 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.
【0023】なお、最適経路探索部3は電車の乗り継ぎ
経路を探索する際、時刻表データから、出発駅について
の駅ノード番号,駅名,路線番号,路線名,出発駅の駅
位置とした出発地に最寄りの出入口の出入口番号(図2
参照)、発車時刻、途中の乗換えすべき駅毎に、乗換え
駅の駅ノード番号,駅名,乗換え駅での入線側路線番
号,入線側路線名,到着時刻,乗換え駅での入線側路線
上で1つ手前(出発地寄り)の駅の駅ノード番号(入線
側隣接駅ノード番号),乗換え駅での出線側路線番号,
出線側路線名,発車時刻,出線側路線上で1つ先(目的
地寄り)の駅の駅ノード番号(出線側隣接駅ノード番
号)、目的駅についての駅ノード番号,駅名,目的駅の
駅位置とした目的地に最寄りの出入口の出入口番号、到
着時刻を判別し、これらの情報も電車の乗り継ぎ経路情
報に含めて記憶する。また、出発駅の駅位置とした出入
口の名称を検索し、目的駅の駅位置とした出入口の名称
を検索し、これらの情報も電車の乗り継ぎ経路情報に含
めて記憶させる。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.
【0024】出発地、目的地、○○○線、△△線の関係
が図8の如くなっている場合、出発駅は○○○線××駅
となり(図9参照)、出発駅の駅位置とされる出入口は
「A4」(名称)とされる。また、目的駅は△△線△△
駅となり(図10、図6参照)、目的駅の駅位置とされ
る出入口はB2の「西口」(名称)となる。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】また、乗換え駅は○○○線○○駅となり
(図4参照)、電車の乗り継ぎ経路情報には、乗換え駅
の駅ノード番号SNb,駅名○○駅,乗換え駅での入線
側路線番号RNX,入線側路線名○○○線,到着時刻,
乗換え駅での入線側路線上で1つ手前(出発地寄り)の
駅の駅ノード番号(入線側隣接駅ノード番号であり、乗
換え駅での入線方向を示す)SNa,乗換え駅での出線
側路線番号RNY,出線側路線名△△線,発車時刻,出
線側路線上で1つ先(目的地寄り)の駅の駅ノード番号
(出線側隣接駅ノード番号であり、乗換え駅での出線方
向を示す)SNfが含まれる。[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.
【0026】このあと、最適経路探索部3は道路データ
を参照して出発地から先に確定した出発駅の駅位置とし
て設定した出入口「A4」までを最短で結ぶ徒歩経路を
探索し、出発地−出発駅間徒歩経路データとして内部に
記憶する。同様に、道路データを参照して先に確定した
目的駅の駅位置として設定した出入口B2から目的地ま
でを最短で結ぶ徒歩経路を探索し、目的駅−目的地間徒
歩経路データとして内部に記憶する。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.
【0027】更に、最適経路探索部3は交通機関の路線
網データの内、最適乗換え車両位置情報テーブル(図3
参照)を参照して、先に探索した電車の乗り継ぎ経路情
報の内の乗換えすべき○○○線○○駅について、入線側
路線番号と入線側隣接駅ノード番号、出線側路線番号と
出線側隣接駅ノード番号から、入線側路線○○○線で×
○駅方向から入線し、出線側路線△△の△×駅方向へ出
線する場合に○○○線○○駅で一番早く乗り換えられる
○○○線の最適乗換え車両位置を検索し、乗り継ぎ経路
情報に追加して記憶する。図3、図4の場合、最適乗換
え車両位置は1となる。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.
【0028】更に、最適経路探索部3は交通機関の路線
網データの内、駅出入口別最適降車車両位置情報テーブ
ル(図5参照)を参照して、先に探索した電車の乗り継
ぎ経路情報の内の目的駅である△△線△△駅について、
入線側路線番号と入線側隣接駅ノード番号、出入口番号
(2)から、入線側路線△△線で×□駅方向から入線
し、出入口B2へ向かう場合に△△線△△駅で一番早く
移動できる△△線の最適降車車両位置を検索し、乗り継
ぎ経路情報に追加して記憶する。図5、図6の場合、最
適降車車両位置は6となる。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.
【0029】以上の如くして最適経路探索部3による出
発地から目的地までを徒歩と交通機関により、最短時間
で結ぶ最適な経路の探索が完了すると、内部に記憶した
出発駅−出発地間徒歩経路データとt1を対応付けて記
憶部4に記憶させ、目的駅−目的地間徒歩経路データと
t3を対応付けて記憶部4に記憶させる。また、乗り継
ぎ経路情報、出発地出発予定日時、t1、t3などか
ら、交通手段の別に最適経路の概要を文字で表した図1
1の如く最適経路概要文字情報を作成して記憶部4に記
憶させる。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 1 are associated with each other and stored in the storage unit 4, and the destination station-destination walking route data and t 3 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 1 , 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.
【0030】表示制御部7は最適経路探索部3による最
適な経路の探索が完了すると、まず記憶部4に記憶され
た最適経路概要文字情報を表示部5に表示させる(図1
1参照)。これにより、ユーザは、出発地から出発駅ま
での徒歩による所要時間、出発駅の駅名,路線名,出発
駅で出発地に最寄りの出入口の名称,出発駅での発車時
間,出発駅で電車に乗るのに適した車両位置(次の乗換
え駅での乗換えが便利な車両位置)、乗換え駅の駅名,
乗換え先の路線名と駅名,乗換え先の路線での発車時
間,目的駅の駅名,路線名,目的駅での到着時間,目的
駅で目的地に最寄りの出入口の名称,目的駅から目的地
までの徒歩による所要時間などを知ることができる。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.
【0031】ここで、出発地に最寄りの出発駅の出入口
の名称が判るので、出発駅が複数の出入口を有していて
も、出発地から徒歩で出発後、出発駅の出入口の内、出
発地に最寄りの出入口を容易に見つけることができ、出
発駅まで遠回りする恐れがなくなる。同様に、目的地に
最寄りの目的駅の出入口の名称が判るので、目的駅が複
数の出入口を有していても、目的駅の出入口の内、目的
地に最寄りの出入口を容易に見つけることができ、目的
地まで遠回りする恐れがなくなる。また、最適経路に一
方の路線(図8のRB参照)から他方の路線(図8のR
C参照)へ乗換えすべき駅が有るとき、一方の路線で乗
換えを素早くできる便利な車両位置が事前に判るので、
一方の路線で電車に乗る際に、当該便利な車両位置に乗
ることで、乗換えに要する時間を短縮することができ
る。同様に、目的駅まで最後に乗る路線から降りて目的
駅の出入口の内、目的地に最寄りの出入口に素早く向か
うことのできる便利な車両位置が事前に判るので、最後
に乗る路線で電車に乗る際に、当該便利な車両位置に乗
っておくことで、目的駅で目的地に最寄りの出入口に素
早く到達することができる。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.
【0032】ユーザが出発地−出発駅間徒歩経路を地図
上で確認したいとき、操作部6で出発地−出発駅間徒歩
経路表示指示操作をする。すると、表示制御部7は、記
憶部4の内、出発地−出発駅間徒歩経路データを参照し
て、CD−ROM2から出発地周辺の地図データを読み
出し、出発地を中心とする地図画像を描画し、該地図画
像の上に重ねて出発地−出発駅間徒歩経路(図8のRA
参照)を特定の色で太く強調して描画し、更に、地図画
像の内、出発地−出発駅間徒歩経路の起点と終点に相当
する箇所に起点マークと終点マークを重ねて描画し、表
示部5に表示させる(図12参照)。これにより、ユー
ザは、出発地から出発駅までの最適な徒歩経路を地図上
で確認することができる。出発駅が複数の出入口を有し
ていても、出発地から一番最寄りの出入口に向けた最適
徒歩経路が探索されているので、ユーザは地図上の強調
徒歩経路(図12の符号RA′参照)を辿って出発駅に
向かうことで、速やかに出発地に辿り着くことができ、
出発駅の内、出発地から遠い方の出入口に間違って向か
う恐れがなくなる。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.
【0033】また、ユーザが目的駅−目的地間徒歩経路
を地図上で確認したいとき、操作部6で目的駅−目的地
間徒歩経路表示指示操作をする。すると、表示制御部7
は、記憶部4の内、目的駅−目的地間徒歩経路データを
参照して、CD−ROM2から目的駅周辺の地図データ
を読み出し、目的駅を中心とする地図画像を描画し、該
地図画像の上に重ねて目的駅−目的地間徒歩経路(図8
のRD参照)を特定の色で太く強調して描画し、更に、
地図画像の内、目的駅−目的地間徒歩経路の起点と終点
に相当する箇所に起点マークと終点マークを重ねて描画
し、表示部5に表示させる(図13参照)。これによ
り、ユーザは、目的駅から目的地までの最適な徒歩経路
を地図上で確認することができる。目的駅が複数の出入
口を有していても、目的地に一番最寄りの出入口から目
的地に向けた最適徒歩経路が探索されているので、ユー
ザは地図上の強調徒歩経路(図12の符号RD′参照)
の起点に相当する出入口から目的駅を出て強調徒歩経路
に沿って目的地に向かうことで、速やかに目的地に辿り
着くことができ、目的駅の内、目的地から遠い方の出入
口から間違って出て遠回りで目的地に向かう恐れがなく
なる。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.
【0034】この実施の形態によれば、最適経路探索部
3で探索した最適経路の途中に、或る路線から他の路線
への乗換え駅があった場合、該乗換え駅で一番早く乗換
えができる当該或る路線の電車での乗車車両位置をユー
ザが知ることが出来るので、乗換えに無駄な時間を掛け
ることがなくなる。また、最適経路探索部3で探索した
最適経路の目的駅に関して、目的駅まで最後に乗った路
線の電車から目的駅で降り、目的地の出入口の内、目的
地に最寄りの出入口に素早く向かうことのできる便利な
車両位置が事前に判るので、最後に乗る路線で電車に乗
る際に、当該便利な車両位置に乗っておくことで、目的
駅で目的地に最寄りの出入口に素早く到達することがで
きる。また、最適経路探索部3が出発地近くの1または
複数の出発駅候補を検索したときに、或る出発駅候補が
複数の出入口を有しているときは、出発地に最寄りの1
つの出入口を当該出発駅候補の駅位置に設定し、目的地
近くの1または複数の目的駅候補を検索したときに、或
る目的駅候補が複数の出入口を有しているときは、目的
地に最寄りの1つの出入口を当該目的駅候補の駅位置に
設定して最適経路の探索をするので、最終的に、出発地
−目的地間の徒歩と交通機関による移動時間が一番短い
経路を確実に探索できる。そして、最終的に探索した最
適経路上の出発駅が複数の出入口を有するときは、出発
地に最寄りの一番最適な1つの出入口の名称をユーザが
知ることが出来るので、出発地に最寄りの出入口を容易
に見つけることができ、出発駅内に入るのに遠回りせず
に済み、同様に、最終的に探索した最適経路上の目的駅
が複数の出入口を有するときは、目的地に最寄りの一番
最適な1つの出入口の名称をユーザが知ることが出来る
ので、目的地に最寄りの出入口を容易に見つけることが
でき、目的地まで遠回りせずに済む。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.
【0035】なお、上記した実施の形態では、出発地、
目的地、出発地出発予定時間を探索条件として指定する
場合を例に挙げて説明したが、出発地、目的地、目的地
到着予定時間を探索条件として指定する場合にも同様に
適用することができる。目的地到着予定時間が指定され
たときは、最適経路探索部は、出発地近くの1または複
数の出発駅候補と、目的地近くの1または複数の目的駅
候補の組み合わせの内、出発地を一番遅く出発できる組
み合わせの出発駅候補と目的駅候補の組み合わせを出発
駅と目的駅として確定すれば良い。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.
【0036】また、上記した実施の形態では、出発地と
目的地が駅から離れている場合について説明したが、或
る所望の駅を出発地とし、他の或る所望の駅を目的地と
し、出発駅出発予定日時または目的駅到着予定日時とと
もに指定するようにしても良く、この場合、最適経路探
索部3は道路データは用いずに、単に、時刻表データか
ら、指定探索条件に従応じた出発駅から目的駅まで最短
時間で移動できる最適な乗り継ぎ経路を探索すれば良
く、この際、乗換えすべき駅があれば前述と同様にし
て、最適乗換え車両位置を求めるようにする。目的駅で
の最適降車車両位置と出入口名称は、目的駅の1番目の
出入口を対象にして求めるようにし、出発駅の名称は、
出発駅の1番目の出入口を対象にして求めるようにすれ
ば良い。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.
【0037】また、上記した実施の形態では、道路デー
タ及び交通機関の時刻表データはCD−ROM1に記憶
されたものを使用したが、ICメモリカードに記憶させ
て最適経路探索装置を携帯可能としても良い。また、最
適経路探索装置をネットワーク上に設置し、外部と通信
可能としておき、携帯電話、携帯コンピュータ等からネ
ットワーク経由で探索条件を指定して最適経路探索装置
に探索を指示し、外部から通信で探索が指示されると、
最適経路探索部が指定探索条件に従い、最適経路の探索
をしたのち、図示しない配信部が最適経路概要文字情報
を要求元の携帯電話、携帯コンピュータ等に返信して画
面表示可能とし、このあと、携帯電話、携帯コンピュー
タ等から出発地−出発駅間徒歩経路(または目的駅−目
的地間徒歩経路)が要求されると、表示制御部の描画し
た強調徒歩経路付の出発地周辺の地図画像データ(また
は強調徒歩経路付の目的駅周辺の地図画像データ)を図
示しない配信部が要求元の携帯電話、携帯コンピュータ
等に返信して画面表示可能としても良い。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】[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.
【図1】本発明の一つの実施の形態に係る最適経路探索
装置の構成図である。FIG. 1 is a configuration diagram of an optimum route search device according to an embodiment of the present invention.
【図2】図1中の路線網データに含まれる駅出入口情報
テーブルの内容を示す説明図である。FIG. 2 is an explanatory diagram showing the contents of a station entrance / exit information table included in the route network data in FIG.
【図3】図1中の路線網データに含まれる最適乗換え車
両位置情報テーブルの内容を示す説明図である。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.
【図4】最適乗換え車両位置情報テーブルのデータ構成
を説明する説明図である。FIG. 4 is an explanatory diagram illustrating a data configuration of an optimum transfer vehicle position information table.
【図5】図1中の路線網データに含まれる駅出入口別最
適降車車両位置情報テーブルの内容を示す説明図であ
る。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.
【図6】駅出入口別最適降車車両位置情報テーブルのデ
ータ構成を説明する説明図である。FIG. 6 is an explanatory diagram illustrating a data structure of an optimal exiting vehicle position information table for each station entrance / exit.
【図7】図1中の記憶部に記憶される内容の説明図であ
る。7 is an explanatory diagram of contents stored in a storage unit in FIG. 1. FIG.
【図8】最適経路探索方法の説明図である。FIG. 8 is an explanatory diagram of an optimum route search method.
【図9】最適経路探索方法の説明図である。FIG. 9 is an explanatory diagram of an optimum route search method.
【図10】最適経路探索方法の説明図である。FIG. 10 is an explanatory diagram of an optimum route search method.
【図11】表示部に表示される最適経路概要文字情報の
説明図である。FIG. 11 is an explanatory diagram of optimum route outline character information displayed on the display unit.
【図12】表示部に地図に重ねて表示される出発地から
出発駅までを結ぶ徒歩経路の説明図である。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.
【図13】表示部に地図に重ねて表示される目的駅から
目的地までを結ぶ徒歩経路の説明図である。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.
1 最適経路探索装置 2 CD−ROM 3 最適経路探索部 4 記憶部 5 表示部 6 操作部 7 表示制御部 1 Optimal route search device 2 CD-ROM 3 Optimal route search unit 4 Storage unit 5 Display 6 Operation 7 Display control section
フロントページの続き Fターム(参考) 5B075 ND02 PQ32 PQ75 UU16 5H161 AA01 CC20 GG14 GG15 GG17 GG22 Continued front page F term (reference) 5B075 ND02 PQ32 PQ75 UU16 5H161 AA01 CC20 GG14 GG15 GG17 GG22
Claims (4)
ータを記憶した記憶手段と、出発駅、目的駅、出発予定
日時または到着予定日時から成る指定探索条件に従い、
交通機関の時刻表データを用いて交通機関により、指定
探索条件に応じて出発駅から目的駅まで最短時間で移動
できる最適な経路を探索する探索手段と、を備えた最適
経路探索装置において、 記憶手段には、交通機関の路線網データに、路線間の乗
換えができる各駅につき、入線側路線及び入線方向と、
出線側路線及び出線方向の組み合わせ別に、入線側路線
での最適乗換え車両位置情報を含めて記憶しておき、 探索手段は、探索した最適な経路に路線間で乗換えを行
うべき駅があるとき、交通機関の路線網データから最適
な経路上での当該乗換え駅での入線側路線及び入線方向
と、出線側路線及び出線方向を判別したのち、入線側路
線での最適乗換え車両位置情報を検索し、最適経路情報
に付加するようにしたこと、 を特徴とする最適経路探索装置。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.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2001402774A JP2003182579A (en) | 2001-12-16 | 2001-12-16 | Optimum route searching device and its method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2001402774A JP2003182579A (en) | 2001-12-16 | 2001-12-16 | Optimum route searching device and its method |
Publications (2)
Publication Number | Publication Date |
---|---|
JP2003182579A true JP2003182579A (en) | 2003-07-03 |
JP2003182579A5 JP2003182579A5 (en) | 2005-06-23 |
Family
ID=27605626
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2001402774A Pending JP2003182579A (en) | 2001-12-16 | 2001-12-16 | Optimum route searching device and its method |
Country Status (1)
Country | Link |
---|---|
JP (1) | JP2003182579A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010256159A (en) * | 2009-04-24 | 2010-11-11 | Navitime Japan Co Ltd | Route search system, route search server, and route search method |
CN107010089A (en) * | 2016-01-27 | 2017-08-04 | 普天信息技术有限公司 | Track traffic thread-changing hand-over method and system |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH10134108A (en) * | 1996-11-01 | 1998-05-22 | Nec Corp | Railroad transfer navigation system |
JP2001034663A (en) * | 1999-07-16 | 2001-02-09 | Hitachi Information Systems Ltd | Time table system and program storage medium therefor |
JP2001106076A (en) * | 1999-10-08 | 2001-04-17 | Toyota Motor Corp | Route searching device |
-
2001
- 2001-12-16 JP JP2001402774A patent/JP2003182579A/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH10134108A (en) * | 1996-11-01 | 1998-05-22 | Nec Corp | Railroad transfer navigation system |
JP2861974B2 (en) * | 1996-11-01 | 1999-02-24 | 日本電気株式会社 | Railway transfer navigation system |
JP2001034663A (en) * | 1999-07-16 | 2001-02-09 | Hitachi Information Systems Ltd | Time table system and program storage medium therefor |
JP2001106076A (en) * | 1999-10-08 | 2001-04-17 | Toyota Motor Corp | Route searching device |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010256159A (en) * | 2009-04-24 | 2010-11-11 | Navitime Japan Co Ltd | Route search system, route search server, and route search method |
CN107010089A (en) * | 2016-01-27 | 2017-08-04 | 普天信息技术有限公司 | Track traffic thread-changing hand-over method and system |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP3987073B2 (en) | Navigation system, route search server, route search method and program | |
JP4454043B1 (en) | Route guidance system, route search server, route guidance mediation server, and route guidance method | |
US8150614B2 (en) | Routing guide mediation system, routing guide mediation server, and routing guide method | |
JP5141739B2 (en) | Communication system and mobile terminal | |
JP4728438B2 (en) | Computer system | |
WO2009133596A1 (en) | Route guidance system, route search server, route guidance method, and terminal | |
JP4066439B2 (en) | Evacuation route providing system, route search server, and portable terminal device | |
US8359159B2 (en) | System which mediates providing of map information, server which mediates providing of map information, and method for providing map information | |
JP4368404B2 (en) | Navigation system, route search server, and route search method | |
JP2003182578A (en) | Optimum route searching device and its method | |
KR101098820B1 (en) | System and method for providing transportation information using intellectual mobile terminal | |
JP4485095B2 (en) | Computer system and route guidance information distribution method | |
JP2010126028A (en) | Path information presenting device, path information presenting system, path searching device, terminal device, program for path searching device, program for terminal device, and path information presenting method | |
JP4489619B2 (en) | Navigation device and method for guiding relative position of own vehicle | |
JP4550697B2 (en) | Navigation system, route search server, and portable terminal device | |
JP4851402B2 (en) | Information distribution system, information distribution server, portable terminal device, and information distribution method | |
JP4689104B2 (en) | Parking lot information retrieval method, parking lot information retrieval system and program | |
JP2003182579A (en) | Optimum route searching device and its method | |
JP4834165B2 (en) | Information providing system, server device, terminal device, information providing method, and program | |
JP2003185464A (en) | Apparatus and method for searching optimum route | |
JP2004108803A (en) | Navigation terminal, navigation system, its program, and travel guidance method | |
US20110301833A1 (en) | Route guidance system, route search server, and route guidance method | |
JP2005249444A (en) | Navigation system and navigation apparatus | |
JP2011112387A (en) | Navigation system, route search server, terminal, method of navigation, and navigation device | |
JP5495391B2 (en) | Navigation system, route search server, and route search method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
RD01 | Notification of change of attorney |
Free format text: JAPANESE INTERMEDIATE CODE: A7421 Effective date: 20040921 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20041007 |
|
A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20041007 |
|
A977 | Report on retrieval |
Free format text: JAPANESE INTERMEDIATE CODE: A971007 Effective date: 20060710 |
|
A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20060721 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20060913 |
|
A02 | Decision of refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A02 Effective date: 20070220 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20070406 |
|
A911 | Transfer to examiner for re-examination before appeal (zenchi) |
Free format text: JAPANESE INTERMEDIATE CODE: A911 Effective date: 20070426 |
|
A912 | Re-examination (zenchi) completed and case transferred to appeal board |
Free format text: JAPANESE INTERMEDIATE CODE: A912 Effective date: 20070615 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20081002 |