JPH09161105A - Route retrieving system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce time for retrieving a route by setting junction stations being transfer stations to be retrieving data at the time of retrieving the route, setting station between a junction station and another junction station to be one group and retrieving the route by means of retrieving data. SOLUTION: A memory 121 sets a junction station, which is a transfer station and is provided with more than three branches, to be the junction station retrieving data at the time of retrieving the route, sets the stations between a junction station and another junction station to be data of one group and holds them. A by-way, starting and terminal station setting part (a starting and terminal station receiving means) 104 receives the designation of a starting station and a terminal station included in a list consisting of plural stations and branches connecting these stations. A route retrieving part 103 retrieves a route from a starting station to a terminal station by means of retrieving data. A route and starting/terminal station setting part (a route receiving means) 104 receives the designation of the retrieved route. A condition setting operation part 102 receives the designation of an effective limit. Then a commutation ticket issuing part 124 issues the commutation ticket of received starting/terminal stations, route and effective limit.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a route search system for searching a route from a station having a transportation system such as a railway to another station.

[0002]

2. Description of the Related Art For example, when issuing a commuter pass used in transportation, it is necessary to set a use section of the issued commuter pass. When setting the use section, transit stations are also set. To set up this transit station, it was necessary to search for a route from one station to another. Such route search is performed by tracing stations one by one.

[0003]

However, even if a station that has only two routes, that is, a transit route after passing through the station is uniquely determined, the route is searched by tracing each station one by one. There is a problem that it takes time to search. Here, a specific description will be given by taking the Tokyo-Shinagawa area of FIG. 6 as an example. Between Tokyo and Shinagawa, the list (pointer) is traced seven times, such as “Tokyo → Yamate Tokyo → Yamate Yurakucho → Yamate Shimbashi → Yamate Hamamatsucho → Yamatedacho → Yamate Shinagawa → Shinagawa”. An object of the present invention is to provide a route search system capable of quick route search.

[0004]

According to the route search method of the present invention, in a route network composed of a plurality of stations and routes including these stations, a crossover station having three or more branches is used as a crossover station to perform this crossover. Stations are used as search data at the time of route search; stations sandwiched between the intersecting stations and the intersecting stations are grouped; input of departure station and arrival station included in the route network is accepted; When the departure station is not a crossing station, the group including this departure station is obtained, and the crossing stations at both ends of this group are set as the search starting station; When the destination station is a station, this destination station is the search target station; when the destination station is not a crossing station, a group including this destination station is obtained, and the crossing stations at both ends of this group are the search target stations; Next to It won adjacent intersection station as cross station; repeatedly acquiring cross station adjacent to said acquired neighboring cross station to search for a route to the searched station.

The commuter pass issuing device according to the present invention is a search data at the time of route search with a transferable station having three or more branches as an intersecting station in a route network composed of a plurality of stations and lines including these stations. And holding means for holding the station sandwiched between the intersection stations as one group data; departure station and arrival station acceptance means for accepting designation of departure station and arrival station included in the route network; Search means for searching a route from the destination station to the destination station based on the search data; route acceptance means for accepting designation of the retrieved route; expiry date acceptance means for accepting designation of expiry date; the accepted departure station , Arriving station, route, and commuter pass issuing means for issuing commuter pass with expiration date.

In the route search method of the present invention, in a list composed of a plurality of points and branches connecting these points, points having three or more branches are used as search data at the time of route search; input of start point and end point Is accepted; a route from the start point to the end point is searched by the search data.

In the route search method of the present invention, in a list composed of a plurality of points and branches connecting these points, a point having three or more branches is an intersection, and this intersection is used as search data for route search; A point sandwiched between the intersection and the intersection is regarded as one group; an input of a start point and an end point included in the list is accepted; when the start point corresponds to an intersection, the start point is set as a search start point; If this is not the case, find this starting point group,
The intersections at both ends of this group are set as search start points; when the end point corresponds to an intersection, this end point is set as a search target point; when the end point does not correspond to an intersection, this end point group is obtained, and the intersections at both ends of this group are set. As a search target point; a route from the search start point to the search target point is searched by the search data.

In the route search method of the present invention, in a list composed of a plurality of points and branches connecting these points, a point having three or more branches is an intersection, and this intersection is used as search data for route search; A point sandwiched between the intersection and the intersection is regarded as one group; an input of a start point and an end point included in the list is accepted; when the start point corresponds to an intersection, the start point is set as a search start point; If this is not the case, find this starting point group,
The intersections at both ends of this group are set as search start points; when the end point corresponds to an intersection, this end point is set as a search target point; when the end point does not correspond to an intersection, this end point group is obtained, and the intersections at both ends of this group are set. As a search target point; acquire an adjacent intersection as an intersection adjacent to the search start point; repeatedly acquire an intersection adjacent to the acquired adjacent intersection to search for a route to the search target point.

According to the route search method of the present invention, in a list composed of a plurality of stations and branches connecting these stations, a transferable station having three or more branches is defined as an intersection station, and this intersection station is searched at the time of route search. As search data; the stations sandwiched between the intersections and the intersections are grouped as one; input of the departure station and the arrival station included in the list is accepted; when the departure station corresponds to the intersection, this departure station Is the search start station;
When the departure station does not correspond to an intersection station, a group of this departure station is obtained, and the intersection stations at both ends of this group are set as search start stations; when the arrival station corresponds to the intersection station, this arrival station is set as a search target station; When the destination station does not correspond to an intersection station, a group of the destination station is obtained, and the intersection stations at both ends of the group are set as search target stations; the adjacent intersection station as an intersection station adjacent to the search start station is acquired; The acquisition of the adjacent crossing station adjacent to the acquired adjacent crossing station is repeated to search the route to the search target station.

The route searching device of the present invention includes a holding unit that holds a point having three or more branches as search data at the time of route searching in a list composed of a plurality of points and a branch connecting the points. Input means for accepting inputs of a start point and an end point included in the list; and a search means for searching a route from the start point to the end point with the search data.

The commuter pass issuing device according to the present invention has three stations in a list composed of a plurality of stations and branches connecting these stations.
Holding means for holding a station having two or more branches as a crossover station as search data for route search, and a station sandwiched between the crossover stations as one group data; included in the list Departure / arrival station accepting means for accepting designation of departure station and arrival station; retrieving means for retrieving a route from the departure station to the arrival station with the retrieval data; route acceptance means for accepting designation of the retrieved route ;
An expiration date acceptance means for accepting designation of an expiration date; and a commuter ticket issuing means for issuing the accepted departure station, arrival station, route, and commuter ticket for the expiration date.

As a result of taking the above-mentioned means, the following actions occur. A station having three or more branches, that is, a crossover station that is a transferable station is used as search data for route search, and stations sandwiched between this crossover station and the crossover station are treated as one group. Since the route search is executed, the number of searches is small and the search time is shortened.

[0013]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a schematic diagram showing an internal configuration of a commuter pass issuing device using a route search system according to an embodiment of the present invention.

That is, the CPU 120 for controlling the entire commuter pass issuing device stores a control program, character patterns, etc., and a memory 121 for storing various data, and a commuter pass purchase application form. A name reading unit 122 for reading a name, a name transfer unit 123 for transferring the name read by the name reading unit 122, a commuter ticket issuing unit 124 for issuing a commuter ticket, and a commuter ticket sales data.
A journal printer 125 that prints data on a journal (not shown), and a magnetic disk (not shown) that stores various information related to commuter pass issuance, such as sales data or fare data. Magnetic disk unit 1
26, and a communication control unit 127 connected to an external device such as the host computer 130 via a communication line (not shown).
And a condition setting operation unit 102 for setting conditions of the issued commuter pass, for example, an expiration date, a route search unit 103 for executing a route search process described later, a departure station and an arrival station as boardable sections. And the transit station setting unit 104 for setting the transit station and transit station are connected to the display unit 105 and the like.

The commuter pass issuing unit 124 prints print data corresponding to the purchase information of the commuter pass application form or print data corresponding to the old ticket or records magnetic information to issue a new commuter pass. .

The route search which is the point of the present invention will be described below. FIG. 2 is a diagram showing a concept in which only a station having three or more branches (routes), that is, a crossover station that can be transferred is used as search data at the time of route search, and a route network used at the time of route search. Is.

That is, only the intersection stations having three or more branches, such as A station to F station, are used as the search data at the time of route search, and stations other than these are grouped into groups a to c. That is, focusing on the fact that there is only one passage route between the stations adjacent to the two stations, the adjacent stations are grouped, and the grouped data is used as the lower data of the search data. Note that such search data and grouped data are stored in the memory 121.

FIG. 3 is a diagram for explaining a search using search data. In other words, between Tokyo and Shinagawa, "Tokyo →
Yamate Tokyo → Yamate Shinagawa → Shinagawa ”will be traced. Therefore, there are four points (blocks shown in FIG. 3) and three lists (pointers) between Tokyo and Shinagawa. The data from Yamate Tokyo to Yamate Shinagawa are grouped.

FIG. 4 is a flow chart for explaining the setting of the search start station and the search target station, and FIG. 5 is a flow chart for explaining the route search processing. Hereinafter, these flowcharts will be described together with an example of a route network (list) configured by a plurality of stations and routes including these stations as shown in FIG. The processing described below is performed by the CPU 120 and the route search unit 103.

For example, a case of route search between station A and station F in FIG. 2 will be described. First, A station is input as the departure station and F station is input as the arrival station from the via departure / arrival station setting unit 104.
The departure station A station is a station having three or more branches, that is, a crossing station (ST12, YES). Therefore, the departure station A station is set as the search start station (ST14).

If the departure station is not an intersection station (ST1
2, NO), for example, when the departure station is the a2 station, the group of the departure station a2 stations is obtained (ST16). In this case, the group of the departure station a2 station is a. Then, stations at both ends of the group a, that is, stations A and F are set as search start stations (ST18).

Arrival station F station is a station having three or more branches, that is,
It is an intersection station (ST20, YES). Therefore, the arrival station A station is set as the search target station (ST22). If the arrival station is not an intersection station (ST20, NO), for example, if the arrival station is c2 station, a group of this arrival station c2 station is obtained (ST24). In this case, the group of the departure station c2 station is c. Then, stations at both ends of the group c, that is, D station and F station are set as search start stations (ST26).

Further, since the departure station A station and the arrival station F station are not in the same group (in this case, both the departure station A station and the arrival station F station do not belong to the group) (ST28, NO), the route candidate search process Is started (ST32).

If the departure station and the arrival station are the same group (ST28, YES), for example, if the departure station is a1 station and the arrival station is a4 station, the same group, that is,
The route (a1 → a2 → a3 → a4) in the a group is registered as one of the route candidates (ST30), and the route candidate search process is started (ST32).

Next, the via search process will be described with reference to the flowchart of FIG. First, an adjacent crossing station (adjacent crossing station) is obtained from the search start station (ST40). When the search start station is the departure station A station, B station, C station, and F station are adjacent intersection stations. At this time, the processing for all the adjacent intersection stations is not completed (ST42, NO). That is, the processing for the adjacent intersection stations B station, C station, and F station is not completed.

First, it is assumed that processing is performed on the adjacent intersection station F. Adjacent intersection station F is a search target station (ST4
4, YES), the transit route from the departure station A to the adjacent intersection station F, station A → station F is registered as a transit candidate (ST4).
6).

Then, the adjacent intersection station B is obtained as the next adjacent intersection station (ST54). At this time, the processing for all the adjacent intersection stations is not completed (ST42, NO). That is, the processing for the adjacent intersection stations B and C has not been completed. Adjacent intersection station B is not the search target station (ST44,
NO), since it is not a transit route (ST48), the adjacent intersection station B is registered in the transit route (ST50). Further, a route search process (recursive process) based on the adjacent intersection station B is performed (ST52). In this way, the transit routes are registered one after another, and the station to be searched is finally found (ST44). In conclusion, station A → station B → station C →
Station D → Station F will be registered as a transit candidate.

Then, the adjacent crossing station C is obtained as the next adjacent crossing station (ST54), and so on.
The route via is searched. In conclusion, station A → station C
→ Station D → Station F is registered as a transit candidate.

In summary, the three route candidates, namely,
Station A → Station F, Station A → Station B → Station C → Station D → Station F, Station A → Station C → Station D → Station F are registered. in this way,
Only stations having three branches, that is, only crossing stations are used as search data for route search, and stations sandwiched between crossing stations are grouped together and the grouped data is used as lower data of the search data. As a result, the route can be searched simply by tracing the data of the crossing station, and the processing time can be shortened.

[0030]

EFFECTS OF THE INVENTION A station having three or more branches, that is, a crossing station which is a transferable station is used as search data for route search,
It is possible to provide a route search system in which the number of searches (search candidates) is small and the search time can be shortened because the intersections and the stations sandwiched between the intersections are treated as one group and a route search is executed based on the search data.

[Brief description of the drawings]

FIG. 1 is a schematic diagram showing an internal configuration of a commuter pass issuing device using a route search system according to an embodiment of the present invention.

FIG. 2 is a diagram showing a concept in the case where only a station having three or more branches, that is, a crossover station where transfer is possible is used as search data for route search.

FIG. 3 is a diagram illustrating an example of route search according to the present invention.

FIG. 4 is a flowchart illustrating setting of a search start station and a search target station.

FIG. 5 is a flowchart illustrating a route search process.

FIG. 6 is a diagram illustrating an example of a conventional route search.

[Explanation of symbols]

102 ... Condition setting operation section (expiration date acceptance means) 103 ... Route search section (search means) 104 ... Via departure / arrival station setting section (departure / arrival station acceptance means, route acceptance means) 105 ... Display section 120 ... CPU 121 ... Memory (retention) Means) 124 ... Commuter ticket issuing unit (commuter ticket issuing means)

Claims (8)

[Claims] 1. In a route network composed of a plurality of stations and routes including these stations, a transferable station having three or more branches is defined as an intersecting station, and this intersecting station is used as search data for route search; A station sandwiched between a station and a crossing station is regarded as one group; an input of a departure station and a destination station included in the route network is accepted; when the departure station corresponds to a crossing station, this departure station is set as a search start station. If the departure station does not correspond to an intersection station, a group including this departure station is obtained, and the intersection stations at both ends of this group are set as search start stations; if the arrival station corresponds to the intersection station, this arrival station is the search target station. If the destination station does not correspond to an intersection station, a group including the destination station is obtained, and the intersection stations at both ends of the group are set as search target stations; the adjacent intersection station as an intersection station adjacent to the search start station is acquired. Shi; the catch And repeating the acquisition of cross station adjacent to the adjacent cross station to search for a route to the searched station; path search method characterized by. 2. In a route network composed of a plurality of stations and lines including these stations, a transferable station having three or more branches is set as an intersection station and used as search data for route search. Holding means for holding a station sandwiched between stations as one group data; departure and arrival station acceptance means for accepting designation of departure station and arrival station included in the route network; route from the departure station to the arrival station Search means for searching for the searched route; route acceptance means for accepting the designation of the searched route; expiration date acceptance means for accepting the designation of the expiration date; the accepted departure station, arrival station, route, and A commuter ticket issuing device, comprising: a commuter ticket issuing means for issuing a commuter ticket having an expiration date; 3. In a list composed of a plurality of points and branches connecting these points, points having three or more branches are used as search data for route search; input of start point and end point is accepted; Searching the route to the end point with the search data; 4. In a list composed of a plurality of points and a branch connecting these points, a point having three or more branches is an intersection, and this intersection is used as search data for route search; Place the sandwiched points as a group;
Input of start points and end points included in the list is accepted; when the start point corresponds to an intersection, this start point is used as a search start point; when the start point does not correspond to an intersection, a group of this start point is obtained, and intersections at both ends of this group are obtained. As a search start point; when the end point corresponds to an intersection, the end point is used as a search target point; when the end point does not correspond to an intersection, a group of the end points is obtained, and intersections at both ends of the group are used as search target points; A route search method for searching a route from a search start point to the search target point by the search data. 5. In a list composed of a plurality of points and branches connecting these points, a point having three or more branches is an intersection, and this intersection is used as search data for route search; Place the sandwiched points as a group;
Input of start points and end points included in the list is accepted; when the start point corresponds to an intersection, this start point is used as a search start point; when the start point does not correspond to an intersection, a group of this start point is obtained, and intersections at both ends of this group are obtained. As a search start point; when the end point corresponds to an intersection, the end point is used as a search target point; when the end point does not correspond to an intersection, a group of the end points is obtained, and intersections at both ends of the group are used as search target points; A route search method, comprising: acquiring an adjacent intersection as an intersection adjacent to a search start point; repeating acquisition of an intersection adjacent to the acquired adjacent intersection to search a route to the search target point. 6. In a list composed of a plurality of stations and branches connecting these stations, a transferable station having three or more branches is defined as a crossover station, and this crossover station is used as search data for route search; A station sandwiched between a station and a crossing station is regarded as one group; an input of a departure station and an arrival station included in the list is accepted; when the departure station corresponds to an intersection station, this departure station is set as a search start station; When the departure station does not correspond to an intersection station, a group of this departure station is obtained, and the intersection stations at both ends of this group are set as search start stations; when the arrival station corresponds to the intersection station, this arrival station is set as a search target station; When the destination station does not correspond to an intersection station, a group of the destination station is obtained, and the intersection stations at both ends of the group are set as search target stations; the adjacent intersection station as an intersection station adjacent to the search start station is acquired; Won Repeating the acquisition of cross station adjacent to the adjacent cross station to search for a route to the searched station; path search method characterized by. 7. A holding means for holding a point having three or more branches as search data at the time of route search in a list composed of a plurality of points and a branch connecting these points; a starting point included in the list. And an input receiving unit that receives an input of an end point; and a searching unit that searches a route from the start point to the end point with the search data; 8. In a list composed of a plurality of stations and branches connecting these stations, a transferable station having three or more branches is taken as search data at the time of route search as a crossing station, and crossing this crossing station. Holding means for holding a station sandwiched between stations as one group data; departure and arrival station acceptance means for accepting designation of departure station and arrival station included in the list; and a route from the departure station to the arrival station Search means for searching by the search data; route acceptance means for accepting designation of the retrieved route; expiry date acceptance means for accepting designation of expiry date; the accepted departure station, arrival station, route, and validity A commuter ticket issuing device, comprising: commuter ticket issuing means for issuing a commuter ticket for a deadline.