JP3811105B2 - Route search method and route search program - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a route search method and a route search program capable of searching for one or a plurality of routes between a departure place and a destination using a computer.
[0002]
[Prior art]
2. Description of the Related Art Conventionally, there is software that displays (guides) one or more routes from a departure point to a destination when a departure point, a destination, a desired departure time, and the like are input using a computer. For example, in the case of train transfer guidance, the displayed route is composed of a departure station, a transfer station, a destination station, a use route or a use train, and the departure time at the departure station and the departure / arrival time at the transfer station. In many cases, the arrival time at the destination station, the required time, and the charge are also displayed. Such a search service is performed on the web page of package software or a service provider.
[0003]
This route search is usually considered based on a network that is a graph in which nodes are connected by arcs and weights (costs) are assigned to the arcs. When considering a path from the departure node s to the destination node t in the network, the i-th shortest path from s to t is referred to as the i-th shortest path from s to t. The first shortest path is a so-called shortest path. As is well known, the shortest path is obtained at high speed by the Dijkstra method. Algorithms for obtaining the shortest path after the second shortest path have also been studied for a long time, and various efficient algorithms have been proposed.
[0004]
As an algorithm for obtaining the first to K shortest paths, for example, Martin's algorithm (“An algorithm for ranking loopless paths”, e-queue buoy martin et al. ( EQVMartins et al.,), Coimbra University research report (Research Report, Univ. De Coimbra), 1999, etc.) are known. When obtaining the first to K shortest paths, there are cases where a loop (closed circuit) is allowed and cases where it is not allowed. The reason for allowing a loop is to adopt a redundant path that passes through the same node twice or more as the i-th shortest path. Allowing loops is easier to handle as a problem, but is generally more practical when loops are not allowed. Martin's algorithm is one of the algorithms when loops are not allowed.
[0005]
In a connected network in which the weight of each arc is non-negative, the shortest path from each node to the target node t is a path that does not pass through the same node twice. The shortest path from all nodes to t can be expressed by a rooted tree with t as the root. This rooted tree is called the shortest path tree ("Information structure (below)", Takao Asano, Nippon Critics, p.241). In addition, an element of the ordered set S is assigned to each node v of the tree so as to satisfy the condition “for each node v other than the root, the parent element is smaller than or equal to the child element”. A rooted tree is called a heap (see “Structure of Information (above)”, Takao Asano, Nippon Critics, p. 45).
[0006]
In the Martin algorithm, the path from the start node s to the target node t corresponds to a node of the heap, and the path cost (the sum of arc weights on the path) corresponds to an element of the ordered set S. The outline of Martin's algorithm will be described. First, a shortest path tree having a target node t as a root is created by Dijkstra method, and the shortest path is stored in a heap. Next, the following processes (i) and (ii) are repeated with k = 0.
[0007]
(i) Extract the path p with the lowest cost from the heap. If p does not include a loop, p is registered as the (k + 1) -th shortest path, and 1 is added to k. End if k = K.
[0008]
(ii) Regardless of whether or not p includes a loop, at most one derivative path for p (a path that deviates sideways and then travels through an arc on the shortest path tree at a time) for each node on p. Find it one by one and store it in the heap. Return to (i).
[0009]
The point is how to select an arc when making a derived path, that is, an arc when moving one step aside from the original path p.
[0010]
[Problems to be solved by the invention]
By the way, when a substantial reciprocal part is generated in the searched route by using the same route or another route of the same company running in parallel, it is referred to as “xell”. The conventional algorithm for obtaining the first to K shortest paths has been devised for a general network, and does not take into account xels in trains and the like. Since a case where a round trip occurs on the same route corresponds to a loop, it is possible to obtain a route where no round trip occurs on the same route, even with the Martin algorithm. However, a case where a substantial reciprocal part is generated by using different parallel lines of different stations of the same company cannot be excluded. For example, in FIG. 6, when the boarding station is S station and the stop station is V station, a path such as “S station; F route; W station; G route; V station” may be obtained.
[0011]
Therefore, in view of the above problems, the present invention provides a route search method and route search that can obtain a route that does not include a xel in a network that has stations as nodes and expresses routes between stations and walking transfers using arcs. The purpose is to provide a program.
[0012]
[Means for Solving the Problems]
In order to achieve the above object, the first feature of the present invention is: A route search method in which a computer searches for a route, (A) A plurality of points stored in the data storage device are represented by nodes, routes between adjacent points are represented by a plurality of arcs, a part of the nodes are cliqued, and a part of the plurality of arcs , A step of reading a network in which a skip arc, which is an arc that skips a point on a parallel route, and (b) the shortest path from the departure point to the destination point on the network based on the input search condition A step of creating the shortest path tree involved, and (c) searching for a plurality of shortest paths from the starting point to the destination point based on the shortest path tree, and using a skip arc to each of the plurality of shortest paths. The gist of the present invention is a route search method including a step of determining whether or not xels are included. Here, “point” refers to a specific point such as a train station, an airport, a bus stop, or a road. “Clique” refers to representing a single point as a plurality of nodes corresponding to the number of routes connected to the point, and providing arcs for route change between these nodes. An arc for changing the route is provided between the nodes. This arc for route change is referred to as “route change arc”. On the other hand, a normal arc representing a route is called a “route arc”.
[0013]
According to the route search method according to the first feature, it is possible to obtain a route that does not include a xel in a network that has stations as nodes and expresses routes between stations and walking transfers with arcs.
[0014]
In the route search method according to the first feature, (d) a partial route that is allowed to be returned is searched, the partial route that is allowed to be returned is replaced with a partial route that includes the return, and a new route is obtained. A step may be further included. According to this route search method, in a network that has stations as nodes and expresses routes between stations and transfers between trains by arcs, routes that do not contain xels can be obtained. This can be dealt with by a special replacement operation as a process.
[0015]
The step of determining the route search method according to the first feature includes a step of setting a skip arc appearing on the shortest path as a first arc, and a step of setting a route arc immediately before the first arc as a second arc. When the second arc is not a skip arc, a step of determining that the shortest path includes a xell when the point corresponding to the start point of the second arc coincides with the point where the first arc skips first may be included. . The determining step includes a step of setting a skip arc appearing on the shortest path as a first arc, a step of setting a route arc immediately after the first arc as a third arc, and a step where the third arc is a skip arc. The first point is the point where the third arc skips first, and the first point and the point where the first arc skips last match when determining that the shortest path contains xels. May be included. In addition, this determination step includes a stage in which the skip arc appearing on the shortest path is the first arc, a stage in which the route arc immediately after the first arc is the third arc, and the third arc is not a skip arc. A point corresponding to the end point of the third arc as the first point, and a step of determining that the shortest path includes xels when the first point and the point where the first arc skips last match, May be included.
[0016]
The route search method according to the first feature includes the steps of (e) removing a route change arc and shortening consecutive arcs of the same route name for a plurality of shortest paths to obtain a plurality of shortest routes. And (f) selecting a part of the plurality of shortest paths based on the priority criteria and outputting the selected part to the output device. According to this route search method, a plurality of shortest routes from the departure point to the destination point can be efficiently displayed.
[0017]
The second feature of the present invention is that (a) a plurality of points stored in the data storage device are represented by nodes, routes between adjacent points are represented by a plurality of arcs, and a part of the plurality of points is represented. Based on the command that reads the network in which the skip arc that is the arc that skips the point of another route that runs parallel to a part of multiple arcs, the node is cliqued, and (b) the input search condition, A command to create the shortest path tree related to the shortest path from the departure point to the destination point on the network, and (c) search for multiple shortest paths from the departure point to the destination point based on the shortest path tree and skip An instruction that uses arcs to determine whether or not each of the plurality of shortest paths contains a xel. On the computer The gist is that it is a route search program to be given. The route search program according to the second feature includes (d) a command for removing a route change arc and shortening arcs of consecutive identical route names for a plurality of shortest paths and obtaining a plurality of shortest routes; E) A command for selecting a part of a plurality of shortest paths based on the priority criteria and outputting the selected part to the output device. On the computer May be given.
[0018]
The route search program for realizing the above instructions is stored in a program storage device connected to the processing control device (CPU) of the route search device. By reading the route search program according to the second feature of the present invention, it is possible to cause the route search device to realize the above command.
[0019]
DETAILED DESCRIPTION OF THE INVENTION
Next, embodiments of the present invention will be described with reference to the drawings. In the following description of the drawings, the same or similar parts are denoted by the same or similar reference numerals. However, it should be noted that the drawings are schematic.
[0020]
As a route search method according to an embodiment of the present invention, first, a network composed of a plurality of “nodes” and “arcs” connecting the nodes will be described. A network used for route search is basically created by regarding stations as “nodes” and providing “arcs” between adjacent stations on the track. As an example of this, a network of X station and Y station is shown in FIG. Here, X station and Y station are nodes, and double-ended arrows indicated by solid lines with symbols A, B, C, D, and E represent arcs (up / down two arcs are collectively represented as one). ing). Symbols A, B, C, D, and E attached to the arc represent route names. In addition, an up / down flag, an average required time, and the like are attached to each arc of the route. Further, in FIG. 4, the area between the X station and the Y station is indicated by a broken-line arc, and is located at a position 13 minutes on foot.
[0021]
There are two types of transfer between routes: changing at the same station and transferring between different stations. When changing at the same station, the station is creeked. A “clique” is a complete subgraph composed of a plurality of points (nodes) included in a given graph. “Clique” means that one station is represented by a node corresponding to the number of routes connected to the station. An arc is set between multiple creeked nodes to provide transfer time. FIG. 5 shows an example in which the X and Y stations are creeked. X station is creeked into a three-point complete graph (triangle) consisting of X station (A) on route A, X station (B) on route B, and X station (C) on route C. Transfer between nodes The time is all 3 minutes. Y station is creeked into a two-point complete graph consisting of Y station (D) on D route and Y station (E) on E route, and the transfer time between nodes is 2 minutes. Nodes in the creek are called “creek stations”, and arcs between creek stations are called “route change arcs”. A new “walking arc” will be provided for transfers between different stations by foot. The route change arc and the walking arc are both moved by walking, but are used separately for convenience. In FIG. 5, a thick line represents a route change arc, and a broken line represents a walking arc. A walking arc is applied to every pair of creek stations at X and Y stations. The walking arc or the route change arc has a flag for identifying it, a movement or transfer time, and the like.
[0022]
In addition, in order to distinguish the original station from the creek station, the original station will be referred to as the original station. For example, X station and Y station are originally stations, and X station (A), X station (B), and X station (C) are creek stations. X station remains on the network as multiple creek stations.
[0023]
(First embodiment)
In the first embodiment, a route search method capable of obtaining a route that does not include a xell in a network that has stations as nodes and expresses routes between stations and walking transfers using arcs will be described.
[0024]
As shown in FIG. 3, the route search device according to the first embodiment of the present invention includes an input device 11, an output device 12, a data storage device 13, a temporary storage device 14, a program, and a processing control device (CPU) 5. A storage device 15, a shortest path tree storage device 20, a multiple path storage device 21, and a multiple path storage device 22 are connected. The CPU 5 includes a network creation module 5a for creating a network, a data reading module 5b for reading search conditions and data necessary for search, a shortest path tree creation module 5c for creating a shortest path tree, and a plurality of shortest path trees based on the shortest path tree. Multiple path search module 5d for searching for the shortest path, xell check module 5e for determining whether or not a xel is included for each of the plurality of shortest paths, removal of route change arcs for the plurality of shortest paths, and continuous identicalness A path shortening module 5f that shortens the arc of the route name and obtains a plurality of shortest paths, a time allocation module 5g that assigns time to a plurality of shortest paths, and a charge calculation module 5h that calculates charges for a plurality of shortest paths A display module that selects and displays the top multiple routes based on priority criteria. Including Le 5i. In the following description of the route search, it is assumed that K shortest routes are obtained.
[0025]
The network creation module 5 a creates the above-described clique network based on data such as a route map and required time between stations, and stores the network in the data storage device 13. At this time, a skip arc is set in the network to be created. “Skip arc” refers to an arc of a route that passes through a station of another route running in parallel. For the skip arc a, the original station through which a passes is called “a skip station” of a. For example, in FIG. 6, the arc from the node on the F route at the T station to the node on the F route at the W station is a skip arc, and the U station and the V station are the skip stations. Only the first and last skip stations for the skip arc are used as the skip stations for determining whether or not the xels are included. Since FIG. 6 shows just two examples of the skip station, the U station is the first skip station and the V station is the last skip station. If there is one skip station, it is considered to be the first skip station and the last skip station. Each skip arc on the network has the original station number of the first and last skip station.
[0026]
The data reading module 5b reads the search condition input from the input device 11, and reads necessary data such as network, timetable data, and fee data from the data storage device 13. At this time, the original station numbers are obtained for the boarding station name and the getting-off station name as search conditions. When the boarding station or the getting-off station is creeked, the number of the representative creek station in the creek station is obtained. It is assumed that the numbers of the other creek stations in the creek are serial numbers following the number of the representative creek station. When the boarding station or the getting-off station is not creeked, the station is regarded as a representative creek station.
The shortest path tree creation module 5c creates a shortest path tree using the Dijkstra method or the like. The created shortest path tree is stored in the shortest path tree storage device 20. The multi-path search module 5d obtains the first to K shortest paths from the representative creek station of the boarding station to the representative creek station of the disembarking station using a Martin algorithm or the like. The searched plural shortest paths are stored in the plural path storage device 21.
[0027]
The xell check module 5e determines whether or not xels are included for each of the first to K shortest paths. A detailed determination method will be described later.
[0028]
The path shortening module 5f removes all the route change arcs from the first to K shortest paths obtained as described above, and further shortens all the arcs having the same route name. For example, when searching from station J to station N, as the i-th shortest path, “J station; H route; K station; H route; L station (transfer); I route; M station; I route; N station” Is searched. By shortening the arc of the same route name continuous with the route change arc, “J station; H route; L station; I route; N station” is obtained. The path thus obtained is called a “route”. In the following description, the one corresponding to the i-th shortest path is called the i-th route. The determined shortest path is stored in the multi-path storage device 22.
The time allocation module 5g allocates the time at the boarding station, the getting-off station, the transfer station, and the like to the obtained first to K routes based on the timetable data. The fee calculation module 5h calculates a fee for the obtained first to K routes based on fee data or the like. The display module 5i selects a plurality of higher-order routes from routes assigned with time and fee based on priority criteria such as required time and displays them on the output device 12 or a Web page on the Internet.
[0029]
The input device 11 refers to a device such as a keyboard and a mouse. When an input operation is performed from the input device 11, corresponding key information is transmitted to the CPU 5. The output device 12 indicates a screen such as a monitor, and a liquid crystal display (LCD), a light emitting diode (LED) panel, an electroluminescence (EL) panel, or the like can be used. The data storage device 13 stores a network, timetable data, fee data, and the like. The temporary storage device 14 temporarily stores data being calculated or being analyzed in the calculation by the CPU 5. The program storage device 15 stores a program for causing the CPU 5 to execute check of a xel, creation of a shortest path, search, and the like. The shortest path tree storage device 20 stores the shortest path tree created by the shortest path tree creation module 5c. The multiple path storage device 21 stores the multiple paths searched by the multiple path search module 5d. The multiple path storage device 22 stores the multiple paths obtained by the path shortening module 5f.
[0030]
Next, a route search method according to the first embodiment of the present invention will be described with reference to FIGS.
(A) First, as a premise for route search, in step S101, a plurality of stations are represented by nodes, and a connection between the plurality of stations is represented by a plurality of arcs, and some nodes of the plurality of stations are cliqued. Create a new network. A skip arc is set in a part of the arc of this network. Each skip arc on the network has the original station number of its first and last skip station. The created network is stored in the data storage device 13. The network may be created in advance by another device and stored in the data storage storage device 13. Next, in step S102, the retrieval conditions such as the boarding station, the getting-off station, the departure / arrival time, etc. input using the input device 11 or the like are read. In step S103, necessary data such as a network, timetable data, and fee data is read from the data storage device 13.
[0031]
(B) Next, in step S104, the shortest path tree of the route from the boarding station to the getting-off station is created on the network based on the input search condition using the Dijkstra method or the like. The created shortest path tree is stored in the shortest path tree storage device 20.
[0032]
(C) Next, in step S105, from the representative creek station of the boarding station to the representative creek station of the disembarking station based on the shortest path tree read from the shortest path tree storage device 20 using the Martin algorithm or the like. Search for the first to K shortest paths to reach. Then, using the skip arc, it is determined whether or not a xel is included in each of the obtained first to K shortest paths. Details of this determination method will be described later. This xelsel check is performed every time the shortest path is obtained. That is, when a candidate for the i-th shortest path is found, a xell check is performed on that path, and if no xel is included, it is adopted as the i-th shortest path. In step S106, the first to K shortest paths are obtained as a result. The obtained first to K shortest paths are stored in the multi-path storage device 21.
[0033]
(D) Next, in step S107, the first to K shortest paths are shortened to obtain first to K paths. Specifically, all the route change arcs are removed for each of the first to K shortest paths, and all the arcs having the same route name are shortened. The obtained multiple paths are stored in the multiple path storage device 22.
[0034]
(E) Next, in step S108, time allocation is performed for each of the first to K routes while checking the timetable, and in step S109, a fee is calculated. In step S110, a plurality of higher-order routes are selected from the first to K routes to which the time and fee are assigned, and output (displayed) to the output device 12 in step S110.
[0035]
Details of the xels check shown in step S105 of FIG. 1 will be described with reference to FIG.
(A) First, in step S201, it is determined whether a skip arc exists on the path. If it does not exist, the process proceeds to step S213, and it is determined that no xels are included. When the skip arc exists, the process proceeds to step S202, and the skip arc that first appears on the path is set as the first arc.
[0036]
(B) Next, in step S203, it is determined whether there is an arc before the first arc. If not, the process proceeds to step S207. If there is, the process proceeds to step S204, and the arc immediately before the first arc is set as the second arc.
[0037]
(C) Next, in step S205, it is determined whether the second arc is a skip arc. If it is a skip arc, the process proceeds to step S207. If it is not a skip arc, the process proceeds to step S206, and it is determined whether the original station of the start point of the second arc matches the first skip station of the first arc. If they match, the process proceeds to step S214, and it is determined that xels are included. The state at this time is shown in FIG. The original station of the starting point of the second arc is B station, and the first skip station of the first arc which is a skip arc is B station. Since they match, it can be seen that they contain xels.
[0038]
(D) If they do not match in step S206, the process proceeds to step S207 to determine whether there is an arc after the first arc. If not, the process proceeds to step S213, and it is determined that no xels are included. If there is, the process proceeds to step S208, and the arc immediately after the first arc is set as the third arc.
[0039]
(E) Next, in step S209, if the third arc is a skip arc, the first skip station of the third arc is set as the first station. In step S210, it is determined whether the first station and the last skip station of the first arc match. If they match, the process proceeds to step S214, and it is determined that xels are included. FIG. 7 (b) shows the state when the third arc is determined to be a skip arc and includes xels, and FIG. 7 (b) illustrates the state when the third arc is determined not to be a skip arc and includes xels. 7 (c). In FIG. 7B, the first skip station of the third arc, which is a skip arc, is C station (first station), and the last skip station of the first arc, which is a skip arc, is C station. Since they match, it can be seen that they contain xels. In FIG.7 (c), the original station of the end point of 3rd arc is C station (1st station), and the last skip station of 1st arc which is a skip arc is C station. Since they match, it can be seen that they contain xels.
[0040]
(F) If they do not match in step S210, the process proceeds to step S211 to determine whether a skip arc exists after the first arc on the path. When it exists, it progresses to step S212, the skip arc is made into a new 1st arc, and the process of step S203-step S211 is repeated. If it does not exist, the process proceeds to step S213, and it is determined that no xels are included.
[0041]
According to the route search method of the first embodiment, it is possible to obtain a route that does not include a xel in a network that has a station as a node and expresses a route between stations and a transfer on foot by an arc.
[0042]
(Second Embodiment)
In the second embodiment, in a network that has a station as a node and expresses a route between stations and a transfer by walking with an arc, a route that does not include a xell can be obtained, and for a route that is allowed to return, A route search method that can be handled by the replacement operation will be described.
[0043]
As shown in FIG. 8, the route search device according to the second embodiment of the present invention includes an input device 11, an output device 12, a data storage device 13, a temporary storage device 14, a program, and a processing control device (CPU) 5. A storage device 15, a shortest path tree storage device 20, a multiple path storage device 21, and a multiple path storage device 22 are connected. The CPU 5 includes a network creation module 5a for creating a network, a data reading module 5b for reading search conditions and data necessary for search, a shortest path tree creation module 5c for creating a shortest path tree, and a plurality of shortest path trees based on the shortest path tree. A multiple path search module 5d for searching for the shortest path, a xell check module 5e for determining whether or not a xel is included in each of the plurality of shortest paths, removal of route change arcs for a plurality of shortest paths, and consecutive identical route names A path shortening module 5f for obtaining a plurality of shortest paths, a time allocation module 5g for allocating time to a plurality of shortest paths, a charge calculation module 5h for calculating charges for a plurality of shortest paths, priority Display module that selects and displays multiple top routes based on criteria i, for the path folding is allowed provided the path replacement module 5j replace path. In the following description, K shortest paths are obtained.
[0044]
Some routes in Japan are allowed to be partially folded. For example, as shown in FIG. 10, since the express and limited express on the J route do not stop at the E station, when changing to the K route, the change is made at the F station. In that case, a turnaround occurs between the E station and the F station, but this turnaround is permitted.
[0045]
The route replacement module 5j performs replacement processing for such routes that are allowed to be turned back. For example, when a partial route “route 1; E station; route 2” is transferred from route 1 to route 2, it is assumed that turn-back is permitted at station F. At this time, for each of the first to K routes obtained by the path shortening module 5f, a partial route “route 1; E station; route 2” that is permitted to be turned back is detected, and the partial route is turned back. Is added to the original route group as the (K + 1) -th route. When there are a plurality of routes to be replaced, they are added as the K + 2 route, the K + 3 route,.
[0046]
For example, in the example of FIG. 10, a new route is added by the following replacement.
(1) If there is a section "J route (down); E station; K route (down)" on the route, the route is replaced with the section "J route (down); F station; K route (down)" Also add.
(2) If there is a section "K route (up); E station; J route (up)" on the route, the route is replaced with the section "K route (up); F station; J route (up)" Add to
[0047]
Network creation module 5a, data reading module 5b, shortest path tree creation module 5c, multi-path search module 5d, xell check module 5e, path shortening module 5f, time allocation module 5g, fee calculation module 5h, display module 5i, input device 11 The output device 12, the data storage device 13, the temporary storage device 14, the program storage device 15, the shortest path tree storage device 20, the multiple path storage device 21, and the multiple path storage device 22 are the same as those in the first embodiment. The description is omitted here.
[0048]
Next, a route search method according to the second embodiment of the present invention will be described with reference to FIG.
(A) First, steps S301 to S307 are the same as steps S101 to S107 in FIG.
(B) Next, in step S308, the shortest path permitted to be turned back is searched. Then, the path that is permitted to be turned back is replaced with a path that includes the turn back. The route including the return is added to the original route group as a new route and is stored in the multiple route storage device 22.
(C) Next, steps S309 to S311 are the same as steps S108 to S110 in FIG.
[0049]
According to the route search method of the second embodiment, in a network that has stations as nodes and expresses routes between stations and walking transfers by arcs, routes that do not contain xels can be obtained, and routes that are allowed to return Can be dealt with by a special replacement operation as post-processing.
[0050]
(Other embodiments)
Although the present invention has been described according to the above-described embodiments, it should not be understood that the descriptions and drawings constituting a part of this disclosure limit the present invention. From this disclosure, various alternative embodiments, examples and operational techniques will be apparent to those skilled in the art.
[0051]
For example, in the first to second embodiments of the present invention, the train line station has been described as an example. However, the present invention is not limited to this, and a route search may be performed using an airport or a bus stop as a departure point or destination. .
[0052]
Further, in the first to second embodiments of the present invention, it has been described that the retrieval conditions such as the boarding station, the getting-off station, the departure / arrival time, etc. inputted from the input device 11 are read. Not only the input but also the route search device according to the present invention may be connected to the Internet and the search condition may be input from the terminal device of the Internet user. Similarly, it has been described that a plurality of higher-order routes are selected from the obtained first to K routes and output to the output device 12 of the route search device. However, the route search device according to the present invention is connected to the Internet and searched. The route of the result may be displayed on a web page or the like.
[0053]
In FIG. 9, the route replacement (S308) has been described after the shortest path shortening (S307). However, it may be performed after a plurality of shortest path searches (S306).
[0054]
In addition, the route search device according to the first to second embodiments of the present invention includes a data storage device 13, a temporary storage device 14, a program storage device 15, a shortest path tree storage device 20, a multiple path storage device 21, and a plurality of storage devices. Although it has been described that the path storage device 22 is provided separately, these storage devices may be substituted with one storage device. Similarly, each module in the CPU 5 has been described as being in one CPU 5, but may be provided separately for a plurality of CPUs 5. At that time, the devices are connected by a bus or the like so that data can be exchanged between the plurality of CPUs 5.
[0055]
As described above, the present invention naturally includes various embodiments not described herein. Therefore, the technical scope of the present invention is defined only by the invention specifying matters according to the scope of claims reasonable from the above description.
[0056]
【The invention's effect】
According to the present invention, it is possible to provide a route search method and a route search program capable of obtaining a route that does not include a xel in a network that has a station as a node and expresses a route between stations and a transfer on foot by an arc. it can.
[Brief description of the drawings]
FIG. 1 is a flowchart of a route search method according to a first embodiment.
FIG. 2 is a flowchart of a xell check method according to the first to second embodiments.
FIG. 3 is a block diagram of a route search apparatus according to the first embodiment.
FIG. 4 is an example of a network for a route search method according to the first to second embodiments.
FIG. 5 is an example of a clique network of the route search method according to the first to second embodiments.
FIG. 6 is an example of a xel according to the first to second embodiments.
7 is a state diagram of xels in the flowchart of FIG. 2;
FIG. 8 is a block diagram of a route search apparatus according to a second embodiment.
FIG. 9 is a flowchart of a route search method according to the second embodiment.
FIG. 10 is an example of a path that is allowed to be turned back according to the second embodiment;
[Explanation of symbols]
5 CPU (Processing control device)
5a Network creation module
5b Data reading module
5c Shortest path tree creation module
5d multiple path search module
5e Xel Check Module
5f path shortening module
5g time allocation module
5h Charge calculation module
5i display module
5j Path replacement module
11 Input device
12 Output device
13 Data storage device
14 Temporary storage
15 Program storage device
20 Shortest path tree storage device
21 Multi-pass storage device
22 Multi-path storage device

Claims (8)

A route search method in which a computer searches for a route, wherein a plurality of points stored in a data storage device are each represented by a node, and a route between adjacent points is represented by a plurality of arcs, and a part of the node And a step of reading a network in which a skip arc that is an arc that skips a point of another route that runs parallel to a part of the plurality of arcs is set,
Creating a shortest path tree related to the shortest path from the starting point to the destination point on the network based on the input search condition;
Based on the shortest path tree, a plurality of shortest paths from the starting point to the destination point are searched, and the skip arc is used to determine whether each of the plurality of shortest paths includes xels. A route search method comprising the steps of:   The route according to claim 1, further comprising a step of searching for a partial route that is permitted to be turned back, replacing the partial route that is allowed to be turned back with a partial route including the turned-back, and forming a new route. Search method. The step of determining includes
Making the skip arc appearing on the shortest path a first arc;
A line arc preceding the first arc is a second arc;
If the second arc is not a skip arc, and the point corresponding to the start point of the second arc coincides with the point where the first arc skips first, the step of determining that the shortest path includes a xel The route search method according to claim 1, further comprising: The step of determining includes
Making the skip arc appearing on the shortest path a first arc;
A line arc after the first arc as a third arc;
When the third arc is a skip arc, when the point where the third arc skips first is the first point, and when the first point and the point where the first arc skips last match, The route search method according to claim 1, further comprising: determining that the shortest path includes xels. The step of determining includes
Making the skip arc appearing on the shortest path a first arc;
A line arc after the first arc as a third arc;
When the third arc is not a skip arc, a step corresponding to the end point of the third arc is set as the first point;
5. The method according to claim 1, further comprising: determining that the shortest path includes a xel when the first point coincides with a point where the first arc is skipped last. The route search method described in 1. For the plurality of shortest paths, removing route change arcs and shortening arcs of consecutive identical route names to obtain a plurality of shortest paths;
The route search method according to claim 1, further comprising: selecting a part of the plurality of shortest paths based on a priority criterion and outputting the selected part to an output device. A plurality of points stored in the data storage device are represented by nodes, routes between adjacent points are represented by a plurality of arcs, and some nodes of the plurality of points are cliqued, and the plurality of arcs A command to read a network in which a skip arc that is an arc that skips a point on another route that runs parallel to a part of
Based on the input search condition, an instruction to create a shortest path tree related to the shortest path from the starting point to the destination point on the network;
Based on the shortest path tree, a plurality of shortest paths from the starting point to the destination point are searched, and the skip arc is used to determine whether or not each of the plurality of shortest paths includes xels. A route search program characterized by giving instructions to a computer . For the plurality of shortest paths, a command for obtaining a plurality of shortest paths by removing route change arcs and shortening arcs of consecutive identical route names;
The route search program according to claim 7, further comprising: giving a computer a command to select a part of the plurality of shortest routes and output to the output device based on a priority criterion.

Images