JP2014190777A - Route search device and route search system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a route search device which identifies characteristics of facilities associated with respective routes from a first point to a second point.SOLUTION: In a route search device, a facility information storage section stores information to identify a facility associated with a node and a link and an index value set for the facility. An allowable route search section sets maximum travel time on the basis of a desired arrival time at a second point acquired from a user and searches at least one route as the allowable route with required travel time to travel from the first point to the second point not more than the maximum travel time. The allowable route search section also identifies the index values of the facilities associated with respective allowable routes.

Description

  The present invention relates to a route search apparatus.

  In recent years, car navigation systems, mobile phones, portable game machines, PNDs (Personal Navigation Devices) and PDAs (Personal Digital Assistants) installed in automobiles are known as route search devices for searching for routes from departure points to arrival points. It has been. Some route search devices present a plurality of routes to the user as routes from the departure point to the arrival point.

  For example, in Patent Document 1, an arbitrary position is set in an optimum route that travels from a departure point to an arrival point in the shortest time, and exists within a certain distance from an arbitrary position, or an arbitrary position. A route search device that extracts a facility within a range that can be moved in a certain time from a starting point and searches for a route from a departure point to an arrival point via the extracted facility is disclosed.

JP 2010-25833 A

  However, in the technique described in Patent Document 1, when there are many facilities that the user wants to go through, the route from the departure point to the arrival point via all the facilities is searched, After confirming the required time, it is necessary for users to narrow down the facilities they want to go through, and it may take time to narrow down the facilities they want to go through.

  SUMMARY An advantage of some aspects of the invention is to solve at least a part of the problems described above, and the invention can be implemented as the following forms.

(1) According to an aspect of the present invention, there is provided a route search device that searches for a route connecting any two points on a network. The route search device includes a route information storage unit that stores data for specifying nodes and links constituting a route, data for specifying a link cost representing a time required for passage of each link, and at least a node or a link A facility information storage unit for storing data identifying a facility associated with one side and data identifying a property set in the facility; a point for acquiring data identifying a first point and a second point An acquisition unit; an upper limit time setting unit that sets a movement upper limit time that is an upper limit value of the time required to pass the route from the first point to the second point; and from the first point to the second point Among these routes, at least one route in which the required travel time, which is the time required to travel from the first point to the second point, is less than or equal to the upper limit travel time is defined as an allowable route. A permissible route searching unit for searching; a facility specific to each of the permissible routes specifying the facility associated with the nodes and links included in each permissible route and the characteristics set in the facility; Is provided. According to the route search device of this aspect, the route from the first point to the second point via the facility is within the allowable route range that the user of the route search device can reach by the arrival time at which the user wants to arrive at the second point. Can be provided to users. Further, in the route search from the first point to the second point, only an allowable route whose travel time is equal to or shorter than the upper limit movement time is searched, and therefore a useless route that cannot reach the arrival point within the upper limit movement time is not searched. Moreover, if it is the range of the facilities linked | related with the permissible path | route, the permissible path | route which goes through about each of all the facilities can be provided to a user.

(2) In the route search device of the above aspect, the allowable route search unit is a minimum cost route that minimizes a cumulative value of link costs of each link among a plurality of routes connecting the first point to a specific node. And a non-minimum cost route other than that, and an optimal route search unit that sets the minimum cost route as the optimal route when the specific node is the second point; , For each of a plurality of specific nodes included in the route from the first point to the second point, among the plurality of routes connecting the first point to the specific node, the minimum cost route and the non-point A path storage unit for each node that stores a cumulative value of link costs of a minimum cost path; and the allowable path search unit sequentially selects a plurality of the specific nodes included in the optimal path. And the difference in the cumulative value of the link cost between the minimum cost route and the non-minimum cost route in the optimal node is equal to or less than the allowable time obtained by subtracting the cumulative value of the link cost of the optimal route from the movement upper limit time. The non-minimum cost route is selected, and a route combining the selected non-minimum cost route and the route from the optimum node to the second point that is the same as the optimum route is set as a similar route. The optimum route searching unit searches for the accumulated value of the link cost of the minimum cost route and the non-minimum cost route to a value obtained by adding the allowable cost to the accumulated value of the link cost of the optimum route. And the allowable route may be the optimum route and the similar route. According to the route search device of this embodiment, the optimum route search and the similar route can be efficiently set as the allowable route, and the route from the first point to the second point can be set efficiently.

(3) In the route search device of the above aspect, the similar route setting unit sequentially selects the specific nodes that are not included in the optimal route and included in the similar route as sub-optimal nodes. A route in which the difference in the cumulative value of the link cost between the minimum cost route and the non-minimum cost route is the difference in the cumulative value of the link cost between the optimum route and the similar route including the suboptimal node from the allowable time. Selecting the non-minimum cost route that is equal to or less than another time difference, and combining the selected non-minimum cost route with the route that is the same route as the similar route from the suboptimal node to the second point. After setting as a semi-similar route, and further setting the semi-similar route as the similar route, the semi-optimal node included in the set similar route The non-minimum difference between the minimum cost route and the non-minimum cost route is less than the value obtained by subtracting the cumulative cost of the optimal route and the time difference for each route from the allowable time. You may search until there is no cost path. According to the route search device of this embodiment, the optimum route search and the similar route can be efficiently set as the allowable route, and the route from the first point to the second point can be set efficiently.

(4) In the route search device according to the above aspect, the data specifying the characteristic is an index value; the route search device further: a label attaching unit for attaching label information to a specific node included in the allowable route The label information is included in the total of the index values of the facilities associated with the route from the first point to the specific node and the allowable route from the first point to the specific node. For each of the nodes to be added, a route addition cost obtained by adding up the total difference of link costs between the non-minimum cost route and the minimum cost route of the selected route, and one of the specific nodes in the allowable route Label information in a previous node that is a previous node; and the path-specific characteristic specifying unit includes a node included in each of the permissible paths, and The index value of the facility associated with the link may be specified for each of the allowable path. According to the route search device of this aspect, by providing a single index value to the user of the route search device instead of complicated information for each of a plurality of facilities, the route search device includes a route from the first point to the second point. From the above, it is possible to easily select one of the allowable routes, and the convenience for the user is improved.

(5) In the route search device according to the above aspect, further comprising: a label attaching unit that attaches label information to a specific node included in the allowable route; the label information is from the first point to the specific node. For each of the combination of facilities associated with a route and each of the nodes included in the allowed route from the first point to the specific node, the non-minimum cost route and the minimum cost route of the selected route Information including a route addition cost obtained by adding all the differences in the cumulative value of link costs, and label information in a previous node which is a node immediately preceding the specific node in the allowable route; In the same node, the combination of the facilities associated with the nodes and links included in each of the allowed routes is the same. With some, if the label information said path adding cost is different is granted may identify only the label information towards said path adding cost is small. According to the route search device of this aspect, when calculating a combination of facilities associated with an allowable route, it is not necessary to calculate a combination based on a label having a high cumulative value of link costs, and the second point to the second point. The time required to search for a route to can be shortened.

(6) In the route search device of the above aspect, the data specifying the characteristic is an index value; the route search device further includes: a specific facility selection unit that selects at least one specific facility from the plurality of facilities And when the specific facility is included in the combination of the facility associated with the node and the link included in the allowable route, an index addition value set in advance for the specific facility is set to the allowable route. An index value adding unit that adds to the total of the index values. According to the route search device of this aspect, when there is a facility that the user of the route search device wants to use, an allowable route that can use the facility can be preferentially provided to the user. Convenience when searching for a route from to the second point is improved.

(7) In the route search device according to the above aspect, the facility information storage unit stores a facility use time indicating a time required for using the facility; data specifying the characteristic is an index value; The apparatus further includes: a label attaching unit that assigns label information to a specific node included in the allowable route; the label information is associated with a route from the first point to the specific node. The total of the index value and the cumulative link cost of the non-minimum cost route and the minimum cost route of the selected route for each of the nodes included in the allowable route from the first point to the specific node Information including a route addition cost obtained by adding all the difference in values, and label information in a previous node that is a node immediately before the specific node in the allowable route. Yes; the label assigning unit is associated with the immediately preceding link from the label information of the same immediately preceding label when the facility is associated with the immediately preceding link that is a link connecting the immediately preceding node to the specific node. Two types of label information, that is, the label information when the facility is used and the label information when the facility is not used, are added, and the route addition cost is added to the label information when the facility is used. Instead of the above, a time obtained by adding the route addition cost and the facility use time of the facility used for the route addition cost may be given. According to the route search device of this aspect, since the facility use time of the used facility is added to the travel time required for the route from the first point to the second point, The arrival time arriving at the two points can be provided to the user of the route search apparatus, and the convenience for the user is improved.

(8) In the route search device of the above aspect, the facility information storage unit stores an event start time at which a specific event set in the facility starts and an event end time at which the specific event ends; The route search device further includes: a label attaching unit that attaches label information to a specific node included in the allowable route; and the label information is associated with a route from the first point to the specific node. For the combination of facilities and each of the nodes included in the allowable route from the first point to the specific node, the cumulative value of the link cost of the non-minimum cost route and the minimum cost route of the selected route The route addition cost obtained by adding all the differences and the label information in the immediately preceding node that is the node immediately before the specific node in the allowable route. The label assigning unit is configured such that when the facility is associated with the immediately preceding link, which is a link connecting the immediately preceding node to the specific node, the time when the facility is used is When it is between the event start time and the event end time, the label information when the facility associated with the previous link is used from the label information of the same previous label is not used. If the time when the facility is used is not between the event start time and the event end time, label information only when the facility is not used is given. It may be given. According to the route search device of this aspect, even when there is a facility associated with the allowable route, a user of the route search device passes a node or a link associated with the facility outside the time when the facility can be used. In this case, only label information that does not use the facility is given to the node immediately after passing through the facility. Therefore, the arrival time of arrival at the second point can be provided to the user based on the actual travel time, and the convenience for the user is improved.

(9) In the route search device according to the above aspect, when the facility is stored in association with an arbitrary position on the link, the allowable route search unit sets the arbitrary position as a new node as a facility node. And setting each of the two nodes adjacent to the facility node as a first adjacent node and a second adjacent node, and a first link connecting the facility node and the first adjacent node; Respective link costs of the second link connecting the facility node and the second adjacent node with respect to the length of the link cost of the link connecting the first adjacent node and the second adjacent node A link cost prorated by the length of the first link and the length of the second link may be set, and the allowable route may be newly searched. According to the route search device of this aspect, a specific position in the facility associated with the link is set as a facility node that is a new node. Therefore, since a target facility node that passes not only through the link associated with the facility but also only through the facility is added, more routes that reflect the characteristics of the facility are provided to the user of the route search device. It can be provided and the convenience for the user is improved.

(10) In the route search device of the above aspect, each of the allowable routes, the facility specified for each allowable route, and at least one of the characteristics set in the facility, You may provide the display information transmission part which transmits the display information displayed in correlation. According to the route search device of this aspect, the user of the route search device can recognize the facilities for each allowable route and the characteristics of the facilities as a list display, and the convenience for the user is improved.

  Note that the present invention can be realized in various modes. For example, a route search device and method, a route search system and method, an information terminal device, an information transmission device and method, a mobile terminal device, an information processing server, The present invention can be realized in the form of a route search server, a computer program for realizing these devices, methods, and systems. Further, these computer programs may be recorded on a computer-readable recording medium (for example, a flexible disk, a CD-ROM, a DVD-ROM, a magneto-optical disk, a memory card, a hard disk, etc.).

It is explanatory drawing which shows schematic structure of the route search system 10 in 1st Embodiment of this invention. It is explanatory drawing which shows the flow of a route search process. It is explanatory drawing which shows the flow of an allowable route search process. It is explanatory drawing which shows an example of the node and link in the path | route from departure point SA to arrival point GL. It is explanatory drawing which shows the outline of the cost total value calculation of each path | route in each node. It is explanatory drawing which shows the outline of the cost total value calculation of each path | route in each node. It is explanatory drawing which shows the flow of the process which sets a similar path | route from an optimal path | route. It is explanatory drawing which shows the outline of the similar path | route set in each optimal node. It is explanatory drawing which shows the outline of the semi-similar path | route set in each suboptimal node. It is explanatory drawing which shows the various information of the plant | facility linked | related with the node and the link. It is explanatory drawing which shows the various information of the plant | facility linked | related with the node and the link. It is explanatory drawing which shows the detail of the flow which calculates the satisfaction in each of an allowable path | route. It is explanatory drawing which shows the detail of the flow which calculates the satisfaction in each of an allowable path | route. It is explanatory drawing which shows the detail of the flow which calculates the satisfaction in each of an allowable path | route. It is explanatory drawing which shows the detail of the flow which calculates the satisfaction in each of an allowable path | route. It is explanatory drawing which shows the list of the labels provided to the arrival point GL. It is explanatory drawing which shows an example of the satisfaction according to the permissible path | route displayed on the mobile telephone 200. FIG. It is explanatory drawing which shows the detail of the flow which calculates the satisfaction in each of an allowable path | route. It is explanatory drawing which shows the detail of the flow which calculates the satisfaction in each of an allowable path | route. It is explanatory drawing which shows an example of the satisfaction according to the permissible path | route displayed on the mobile telephone 200. FIG. It is explanatory drawing which shows an example of the node and link in the path | route from departure point SA to arrival point GL. It is explanatory drawing which shows an example of the satisfaction according to permissible path | route. It is explanatory drawing which shows the information of the plant | facility linked | related with the allowable route and the link. It is explanatory drawing which shows the detail of the flow which selects the plant | facility used in each of the tolerance | permissible path | route. It is explanatory drawing which shows the facility utilized in each of the tolerance | permissible path | route. It is explanatory drawing which shows the information of the plant | facility linked | related with the permissible route. It is explanatory drawing which shows the detail of the flow which selects the facility utilized in each of the tolerance | permissible path | route. It is explanatory drawing which shows the facility utilized in each of the tolerance | permissible path | route. It is explanatory drawing which shows the information of the plant | facility linked | related with the permissible route. It is explanatory drawing which shows an example of the relationship between a tolerance route and the facility linked | related with the tolerance route.

Next, embodiments of the present invention will be described in the following order.
A. First embodiment:
A-1. Information processing system configuration:
A-2. Route search process:
A-3. Allowable route search processing:
A-4. Optimal route search processing:
A-5. Similar route setting processing:
A-6. Satisfaction calculation processing by permissible route:
B. Second embodiment:
C. Third embodiment:
D. Fourth embodiment:
E. Fifth embodiment:
F. Sixth embodiment:
G. Variations:

A. First embodiment:
A-1. Information processing system configuration:
FIG. 1 is an explanatory diagram showing a schematic configuration of a route search system 10 according to the first embodiment of the present invention. The route search system 10 of the present embodiment includes a server 100 and a mobile phone 200 as a mobile terminal device. Although only one mobile phone 200 is shown in FIG. 1, the route search system 10 includes various mobile phones 200 and mobile game machines, PND (Personal Navigation Device), PDA (Personal Digital Assistant), and the like. A mobile terminal device may be included.

  The mobile phone 200 includes a GPS receiver 201, a display panel 202, an audio output unit 203, a wireless communication circuit 205, an operation unit 206, a main control unit 210, and a call control unit 220.

  The GPS receiver 201 receives departure point information that specifies the current position (latitude, longitude) of the mobile phone 200 measured using an artificial satellite constituting a GPS (Global Positioning System) by radio waves.

  The display panel 202 includes a liquid crystal display and a drive circuit that drives the liquid crystal display. The display panel 202 is not limited to a liquid crystal display, and various display devices such as an organic EL display can be used. The audio output unit 203 includes a speaker for outputting audio, a drive circuit for driving the speaker, and the like. The wireless communication circuit 205 wirelessly performs data communication or voice communication with the base station BS. The operation unit 206 is an input device that includes a numeric keypad 206a, a cursor key 206b, a touch panel, and the like. The operation unit 206 accepts the user's arrival point, the arrival time at which the user wants to arrive at the arrival point, the facility at which the user wants to drop in, and the setting input for the arrival time at which the user wants to arrive at the facility. The call control unit 220 is a circuit that performs incoming calls and calls for voice calls, conversion of voice signals and electric signals, and the like.

  The main control unit 210 controls each unit of the mobile phone 200. The main control unit 210 includes a CPU 211, a RAM 212, and a ROM 213. The CPU 211 implements a function for executing various processes described later by loading a program stored in the ROM 213 into the RAM 212 and executing the program. For example, the main control unit 210 controls the display panel 202 to display a map image, a recommended route, a current position, and the like. The main control unit 210 controls the wireless communication circuit 205 to store information on the Internet INT via the base station BS (more specifically, via a transmission / reception antenna, a base station BS, and an exchange). Communicates with unit 110 and route search unit 120. In addition, the main control unit 210 receives the current position information of the mobile phone 200 measured using the GPS via the GPS receiver 201 at regular intervals, and generates departure point information.

  The server 100 includes a communication unit 102 that communicates with the mobile phone 200 via the Internet INT, an information storage unit 110, and a route search unit 120. The information storage unit 110 includes a control unit configured by a CPU, a RAM, and a ROM, and includes a storage device 118 that stores information. The storage device 118 is constituted by, for example, a hard disk device. In the storage device 118, a map information database (DB) 114, a node-specific route information database (DB) 115, and a POI information database (DB) 116 are constructed. The map information DB 114 stores, for example, link information, node information, and map image data as image data. When searching for a route from a starting point to an arriving point for starting a route search, which will be described later, the node-specific route information DB 115 includes links and nodes in the searched route from the starting point to a specific node that is an arbitrarily selected node. (Hereinafter also referred to as “route”) and a cumulative value of link costs in the route (hereinafter also referred to as “cost cumulative value”) are stored in association with a specific node as node-specific route information. . In the route information by node, for each node, the route with the minimum cost cumulative value from the departure point SA is stored as the minimum cost route, and other routes are stored as non-minimum cost routes, and the cost cumulative value is associated with the node. Is memorized. In addition, the numerical value of the link cost memorize | stored in path | route information DB115 classified by node represents time. In this embodiment, the link cost is stored as a numerical value representing “minute”, which is an absolute time, but in other embodiments, it is “hour” or “second” which is a unit other than “minute”. Alternatively, it may be stored as a numerical value representing relative time.

  The POI information DB 116 stores various types of facility information associated with link information and node information stored in the map information DB 114. Further, the POI information DB 116 specifies and stores various information stored in the facility associated with the searched route for each route. The details of various facility information stored in the POI information DB 116 will be described later. The server 100 corresponds to the route search device in the claims, and the information storage unit 110 corresponds to the route information storage unit and the node-specific route storage unit in the claims. The POI information DB 116 corresponds to a facility information storage unit and a route-specific characteristic specifying unit in claims.

  The route search unit 120 includes a control unit including a CPU, a RAM, and a ROM, and includes an allowable route search unit 121. The allowable route search unit 121 includes an optimal route search unit 123 and a similar route setting unit 124. When the arrival point is set in the mobile phone 200 and the departure point information is transmitted from the mobile phone 200, the route search unit 120 receives the departure point information and the arrival point information via the communication unit 102. The allowable route search unit 121 calculates the link cost of each link based on the route information stored in the map information DB 114 and the received departure point information and arrival point information, and determines the later-described allowable route to the arrival point. Explore.

  The optimum route search unit 123 of the route search unit 120 calculates the link cost of each link based on the route information stored in the map information DB 114 and the received departure point information and arrival point information, The optimum route described later is searched, and the arrival time at the arrival point is calculated. The similar route setting unit 124 of the route searching unit 120 sets a similar route, which will be described later, based on the route information and the optimum route. The route search unit 120 transmits route information including the optimum route to the arrival point and a similar route to the mobile phone 200 via the communication unit 102.

A-2. Route search process:
FIG. 2 is an explanatory diagram showing a flow of route search processing. In the route search process, an allowable route that can arrive at the arrival point by the time at which the user wants to arrive is searched from the route from the departure point to the arrival point of the user of the mobile phone 200, and each of the allowable routes arrives at the arrival point. The total degree of satisfaction set for the facilities that pass through is calculated.

  First, the route search unit 120 of the server 100, from the mobile phone 200 carried by the user, the departure point, the arrival point, and the upper limit time allowed for moving the route from the departure point to the arrival point, Is acquired (step S11). When the user inputs an arrival point and a time at which the user wants to arrive at the arrival point, the mobile phone 200 generates arrival point information. Further, the GPS receiver 201 generates departure point information from the current position of the mobile phone 200. When the arrival point information and the departure point information are transmitted from the mobile phone 200, the route search unit 120 receives these pieces of information and calculates the upper limit time from the departure time and the arrival time. Each of the departure point and the arrival point corresponds to the first point and the second point in the claims, and the upper limit time corresponds to the movement upper limit time in the claims. The route search unit 120 corresponds to a point acquisition unit and an upper limit time setting unit in the claims.

  Next, the allowable route search unit 121 of the route search unit 120 searches for an allowable route (step S12). Based on the departure point, the arrival point, and the upper limit time, the allowable route search unit 121 searches for an allowable route that is at least one route that can arrive from the departure point to the arrival point within the upper limit time. Details of the process for searching for an allowable route will be described later.

  Next, the route search unit 120 calculates the degree of satisfaction for each allowable route for each of the searched allowable routes (step S13). The route search unit 120 calculates satisfaction for each allowable route using the satisfaction for each facility stored in the POI information DB 116. Details of the process for calculating the satisfaction degree for each allowable route will be described later. Next, the satisfaction level display information, which is information indicating the satisfaction level for each allowable route calculated by the route search unit 120, is transmitted to the mobile phone 200. The mobile phone 200 displays the transmitted satisfaction level display information on the display panel 202. It is displayed (step S14). The satisfaction display information corresponds to the display information in the claims, and the route search unit 120 corresponds to the display information transmission unit in the claims.

A-3. Allowable route search processing:
FIG. 3 is an explanatory diagram showing the flow of the allowable route search process. In the allowable route search process, at least one route in which the time required for the movement of the user of the mobile phone 200 from the departure point to the arrival point is equal to or shorter than the upper limit time is searched as an allowable route. First, the optimum route search unit 123 of the route search unit 120 searches for an optimum route that is a route that can travel from the departure point to the arrival point in the shortest time (step S21). Details of the optimum route search process will be described later. When the optimum route is searched, the route search unit 120 searches for the minimum cost route and the non-minimum cost route in each node in the range from the departure point to the node that can arrive within the upper limit time (step S22). In the present embodiment, since the search for the minimum cost route and the non-minimum cost route is performed in the range up to the node that can arrive within the upper limit time, the route search unit 120 determines the nodes that cannot reach the arrival point within the upper limit time. Does not perform a useless route search. Next, the similar route setting unit 124 of the route search unit 120 sets a similar route based on the searched optimum route (step S23). The similar route is a route that is different from the optimum route set based on the optimum route and that can arrive from the departure point to the arrival point within the upper limit time. Details of the similar route setting process will be described later. Next, the allowable route search unit 121 sets the optimum route searched based on the departure point, the arrival point, and the upper limit time and the set similar route as the allowable route (step S24).

A-4. Optimal route search processing:
In the optimum route processing in the present embodiment, the optimum route search unit 123 searches for the minimum cost route and the non-minimum cost route among the searched routes from the departure point to the specific node, and the information storage unit 110 saves the minimum cost. Store routes and non-minimum cost routes. The optimum route search unit 123 sets a minimum cost route when the specific node is the arrival point as the optimum route.

  The optimum route searching unit 123 searches for the optimum route by the Dijkstra method based on the arrival point information and the departure point information received from the mobile phone 200. FIG. 4 is an explanatory diagram showing an example of nodes and links in the route from the departure point SA to the arrival point GL. FIG. 4 shows the buildings displayed with hatching, the names of the links and nodes, and the link costs for each link. For example, the node N41 and the node N31 are connected by a link L2, and the link cost of the link L2 is 10. In this embodiment, since the link cost is set to be the same as the time (minute), when the user of the mobile phone 200 moves from the node N41 to the node N31, the link cost of 10 minutes moves. Elapsed as necessary time. Based on the route information shown in FIG. 4 stored in the map information DB 114, the optimum route search unit 123 calculates the minimum cost route and the non-minimum cost route in each node and the accumulated cost value of each route.

  FIG. 5 and FIG. 6 are explanatory diagrams showing an outline of calculation of the accumulated cost value of each route in each node. First, as shown in FIG. 5A, the total cost value for each route is calculated with the departure point SA as the departure point. At the beginning of the route search process, the cost total value at the departure point SA, which is a node, is zero because no link has yet passed. At this time, since there is no accumulated cost value of the route from the link connected to the departure point SA to the departure point SA, zero is the accumulated cost value of the minimum cost route at the departure point SA (hereinafter referred to as “determined label”). Is also called). The node-specific route information DB 115 of the information storage unit 110 stores a minimum cost route and a confirmed label. In FIGS. 5 and 6, the confirmation label is displayed surrounded by a square.

  Next, in the node N41 that has passed the link L1 from the departure point SA, the accumulated cost value of the route entering from the link L1 to the node N41 is 10, and the node as the minimum cost route candidate (hereinafter also referred to as “provisional label”). It is stored in another route information DB 115. In FIG. 5 and FIG. 6, the temporary label is displayed by enclosing the accumulated cost value in a pentagon having the apex in the direction of entering the node. Similarly, in the node N31 that has passed the link L3 from the departure point SA, the temporary label of the route that enters from the link L3 to the node N31 becomes 21, and is stored in the node-specific route information DB 115.

  Next, as shown in FIG. 5B, in the node N41, the temporary label having the minimum accumulated cost value of 10 among all the temporary labels becomes the final label, and the cost of each route starting from the node N41. A cumulative value is calculated. After passing through the link L1 and entering the node N41, passing through the link L2 and entering the node N31, the temporary label of the route becomes 20 with the link cost of the link L2 added. Here, in the route from the departure point SA to the node N31, the route passing through the link L3 is larger than the temporary label of the route passing through the link L1 and the link L2, and therefore, the route information by node as a non-minimum cost route. Stored in the DB 115. When stored as a non-minimum cost route, when searching for a route starting from the node N31, the route search that has passed through the non-minimum cost route is not performed, and the route search is performed based on the minimum cost route. In FIGS. 5 and 6, the accumulated cost value of the non-minimum cost route (hereinafter also referred to as “losing label”) is displayed with the accumulated cost value surrounded by a circle.

  Next, the temporary label of the route that has passed through the link L1 and entered the node N41 and then passed through the link L1 again and returned to the departure point SA is again 20 with the link cost of the link L1 added. Since the temporary label of the route is larger than 0 of the confirmed label at the departure point SA, it is stored in the route information DB 115 by node as a losing label.

  Next, as shown in FIG. 5C, the total cost value of each route is calculated starting from the node N31 having the temporary label with the minimum cost. In the node N31, a route search is performed on the basis of the route (the minimum cost route in the node N31) that has passed through the link L1 and the link L2. When the node N31 passes through the link L4 and enters the node N21, the temporary label of the route becomes 29 after adding the link cost of the link L4. Similarly, when the node N31 passes through the link L5 and enters the node N32, the temporary label of the route becomes 35 with the link cost of the link L5 added.

  When the node N31 passes the link L2 again and returns to the node N41, the temporary label of the route is 30 with the link cost of the link L2 added, and is larger than 10 of the confirmed label at the node N41. Remembered. In this case, in the node N41, since the cost total value of the route that enters the node N41 from all the links connected to the node N41 is stored, the optimum route search unit 123 thereafter selects the route that enters the node N41. Do not search. Similarly, when the node N31 passes through the link L3 and enters the departure point SA, the temporary label of the route becomes 41 by adding the link cost of the link L5, and is larger than zero of the confirmed label at the departure point SA. , Stored as a losing label. Thereafter, the optimum route searching unit 123 does not search for a route entering the departure point SA. In the present embodiment, the optimum route searching unit 123 stores the cost accumulated value having the smallest cost accumulated value among the routes entering the specific node from the same link, and does not store the cost accumulated value of other routes. Therefore, the processing burden on the server 100 can be reduced, and the capacity of the information storage unit 110 can be reduced.

  Next, as shown in FIG. 5D, the total cost value of each route is calculated with the node N21 as a starting point. When the route search is performed using the node N21 as a starting point, the cost accumulated value of the route (the minimum cost route of the node N21) that has passed through the link L1, the link L2, and the link L4 is the smallest cost accumulated among all the temporary labels. Since it has a value, it is stored as a confirmed label. When the node N21 passes through the link L6 and enters the node N11, the temporary label of the route becomes 38 with the link cost of the link L6 added. Similarly, when the node N21 passes through the link L7 and enters the node N22, the temporary label of the route becomes 44 by adding the link cost of the link L7. When the node N21 passes through the link L4 again and returns to the node N31, the temporary label of the route becomes 38 with the link cost of the link L4 added, and since the confirmed label already exists in the node N31, Remembered. In addition, the temporary label of the route that has entered the node N32 from the node N31 through the link L5 has the smallest cost accumulation place among all the temporary labels, and is therefore stored as the next confirmed label.

  Next, as shown in FIG. 6A, the accumulated cost value is calculated for each route with the node N32 as a starting point. When the node N32 passes through the link L8 and enters the node N22, the temporary label of the route is 45 as the link cost of the link L8 is added, and is larger than 44 of the temporary label in the node N21. Is done.

  When the node N32 passes through the link L9 and enters the node N33, the temporary label of the route becomes 44 by adding the link cost of the link L9. When the node N32 passes through the link L10 and enters the node N43, the temporary label of the route becomes 55 by adding the link cost of the link L10.

  When the node N32 passes through the link L5 again and returns to the node N31, the temporary label of the route becomes 50 by adding the link cost of the link L5. Since the node N31 already has a confirmed label, it is stored as a losing label. Here, since the total cost value of the route that enters the node N31 from all the links connected to the node N31 is stored, the optimum route search unit 123 does not search for the route that enters the node N31. Here, since the total cost value of the route that enters the node N31 from all the links connected to the node N31 is stored, the optimum route search unit 123 does not search for the route that enters the node N31. Here, since the temporary label of the node N11 has the minimum cost accumulated value among all the temporary labels, it is stored as a confirmed label. Since the node N11 has a temporary label with the lowest cost accumulation value at this time, the cost accumulation value is calculated for each route as a starting point. When the node N11 passes through the link L11 and enters the node N13, the link cost of the link L11 is added and the accumulated cost value becomes 62. Further, when the node N11 passes through the link L6 and returns to the node N21, the temporary label of the route becomes 47 by adding the link cost of the link L6, and since the confirmed label already exists in the node N21, the losing label Is remembered as Here, the temporary label of the route that has entered the node N33 from the node N32 through the link L9 has the lowest cost among all the temporary labels, and is therefore stored as the next confirmed label. Similarly, the temporary label of the route that has entered the node N22 through the link L7 from the node N21 is also stored as a confirmed label.

  In FIG. 6B, as described above, the total cost value is calculated from all the links connected to each node, the minimum cost path and the non-minimum cost path stored in the node-specific path information DB 115, and the confirmation label. And a losing label. The optimum route searching unit 123 extracts and determines the optimum route having the minimum cost accumulated value in the route from the departure point SA to the arrival point GL in each route stored in the node-specific route information DB 115. In FIG. 6 (b), as the optimum route, it passes from the departure point SA through the link L1, the node N41, the link L2, the node N31, the link L4, the node N21, the link L6, the node N11, the link L11, the node N13, and the link L16. The route that has entered the arrival point GL is indicated by an arrow. In addition, in the node N23 shown in FIG. 6B, a route having a confirmed label of 54 and a losing label having the same cost accumulated value as the confirmed label of 54 are displayed. Even if the routes are different, if the accumulated cost value is the same, the optimum route search unit 123 arbitrarily sets one as a confirmed label. In the present embodiment, the accumulated cost value of the route entering the node N23 from the link L12 previously searched in the node N23 is set as the confirmed label.

  When the optimal route is determined, the route search unit 120 continues to calculate the total cost that is less than the cost obtained by adding the total cost value of the optimal route and the set allowable cost in the route from the departure point SA to the arrival point GL. Calculate a temporary label for the value. In the present embodiment, since a temporary label that is equal to or more than the cost obtained by adding the accumulated cost value of the optimum route and the allowable cost is not calculated, there is no need to search for an infinite route from the departure point SA to the arrival point GL, and the route is efficiently routed. Search can be performed.

  Next, the similar route setting unit 124 of the route search unit 120 calculates a similar route from the departure point SA to the arrival point GL based on the obtained optimum route and the minimum cost route and the non-minimum cost route at each node. Set.

A-5. Similar route setting processing:
Next, the similar route setting unit 124 sets a similar route based on the searched optimum route (step S23 in FIG. 3). FIG. 7 is an explanatory diagram showing the flow of processing for setting a similar route from the optimum route. In the similar route setting process, first, the route search unit 120 sets an allowable time obtained by subtracting the accumulated cost value of the optimum route from the upper limit time (step S41). In the present embodiment, the upper limit time is set to 71 minutes in advance. Since the accumulated cost value of the optimum route from the departure point SA to the arrival point GL for the user of the mobile phone 200 is 67, the allowable time is 4 minutes. Next, the similar path setting unit 124, in each optimal node that is a node included in the optimal path, the difference between the confirmed label and the losing label in order (hereinafter also referred to as “cost difference by path”) is less than the allowable time. It is determined whether there is a certain non-minimum cost route (step S42). When it is determined that there is no optimum node having a non-minimum cost route whose cost difference by route is equal to or less than the allowable time (step S42: NO), the similar route setting unit 124 sets that there is no similar route, and sets the similar route. The setting process ends. When it is determined that there is a non-minimum cost route whose cost difference for each route is equal to or less than the allowable time in an optimal node (step S42: YES), the similar route setting unit 124 sets a similar route in the optimal node.

  FIG. 8 is an explanatory diagram showing an outline of a similar route set in each optimum node. FIG. 8A shows the searched optimum route and the set similar route, and the finalized label and the losing label in each optimum node. FIG. 8B shows a definite label, a losing label, and a path-specific cost difference at each optimum node. FIG. 8C shows an outline of the cost difference for each route when each optimum node and a similar route are selected in correspondence with FIG. 8B.

  When the similar path setting unit 124 searches for a non-minimum cost path having a path-specific cost difference of 5 or less, as shown in FIGS. 8A and 8B, among the optimal nodes, the node N13 and the node N31 Then, a non-minimum cost route having a path-specific cost difference of 5 or less is extracted. The non-minimum cost route having a cost difference by route of 2 at the node N13 passes through the same route as the optimum route from the departure point SA to the node N21, and from the node N21 to the link L7, the node N22, the link L12, the node N23, the link The route passes through L13 and enters the node N13, and the route from the node N13 to the arrival point GL passes the same route as the optimum route (hereinafter also referred to as “first similar route”).

  In addition, a non-minimum cost route having a cost difference by route of 1 at the node N31 passes through the link L3 from the departure point SA and enters the node N31, and a route that passes through the same route as the optimum route from the node N31 (hereinafter referred to as “optimal route”). , Also called “second similar route”). The similar route setting unit 124 sets the first similar route and the second similar route as similar routes (step S43 in FIG. 7).

  Next, the similar route setting unit 124 determines, based on the allowable time, that the difference in cost for each route is the difference in the accumulated cost value between the optimal route and the similar route in each suboptimal node that is not included in the optimal route but included only in the similar route. It is determined whether there is a non-minimum cost route that is equal to or less than the subtracted value (hereinafter also referred to as “difference allowable time”) (step S44). When it is determined that there is no non-minimum cost route whose cost difference for each route is equal to or less than the allowable difference time in the suboptimal node (step S44: NO), the similar route setting unit 124 ends the similar route setting process. When it is determined that there is a non-minimum cost route whose cost difference for each route is equal to or less than the allowable difference time in a suboptimal node (step S42: YES), the similar route setting unit 124 uses a semisimilar route in the suboptimal node. Set.

  FIG. 9 is an explanatory diagram showing an outline of the set semi-similar route in each sub-optimal node. FIG. 9A shows the searched optimum route, the set similar route and semi-similar route, and the definite label and the losing label in each sub-optimal node. FIG. 9B shows the definite label, the losing label, and the cost difference for each route in each suboptimal node, as in FIG. 8B. FIG. 9B shows a value obtained by adding a cost difference for each route in the semi-optimum node included in the semi-similar route and a difference between the cost total value of the similar route including the semi-similar route and the optimum route ( Hereinafter, it is also referred to as “route addition cost”). FIG. 9C shows an outline of the cost difference for each route and the route addition cost when each semi-optimal node and a semi-similar route are selected, corresponding to FIG. 9B.

  As shown in FIGS. 9A and 9B, the similar route setting unit 124 determines that the cost difference for each route is less than or equal to the allowable difference time between the node N23 and the node N22 among the sub-optimal nodes in the first similar route. Extract a non-minimum cost path. The non-minimum cost route in which the cost difference by route is zero in the node N23 passes through the same route as the first similar route from the departure point SA to the node N31, and from the node N31 to the links L5, N32, L9, and N33 , Passes through the link L14, enters the node N23, and passes from the node N23 through the same route as the first similar route (hereinafter also referred to as “first quasi-similar route”). Further, as shown in FIG. 9B, the first quasi-similar route has zero route-specific cost difference at the node N23 compared to the first similar route whose route-specific cost difference is 2. , A route whose accumulated cost value is 2 larger than the optimum route.

  The minimum cost route having a cost difference by route of 1 at the node N22 passes through the same route as the first similar route from the departure point SA to the node N31, and passes from the node N31 through the link L5, the node N32, and the link L8. The node N22 is a route that passes through the same route as the first similar route from the node N22 (hereinafter also referred to as “second quasi-similar route”). Further, as shown in FIG. 9B, the second quasi-similar route has a route-specific cost difference at the node N22 of 1 compared to the first similar route whose route-specific cost difference is 2. , A route whose accumulated cost value is 3 larger than the optimum route. The similar route setting unit 124 sets the first quasi-similar route and the second quasi-similar route as quasi-similar routes (step S45 in FIG. 7).

  Next, the similar route setting unit 124 sets the semi-similar route as a similar route (step S46), and if there is no semi-similar route in the process of step S44 described above in the semi-optimal node in the newly set similar route. Repeat until judged. When it is determined that there is no semi-optimal node having a non-minimum cost route whose cost difference by route is equal to or less than the difference allowable time (step S44: NO), the similar route setting unit 124 sets that there is no semi-similar route. The similar route setting process is terminated. The allowable route search unit 121 sets the optimal route and the similar route as allowable routes (step S24 in FIG. 3).

A-6. Satisfaction calculation processing by permissible route:
In the satisfaction degree calculation process for each permissible route, for each searched permissible route, the facility associated with the node and the link included in the permissible route is specified, and the satisfaction degree obtained when passing through the associated facility Calculate the sum of.

  FIG. 10 and FIG. 11 are explanatory diagrams showing various types of facility information associated with nodes and links. As shown in FIG. 10, the POI information DB 116 indicates the name of the facility associated with the node and the link, the node or link associated with the facility, and the satisfaction level set for the facility. . The satisfaction level corresponds to the index value in the claims. FIG. 11 shows the relationship between the searched allowable route and the facility. For example, as shown in FIGS. 10 and 11, the facility AA is associated with the link L7 and the link L12, and 20 is added to the allowable route as a satisfaction degree when the facility AA is passed.

  FIG. 12 to FIG. 15 are explanatory diagrams showing details of the flow for calculating the degree of satisfaction in each of the allowable routes. In the processes shown in FIG. 12 to FIG. 15, a label including satisfaction is given to each of the nodes included in the allowable route that have different route addition costs when moving to an adjacent node. The flow of calculating the satisfaction degree of each allowable route using the label is shown. For each label given to each node, the satisfaction, the path addition cost indicating how much the accumulated cost value of the route to the label is larger than the accumulated cost value of the optimum route, and the previous one to which the label is assigned Label (hereinafter also referred to as “immediate label”). In other embodiments, labels may be assigned to all nodes included in the allowable route.

  In the satisfaction degree calculation process for each allowable route, as shown in FIG. 12A, first, the route search unit 120 selects the departure point SA as the first node included in the allowable route. Next, the route search unit 120 assigns a label A0 at the departure point SA. Since the starting point SA is the first node, the label A0 does not have a label immediately before the label A0, and does not pass through any facility. Therefore, the route search unit 120 assigns a label A0 with a satisfaction level of 0, a route addition cost of 0, and a previous label “−” at the departure point SA. The POI information DB 116 stores the assigned label for each node.

  Next, the route search unit 120 stores the label A0 at the departure point SA as a confirmed label, assigns the label at the node adjacent to the departure point SA, with the immediately preceding label as the label A0. However, although the node N41 is a node adjacent to the departure point SA, there is no branch of the route at the node N41 in the allowable route that enters from the link L1 to the node N41 and passes through the link L2, and the route addition cost changes. do not do. Therefore, the route search unit 120 does not give a label at the node N41. In FIG. 12 to FIG. 15, the confirmation label is displayed by being surrounded by a square.

  As illustrated in FIG. 12B, the route search unit 120 assigns the label A1 that has passed through the link L1, the node N41, and the link L2 and the label A2 that has passed through the link L3 at the node N31. In label A1, since no facilities pass through, the satisfaction is 0, and the link L1, the node N41, and the link L2 are routes included in the optimal route, and the route addition cost is 0. The label is label A0. Also, since no facility passes through label A2, the satisfaction level is 0, the route addition cost is 1 for the optimal route, and the immediately preceding label is label A0. At this time, since the label having the node N31 as the immediately preceding node is not given, the labels A1 and A2 are given as temporary labels at the node N31. In FIG. 12 to FIG. 15, the temporary label is displayed surrounded by a pentagon whose apex is the direction from the link to the node.

  Next, as illustrated in FIG. 13A, the route search unit 120 stores the label A1 in the node N31 as a confirmed label, the label A1 as the immediately preceding label, the label A3 in the node N21, and the label A4 in the node N32. And are given. Since the label A3 does not pass through any of the facilities, the satisfaction level is 0, and the link L4 is a route included in the optimum route, so the route addition cost is 0 as in the label A1, and the immediately preceding label is the label. A1. In addition, since the label A4 passes through the facility DD associated with the link L5, the satisfaction level is 10, the route addition cost is 2 for the optimum route, and the immediately preceding label is the label A1.

  Next, as illustrated in FIG. 13B, the route search unit 120 stores the label A2 at the node N31 as a confirmed label, the label A2 as the immediately preceding label, the label A5 at the node N21, and the label A6 at the node N32. And are given. In label A5, since no facility is routed, the satisfaction level is 0, and link L4 is a route included in the optimum route, so the route addition cost is 1 as in label A2, and the immediately preceding label is labeled A2. Further, in label A6, since the route passes through the facility DD associated with the link L5, the satisfaction level is 10, and the link L5 is a route whose route addition cost is 2 with respect to the optimum route. It is 3 added to 1 of the route addition cost of A2, and the immediately preceding label is label A2.

  FIG. 14A shows a state in which temporary labels from label A7 to label A12 are given from the state of FIG. 13B. Label A7 and label A8 are temporary labels with label A3 as the immediately preceding label, label A9 and label A10 are temporary labels with label A4 as the immediately preceding label, and label A11 and label A12 have label A5 as the immediately preceding label. Is a temporary label.

  FIG. 14B shows a state in which the label A13 at the node N23 is assigned with the label A6 at the node N32 as the immediately preceding label from the state shown in FIG. 14A. As shown in FIG. 14B, the route search unit 120 sets the label of the route that enters the node N22 through the link L8 with the label A6 as the immediately preceding node before giving the label A13 at the node N23. It is given as label A13. However, in the label A13 at the node N22, the route addition cost is 5, which exceeds the allowable time of 4 minutes. Therefore, since the immediately preceding label is label A6 and the path passing through the link L8 and the node N22 is not an allowable path, this label A13 is not given. As a result, the label A13 at the node N23 is not given, but the label A13 at the node N23 is given and stored in the POI information DB 116. As described above, the route search unit 120 assigns a label to the nodes included in the allowable route. FIG. 15 shows a confirmed label assigned to each node included in the allowable route. The POI information DB 116 stores all confirmed labels for each allowable route and each node.

  FIG. 16 is an explanatory diagram showing a list of labels given to the arrival point GL. As shown in FIG. 16, the route search unit 120 shows the satisfaction level of the facility associated with each allowable route and each label in the node included in the allowable route. For example, the satisfaction degree of the allowable route of the label A23 is 10, and the transition of the label A23 is the label A0, the label A1, the label A4, the label A10, the label A17, and the label A23. The route of the label A23 is displayed as a solid line on the display panel 202 of the mobile phone 200. In the present embodiment, the route searching unit 120 does not provide the user of the mobile phone 200 with the allowable route that forms the label A14 and the label A18 having a satisfaction level of 0 as the route from the departure point SA to the arrival point GL. In another embodiment, an allowable route constituting the label A14 and the label A18 may be provided to the user of the mobile phone 200.

  Next, the route search unit 120 displays the satisfaction for each allowable route on the mobile phone 200 (step S14 in FIG. 2). The route search unit 120 transmits to the mobile phone 200 satisfaction level display information indicating the searched allowable route and the satisfaction level of the allowable route. FIG. 17 is an explanatory diagram showing an example of the degree of satisfaction for each allowable route displayed on the mobile phone 200. FIG. 17 shows allowable paths having a satisfaction degree of 10 or more shown in FIG. In the present embodiment, as shown in FIG. 17, the line type and the thickness of the allowable route are displayed on the mobile phone 200 so that the thicker the line of the allowable route is, the higher the satisfaction is. Yes.

  As described above, in the server 100 according to the present embodiment, the POI information DB 116 stores information that identifies the facility associated with the node and the link and the satisfaction level set for the facility. The route search unit 120 sets an upper limit time based on the arrival time at which it wants to arrive at the acquired arrival point, and the allowable route search unit 121 has a travel time required for moving from the departure point SA to the arrival point GL to be less than or equal to the upper limit time. A certain at least one route is searched as an allowable route. The route search unit 120 specifies the satisfaction degree of the facility associated with each of the allowable routes for each allowable route. Therefore, in the server 100 according to the present embodiment, the route from the departure point SA to the arrival point GL via the facility that the user can pass within the allowable route range in which the user can arrive by the arrival time at which the arrival point GL wants to arrive. Can be provided to users. Further, in the route search from the departure point SA to the arrival point GL, only an allowable route whose travel time is equal to or shorter than the upper limit time is searched, and therefore a useless route that cannot reach the arrival point GL within the upper limit time is not searched. Further, in this embodiment, within the range of the facility associated with the allowable route, it is possible to provide the user with an allowable route that passes through all of the facilities.

  In the server 100 according to the present embodiment, the allowable route search unit 121 includes an optimal route search unit 123 and a similar route setting unit 124. The optimum route search unit 123 sets an optimum route in which the cumulative cost value of the link cost is the smallest among the routes from the departure point SA to the arrival point GL. The node-specific route information DB 115 stores a confirmed label and a losing label in each node. The similar route setting unit 124 sets a similar route based on the set optimum route and the allowable time that is the difference between the upper limit time and the cost accumulated location of the link cost of the optimum route. The allowable route is an optimal route and a similar route. In the server 100 of the present embodiment, the similar route setting unit 124 sets a semi-similar route based on the similar route, sets the set semi-similar route as a new similar route, and then sets the semi-similar route. The semi-similar route setting is repeated until no more. Therefore, the server 100 according to the present embodiment can efficiently search for the optimum route and set a similar route as the allowable route, and can efficiently set the route from the first point to the second point.

  Further, in the server 100 in the present embodiment, the POI information DB 116 stores the satisfaction level set for the facility, and the route search unit 120 assigns a label to the nodes included in the allowable route. The label includes a total satisfaction degree from the departure point SA to the node to which the label is assigned, and a route addition cost indicating how much the accumulated cost value of the route to the label is larger than the accumulated cost value of the optimum route. , And the immediately preceding label. The route search unit 120 specifies the satisfaction degree of the facility associated with each allowable route for each allowable route. Therefore, the server 100 according to the present embodiment provides the user with one index value, such as satisfaction, instead of complicated information for each of the plurality of facilities, so that the route from the departure point SA to the arrival point GL Any of the allowable routes can be easily selected, and the convenience for the user is improved.

  Further, in the server 100 according to the present embodiment, the route search unit 120 displays, on the mobile phone 200, satisfaction level display information, which is information that displays the allowable route and the satisfaction level of the facility associated with each allowable route in association with each other. Send. Therefore, in the server 100 according to the present embodiment, the user of the mobile phone 200 can recognize the satisfaction level for each allowable route as a list display, and the convenience for the user is improved.

B. Second embodiment:
In the second embodiment, the setting of the nodes and links from the departure point SA to the arrival point GL, the method of assigning a definite label to the nodes included in the searched allowable route, and the order of assigning the labels are as described above. Different from form. 18 and 19 are explanatory diagrams showing details of a flow for calculating the satisfaction degree in each of the allowable routes. In the calculation of the total satisfaction shown in FIG. 18 and FIG. 19, a label with the same satisfaction and a high route addition cost among the confirmed labels at the same node does not give a new label to the adjacent node as the immediately preceding label. . The objects for which the route addition costs are compared are the same label with the same satisfaction level set in the facility, and the same stop order for the facility.

  As shown in FIG. 18 (a), in the second embodiment, the link and node settings are different from those in the first embodiment. For example, the route passes from the departure point SA through the node N51 and enters the departure point SA again. Has also been searched as an allowable route. In the process of calculating the total satisfaction for each allowable route, as in the first embodiment, a label A0 is given as shown in FIG. 18 (a). Here, the order of label assignment is different from that in the first embodiment, and labels are assigned to adjacent nodes from a label with a low route addition cost. FIG. 18B shows a state in which label A1 at node N71 and label A2 at node N51 are assigned with label A0 as the immediately preceding label. FIG. 18C shows a state in which the label A2 at the node N50, the label A4 at the node N61, and the label A5 at the departure point SA are given as temporary labels, with the immediately preceding label as the label A2. In FIG. 18 (d), the label A5 assigned to the departure point SA has the same satisfaction as the label A0 that is the confirmed label assigned to the same departure point SA, the route addition cost is 2, and the label A0 Since it is higher than the route addition cost 0, it is not stored in the POI information DB 116 as a label.

  Since the label A5 is not given as the immediately preceding node, the label A7 at the node N51 and the label A8 at the node N71 shown in FIG. 19A are not given as new labels. Also, the label A13 in the node N71 shown in FIG. 19B is 10 with the same satisfaction level as the label A1 of the confirmed label in the node N71, and the route addition cost is 4, which is 2 larger than the route addition cost of the label A1. So it is not given as a new label. As shown in FIGS. 19 (a) and 19 (b), for the sake of simplicity, only some label names are shown in some confirmed labels.

  FIG. 20 is an explanatory diagram illustrating an example of the degree of satisfaction for each allowable route displayed on the mobile phone 200. In FIG. 20A, each route from the route R1 to the route R4, which is an allowable route, is displayed with different line types. FIG. 20 (b) shows the degree of satisfaction for each allowable route shown in FIG. 20 (a), transit facilities via which travel is required, and the travel time required to travel from the departure point SA to the arrival point GL. . For example, the route R3 has a satisfaction degree of 40, and the transit facilities are the facility A, the facility B, and the facility E, and the travel time required to arrive at the arrival point GL after leaving the departure point SA Is 40 minutes.

  As described above, in the server 100 according to the second embodiment, the label includes a combination of facilities associated with the route from the departure point SA to the node to which the label is assigned. The route search unit 120 specifies, as a confirmed label, a label that has the same satisfaction and a smaller route addition cost among the confirmed labels in the same node. Therefore, in the server 100 according to the present embodiment, it is not necessary to calculate the satisfaction level and the combination based on the useless label having a high accumulated cost value when calculating the satisfaction level or the combination of the facilities associated with the allowable route. The time for searching for a route from the departure point SA to the arrival point GL can be shortened.

C. Third embodiment:
In the third embodiment, the route search unit 120 sets a specific position in a link where a facility and a link are associated as a new node, and treats the facility node in the same manner as other nodes. The point which searches a path | route differs from the said embodiment. FIG. 21 is an explanatory diagram showing an example of nodes and links in the route from the departure point SA to the arrival point GL. FIGS. 21A and 21B show nodes and links, a facility node newly set by the route search unit 120, and a facility associated with the facility node. For example, the facility node SP3 is a position associated with the facility C and the facility D. A link connecting the node N51 to the facility node SP3 is a link L61a, and a link connecting the facility node SP3 to the node N61 is a link L61b. The allowable route is a route that travels in the direction of the arrow shown in FIG. The link costs of the link L61a and the link L61b are the link costs of the link L61a and the link L61b before being divided by the facility node SP3 by the route search unit 120, and the link L61a and the link L61b. It is set based on the ratio of the lengths of the respective links. In the third embodiment, since the link length ratio between the link L61a and the link L61b is 3: 2, the link cost of the link L61a is three-fifths of the link cost before being divided, and the link L61b The link cost is 2/5 of the link cost before being divided. Each of the node N51 and the node N61 corresponds to a first adjacent node and a second adjacent node in the claims. In another embodiment, the link cost of the link divided by the facility node does not necessarily need to be apportioned to the length of the link after the division as described above. The link cost may be set to half of the link cost.

  FIG. 21B shows a method for assigning labels to the nodes included in the allowable route including the facility node. Similar to the above embodiment, the route search unit 120 assigns the label A1 at the facility node SP4 and the label A2 at the node N51 with the label A0 at the departure point SA as the immediately preceding label. Next, the route search unit 120 assigns a label at the node N71 with the label A1 at the facility node SP4 as the immediately preceding node.

  The facility node SP1 to the facility node SP4 are handled in the same manner as other nodes, and the confirmed label in the node included in the allowable route is stored in the POI information DB 116. FIG. 22 is an explanatory diagram illustrating an example of the degree of satisfaction for each allowable route. In FIG. 22A, each route from the route R11 to the route R16, which is an allowable route having a satisfaction degree of 10 or more, is indicated by arrows having different line types. In FIG. 22B, in each of the routes from the route R11 to the route R16, the total satisfaction, the transit facility that is the transit facility, and the departure point SA to the arrival point GL when passing the route are shown. The travel time required to arrive is shown. For example, the route R13 is a route indicated by an alternate long and short dash line, has a satisfaction level of 40, and takes 40 minutes to reach the arrival point GL from the departure point SA via the facility A, the facility B, and the facility E. It is a route that requires a long travel time. In FIG. 22B, the route R12 and the route R16 surrounded by a dotted line indicate that they are allowed routes searched by newly setting a facility node. Note that the mobile phone 200 does not display the dotted lines surrounding each of the route R12 and the route R16.

  As described above, in the server 100 according to the third embodiment, the route search unit 120 sets a specific position in a link in which a facility and a link are associated as a facility node that is a new node. Further, the route search unit 120 calculates the link cost of the link L61a and the link L61b, the link cost of the link L61a and the link L61b before being divided by the facility node SP3, as the link L61a and the link L61b. Proportionally set by the ratio of the length of each link. Therefore, in the server 100 in the third embodiment, a specific position in the facility associated with the link is set as a new node. Therefore, not only the link associated with the facility but also the target node that passes only through the facility is added, so it is possible to provide users with more routes that reflect the satisfaction of the facility and use User convenience is improved.

D. Fourth embodiment:
In the fourth embodiment, unlike the above embodiment, the route search unit 120 adds the facility use time, which is the time required to use a preset facility when passing through the facility, to the route addition cost. The travel time required from the departure point SA to the arrival point GL is calculated. FIG. 23 is an explanatory diagram showing information on a facility associated with an allowable route and a link. In FIG. 23 (a), the allowable routes in the fourth embodiment are indicated by arrows having different line types, and the facilities F to J associated with the link are indicated. The POI information DB 116 stores facility use time required when a specific facility is used. In FIG. 23 (a), the optimum route is a route that starts from the departure point SA, passes through the link L91, the node N81, the link L92, the node N82, the link L95, and the node N87, and arrives at the arrival point GL. is there. In the fourth embodiment, the accumulated cost value of the optimal route is 10, and the upper limit time until arrival from the departure point SA to the arrival point GL is set to 70 minutes, so the allowable time is 60 minutes. FIG. 23B shows a list of the classification of each facility, the content of the service provided by the facility, and the facility usage time required when the facility is used. For example, as shown in FIG. 23 (b), the facility F is a store that is classified as an apparel that sells clothing, and the clothing to be sold is limited to women's clothing. It is a necessary facility.

  FIG. 24 is an explanatory diagram showing details of a flow for selecting a facility to be used in each of the allowable routes. In the process of assigning labels shown in FIG. 24, unlike the above embodiment, the route search unit 120 assigns the facility used instead of the satisfaction, the route addition cost, and the immediately preceding label as labels. FIG. 24A shows a state in which the labels A1 and A2 at the node N83 and the label A3 at the node N81 are assigned with the label A0, which is the confirmed label assigned to the departure point SA, as the immediately preceding node. Has been. A link L93 connecting the departure point SA and the node N83 is associated with the facility I. Therefore, in the node N83, the route search unit 120 assigns two labels, a label A1 when the facility I is not used and a label A2 when the facility I is used. Label A1 indicates that none of the facilities is used, the route addition cost is 2, and the immediately preceding label is label A0. The label A2 is 27, which is the sum of the route addition cost 2 when the facility I is used and the user passes the link L93 and 25, which is the facility use time of the facility I. This indicates that the label is A0. The label A3 indicates that the facility is not used, the route addition cost is 0, and the immediately preceding label is the label A0.

  FIG. 24B shows a state in which the label A4 at the node N86 and the labels A5 and A6 at the node N84 are given with the label A1 given to the node N83 as the immediately preceding node. Label A4 indicates that the facility is not used, the route addition cost is 2, and the immediately preceding label is label A1. Since the link L96 is associated with the facility H, in the node N84, the route search unit 120 uses two labels, a label A5 when the facility H is not used and a label A6 when the facility H is used. Is granted. The label A5 indicates that none of the facilities is used, 4 is a newly added route addition cost of 2, and the immediately preceding label is the label A1. The label A6 is 49, which is obtained by adding 2 of the route addition cost when the facility H is used and the user passes the link L96 and 45 that is the facility use time of the facility I. The label A1 is indicated.

  FIG. 24C shows a state in which the label A2 given to the node N83 and the label A8 given to the node N84 are given with the label A2 given to the node N83 as the immediately preceding node. The label A7 indicates that the facility I is used, the route addition cost is 27, and the immediately preceding label is the label A2. In the node N84, the route search unit 120 assigns a label A8 when the facility H is not used. The label A8 indicates that the facility I is used, 29 that the route addition cost is newly added 29, and the immediately preceding label is the label A2. Note that in the node N84, the route search unit 120 tries to give the label A9 in which the facility H is used, but in this case, the route addition cost becomes 74, and the upper limit time is exceeded. Cannot be granted.

  FIG. 24D shows a state in which the label A3 given to the node N81 is set as the immediately preceding node, and the label A9 at the node N87 and the labels A10 to A13 at the node N84 are given. In the node N84, labels A10 to A13 are given for combinations when the facility G and the facility J are used. As described above, labels are given to the nodes included in the allowable route by the method shown in FIGS. 24 (a) to 24 (d).

  FIG. 25 is an explanatory diagram showing facilities used in each of the allowable routes. In FIG. 25A, the allowable route is indicated by arrows having different line types depending on the route addition cost. FIG. 25 (b) shows the travel time required for moving from the departure point SA to the arrival point GL and the use facilities used in each of the allowable routes from the route R21 to the route R24. Yes. For example, the route R23 is a route indicated by a one-dot chain line arrow, and a route that can move from the departure point SA to the arrival point GL in 12 minutes without using any facility, and a route that uses the facility I from the departure point SA. There are two types of routes: a route that can move in 37 minutes to the arrival point GL.

  As described above, in the server 100 in the fourth embodiment, the route search unit 120 uses the label A1 when the facility I associated with the link L93 is not used and the facility I when the facility I is used at the node N83. Two labels A2 and A2 are assigned. No facility is used for label A1, the route addition cost is 2, and the immediately preceding label is label A0. The label A2 is 27, which is the sum of 2 of the route addition cost when the facility I is used and the route addition cost passes the link L93 and 25 that is the facility use time of the facility I, and the immediately preceding label is the label A0. is there. For this reason, in the server 100 according to the fourth embodiment, since the facility usage time of the used facility is added to the travel time required for the route from the departure point SA to the arrival point GL, the actual travel time is taken into consideration. The arrival time of arrival at the arrival point GL can be provided to the user, and the convenience for the user is improved.

E. Fifth embodiment:
In the fifth embodiment, unlike the above embodiment, the POI information DB 116 includes, as various types of facility information, an event that is performed at a predetermined time in a specific facility, and a start time and an end time at which the event is performed. The route search unit 120 changes the method of assigning a label based on the start time and end time of the event.

  FIG. 26 is an explanatory diagram showing information on a facility associated with an allowable route. In FIG. 26A, the allowable route in the fifth embodiment is indicated by arrows of different line types, and each facility from the facility K to the facility O associated with the link is illustrated. The POI information DB 116 stores event required time required when participating in an event at a specific facility. In FIG. 26A, the optimum route is a route that departs from the departure point SA, passes through the link L111, the node N91, the link L112, the node N92, and the link L116 and arrives at the arrival point GL. In the fifth embodiment, the accumulated cost value of the optimal route is 10, and the upper limit time until arrival from the departure point SA to the arrival point GL is set to 130 minutes, so the allowable time is 120 minutes. The time when the user of the mobile phone 200 departs from the departure point SA is 9:00.

  In FIG. 26B, the classification of each facility stored in the POI information DB 116, the contents of the service provided by the facility, the event flag, the early flag, and the event required time required when participating in the event are shown. Event start time and event end time are shown. The event flag represents the presence / absence of an event preset in the facility. The early flag indicates whether or not it is necessary to arrive at the facility by the event start time when participating in the event of the facility, and the content of the event when it is necessary to arrive by the event start time. For example, as shown in FIG. 26 (b), the facility M is a restaurant making doll ware, and there is a special sale event from 10:30 to 12:00, and an early flag is set for this event. Not. Therefore, in order for a user to participate in the event of the facility M, it is necessary to arrive at the facility M from 10:30 to 11:45 (time obtained by subtracting 15 minutes of the event duration from 12:00 at the end of the event). is there.

  FIG. 27 is an explanatory diagram showing details of a flow for selecting a facility used in each of the allowable routes. FIG. 27A shows a state in which the labels A1 and A2 at the node N94 and the label A3 at the node N91 are assigned with the label A0, which is the confirmed label assigned to the departure point SA, as the immediately preceding node. Has been. The label A1 is a label where the facility O is not used, and the label A2 is a label where the facility O is used. The label A3 in the node N91 is a label that is not used by any facility.

  FIG. 27B shows a state in which the label A4, the label A5, and the label A6 at the node N95 are given with the label A2 given to the node N94 as the immediately preceding node. Note that the label given to the node N97 is not used in any of the links L118 and L120, and the label assignment method is the same as in the above embodiment, and thus the description thereof is omitted. The label A4 is a label where the facility M is not used. The label A5 is a label where the facility M is used. The label A6 is a label in which the facility M is used and the user further participates in a special sale event at the facility M from 10:30. Note that a waiting time until 10:30 is added to the label A6 as a route addition cost.

  In FIG. 27C, label A3 assigned to node N91 is set as the immediately preceding node, label A7 and label A8 at node N93 are assigned, label A8 is set as the immediately preceding node, label A9 and label A10 at node N95 are shown. The state where is given is shown. The label A7 is a label where the facility L is not used, and the label A8 is a label where the facility L is used. The route addition cost of label A8 includes a waiting time because the event start time of the facility L is 10:00. The label A9 is a label in which the immediately preceding label is the label A8 and the facility N is not used. The label A10 is a label in which the previous label is the label A8 and the facility N is used, but the user does not participate in the event of the facility N. In addition, since the node N95 arrives at the facility N after 9:30, which is the event start time of the facility N, and the facility N is set with an early flag, the route search unit 120 displays the label immediately before In the case of A8, the label A11 for the user to participate in the event of the facility N is not given.

  FIG. 28 is an explanatory diagram showing facilities used in each of the allowable routes. In FIG. 28A, the allowable route is indicated by arrows having different line types depending on the route addition cost. FIG. 28B shows the time required for moving from the departure point SA to the arrival point GL in each of the allowable routes from the route R31 to the route R35, and whether or not an event has participated in any of the facilities. The waiting time for attending the event is shown. For example, the route R32 is a route indicated by a broken-line arrow, a route in which no facility is used and the required travel time is 20 minutes, and a route in which the facility N is used and the required travel time is 45 minutes , Including the route.

  As described above, in the server 100 according to the fifth embodiment, the POI information DB 116 includes, as various types of facility information, an event that is performed at a predetermined time in a specific facility, a start time and an end time when the event is performed. And remember. When there is a facility that can be used between the event start time and the event end time, the route search unit 120 assigns two labels, that is, when the facility is used and when it is not used. On the other hand, when there is no facility that can be used between the event start time and the event end time, the route search unit 120 assigns only a label when the facility is not used. Therefore, in the server 100 according to the fifth embodiment, even if there is a facility associated with the allowable route, the facility is not used when the node or link associated with the facility passes outside the time when the facility can be used. Only the label is given to the node immediately after passing through the facility. Therefore, the arrival time of arrival at the arrival point GL can be provided to the user based on the actual travel time, and the convenience for the user is improved.

F. Sixth embodiment:
In the sixth embodiment, unlike the above-described embodiment, the route search unit 120 acquires a specific facility that the user wants to use by input by the user of the mobile phone 200, and specifies a specific facility from the searched allowable routes. A satisfaction addition value to be newly added is added to the total satisfaction in at least one allowable route including FIG. 29 is an explanatory diagram showing information on a facility associated with an allowable route. FIG. 29A shows the positional relationship between the departure point SA, the arrival point GL, the facility P, the facility Q, the facility R, the facility S, and the facility T in the sixth embodiment. In the map shown in FIG. 29 (a), the display of the link and the node and the link cost of each link is omitted, but the search process for the allowable route from the departure point SA to the arrival point GL is described above. This is the same as the embodiment. In FIG. 29 (b), for each facility from the facility P to the facility T, the facility classification and contents, the facility usage time required when the facility is used, and the facility availability time for which the facility can be used are shown. ,It is shown. For example, the facility Q is a Buddhist facility, and the facility use time required when it is used is 20 minutes, and the facility use time is from 10:00 to 14:00.

  FIG. 30 is an explanatory diagram illustrating an example of a relationship between an allowable route and a facility associated with the allowable route. FIG. 30 (a) shows the time required for moving from the departure point SA to the arrival point GL and the facility usage order, which is the order of the used facilities, for each of the allowable routes. Yes. In the sixth embodiment, the upper limit time is set to 120 minutes. For example, the route R41 is a route in which the required time from the departure point SA to the arrival point GL is 115 minutes, and the facilities are used in the order of the facility P, the facility Q, the facility R, and the facility T.

  As shown in FIG. 30B, when the facility input by the user is included in the facilities associated with the allowable route based on the contents of the user's input, the route search unit 120 sets each allowable A satisfaction degree addition value is added to the satisfaction degree of the route (not shown), and a route with a high satisfaction degree in the allowable route is displayed on the mobile phone 200 and provided to the user. For example, in the input SL1, the satisfaction degree addition value is added to the route in which the most facilities are used, and the route as the most frequently used facility route is provided. As the most frequently used facility route, a route from the route R41 to the route R51 in which the four facilities shown in FIG. 30A are used is provided. The route search unit 120 corresponds to the specific facility selection unit and the index value addition unit in the claims.

  In the input SL2, since the route of use of the most facilities is provided after the use route of the facility is satisfied in the order of the facility P, the facility Q, the facility R, the facility S, and the facility T, the route other than the facility S Route R41 is provided. In the input SL3, a route that can use the most facilities and can reach the arrival point GL in the shortest time is provided. Therefore, the route R48 and the route that use four facilities and travel for 110 minutes are provided. R51 is provided. In the input SL4, a route in which the facility S and the facility T, which are shrine facilities, are used preferentially is provided, and therefore a route R56 in which the facility S and the facility T are used is provided. In the input SL5, a route in which the facility B is used is provided. Therefore, each route from the route R41 to the route R44, which is a route including the facility B, each route from the route R46 to the route R51, route R53, route R57, A route R58 is provided.

  As described above, in the server 100 in the sixth embodiment, the route search unit 120, when the facility input by the user is included in the facilities associated with the allowable route, the satisfaction degree of each allowable route. Add satisfaction value to. Therefore, in the server 100 according to the sixth embodiment, when there is a facility that the user wants to use, an allowable route that can use the facility can be preferentially provided to the user. Convenience when searching for a route to GL is improved.

G. Variations:
The present invention is not limited to the above-described examples and embodiments, and can be implemented in various modes without departing from the gist thereof. For example, the following modifications are possible.

G1. Modification 1:
In the above embodiment, the allowable route is configured by the optimal route and the similar route set based on the optimal route and the upper limit time. However, the allowable route to be searched for can be variously modified. . For example, an allowable route from the departure point to the arrival point GL may be searched based only on the upper limit time. In this server 100, although it takes extra time compared with the search for the allowable route of the above-described embodiment, it may be possible to search for more allowable routes, and the degree of freedom of the user may be improved.

  Moreover, in the said embodiment, although satisfaction was mentioned as an example as an index value set to each facility, an index value is not restricted to this, A various deformation | transformation is possible. For example, when a user is searching for a restaurant, the index value of the restaurant is set to 1 (for example, “ON” is set), and the index value of stores other than the restaurant is set to 0 (for example, “OFF”). ”), The user can search for only the facilities that meet the purpose.

  In the above embodiment, the satisfaction degree addition value is added to the allowable route including the specific facility input by the user. However, other modes may be used. For example, when there is an event involving two specific facilities, it is not simply an allowable route that includes two facilities, but only an allowable route that uses one facility after using one facility. An aspect in which a satisfaction degree addition value is added may be used.

  In the above embodiment, the departure point SA and the arrival point GL are different points, but the departure point SA and the arrival point GL may be the same point. For example, the user A may use his / her home as the departure point SA and use various facilities, and then return to the home where the arrival point GL is the same as the departure point SA.

G2. Modification 2:
Further, in the above embodiment, the arrival point GL is set by the user operating the operation unit 206 of the mobile phone 200. However, the arrival point GL and various setting input means are not limited to this, and various modifications can be made. is there. For example, the mobile phone 200 may include a voice input unit that receives voice input from the user, and various settings such as setting of the arrival point GL may be performed by voice.

  In the above embodiment, the server 100 includes the information storage unit 110 and the route search unit 120 as illustrated in FIG. 1, but the apparatus including the information storage unit 110 and the route search unit 120 is not limited to this mode. Various modifications are possible. For example, the information storage unit 110 and the route search unit 120 may be provided in different servers, or the route search unit 120 may be mounted on the mobile phone 200. Further, the optimum route search unit 123 and the similar route setting unit 124 in the route search unit 120 may be provided in different servers 100, respectively. Further, the map information DB 114 and the node-specific route information DB 115 may be stored in the same database.

  The present invention is not limited to the above-described embodiments and modifications, and can be realized with various configurations without departing from the spirit of the present invention. For example, the technical features in the embodiments and the modifications corresponding to the technical features in each form described in the summary section of the invention are to solve some or all of the above-described problems, or In order to achieve part or all of the effects, replacement or combination can be performed as appropriate. Further, if the technical feature is not described as essential in the present specification, it can be deleted as appropriate.

DESCRIPTION OF SYMBOLS 10 ... Route search system 100 ... Server 102 ... Communication part 110 ... Information storage part 116 ... POI information DB
DESCRIPTION OF SYMBOLS 118 ... Memory | storage device 120 ... Route search part 121 ... Allowable route search part 123 ... Optimal route search part 124 ... Similar route setting part 200 ... Mobile telephone 201 ... GPS receiver 202 ... Display panel 203 ... Audio | voice output part 205 ... Wireless communication circuit 206 ... Operation unit 206a ... Numeric keypad 206b ... Cursor key 210 ... Main control unit 211 ... CPU
220 ... Call control unit SA ... Departure point GL ... Arrival point BS ... Base station SP1, SP2, SP3, SP4 ... Facility node INT ... Internet

Claims (11)

A route search device for searching a route connecting any two points on a network,
A path information storage unit that stores data for specifying nodes and links constituting the path, and data for specifying a link cost representing the time required for each link to pass;
A facility information storage unit for storing data identifying a facility associated with at least one of a node and a link, and data identifying a characteristic set in the facility;
A point acquisition unit for acquiring data identifying the first point and the second point;
An upper limit time setting unit that sets a movement upper limit time that is an upper limit value of the time required to pass the route from the first point to the second point;
Allow at least one of the routes from the first point to the second point, the time required for moving from the first point to the second point being equal to or less than the upper limit movement time. An allowable route search unit for searching as a route;
A route search apparatus comprising: the facility associated with a node and a link included in each of the allowable routes, and the characteristic set for each route that specifies the characteristic set in the facility for each of the allowable routes. The route search device according to claim 1,
The allowable route search unit searches for a minimum cost route in which a cumulative value of the link cost of each link is minimum and other non-minimum cost routes among a plurality of routes connecting the first point to a specific node. And an optimal route search unit that sets the minimum cost route when the specific node is the second point as an optimal route,
The route information storage unit includes, for each of a plurality of specific nodes included in a route from the first point to the second point, among a plurality of routes connecting the first point to the specific node, A node-by-node path storage unit that stores a cumulative value of a link cost of a minimum cost path and the non-minimum cost path;
The permissible route search unit sequentially selects a plurality of the specific nodes included in the optimum route as optimum nodes, and a difference in cumulative value of link costs between the minimum cost route and the non-minimum cost route in the optimum node. Selects the non-minimum cost route that is equal to or less than the allowable time obtained by subtracting the cumulative value of the link cost of the optimal route from the upper limit time of movement, and the second from the selected non-minimum cost route and the optimal node. A similar route setting unit that sets a route in which a route to a point is combined with the same route as the optimal route as a similar route;
The optimum route search unit searches the accumulated value of the link cost of the minimum cost route and the non-minimum cost route to a value obtained by adding the allowable cost to the accumulated value of the link cost of the optimum route,
The route search device, wherein the allowable route is the optimum route and the similar route. The route search device according to claim 2,
The similar path setting unit sequentially selects the specific nodes not included in the optimal path and included in the similar path as sub-optimal nodes, and the minimum cost path and the non-minimum cost path in the sub-optimal node The non-minimum cost route in which the difference in the cumulative value of link costs is less than or equal to the time difference for each route, which is the difference in the cumulative value of link costs between the optimum route and the similar route including the suboptimal node from the allowable time. A route combining the selected non-minimum cost route and the route from the semi-optimum node to the second point is the same route as the similar route is set as a semi-similar route, and the semi-similar route After setting a route as the similar route, the minimum cost route and the non-minimum cost route in the suboptimal node included in the set similar route. The path search is performed until the non-minimum cost path is found such that the difference in the cumulative value of the link cost is equal to or less than the value obtained by subtracting the cumulative value of the link cost of the optimum path and the time difference for each path from the allowable time. apparatus. A route search device according to claim 2 or claim 3, wherein
The data specifying the characteristic is an index value,
The route search device further includes:
A label attaching unit for attaching label information to a specific node included in the allowable route;
The label information includes a total of the index values of the facilities associated with a route from the first point to the specific node, and a node included in the allowable route from the first point to the specific node. For each, a route addition cost that is the sum of all the differences in the accumulated link costs between the non-minimum cost route and the minimum cost route of the selected route, and a node immediately preceding the specific node in the allowable route Information including the label information in the immediately preceding node,
The route-specific property specifying unit specifies the index value of the facility associated with a node and a link included in each of the allowable routes for each of the allowable routes. The route search device according to any one of claims 2 to 4, further comprising:
A label attaching unit for attaching label information to a specific node included in the allowable route;
The label information is selected for each of a combination of the facilities associated with a route from the first point to the specific node and each of nodes included in the allowable route from the first point to the specific node. A route addition cost obtained by adding all the differences of the accumulated link costs between the non-minimum cost route and the minimum cost route, and the immediately preceding node that is the node immediately before the specific node in the allowable route Information including the label information in
In the same node, the route-specific characteristic specifying unit has the same combination of the facilities associated with the nodes and links included in each of the allowable routes, and the label information having a different route addition cost is given. A route search device that identifies only the label information with the smaller route addition cost. A route search device according to any one of claims 1 to 5,
The data specifying the characteristic is an index value,
The route search device further includes:
A specific facility selecting unit that selects at least one specific facility from a plurality of the facilities;
When the specific facility is included in the combination of the facility associated with the node and the link included in the allowable route, an index addition value set in advance for the specific facility is used as the index of the allowable route. A route search device comprising: an index value addition unit that adds to the sum of values. A route search device according to any one of claims 1 to 6,
The facility information storage unit stores a facility use time representing a time required to use the facility,
The data specifying the characteristic is an index value,
The route search device further includes:
A label attaching unit for attaching label information to a specific node included in the allowable route;
The label information includes a total of the index values of the facilities associated with a route from the first point to the specific node, and a node included in the allowable route from the first point to the specific node. For each, a route addition cost that is the sum of all the differences in the accumulated link costs between the non-minimum cost route and the minimum cost route of the selected route, and a node immediately preceding the specific node in the allowable route Information including the label information in the immediately preceding node,
When the facility is associated with the immediately preceding link that is a link connecting the immediately preceding node to the specific node, the label attaching unit associates the label information of the same immediately preceding label with the immediately preceding link. Two types of label information, that is, the label information when the facility is used and the label information when the facility is not used, are given, and the label information when the facility is used is replaced with the route addition cost. A route search device that gives a time obtained by adding the route addition cost and the facility use time of the facility used for the route addition cost. A route search device according to any one of claims 1 to 7,
The facility information storage unit stores an event start time at which a specific event set in the facility starts and an event end time at which the specific event ends,
The route search device further includes:
A label attaching unit for attaching label information to a specific node included in the allowable route;
The label information is selected for each of a combination of the facilities associated with a route from the first point to the specific node and each of nodes included in the allowable route from the first point to the specific node. A route addition cost obtained by adding all the differences of the accumulated link costs between the non-minimum cost route and the minimum cost route, and the immediately preceding node that is the node immediately before the specific node in the allowable route Information including the label information in
When the facility is associated with the immediately preceding link, which is a link connecting the immediately preceding node to the specific node, the time when the facility is used is changed from the event start time to the event end time. If it is between the label information of the same immediately preceding label, the label information when the facility associated with the immediately preceding link is used and the label information when the facility is not used are used. A route search device that provides information and provides label information only when the facility is not used when the time when the facility is used is not between the event start time and the event end time. A route search device according to any one of claims 1 to 8, comprising:
When the facility is stored in association with an arbitrary position on the link, the allowable route search unit sets the arbitrary position as a new node, which is a new node, and is adjacent to the facility node. Each of the two nodes is set as a first adjacent node and a second adjacent node, and a first link connecting the facility node and the first adjacent node, the facility node, and the second adjacent node are Respective link costs with the second link to be connected are set to the length of the first link with respect to the length of the link cost with respect to the link connecting the first adjacent node and the second adjacent node. A route search device that sets a link cost apportioned by the length of the link and newly searches for the allowable route. The route search device according to any one of claims 1 to 9, further comprising:
A display information transmission unit that transmits display information that causes each of the permissible routes to be displayed in association with at least one of the facilities specified for each permissible route and the characteristics set in the facilities. A route search device comprising: A route search system for searching for a route connecting any two points on a network,
A path information storage unit that stores data for specifying nodes and links constituting the path, and data for specifying a link cost representing the time required for each link to pass;
A facility information storage unit for storing data identifying a facility associated with at least one of a node and a link, and data identifying a characteristic set in the facility;
A point setting unit for setting data for specifying the first point and the second point;
An upper limit time setting unit that sets a movement upper limit time that is an upper limit value of the time required to pass the route from the first point to the second point;
Allow at least one of the routes from the first point to the second point, the time required for moving from the first point to the second point being equal to or less than the upper limit movement time. An allowable route search unit for searching as a route;
A route search system comprising: the facility associated with a node and a link included in each of the permissible routes, and the property set for each route that specifies the property set in the facility for each of the permissible routes.

Images