JP2018072193A - Route searching device, control method, program, and memory medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a route searching device that can calculate the travel cost accurately reflecting tolls on toll roads and appropriately determine a recommended route.SOLUTION: A system controller 20 simulatively deems as being closed to traffic at least one of expressway facilities on tentatively searched-for approximate solution routes and searches for another route than the approximate solution routes on the basis of toll-ignored cost not counting the tolls. Then the system controller 20 calculates the toll-reflecting costs of the approximate solution routes and other routes than the searched-for approximate solution routes and outputs as the recommended route the least expensive route in terms of the toll-reflecting cost.SELECTED DRAWING: Figure 4

Description

  The present invention relates to a technique for searching for a route.

  Conventionally, in route search to a destination, a technology that gives a cost proportional to the unit price of a highway to each link and performs route search considering the toll road fee and required time by the Dijkstra method is known. . For example, Patent Document 1 discloses a navigation device that outputs a recommended route in consideration of a balance between a fee and a time by searching for a route with a combined cost including a toll and a required time.

JP 2011-7706 A

  In the case of a pay-to-use tollgate, by adding the cost related to the distance according to the distance to the link cost, the route search can be performed by the Dijkstra method while reflecting the actual charge value in the search. However, since April 2016, a flat fee system that does not depend on distance has been applied mainly in the Tokyo metropolitan area. In this case, it is possible to determine an accurate cost that reflects the fee for each link. It becomes difficult. Therefore, in the flat fee system that does not depend on the distance, there is a problem that it is difficult to perform a search that accurately reflects the actual fee using the conventional Dijkstra method.

  The present invention has been made in order to solve the above-described problems, and is a route search device capable of suitably determining a recommended route by calculating a cost that accurately reflects a toll on a toll road. The main purpose is to provide

  The invention described in claim is a route search device, a search means for searching for a route, and a control means for causing the search means to search for a route including a toll road based on a cost other than the toll of the route, The calculation means for calculating the tolls of the plurality of routes searched by the search means, respectively, and the combined cost that is the cost for each route calculated based on the costs other than the toll and the tolls, Determining means for determining a recommended route, and the calculating means calculates a toll according to a combination of toll road facilities including an entrance facility and an exit facility of the toll road regardless of the travel distance.

  The invention described in the claims is a control method executed by the route search apparatus, and includes a search step for searching for a route, and a route including a toll road in the search step for a cost other than the toll for the route. A control step of searching based on the calculation step, a calculation step of calculating the tolls of the plurality of routes searched by the searching step, and a composite cost that is a cost other than the toll and a cost for each of the routes calculated based on the toll A determination step of determining a recommended route by comparing costs, and the calculation step includes a toll according to a combination of toll road facilities including an entrance facility and an exit facility of a toll road regardless of the travel distance Is calculated.

  The invention described in the claims is a program executed by a computer, and includes a search unit that searches for a route, and searches the search unit for a route including a toll road based on a cost other than the toll for the route. Control means for calculating the tolls of a plurality of routes searched by the searching means, and a non-toll fee and a combined cost that is a cost for each route calculated based on the toll Thus, the computer functions as a determination unit for determining a recommended route, and the calculation unit calculates a toll according to a combination of toll road facilities including an entrance facility and an exit facility of a toll road regardless of the travel distance. To do.

It is a schematic structure of the navigation apparatus common to each Example. An example of the data structure of a charge table is shown. It is the figure which showed the high-speed facility on the approximate solution route and the approximate solution route. It is a flowchart which shows the procedure of the route search process which concerns on 1st Example. It is the figure which showed the high-speed facility on the approximate solution route and the approximate solution route. The route for comparing the charge consideration costs when determining the recommended route is shown. It is a flowchart which shows the procedure of the route search process which concerns on 2nd Example. An example in which the approximate solution route is divided into multiple stages is shown. Shows the combination of high speed facilities with pseudo-closed roads that are the best route for each zone. The 1st example of a display of a route selection screen is shown. A route selection screen when a user selects a table of 900 yen / h by a touch panel or the like is shown. It is a 2nd display example of a route selection screen. It is a 3rd example of a display of a route selection screen. The route searched in the modification 1 is shown. The structure of the route search system which concerns on the modification 2 is shown.

  According to a preferred embodiment of the present invention, the route search apparatus includes search means for searching for a route, and control means for causing the search means to search for a route including a toll road based on a cost other than the toll for the route. And a calculation means for calculating the tolls of the plurality of routes searched by the search means, respectively, and a composite cost that is a cost for each of the routes calculated based on the cost other than the toll and the toll. Determining means for determining a recommended route, and the calculating means calculates a toll according to a combination of toll road facilities including an entrance facility and an exit facility of the toll road regardless of the travel distance.

  The route search apparatus includes search means, control means, calculation means, and determination means. The control means causes the search means to search for a route including the toll road based on a cost other than the toll for the route. The calculating means calculates tolls for a plurality of routes searched by the searching means. At this time, the calculation means calculates the toll according to the combination of the toll road facility including the entrance facility and the exit facility of the toll road regardless of the travel distance. The determining means determines a recommended route by comparing a cost other than the toll and a composite cost that is a cost for each route calculated based on the toll. Here, the “cost other than the toll” used by the determination means for calculating the composite cost is the same index as the “cost other than the toll” used when the control means causes the search means to search the route including the toll road. It may be a calculated cost or a cost calculated with a different index. In addition, the “recommended route” is a route recommended to the user and may be one route having the lowest cost, or may be a plurality of routes having a cost within a predetermined range. In this mode, the route search device calculates a composite cost that accurately reflects the actual toll for each route even if it includes a toll road where the toll is determined regardless of the travel distance, and is recommended. A route can be suitably determined.

  In one aspect of the route search device, the control unit extracts a facility on the route included in the route searched by the search unit, and makes the facility difficult to pass through at least one of the facilities on the route. The search means is made to search for a plurality of routes having different combinations of facilities on the route to pass. According to this aspect, the route search apparatus can suitably search for another route that can be a recommended route in addition to the route first searched by the search means.

  In another aspect of the route search apparatus, the control means extracts a toll road facility having an influence on a toll depending on the presence or absence of traffic as the facility on the route. As a result, the route search device can search for routes that have various tolls, and therefore can suitably search for a route that can be a recommended route when compared at a combined cost that includes the toll. it can.

  In another aspect of the route search apparatus, the route search device includes a dividing unit that divides a route including the toll road according to a first condition, and the control unit passes a route that passes through each divided section divided by the dividing unit. By causing the search means to search for a plurality of routes having different combinations of upper facilities, facilities on the route to be made difficult to pass are determined for each of the divided sections. According to this aspect, the route search device can suitably reduce the processing load for specifying the facility on the route that should be the inaccessible facility.

  In another aspect of the route search apparatus, the control unit causes the search unit to search for a route that does not pass through all the inaccessible facilities determined for each of the divided sections as the recommended route candidate. According to this aspect, the route search device can suitably search for a route that is highly likely to have the lowest composite cost.

  In another aspect of the route search apparatus, the dividing unit divides a route including the toll road based on at least one of distance, cost, and the number of facilities on the route as the first condition. According to this aspect, the route search device can determine the divided sections.

  In another aspect of the route search device, the dividing unit further divides the divided section when there are a predetermined number or more of facilities on the route in the divided section obtained by dividing the route including the toll road. According to this aspect, the route search device can favorably improve the processing efficiency by setting the number of facilities on the route in one divided section to less than a predetermined number.

  In another aspect of the route search apparatus, the dividing unit divides the route including the toll road into a plurality of ways according to different division positions, and the control unit passes the plurality of ways for each divided section. By determining a facility on a route that should be a difficult facility, the search means searches for the recommended route candidates, and the determination means compares the composite costs of the recommended route candidates for each of the plurality of ways. Then, the recommended route is determined. According to this aspect, the route search device can preferably suppress the influence of the recommended route search result due to the division position of the division section.

  In another aspect of the route search apparatus, the dividing unit divides the route including the toll road into a plurality of ways at different division positions by using different values of the same index. In another aspect of the route search apparatus, the dividing unit divides the route including the toll road into a plurality of ways at different division positions by using different indexes. By these aspects, the route search device can suitably divide the route in a plurality of ways at different division positions.

  In another preferred embodiment according to the present invention, there is provided a control method executed by a route search device, including a search step for searching for a route, and a route including a toll road in the search step, other than a toll for the route A control step of searching based on the cost of the vehicle, a calculation step of calculating the tolls of the plurality of routes searched by the searching step, a cost other than the toll and a cost for each of the routes calculated based on the toll A determination step for determining a recommended route by comparing a certain composite cost, and the calculation step corresponds to a combination of a toll road facility including an entrance facility and an exit facility of a toll road regardless of a travel distance. Calculate tolls. By executing this control method, the route search device can calculate the combined cost that accurately reflects the actual toll even if it includes a toll road where the toll is determined regardless of the distance traveled. And the recommended route can be suitably determined.

  In another preferred embodiment according to the present invention, a program executed by a computer includes a search means for searching for a route, and a route including a toll road in the search means at a cost other than the toll for the route. Control means for searching based on the calculation means, calculation means for calculating the tolls of a plurality of routes searched by the searching means, respectively, a composite cost that is a cost other than the toll and a cost for each of the routes calculated based on the toll By comparing the above, the computer functions as a determining means for determining a recommended route, and the calculating means is a toll according to a combination of toll road facilities including an entrance facility and an exit facility of a toll road regardless of the travel distance. Is calculated. By executing this program, the computer calculates a composite cost for each route that accurately reflects the actual toll even if it includes toll roads where tolls are fixed regardless of the distance traveled. The recommended route can be suitably determined. Preferably, this program is stored in a storage medium.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

[Configuration example]
FIG. 1 shows a schematic configuration of a navigation device 1 to which a route search device according to the present invention is applied. The navigation device 1 determines the recommended route to be presented to the user by accurately calculating the cost according to the actual fee for each route, and displays the route selection screen. As shown in FIG. 1, the navigation device 1 includes a self-supporting positioning device 10, a GPS receiver 18, a system controller 20, a data storage unit 31, a communication device 38, a display unit 40, an audio output unit 50, and an input device 60.

  The autonomous positioning device 10 includes an acceleration sensor 11, an angular velocity sensor 12, and a distance sensor 13. The acceleration sensor 11 is made of, for example, a piezoelectric element, detects vehicle acceleration, and outputs acceleration data. The angular velocity sensor 12 is composed of, for example, a vibrating gyroscope, detects the angular velocity of the vehicle when the direction of the vehicle is changed, and outputs angular velocity data and relative azimuth data. The distance sensor 13 measures a vehicle speed pulse composed of a pulse signal generated with the rotation of the vehicle wheel.

  The GPS receiver 18 receives radio waves 19 carrying downlink data including positioning data from a plurality of GPS satellites. The positioning data is used to detect the absolute position of the vehicle from latitude and longitude information.

  The system controller 20 includes an interface 21, a CPU 22, a ROM 23, and a RAM 24, and controls the entire navigation device 1. As will be described later, the system controller 20 includes a “search unit”, “control unit”, “calculation unit”, “determination unit”, “division unit”, “composite cost calculation unit”, “presentation unit”, and It is an example of the computer which runs the program in this invention.

  The interface 21 performs an interface operation with the acceleration sensor 11, the angular velocity sensor 12, the distance sensor 13, and the GPS receiver 18. From these, vehicle speed pulses, acceleration data, relative azimuth data, angular velocity data, GPS positioning data, absolute azimuth data, and the like are input to the system controller 20. The CPU 22 controls the entire system controller 20. The ROM 23 includes a nonvolatile memory (not shown) in which a control program for controlling the system controller 20 is stored. The RAM 24 stores various data such as route data preset by the user via the input device 60 so as to be readable, and provides a working area to the CPU 22.

  The system controller 20, the data storage unit 31, the display unit 40, the audio output unit 50, and the input device 60 are connected to each other via the bus line 30.

  The data storage unit 31 is configured by, for example, a storage medium such as an HDD, and stores various data used for navigation processing such as the map data 32. The map data 32 includes road data represented by links corresponding to roads and nodes corresponding to road connecting portions (intersections).

  In addition, the data storage unit 31 stores a charge table 33. The fee table 33 is a table for specifying a fee imposed when traveling on an expressway (toll road) from an interchange or the like used as an entrance and an exit. FIG. 2 is an example of the data structure of the charge table 33. In the charge table 33 shown in FIG. 2, the entry point, the exit point, the waypoint (route point 1,...), The discount time zone (discount time zone 1,...), And the discount rate (discount rate 1,...) , Associated with charges. Here, the transit point refers to a facility that has an influence on the fee depending on whether or not a ticket gate passes. Hereinafter, the entry point, the exit point, and the transit point registered in the fee table 33 are also simply referred to as “high-speed facility”. The high-speed facility is an example of the “toll road facility” in the present invention.

  Thus, the charge table 33 is associated with a charge for each combination of elements that determine the charge when using the highway. Therefore, the system controller 20 can accurately identify the toll for the expressway when the searched route includes the expressway by referring to the toll table 33.

  The configuration of the navigation device 1 will be described with reference to FIG. 1 again. The communication device 38 receives traffic information distributed from a VICS (registered trademark, Vehicle Information Communication System) center, traffic information distributed from a server device that distributes traffic information (not shown), and the like. The communication device 38 may receive information to be stored in the data storage unit 31 as the map data 32 from a server device (not shown) based on the control of the system controller 20.

  The display unit 40 displays various display data on a display device such as a display under the control of the system controller 20. Specifically, the system controller 20 reads the map data 32 from the data storage unit 31. The display unit 40 displays an image based on the map data 32 read from the data storage unit 31 by the system controller 20 on a display screen such as a display. The display unit 40 includes a graphic controller 41 that controls the entire display unit 40 based on control data sent from the CPU 22 via the bus line 30 and a memory such as a VRAM (Video RAM), and can display image information that can be displayed immediately. A buffer memory 42 that temporarily stores, a display control unit 43 that controls display of a display 44 such as a liquid crystal display or a CRT (Cathode Ray Tube) based on image data output from the graphic controller 41, and a display 44 are provided. . The display 44 is composed of, for example, a liquid crystal display device having a diagonal of about 5 to 10 inches, and is mounted near the front panel in the vehicle.

  The audio output unit 50 is output from the D / A converter 51 that performs D / A conversion of audio digital data sent from the RAM 24 or the like via the bus line 30 under the control of the system controller 20, and the D / A converter 51. An amplifier (AMP) 52 that amplifies the audio analog signal to be amplified, and a speaker 53 that converts the amplified audio analog signal into sound and outputs the sound into the vehicle.

  The input device 60 includes keys, switches, buttons, a remote controller, a voice input device, and the like for inputting various commands and data. The input device 60 is disposed around the front panel and the display 44 of the main body of the in-vehicle electronic system mounted in the vehicle. When the display 44 is a touch panel system, the touch panel provided on the display screen of the display 44 also functions as the input device 60.

[First embodiment]
In the first embodiment, generally, the system controller 20 regards at least one high-speed facility on a tentatively searched route (also referred to as “approximate solution route”) as a pseudo-block, and charges A route other than the approximate solution route is searched based on a cost that is not considered (also referred to as “cost not considered cost”). Then, the system controller 20 calculates a cost (also referred to as “fee consideration cost”) in consideration of the charges of the approximate solution route and the route other than the searched approximate solution, and recommends the route having the lowest cost as the recommended route. Output as. The fee consideration cost is an example of the “composite cost” in the present invention.

  FIG. 3A shows the approximate solution route and the high-speed facilities on the approximate solution route. FIG. 3A shows an approximate solution route overlapping with a general road by a broken line and an approximate solution route overlapping with an expressway by a solid line. Here, the approximate solution route is a route searched by an existing route search algorithm that can be executed by the Dijkstra method. For example, by setting a required time or / and distance as a cost (link cost) for each link. The searched route may be used. In another example, the approximate solution route may be a route searched by setting a link cost reflecting the assumed fee for each link on the assumption that the travel distance of the highway is proportional to the fee.

  In the example of FIG. 3A, the approximate solution route passes through the four high-speed facilities 6A to 6D including the entrance and exit ICs. In this case, the system controller 20 regards at least one of the high-speed facilities 6A to 6D as a pseudo road closure, and searches for a route other than the approximate solution route based on the unconsidered cost without considering the fee. In this case, for example, the system controller 20 uses the required time or / and distance as an index of the cost, and calculates the integrated value of the link cost of the entire route as the cost non-consideration cost. The high-speed facility that is virtually closed is an example of the “traffic difficult facility” in the present invention.

FIG. 3 (B) shows a route that minimizes the cost non-consideration cost when the high-speed facility 6B is pseudo-closed. In the example of FIG. 3B, the system controller 20 searches for a route that does not pass through the high speed facility 6B. In this case, for example, the system controller 20 sets a link cost for each link based on the required time or / and distance, and searches for a route with the minimum link cost integrated value using the Dijkstra method or the like. Then, the system controller 20 has the minimum link cost integrated value (that is, the cost non-consideration cost) for all the patterns (2 ⁴ −1) in which at least one of the high speed facilities 6A to 6D is closed in a pseudo manner. Search for a route that becomes.

  Further, the system controller 20 is based on the high-speed facility that passes through and the time zone that passes through the route that minimizes the cost non-consideration cost for each pattern in which at least one of the high-speed facilities 6A to 6D is closed. By referring to the charge table 33, the toll is calculated. Then, the system controller 20 converts the calculated fee into a cost in the same unit as the unconsidered fee by multiplying the predetermined conversion rate, and adds the converted cost to the unconsidered cost. Is calculated. Similarly, the system controller 20 calculates a toll for the approximate solution route and calculates a fee-considering cost. Then, the system controller 20 regards the route with the lowest toll consideration cost among the routes for which the toll is calculated as the recommended route.

FIG. 3C shows a route with the lowest charge consideration cost. In this case, the system controller 20 sets the approximate cost route and other high-speed facilities to be pseudo-blocked when the high-speed facilities 6B and 6C are pseudo-closed. Therefore, the recommended route is set.
FIG. 4 is a flowchart illustrating the route search process according to the first embodiment. In the flowchart of FIG. 4, as an example, a temporary (provisional) recommended route is a “first candidate route”, and a route to be compared with the first candidate route is a “second candidate route”. It is an algorithm that sequentially updates the first candidate route by comparing the charge consideration costs of the two candidate routes.

  First, the system controller 20 searches for an approximate solution route (step S100). Next, the system controller 20 creates a list of high speed facilities (also referred to as “high speed facility list”) existing on the approximate solution route (step S101). The high-speed facility existing on the approximate solution route is an example of the “route facility” in the present invention. Then, the system controller 20 calculates the charge consideration cost of the approximate solution route and sets it as the first candidate route (step S102). In this case, the system controller 20 calculates the toll-free cost for the approximate solution route, converts the toll for the approximate solution route specified by the fee table 33 into a cost at a predetermined conversion rate, and adds the cost to the unconsidered cost. Thus, the charge consideration cost of the approximate solution route is calculated.

  Next, the system controller 20 selects at least one high-speed facility to be pseudo-blocked from the high-speed facility list and searches for a second candidate route that minimizes the cost non-consideration cost (step S103). In this case, since the system controller 20 can determine the cost according to the distance, the required time, etc. for each link without considering the fee, the second candidate route can be efficiently searched by the Dijkstra method. It is.

  Then, the system controller 20 adds the cost according to the toll specified by referring to the charge table 33 to the charge non-considered cost of the second candidate route searched in step S103, so that the charge of the second candidate route A consideration cost is calculated (step S104).

  Then, the system controller 20 determines whether or not the charge consideration cost of the second candidate route is smaller than the charge consideration cost of the first candidate route (step S105). Then, when the charge consideration cost of the second candidate route is smaller than the charge consideration cost of the first candidate route (step S105; Yes), the system controller 20 sets the second candidate route as the first candidate route (step S106). ). On the other hand, when the charge consideration cost of the second candidate route is equal to or higher than the charge consideration cost of the first candidate route (step S105; No), it is determined that there is no need to replace the first candidate route, and the process proceeds to step S107.

  Next, the system controller 20 determines whether or not all patterns of the high-speed facility to be pseudo-blocked have been executed (step S107). That is, the system controller 20 determines whether or not the processes of steps S103 to S106 have been executed for all patterns of the high-speed facilities to be pseudo-blocked when at least one high-speed facility in the high-speed facility list is to be pseudo-blocked.

  If the system controller 20 determines that all patterns of the high-speed facility to be pseudo-closed have been executed (step S107; Yes), the system controller 20 regards the current first candidate route as the route with the lowest toll consideration cost, One candidate route is output as a recommended route (step S108).

  On the other hand, when the system controller 20 determines that not all the patterns of the high-speed facility to be pseudo-closed have been executed (step S107; No), the process returns to step S103. In step S103, the system controller 20 searches the route for the pattern of the high-speed facility that is not subjected to the processing in steps S103 to S106 and sets the second candidate route. As described above, the system controller 20 repeatedly executes the processes of steps S103 to S106 until the entire pattern of the high-speed facility to be pseudo-blocked is executed.

  Note that, instead of outputting one route as a recommended route, the system controller 20 may output a predetermined number of routes having the lowest charge consideration cost as recommended routes. In this case, for example, the system controller 20 sets a maximum number of routes as the first candidate routes, and if the number of first candidate routes is less than the predetermined number, the second candidate is determined without performing the determination in step S105. Add the route to one of the first candidate routes. On the other hand, the system controller 20 compares the first candidate route with the highest fee consideration cost with the second candidate route when the predetermined number of first candidate routes exists at the upper limit, and determines the fee consideration cost of the second candidate route. When is lower, the second candidate route is set as the first candidate route instead of the compared first candidate route.

[Second Embodiment]
In the second embodiment, the system controller 20 divides the approximate solution route into a plurality of sections, and determines a pattern of a high speed facility with a closed road that minimizes the charge consideration cost for each divided section. Thereby, the system controller 20 suitably reduces the number of times the route search is performed, and suitably suppresses an increase in processing time even when the number of high-speed facilities on the approximate solution route is large.

FIG. 5A shows an approximate solution route in which five high-speed facilities 6A to 6E exist. In this case, there are 2 ⁵ −1 (= 31) patterns of high-speed facilities to be pseudo-blocked, and in the case of the first embodiment, it is necessary to execute the processing of steps S103 to S106 31 times.

  FIG. 5B shows an example in which the approximate solution route is divided into three sections (section 1 to section 3) based on the distance. In this case, the system controller 20 divides the approximate solution route into sections 1 to 3 so that the distances along the route are equal in each section, and specifies high-speed facilities belonging to each of the sections 1 to 3. . In the example of FIG. 5B, the system controller 20 recognizes that the high speed facilities 6A and 6B exist in the section 1, the high speed facilities 6C and 6D exist in the section 2, and the high speed facility 6E exists in the section 3. To do.

  Thereafter, for each section, the system controller 20 is configured such that when the high-speed facilities in the other sections are allowed to pass, the route in which the non-charge-considered cost is minimized for all the patterns in which the high-speed facilities in the target section are closed. Explore. Thereby, the system controller 20 determines the high-speed facility which should be pseudo-blocked for every area.

  FIGS. 5C to 5E show routes to be searched when a high-speed facility to be pseudo-closed for the section 1 is determined. In the example of FIG. 5 (C), the system controller 20 stops the high speed facility 6A in the section 1 and allows the other high speed facilities 6B in the section 1 and the high speed facilities 6C to 6E in the other sections to pass. Search for the route with the lowest cost. Further, in the example of FIG. 5D, the system controller 20 blocks the high-speed facility 6B in the section 1 and allows other high-speed facilities 6A in the section 1 and 6C to 6E in other sections to pass, and does not consider the charge Search for the route with the lowest cost. Furthermore, in the example of FIG. 5 (E), the system controller 20 stops the high-speed facilities 6A and 6B in the section 1 and allows the high-speed facilities 6C to 6E in the other sections to pass, so that the cost-unconsidered cost is minimized. Explore.

  Then, the system controller 20 determines whether there is no charge from the route obtained in each route search in FIGS. 5C to 5E and the route that can pass through all the high-speed facilities in the section 1 shown in FIG. By determining a route that minimizes the consideration cost, a high-speed facility to be pseudo-closed in the section 1 is determined. For example, when the system controller 20 determines that the cost non-consideration cost is minimized when the high-speed facility 6B is set to be pseudo-closed (that is, in the case of FIG. 5D), the high-speed facility 6B is set to be pseudo-closed in the section 1. Judge that is the best. Similarly, the system controller 20 determines the high-speed facility which should be pseudo-blocked in each section by performing the same process as the section 1 for the sections 2 and 3.

  Next, the system controller 20 determines a route that minimizes the charge consideration cost based on the combination of high-speed facilities that are to be pseudo-closed determined for each section.

  6A to 6E show the respective routes with which the system controller 20 compares the fee-considering costs when determining the recommended route. Here, FIG. 6A shows an approximate solution route, and FIG. 6B shows a case where a high-speed facility (here, high-speed facility 6B) determined to be pseudo-blocked in section 1 is pseudo-blocked. , Indicates the route with the lowest unconsidered cost. Further, FIG. 6C shows a route that minimizes the cost non-consideration cost when the high speed facility (high speed facility 6C in this case) determined to be pseudo closed in the section 2 is closed. 6 (D) shows a route that minimizes the cost non-consideration cost when the high speed facility (here, the high speed facility 6E) determined to be pseudo closed in the section 3 is closed. Further, FIG. 6E shows a route that minimizes the cost non-consideration cost when all high-speed facilities determined to be pseudo-blocked in each section are pseudo-blocked.

  Thereafter, as shown in FIGS. 6 (B) to (D), when a high-speed facility that has been determined to be quasi-closed in a certain section is quasi-blocked and a high-speed facility in another section is allowed to pass, there is no charge. The route with the lowest consideration cost is called “section best route”. In addition, as shown in FIG. 6E, when all high-speed facilities that are determined to be quasi-closed in each section are quasi-closed, a route that minimizes the cost-free consideration cost is referred to as an “overall best route”. .

As described above, the system controller 20 includes the approximate solution route (see FIG. 6A), the section best route corresponding to each section (see FIGS. 6B to 6D), and the overall best route (FIG. 6). (See (E)). Then, the system controller 20 determines a route having the lowest charge consideration cost among these routes as a recommended route. In this case, the system controller 20 can suitably reduce the processing load required for determining the recommended route as compared with the first embodiment. Specifically, in the case of the first embodiment, when the approximate solution route shown in FIG. 6 (A) is obtained, the route search 31 in step S103 of FIG. 4 based on the rates observed considering cost (= 2 ⁵ -1) times, whereas in the case of the second embodiment, the route search based on the tolling cost is 7 (= (2 ² -1) + (2 ² -1) + (2 ¹ -1)) It is sufficient to execute it once. In other words, in the case of the second embodiment, the route search based on the toll rate consideration cost is calculated for section 1 (= 2 ² −1) ways (the case where both high-speed facilities are not pseudo-closed is already calculated). Excluded), 3 (= 2 ² -1) for section 2 (excludes cases where both high-speed facilities have not been closed), and 1 (= 2 ¹ -1) for section 3 (high-speed facility) The case where is not closed is excluded because it has been calculated.

  Here, a supplementary explanation will be given of the section dividing method.

  In the example of FIGS. 5 and 6, the system controller 20 is divided into three sections, but is not limited to this, and may be set to any number of sections of 2 or 4 or more. In this case, for example, the system controller 20 may be set to increase the number of sections as the number of high-speed facilities in the high-speed facility list increases. In another example, the system controller 20 may be set to increase the number of sections as the required travel distance or the required time of the approximate solution route is longer. In these cases, the data storage unit 31 may store in advance a map or table for determining the number of sections described above.

  Similarly, in the example of FIGS. 5 and 6, the system controller 20 divides each section so that the distances of the approximate solution routes in each section become equal, but an index (scale) used to divide each section. Is not limited to distance. For example, the system controller 20 may determine the break of each section based on the cost calculated during the route search for the approximate solution route. In this case, the system controller 20 determines each section so that the total value for each section of the link cost calculated during the route search for the approximate solution route is equal for each section. Also by this, the system controller 20 can preferably divide the approximate solution route. In another example, the system controller 20 may divide each section based on the number of high-speed facilities. In this case, for example, the system controller 20 determines each section so that the number of high-speed facilities belonging to each section is the same or within one difference. In this case, for example, after the system controller 20 determines the high-speed facilities to belong to each section, the intermediate points between the high-speed facilities adjacent to each other in different sections (for example, intermediate points based on distance or cost) are set to these sections. Determined at the boundary position. Also by these, the system controller 20 can suitably determine the boundary position of each section.

  FIG. 7 is a flowchart showing a route search process executed by the system controller 20 in the second embodiment. In the flowchart of FIG. 7, as an example, the system controller 20 sequentially compares the charge consideration costs of the approximate solution route and the section best route (see FIGS. 6B to 6D) of each section, and then the overall best. The recommended route is determined by calculating the charge consideration cost of the route (see FIG. 6E). Here, when the charge consideration costs of the approximate solution route and the section best route of each section are sequentially compared, the route having the lowest charge consideration cost is tentatively set as the first candidate route.

  First, the system controller 20 searches for an approximate solution route (step S200). At this time, the system controller 20 preferably stores the accumulated distance or cost from the departure place required for the section division to each high-speed facility. Next, the system controller 20 creates a high speed facility list (step S201). Then, the system controller 20 calculates the charge consideration cost of the approximate solution route and sets it as the first candidate route (step S202). Then, the system controller 20 divides the approximate solution route by a predetermined number of sections based on the distance or cost, and divides the high-speed facility into groups for each section (1 to n; n is an integer of 2 or more) (step S203). .

  Next, the system controller 20 performs a route search for all patterns of the high-speed facilities that are to be pseudo-closed for the selected section k (k is an integer having an initial value of 1), and the cost non-consideration cost is minimized. A route is searched (step S204). As a result, the system controller 20 determines a high-speed facility to be pseudo-closed in the target section k, and specifies the section best route corresponding to the section k.

  Next, the system controller 20 adds the cost corresponding to the toll of the highway identified by referring to the toll table 33 to the unconsidered toll-free cost for the section best route searched in step S204. Cost is calculated (step S205).

  Then, the system controller 20 determines whether or not the charge consideration cost of the section best route calculated in step S205 is smaller than the charge consideration cost of the first candidate route (step S206). When the charge consideration cost of the section best route searched in step S204 is smaller than the charge consideration cost of the first candidate route (step S206; Yes), the system controller 20 sets the section best route searched in step S204 to the first. A candidate route is set (step S207). On the other hand, when the charge consideration cost of the section best route searched in step S204 is equal to or higher than the charge consideration cost of the first candidate route (step S206; No), it is determined that there is no need to update the first candidate route, and the process proceeds to step S208. Proceed with the process.

  Next, the system controller 20 determines whether or not the processing of steps S204 to S207 has been executed for all sections (k = 1 to n) (step S208). If the system controller 20 determines that the processes of steps S204 to S207 have been executed for all sections (step S208; Yes), the process proceeds to step S209. On the other hand, the system controller 20 returns a process to step S204, when the area which has not performed the process of step S204-S207 exists (step S208; No). In this case, the system controller 20 adds 1 to the section index k, and re-executes steps S204 to S207.

  Next, in step S209, the system controller 20 sets a route (ie, the overall best pattern) in which all the high-speed facilities determined to be quasi-closed in each section are quasi-closed (that is, the overall best pattern) that minimizes the cost non-consideration cost. That is, the entire best route is searched (step S209). Then, the system controller 20 adds the cost according to the toll of the expressway on the overall best route specified by referring to the toll table 33 to the unconsidered cost for the overall best route searched in step S209. Thus, the charge consideration cost is calculated (step S210). Then, the system controller 20 outputs, as a recommended route, one of the first candidate route and the overall best route that has a smaller charge consideration cost (step S211). As a result, the system controller 20 can appropriately determine a route having a low fee-considering cost as a recommended route while suitably reducing the number of route searches.

[Third embodiment]
In the third embodiment, the system controller 20 enables the approximate solution route to be divided into multiple stages. Thereby, the system controller 20 adjusts the number of high-speed facilities in a section, and improves processing efficiency suitably.

FIG. 8A shows an example in which the approximate solution route where the high-speed facilities 6a to 6k exist is divided into two sections, section 1 and section 2. In the example of FIG. 8A, the system controller 20 sets the approximate solution route to two sections so that section 1 includes six high speed facilities 6a to 6f and section 2 includes five high speed facilities 6g to 6k. It is divided into. In this case, there are 2 ⁶ (= 64) high-speed facility patterns to be pseudo-closed in section 1, and there are 2 ⁵ (= 32) high-speed patterns to be pseudo-closed in section 2. When the number of sections is 2, route search is required at least 96 times. Therefore, in this embodiment, the system controller 20 further divides a section in which the number of high-speed facilities in the section is equal to or greater than a predetermined number (also referred to as “threshold number”). Here, it is assumed that the system controller 20 sets the threshold number to three.

  FIG. 8B shows an example in which the section 1 is further divided into a section 1A and a section 1B, and the section 2 is further divided into a section 2A and a section 2B. In the example of FIG. 8B, the system controller 20 has the same number of high-speed facilities in the sections 1 and 2 because the number of high-speed facilities in the sections 1 and 2 is greater than the threshold number. It is subdivided to become. As a result, there are three high speed facilities 6a-6c in section 1A, three high speed facilities 6d-6f in section 1B, three high speed facilities 6g-6i in section 2A, section 2B There are two high-speed facilities 6j and 6k.

  Here, since the number of high-speed facilities equal to or greater than the threshold number exists for the section 1A, the section 1B, and the section 2A, the system controller 20 performs re-division for these sections. FIG. 8C shows the relationship between each section and the high-speed facilities belonging to each section when the section is further divided from the example of FIG. 8B. In the example of FIG. 8C, the system controller 20 divides the section 1A into a section 1Aa including two high speed facilities 6a and 6b and a section 1Ab including one high speed facility 6c. Further, the system controller 20 divides the section 1B into a section 1Ba including two high speed facilities 6d and 6e and a section 1Bb including one high speed facility 6f. Further, the system controller 20 divides the section 2A into a section 2Aa including two high speed facilities 6g and 6h and a section 2Ab including one high speed facility 6i. On the other hand, the system controller 20 does not perform subdivision for the section 2B because the number of high-speed facilities is already less than the threshold number.

  Then, when the number of high-speed facilities in all sections becomes less than the threshold number, the system controller 20 determines, for each section, the section best route that minimizes the cost non-consideration cost for all patterns that make the high-speed facilities pseudo-closed. Search and determine the high-speed facilities that should be closed for each section.

  FIG. 9A is a diagram reflecting the result of determining the high-speed facility that should be pseudo-blocked for each section. In the example of FIG. 9A, in the case of section 1Aa, the cost non-consideration cost is minimized when the high-speed facility 6b is set as pseudo-blocking, and in the case of section 1Ab, section 1Ba, and section 2Aa, the high-speed facility set as pseudo-blocking is selected. In the case of the section 1Bb, the cost non-consideration cost is minimized when the high-speed facility 6f is set as a pseudo closed road, and in the case of the section 2Ab, the high speed facility 6i is set as a pseudo closed road. The cost non-consideration cost is minimum, and in the case of section 2B, the fee non-consideration cost is minimum when the high speed facility 6k is closed.

  Thereafter, in the first example, the system controller 20 determines the recommended route by executing the flowchart of FIG. 7 of the second embodiment. In the example of FIG. 9A, the system controller 20 considers that there are seven sections, and executes the flowchart of FIG.

  In the second example, the system controller 20 determines the high-speed facility that is determined to be quasi-closed in the re-divided section as the high-speed facility that is to be quasi-closed in the original section. FIG. 9B shows the high-speed facilities that should be pseudo-closed in the sections 1A, 1B, 2A, and 2B. The example determined based on the search result of the section best route in is shown.

  In the example of FIG. 9 (B), the system controller 20 designates the high-speed facility determined to be quasi-closed in the sections 1Aa and 1Ab shown in FIG. 9 (A) as the high-speed facility to be quasi-closed in the section 1A. It has established. Similarly, for the section 1B and the section 2A, the system controller 20 defines a high-speed facility to be pseudo-closed. Thereafter, the system controller 20 may determine a recommended route by executing the flowchart of FIG. 7 of the second embodiment for the section 1A, section 1B, section 2A, and section 2B, and in these sections Based on the combination of the high-speed facilities that have been pseudo-closed, the high-speed facilities that are to be pseudo-blocked in the sections 1 and 2 may be determined. In FIG. 9C, the high-speed facilities that should be pseudo-closed in the sections 1 and 2 are determined based on the combination of the high-speed facilities that are pseudo-closed in each of the subdivisions 1A, 1B, 2A, and 2B. An example is shown. In this case, the system controller 20 defines a high-speed facility that is to be pseudo-closed in the section 1 by a combination of high-speed facilities that are to be pseudo-closed in the sections 1A and 1B shown in FIG. Similarly, for the section 2, the system controller 20 determines a high-speed facility to be pseudo-closed. Thereafter, the system controller 20 considers that there are two sections, section 1 and section 2, and executes the flowchart of FIG.

  8 and 9, the system controller 20 sequentially divides the approximate solution route into two parts. However, the system controller 20 is not limited thereto, and may be sequentially divided into three or more division numbers.

  As described above, according to the third embodiment, the system controller 20 determines whether or not to subdivide the approximate solution route according to the number of high speed facilities in the section, and sets the number of high speed facilities in the section to the threshold number. Less than. As a result, the system controller 20 can improve the processing efficiency by setting an appropriate section according to the number of high-speed facilities even when the number of high-speed facilities on the approximate solution route is large.

[Fourth embodiment]
In the fourth embodiment, the system controller 20 receives an input for designating a conversion rate from a fee to a cost used when calculating a fee-considering cost, and performs a display output of a recommended route reflecting the designated conversion rate. Hereinafter, as an example, it is assumed that the unit of charge consideration cost is time.

  FIG. 10 shows a first display example of the route selection screen. In the route selection screen of FIG. 10, the system controller 20 sets the charge consideration cost when the conversion rate from the charge to the cost (charge base time cost) is set to 500 yen / h, 700 yen / h, and 900 yen / h, respectively. The top four routes with low values are presented as recommended routes. In FIG. 10, the system controller 20 displays, on the route selection screen, a table 7A showing the charge consideration costs of the top four routes when the conversion rate (rate) from charge to cost is 500 yen / h, and conversion A table 7B showing the charge consideration costs of the top four routes when the rate is 700 yen / h, and a table 7C showing the charge consideration costs of the top four routes when the conversion rate is 900 yen / h A route outline diagram 8A showing an outline of each route is displayed.

  As shown in the tables 7A to 7C, by changing the conversion rate of the charge per hour, the charge consideration cost of the route using the highway such as the route C and the route E is changed. Specifically, when the conversion rate is 900 yen / h, the value of time relative to the charge is relatively higher than when the conversion rate is 500 yen / h. The cost consideration cost of routes using roads has decreased, and as a result, the ranking of these routes has increased.

  Further, the tables 7A to 7C can be selected, and the system controller 20 displays a route outline based on the charge consideration cost corresponding to the selected table in the route outline diagram 8A. In the example of FIG. 10, since the table 7A is selected, the system controller 20 displays the route A that is the highest when the conversion rate is 500 yen / h, and displays the route B, route C, route In order of D, the lines representing these are displayed gradually thinner. FIG. 11 shows a route selection screen when the user selects the table 7C using the touch panel or the like. In this case, the system controller 20 makes a route outline diagram 8C in which the highest route C in the selected table 7C is made thickest and the lines representing these are gradually narrowed in the order of route A, route B, and route E. It is displayed. Thereafter, the user sets a route by designating the route to be set on the touch panel or the like in the tables 7A to 7C or the route outline diagrams 8A and 8C, for example.

  FIG. 12 is a second display example of the route selection screen. In the example of FIG. 12, the system controller 20 displays, on the route selection screen, a table 7A with a conversion rate of 500 yen / h, a route outline diagram 8A showing an overview of each route in the table 7A, a conversion rate button 26, Is displayed. When the conversion rate button 26 is selected, the system controller 20 displays a balloon 27 including a plurality of conversion rate designation buttons 28 for selecting the conversion rate. The conversion rate designation button 28 is provided for each conversion rate selectable by the user. When the conversion rate designation button 28 indicating a conversion rate different from the currently selected conversion rate is selected, the system controller 20 indicates a charge consideration cost of the conversion rate corresponding to the selected conversion rate designation button 28. And the route outline diagram are displayed on the route selection screen instead of the table 7A and the route outline diagram 8A. According to this aspect, the system controller 20 can suitably display the route search result corresponding to the conversion rate designated by the user on the route selection screen.

  FIG. 13 shows a third display example of the route selection screen. In the example of FIG. 13, the system controller 20 displays a table 7 </ b> X that shows the route with the lowest charge consideration cost in each conversion rate together with the charge consideration cost. Further, the system controller 20 displays a route outline diagram 8X showing an outline of the routes listed in the table 7X together with the table 7X. According to this aspect, the system controller 20 can allow the user to easily grasp the route that minimizes the charge consideration cost at each conversion rate.

[Modification]
Hereinafter, each modification suitable for the first to fourth embodiments will be described. These modifications may be applied in combination to the above-described embodiments.

(Modification 1)
In the second and third embodiments, in addition to the route search in the overall best pattern, the system controller 20 changes the presence / absence of the pseudo-passage of the high speed facility existing at the boundary of the adjacent section from the overall best pattern. A route search may be further performed.

  FIG. 14A shows the overall best pattern when the approximate solution route including the high speed facilities 6a to 6k is divided by the section 1 and the section 2. In the example of FIG. 14A, the high speed facilities 6b and 6f that are pseudo closed when the section best route searched by executing step S204 of FIG. On the other hand, high-speed facilities 6i and 6k are the high-speed facilities that are pseudo-closed during the section best route searched by executing step S204 of FIG. Therefore, in the example of FIG. 14 (A), the pattern in which the high speed facilities 6b, 6f, 6i, and 6k are closed is the best overall pattern.

  Here, in addition to searching for the overall best route in step S209 in FIG. 7, the system controller 20 determines whether or not the high speed facilities 6f and 6g adjacent at the boundary between the sections 1 and 2 have pseudo-blocking from the overall best pattern. For the changed pattern, a route that minimizes the cost non-consideration cost is searched. FIG. 14 (B) shows a pattern in which the presence or absence of pseudo-propagation of the high-speed facility 6f adjacent at the boundary between the section 1 and the section 2 is changed from the overall best pattern, and FIG. 14 (C) shows the boundary between the section 1 and the section 2 The pattern which changed the presence or absence of the pseudo-passage of the adjacent high-speed facility 6g from the whole best pattern is shown. Then, the system controller 20 searches the route corresponding to the patterns corresponding to FIGS. 14 (B) and 14 (C) for the route with the lowest charge non-consideration cost, calculates the charge consideration cost for the searched route, and recommends the route It is determined whether or not it can be.

  Generally, high-speed facilities that exist near the boundary of a section are easily affected by the presence or absence of pseudo-blocking of high-speed facilities in other adjacent sections. It may have occurred. Considering the above, in this modification, route search is also performed for a pattern in which the presence or absence of pseudo-propagation of a high-speed facility existing at the boundary between adjacent sections is changed from the overall best pattern. This makes it possible to efficiently search for a route that can be a recommended route candidate while preventing an excessive increase in the number of route searches.

(Modification 2)
The route search process executed by the navigation device 1 may be executed by a server device that communicates with the navigation device 1 via a network.

  FIG. 15 shows a configuration of a route search system according to a modification. In the example of FIG. 15, the route search system includes the navigation device 1 and the server device 3 having the map data 32 and the charge table 33.

  In the configuration example of FIG. 15, the navigation device 1 transmits input information such as a destination and current position information to the server device 3 after receiving an input designating the destination. Thereafter, the server device 3 determines a recommended route with reference to the map data 32 and the charge table 33 based on the first to third embodiments, and transmits information indicating the route search result to the navigation device 1. Further, the server device 3 causes the navigation device 1 to display the route selection screen by transmitting the display information of the route selection screen described in the fourth embodiment to the navigation device 1. At this time, the navigation device 1 transmits information on the conversion rate input on the route selection screen to the server device 3.

  In the present modification, the server device 3 is an example of the “route search device” in the present invention, and the CPU of the server device 3 is the “search means”, “control means”, “calculation means” in the present invention. , “Determining means”, “dividing means”, “composite cost calculating means”, “presenting means”, and an example of a computer that executes the program according to the present invention.

(Modification 3)
In the second and third embodiments, the system controller 20 may determine sections by a plurality of division methods, calculate a route for each division method, and determine a recommended route from these calculated routes.

  In this case, in the first example, the system controller 20 changes the numerical value that defines the length per section when dividing the approximate solution route by a predetermined index (distance, cost, number of high-speed facilities, etc.). Thus, the approximate solution route is divided by different division positions. For example, when dividing the approximate solution route based on the distance, the system controller 20 determines the division position of the approximate solution route by a dividing method in which one section is 50 km and a dividing method in which one section is 60 km. In this case, the system controller 20 may divide the approximate solution route by three or more numerical values with the same index, and determine the route with the lowest charge consideration cost from the searched routes in each case as the recommended route.

  In the second example, the system controller 20 divides the approximate solution route according to different indexes, and determines the route with the lowest charge consideration cost from the searched routes in each case as the recommended route. For example, the system controller 20 searches for the route in the second or third embodiment when the approximate solution route is divided into a plurality of sections based on the distance and when the approximate solution route is divided into a plurality of sections based on the cost, respectively. I do. Then, the system controller 20 determines, as a recommended route, the route with the lowest charge consideration cost from the routes obtained by the route search in each case. Note that the system controller 20 may divide the approximate solution route using three or more indices, and may determine a route with the lowest cost consideration cost as a recommended route from the searched routes in each case.

  According to these examples, it is possible to suitably reduce the influence of the result of the recommended route due to the way of dividing the approximate solution route.

(Modification 4)
In the first embodiment, the system controller 20 uses a different index for the cost non-considered cost used in the route search in step S103 of FIG. May be calculated. For example, the former may be a cost using distance as an index, and the latter may be a cost using time as an index. Similarly, in the second embodiment and the third embodiment, the system controller 20 distinguishes between the charge non-consideration cost used when searching for the section best route and the charge non-consideration cost used when calculating the charge consideration cost. The cost may be calculated using the index.

DESCRIPTION OF SYMBOLS 1 Navigation apparatus 3 Server apparatus 10 Self-supporting positioning apparatus 12 GPS receiver 20 System controller 22 CPU
31 Data storage unit 38 Communication device 40 Display unit 44 Display 50 Audio output unit 60 Input device

Claims (13)

Search means for searching for a route;
Control means for causing the search means to search for a route including a toll road based on a cost other than the toll of the route;
Calculating means for calculating tolls for a plurality of routes searched by the searching means;
Determining means for determining a recommended route by comparing a cost other than a toll and a composite cost that is a cost for each route calculated based on the toll;
The route search device, wherein the calculating means calculates a toll according to a combination of toll road facilities including an entrance facility and an exit facility of a toll road regardless of a travel distance. The control means extracts facilities on the route included in the route searched by the search means,
The route search device according to claim 1, wherein at least one of the on-route facilities is a non-passable facility, and the search means searches for a plurality of routes having different combinations of on-route facilities.   The route search device according to claim 2, wherein the control means extracts a toll road facility having an influence on a toll depending on the presence or absence of traffic as the facility on the route. Dividing means for dividing the route including the toll road according to a first condition;
The control means should make the inaccessible facility for each divided section by causing the search means to search for a plurality of routes having different combinations of on-route facilities for each divided section divided by the dividing means. The route search device according to claim 2 or 3, wherein a facility on the route is determined.   5. The route search device according to claim 4, wherein the control unit causes the search unit to search for a route that does not pass through all the inaccessible facilities determined for each of the divided sections as the recommended route candidate.   6. The route search device according to claim 4, wherein the dividing unit divides a route including the toll road based on at least one of distance, cost, and the number of facilities on the route as the first condition.   The said dividing means further divides | segments the said division | segmentation area, when the number of facilities on the route in the division | segmentation area which divided | segmented the path | route containing the said toll road exists more than predetermined number. Route search device. The dividing means divides a route including the toll road into a plurality of ways by different dividing positions,
The control means, for each of the plurality of ways, by causing the search means to search for a candidate for the recommended route by determining a facility on the route that should be a difficult passage facility for each divided section,
The route search device according to any one of claims 4 to 7, wherein the determination unit determines the recommended route by comparing composite costs of the recommended route candidates for each of the plurality of types.   The route search device according to claim 8, wherein the dividing unit divides a route including the toll road into a plurality of ways at different division positions by using different values of the same index.   The route search device according to claim 8, wherein the dividing unit divides the route including the toll road into a plurality of ways at different division positions by using different indexes. A control method executed by a route search device,
A search step for searching for a route;
A control step for causing the search step to search for a route including a toll road based on a cost other than the toll of the route;
A calculation step of calculating tolls for a plurality of routes searched by the search step;
Determining a recommended route by comparing a cost other than a toll and a composite cost that is a cost for each route calculated based on the toll; and
The calculation step is a control method for calculating a toll according to a combination of toll road facilities including an entrance facility and an exit facility of a toll road regardless of a travel distance. A program executed by a computer,
Search means for searching for a route;
Control means for causing the search means to search for a route including a toll road based on a cost other than the toll of the route;
Calculating means for calculating tolls for a plurality of routes searched by the searching means;
By comparing the cost other than the toll and the combined cost that is the cost for each of the routes calculated based on the toll, the computer is caused to function as a determining means for determining a recommended route,
The calculation means is a program for calculating a toll according to a combination of toll road facilities including an entrance facility and an exit facility of a toll road regardless of a travel distance.   A storage medium storing the program according to claim 12.

Images