Information processing system, information processing program, information processing device, and information processing method

Abstract

To optimize a route from a departure place to a final via spot.SOLUTION: An information processing system 1 according to an embodiment includes: a route search unit 312 that searches for a first route from a departure place to a destination via a plurality of via spots, the first route optimizing a movement cost from the departure place to a final via spot through which a vehicle finally passes among the plurality of via spots; and information output means 212 that outputs information on the first route.SELECTED DRAWING: Figure 7

Description

Technical Field

[0001] The present invention relates to an information processing system, an information processing program, an information processing apparatus, and an information processing method.

Background Art

[0002] In recent years, with the increase in the goods handled by the logistics industry, the locations (distribution centers) for collecting and delivering goods have been increasing. As a result, the distribution routes for moving through each distribution center have become complicated. Consequently, the risk of late delivery, where the goods cannot reach the distribution center at a predetermined time, has been rising.

[0003] Conventional techniques have proposed methods for optimizing the circular route from the departure point to the destination (Patent Document 1) and methods for optimizing the route from one distribution center to the next (Patent Document 2). However, these conventional techniques do not optimize the route from the departure point of the carrier to the last distribution center (final transit point) to be visited. Therefore, there are cases where a route for arriving at the last distribution center as early as possible cannot be presented, and the risk of late delivery has not been sufficiently reduced.

Prior Art Documents

Patent Documents

[0004]

Patent Document 1

Patent Document 2

Summary of the Invention

Problems to be Solved by the Invention

[0005] The present invention provides an information processing system, an information processing program, an information processing apparatus, and an information processing method capable of optimizing the route from the departure point to the final transit point.

Means for Solving the Problems

[0006] The information processing system according to the present invention is A route search means for searching for a first route that goes from a starting point to a destination via multiple intermediate points, wherein the travel cost between the starting point and the final intermediate point, which is the last intermediate point visited among the multiple intermediate points, is optimal. Information output means for outputting information related to the first route, It is characterized by having the following features. [Effects of the Invention]

[0007] According to the present invention, the route from the starting point to the final transit point can be optimized. [Brief explanation of the drawing]

[0008] [Figure 1] This figure shows an example of a schematic configuration of the entire information processing system according to the present invention. [Figure 2] This figure shows a schematic configuration of a terminal device according to the first embodiment. [Figure 3] This figure shows a schematic configuration of the server according to the first embodiment. [Figure 4] This is a diagram illustrating a method for searching for a first path according to the first embodiment. [Figure 5] This diagram illustrates a method for searching for a second path according to the first embodiment. [Figure 6A] This is a sequence diagram showing an example of processing operation between a terminal device and a server in an information processing system according to the first embodiment. [Figure 6B] Figure 6A is followed by a sequence diagram showing an example of processing operations between a terminal device and a server in the information processing system according to the first embodiment. [Figure 7] This figure shows an example of an operation input unit for inputting route search conditions in a terminal device according to the first embodiment. [Figure 8] This figure shows an example screen for comparing route information related to the first route and the second route, which is displayed on the terminal device according to the first embodiment. [Figure 9]This is an example of a screen showing detailed route information related to the first route, which is displayed on the terminal device according to the first embodiment. [Figure 10] This is a diagram showing another example of a screen for comparing route information related to the first route and the second route, which is displayed on the terminal device according to the first embodiment. [Figure 11] This is a diagram showing a schematic configuration of a server according to the second embodiment. [Figure 12] This is a diagram showing an example of a vehicle database according to the second embodiment. [Figure 13] This is a diagram showing an example of a mover database according to the second embodiment. [Figure 14A] This is a sequence diagram showing an example of a processing operation between the terminal device and the server of the information processing system according to the second embodiment. [Figure 14B] This is a sequence diagram showing an example of a processing operation between the terminal device and the server of the information processing system according to the second embodiment, following FIG. 14A. [Figure 15] This is a diagram showing the first route of each of a plurality of movers according to the second embodiment. [Figure 16] This is a diagram showing an example of information related to vehicle dispatching created by the vehicle dispatching unit according to the second embodiment.

Embodiments for Carrying Out the Invention

[0009] Hereinafter, each embodiment according to the present invention will be specifically described with reference to the drawings. In each figure, components having the same function are denoted by the same reference numerals, and detailed descriptions of the components with the same reference numerals will not be repeated.

[0010] <Information Processing System 1> Referring to FIG. 1, the schematic configuration of an information processing system common to each embodiment of the present invention will be described. This information processing system includes a terminal device 2, a server 3, and a network 4. The terminal device 2 and the server 3 are communicably connected to each other via a network 4 such as the Internet. The network 4 may be either a wired line or a wireless line, and the type and form of the line are not limited.

[0011] The terminal device 2 is an information processing device for a user to register, for example, mover information and vehicle information in each database of the server 3 or to search for a route. The terminal device 2 is, for example, a notebook computer or a desktop computer, but may also be a smartphone, a tablet terminal, or the like. If the terminal device 2 is a portable terminal device such as a smartphone, the embodiments can be realized even when the user is moving in a vehicle or the like.

[0012] (First Embodiment) Referring to FIGS. 2 and 3, the configurations of the terminal device 2 and the server 3 of the information processing system 1 according to the first embodiment will be described in detail.

[0013] As shown in FIG. 2, the terminal device 2 includes a control unit 21, a communication unit 22, a storage unit 23, an operation input unit 24, and a display unit 25.

[0014] The control unit 21 includes an information acquisition unit 211 and an information output unit 212. Each part of the control unit 21 is realized by a processor in the terminal device 2 executing a predetermined program. Note that at least a part of each part of the control unit 21 may be realized by hardware.

[0015] Here, the details of each part of the control unit 21 will be described. The information acquisition unit 211 acquires information entered by the user via the operation input unit 24. The acquired information is, for example, route search conditions, and includes information related to locations (origin, destination, waypoints), the time of departure from the origin, and the time of arrival at the destination. Multiple waypoints may be acquired as route search conditions. In addition, at least one of the departure time and the estimated arrival time may be acquired.

[0016] The information output unit 212 outputs various types of information to be presented to the user of the terminal device 2 in a format appropriate to the output destination. For example, if the output destination is the display unit 25, the information output unit 212 converts the information to be output into a video signal and outputs it to the display unit 25. In this embodiment, the information output unit 212 outputs information related to the first route and / or second route (described later) discovered by the server 3.

[0017] The communication unit 22 is an interface for sending and receiving information between the terminal device 2 and the server 3 via the network 4.

[0018] The storage unit 23 stores data for transmission and reception with the server 3, as well as programs and data necessary for information processing by the control unit 21. The storage unit 23 is composed of storage devices such as a hard disk or semiconductor memory (SSD, etc.).

[0019] The operation input unit 24 is an interface for the user to input information into the terminal device 2, and is an information input means such as a keyboard, mouse, touch panel, or microphone (such as the built-in microphone of a mobile device).

[0020] The display unit 25 is an interface that outputs various information from the terminal device 2 to the user, and is, for example, an image display means such as a liquid crystal display or an organic EL display. The display unit 25 may also have an audio output means (speaker) for providing voice guidance, etc.

[0021] Furthermore, if the display unit 25 is a touch panel, the display unit 25 may also function as the operation input unit 24. Also, the display unit 25 does not necessarily have to directly present information to the user. For example, the display unit 25 may output video signals and audio signals to video display means or audio output means connected to the outside of the terminal device 2, or it may output data to an external storage device for storage.

[0022] Next, I will explain Server 3. As shown in Figure 3, the server 3 includes a control unit 31, a communication unit 32, and a storage unit 33.

[0023] The control unit 31 includes an information receiving unit 311 and a route search unit 312. Each part of the control unit 31 is implemented by a processor in the server 3 executing a predetermined program. At least a portion of each part of the control unit 31 may be implemented by hardware.

[0024] The communication unit 32 is an interface for sending and receiving information between the terminal device 2 and the server 3 via the network 4.

[0025] The storage unit 33 includes a location information database 331, a travel cost information database 332, and a map information database 333. This storage unit 33 is composed of a storage device such as a hard disk or semiconductor memory (SSD, etc.). The storage unit 33 may store programs executed by the control unit 31 and data necessary for processing by said programs. At least a portion of the storage unit 33 may be provided on another server that is connected to the server 3 in a manner that allows communication.

[0026] Here, we will describe the details of each part of the control unit 31. The information receiving unit 311 receives information transmitted from the terminal device 2 via the communication unit 32. For example, the information receiving unit 311 receives route search conditions (origin, destination, and intermediate points, etc.) transmitted from the terminal device 2.

[0027] The route search unit 312 performs a route search based on the route search conditions received by the information reception unit 311 and the databases stored in the storage unit 33. In this embodiment, the route search unit 312 searches for a first route and a second route. Here, the first route is a route that optimizes the travel cost from the starting point to the final intermediate point, which is the last intermediate point visited among multiple intermediate points. The second route is a route that optimizes the travel cost from the starting point to the destination, passing through multiple intermediate points. The travel cost may include, for example, at least one of the travel time, travel expenses, and generalized costs of the searched route. Generalized costs refer to costs obtained by statistically processing travel time, travel expenses, etc., and unifying them into a single unit. The method for searching for the first route and the second route will be described later.

[0028] Next, we will describe the details of each database in the memory unit 33. The location information database 331 is a database of location information, including location information and name information, and is mainly used for location searches (e.g., address searches, free word searches, and category searches) and setting locations for route search conditions. The location information database 331 may temporarily store the departure point, destination, or multiple intermediate points received by the information reception unit 311, and the route search unit 312 may acquire this departure point information when searching for a route.

[0029] The travel cost information database 332 is a database used by the route search unit 312 when performing route searches, and contains road network information including travel cost information (costs between nodes). Road network information is represented, for example, by a combination of data for nodes on the road network representation, such as intersections, and data for links, which are road sections between nodes. Note that the road network information may differ for each mode of transportation. In addition, travel costs for each mode of transportation may be set for each link in the road network information.

[0030] The map information database 333 is primarily used for map display or location searching (e.g., latitude and longitude search). For example, the map information database 333 may store map information for overlaying and displaying routes obtained through route searching.

[0031] <Method for searching for the first and second paths> Next, we will explain how to search for the first and second paths with reference to Figures 4 and 5. Figure 4 is a diagram illustrating how to search for the first path, and Figure 5 is a diagram illustrating how to search for the second path.

[0032] First, referring to Figure 4, we will explain how to find the first route (the route in which the travel cost from the starting point to the last of several intermediate points is optimized).

[0033] Figure 4(a) shows a route from the starting point (node ​​S) to the destination (node ​​G), passing through multiple intermediate points (nodes A-C). Note that the route shown in Figure 4(a) is a circular route where the destination is the same as the starting point. Figure 4(b) shows a cost table that stores the costs associated with travel between the starting point, destination, and the multiple intermediate points. Hereafter, such inter-node travel costs will be referred to as inter-node costs.

[0034] Figure 4(a) shows the paths between two nodes extracted from nodes S, G, and nodes A through C. Specifically, the path from node S to node A is shown as route R1, from node A to node B as route R2, from node B to node C as route R3, from node S to node C as route R4, from node C to node A as route R5, and from node B to node G as route R6.

[0035] Figure 4(b) shows the internode costs for travel along the route R1-R6 shown in Figure 4(a). Column CL1 in Figure 4(b) shows the origin node, and row RW1 shows the destination node. The internode costs between the origin and destination are shown in the cells of the cost table.

[0036] Refer to Figure 4(b) to explain a specific example of internode cost. For example, for route R1 between node S and node A, we can refer to the cells corresponding to "S" in column CL1 and "A" in row RW1, and the internode cost in this case is "5". Below, the relationship between a route and the internode cost will be written as "route name(starting point, ending point; internode cost)". In the above case, that is, "route R1(node ​​S, node A; 5)".

[0037] As shown in column CL2 of Figure 4(b), the inter-node cost is always "0" when the destination is node G. More specifically, when traveling from nodes A to C to node G, the inter-node cost is "0" in all cases. This makes it possible to search for the first path.

[0038] As mentioned above, the first route is the route in which the travel cost from the starting point to the last intermediate point among multiple intermediate points is optimized. Therefore, in Figure 4(b), the first route is the route in which the sum of the internode costs from node S to the last node among nodes A to C is optimized (minimized). In the example in Figure 4(b), the first route is the route via route R4 (node ​​S, node C; 2), route R5 (node ​​C, node A; 7), and route R2 (node ​​A, node B; 8), with node B being the final intermediate point. The travel cost of the first route in Figure 4(b) is 17 (= 2 + 8 + 7).

[0039] To summarize the above, in this embodiment, in order to find the first route, the inter-node costs between each node are first obtained. Then, the route that minimizes the sum of the inter-node costs from the starting point to the final waypoint is determined as the first route. At this time, since the inter-node cost between the final waypoint and the destination is always set to "0", it becomes easy to find the first route that allows the fastest arrival at the final waypoint.

[0040] The above method for finding the first route is merely one example; other search methods that optimize the route from the starting point to the final destination may also be used.

[0041] Next, referring to Figure 5, we will explain how to find a second route (a route that optimizes travel costs from the starting point to the destination, passing through multiple intermediate points).

[0042] Figure 5(a), similar to Figure 4(a), shows a route from the starting point (node ​​S) to the destination (node ​​G) that passes through multiple intermediate points (nodes A-C). Note that the route shown in Figure 5(a) is a circular route where the destination is the same point as the starting point. Figure 5(b), similar to Figure 4(b), shows a cost table of inter-node costs related to travel between the starting point, destination, and multiple intermediate points.

[0043] The correspondence between the paths between nodes and routes R1 to R6 in Figure 5(a) is the same as in Figure 4(a). Similarly, the relationship between the inter-node costs in the table and routes R1 to R6 in Figure 5(b) is the same as in Figure 4(b).

[0044] As shown in column CL2 of Figure 5(b), the internode costs are also listed when the destination is node G. More specifically, Figure 5(b) shows route R1 (node ​​S, node A; 5), route R6 (node ​​B, node G; 15), and route R4 (node ​​C, node G; 2). This allows for the search of a second path.

[0045] As described above, the second route is the route in which the travel cost from the starting point to the destination, passing through multiple intermediate points, is optimized (minimized). Therefore, in Figure 5(b), the second route is the route in which the sum of the inter-node costs from node S to node G, passing through nodes A to C, is minimized. More specifically, the second route in Figure 5(b) is the route that goes through route R1 (node ​​S, node A; 5), route R2 (node ​​A, node B; 8), route R3 (node ​​B, node C; 12), and route R4 (node ​​C, node G; 2). The travel cost of the second route in Figure 5(b) is 27 (= 5 + 8 + 12 + 2).

[0046] To summarize the above, in this embodiment, in order to search for a second route, the inter-node costs between each node are first obtained. The route that minimizes the sum of the inter-node costs from the starting point to the destination is then defined as the second route. At this time, the inter-node costs between the final waypoint and the destination are also obtained, making it possible to search for a second route.

[0047] <Processing operation of Information Processing System 1> An example of the processing operation of the information processing system 1 will be explained with reference to the flowcharts in Figures 6A and 6B.

[0048] First, the information acquisition unit 211 of the terminal device 2 acquires information regarding locations (origin, destination, and intermediate points) and the departure time and / or estimated arrival time as route search conditions, and transmits them to the server 3 via the communication unit 22 (step S11). The above route search conditions are input by the user of the terminal device 2 via the operation input unit 24.

[0049] Next, the information receiving unit 311 of server 3 receives information regarding locations and estimated departure / arrival times. Subsequently, the route search unit 312 refers to the location information database 331 and the travel cost information database 332 and obtains the inter-node costs between each location based on the received information regarding locations and estimated departure / arrival times (step S21). Specifically, the route search unit 312 obtains the inter-node costs for combinations of two locations extracted from locations (location S, location G, locations 1-21, etc.) (location S to location 1, location 1 to location 2, or location 2 to location 3) from the travel cost information database 332. Furthermore, inter-node costs may be calculated by server 3 based on information about the roads between locations (e.g., road width, presence of construction / accidents, whether it is a toll road / public road, regulations under the Road Traffic Act, etc.). Inter-node costs may also be varied based on departure time and / or arrival time.

[0050] Next, the route search unit 312 of server 3 searches for a first route and a second route based on the inter-node costs between points obtained in step S21 (step S22). Multiple routes may be searched for as the first route and the second route. For example, route searches may be performed for each condition such as prioritizing distance traveled, prioritizing toll roads, prioritizing general roads, and prioritizing congestion avoidance to obtain multiple first routes.

[0051] In this embodiment, the route search unit 312 uses the map information database 333 to generate information for displaying the first route and the second route on the map. This provides information related to the first route and the second route.

[0052] The information relating to the first and second routes may include, for example, the departure time from the starting point, the estimated arrival time at the destination, the time required to travel along the route, the distance traveled along the route, the toll fees along the route, the estimated arrival time at the final stop, and the time required to reach the final stop (see display window W3 in Figure 8). The route search unit 312 may acquire the above route information for each of the first and second routes. In other words, the information relating to the first and second routes searched by the route search unit 312 includes information for displaying the travel costs of the first and second routes.

[0053] Next, the server 3 transmits the route information relating to the first and second routes found by the route search unit 312 in step S22 to the terminal device 2 via the communication unit 32 (step S23). The route information relating to the first route includes information for displaying at least one of the estimated arrival time and estimated travel time to the final waypoint.

[0054] Next, the information output unit 212 of the terminal device 2 outputs information for displaying the route information related to the first and second routes received from the server 3 in a comparable manner (step S12). Step S12 completes the processing operation of the information processing system 1 of this embodiment.

[0055] Here, with reference to Figure 7, an example of the screen displayed on the display unit 25 in step S11 for the user to input route search conditions will be described.

[0056] As shown in Figure 7, the screen for inputting route search conditions includes input window E1. Furthermore, input window E1 includes input windows E11 to E14.

[0057] Input window E11 is used to input information about the starting point and information related to the selection of the route to search. In the example in Figure 7, "Location S" is entered as the starting point, and "Route 1" is selected as the route to search. The route search unit 312 may also search for Route 2, which is not selected, along with Route 1. Furthermore, if Route 2 is selected, the route search unit 312 may also search for Route 1.

[0058] Input window E12 is used to input information about intermediate stops, destinations, and departure / arrival dates and times. In the example in Figure 7, "Intermediate Stops A-C" are entered as multiple intermediate stops. It may also be possible to input the time required for loading and unloading cargo at each intermediate stop (e.g., 10 minutes). This would allow for a more accurate calculation of the total travel time. In the example in Figure 7, "Location G" is entered as the destination, and "June 11, 2020, 10:00 AM" is entered as the departure date and time. Alternatively, the arrival date and time may be entered instead of the departure date and time.

[0059] Input window E13 is used to enter vehicle type information and information related to priority search. In the example in Figure 7, the vehicle type is used to enter information related to the size of the vehicle used by the traveler (e.g., a medium-sized car). For priority search, the type of route to be prioritized is entered. For example, it may be possible to select from recommended (prioritizing travel time), toll road priority (prioritizing toll roads), or general road priority (prioritizing general roads).

[0060] Input window E14 is used to indicate whether or not to perform a route search. In the example in Figure 7, if "Create" is pressed, a route search will be performed based on the information entered in input windows E11-13. If "Cancel" is pressed, the information entered in input windows E11-13 will be deleted.

[0061] Next, with reference to Figures 8 to 10, comparable display examples related to the first and second routes shown on the display unit 25 in step S12 will be described.

[0062] Figure 8 shows an example where travel costs are displayed in addition to route information. The display unit 25 in Figure 8 displays display windows W1, W2, and W3. Display window W1 shows the first route, and display window W2 shows the second route. As shown in Figure 8, by displaying display windows W1 and W2 side by side, the differences between the first and second routes can be compared at a glance.

[0063] Display windows W1 or W2 in Figure 8 show information about the first and second routes, as well as the departure point (point S), destination (point G), and multiple waypoints (points 1-21). The information about the points can be the address, telephone number, latitude and longitude, or name of the point. Display window W3 in Figure 8 shows information about the departure time or estimated arrival time. The departure time is the time when the vehicle should depart from the departure point, and the estimated arrival time is the time when the vehicle should arrive at the final waypoint or destination.

[0064] Furthermore, in this embodiment, as shown in the display windows W1 and W2 of Figure 8, the order in which points are passed through on the first and second routes is displayed, making it possible to compare the differences between the first and second routes at a glance. For example, "1" is displayed at point P2 in display window W1, and "21" is displayed at point P2 in display window W2. That is, it can be seen at a glance that point P2 is passed through first (1st) on the first route, and point P2 is passed through last (21st) on the second route. In addition, in both the first and second routes, the display of the departure point "S" and the display of the destination "G" are located at point P1. Furthermore, the final waypoint may be displayed in display windows W1 and W2 in a manner that allows it to be distinguished from other waypoints (see Figure 10). For example, the color or shape of the pin display for the final waypoint may be different from the pin displays for other waypoints, or the font or size of the number for the final waypoint may be different from the numbers for other waypoints.

[0065] In Figure 8, display window W3 shows route information (travel cost) for the first and second routes. Specifically, display window W31 shows route information for the first route, and display window W32 shows route information for the second route. As shown in Figure 8, by displaying display windows W31 and W32 side by side, the difference in travel costs between the first and second routes can be compared at a glance.

[0066] As shown in Figure 8, by displaying windows W1, W2, and W3 in a comparable manner, the location and estimated arrival time of the final waypoint can be grasped at a glance. Specifically, in the first route, the final waypoint "21" is displayed at point P3 in display window W1, and the estimated arrival time of the final waypoint "12:50" is displayed in display window W31. Similarly, in the second route, the final waypoint "21" is displayed at point P2 in display window W2, and the estimated arrival time of the final waypoint "13:29" is displayed in display window W32.

[0067] As shown in Figure 8, the location and estimated arrival time of the final waypoint can be easily seen for each of the first and second routes. This allows the user to select either the first or second route according to their purpose. Specifically, if the user wants to shorten the travel time from the departure point to the final waypoint, they can select the first route (by pressing the selection button WB1), while if they want to shorten the travel time from the departure point to the destination, they can select the second route (by pressing the selection button WB2).

[0068] Although Figure 8 shows both the first and second routes, it is also possible to display only the first route and not the second route. In other words, the display window W32 in Figure 8 may be omitted. In this case, more detailed route information related to the first route may be displayed in the display window W4 in Figure 9. For example, the display window W4 may also display the time required to the final waypoint and location information of the final waypoint. This allows the user to grasp more detailed information related to the first route and select a more appropriate route. However, as mentioned above, even if the second route is not displayed, the route search unit 312 may still search for the second route.

[0069] Next, Figure 9 will be explained. Figure 9 shows an example of displaying detailed route information for the first route. Specifically, Figure 9 shows an example of what is displayed on the display unit 25 when the selection button WB1 in Figure 8 is pressed.

[0070] Figure 9 shows that the display window W4 is displayed on the display unit 25, and further shows that the display window W4 includes display window W41, display window W42, display window W43, selection button WB3, and selection button WB4.

[0071] Display windows W41 to W43 all show route information related to the travel cost of the first route. Specifically, display window W41 shows the recommended route among the multiple first routes obtained in the route search, display window W42 shows the toll priority route among the first routes, and display window W43 shows the general priority route among the first routes.

[0072] As shown in Figure 9, by displaying the recommended route, the toll-priority route, and the general priority route for the first route in a comparable manner, users can select the recommended route, the toll-priority route, or the general priority route according to their purpose. For example, if a user wants to take the route recommended by the information processing system 1, they can select the recommended route; if they want to shorten the travel time, they can select the toll-priority route; and if they want to save on toll fees, they can select the general priority route.

[0073] In the screen shown in Figure 9, to select a recommended route, the user presses display window W41 to activate the display of recommended routes and then presses the selection button WB3. Following this user action, the recommended route for the first route is displayed in display window W1 in Figure 8, and the route information for the recommended route for the first route is displayed in display window W31. To change from the first route to the second route, the user presses the selection button WB4 in Figure 9. This returns the user to the display screen of the display unit 25 shown in Figure 8.

[0074] Note that while Figure 9 uses the first route as an example, the second route may be displayed similarly. That is, when the user presses the selection button WB2 in Figure 8, the display window W4 will show the recommended route, the toll priority route, and the general priority route for the second route in a comparable manner.

[0075] The display in Figure 8 and the display in Figure 9 may be displayed simultaneously within the display unit 25. Specifically, the route information for the first route in Figure 8 may be displayed together with the more detailed route information (recommended route, toll priority route, general priority route) in Figure 9. This allows the user to grasp more detailed information about the first route at a glance and select a more appropriate route. If the user selects the second route, the route information for the second route may be displayed together with the more detailed route information for the second route, similar to the case of the first route.

[0076] Next, Figure 10 will be explained. Figure 10 shows an example screen displaying the difference in travel costs between the first and second routes. Specifically, Figure 10 shows an example where the information output unit 212 of the terminal device 2 outputs information to display the difference in travel costs between the first and second routes, and this information is displayed by the display unit 25.

[0077] Figure 10 shows that display window W5 is displayed on the display unit 25, and further shows that display window W5 includes display windows W51, W52, W53, and W54. Display window W51 shows the second route, and the final waypoint, point P2, is marked with "most". Similarly, display window W52 shows the first route, and the final waypoint, point P3, is marked with "most".

[0078] The final waypoints mentioned above are associated with and display their respective estimated arrival times. Specifically, display window W53 displays the estimated arrival time of "12:00" for the final waypoint of the first route, and display window W54 displays the estimated arrival time of "13:29" for the final waypoint of the second route. Display window W53 is associated with point P3 of the first route, and display window W54 is associated with point P2 of the second route.

[0079] Furthermore, the display window W53 also shows the difference in estimated arrival times, "(-1:29)". More specifically, it shows the difference between the estimated arrival time at the final stop of the first route and the estimated arrival time at the final stop of the second route. This allows the user to see at a glance the difference in travel costs (e.g., estimated arrival time at the final stop) between the first and second routes.

[0080] As described above, in this embodiment, a first route is searched that optimizes the travel cost from the starting point to the final transit point, which is the last transit point among multiple transit points, and information related to this first route is output to the user. As a result, the user can understand the optimal route from the starting point to the final transit point and arrive at the final transit point earlier. Consequently, for example, the risk of delivery delays for delivery companies can be reduced.

[0081] In other words, in this embodiment, the route search unit 312 searches for a first route that goes from the starting point to the destination via multiple intermediate points, and for which the travel cost from the starting point to the final intermediate point is optimal. The information output unit 212 then outputs information related to the searched first route. The first route can reduce the risk of delivery delays for delivery companies.

[0082] Furthermore, in this embodiment, a second route is further searched for that optimizes the travel cost from the starting point to the destination via multiple intermediate points. This allows the user to understand both the first and second routes and select the route that best suits their purpose.

[0083] Furthermore, in this embodiment, information is output to display the travel costs of the first route (estimated time, distance traveled, toll fees, etc.) and the travel costs of the second route in a comparable manner. This allows the user to understand the first and second routes more accurately and to select a route more appropriately according to their purpose.

[0084] Furthermore, in this embodiment, information is output to display the difference in travel costs between the first route and the second route. This allows the user to focus on the difference in travel costs (for example, the difference in the estimated arrival time at the final transit point) and easily select the first or second route according to their purpose.

[0085] (Second embodiment) Next, a second embodiment will be described. The information processing system 1A according to the second embodiment includes an automatic dispatch means in addition to the first embodiment. This allows for the automatic dispatch of multiple vehicles, such as trucks. The following description will focus on the differences from the first embodiment.

[0086] <Configuration of Information Processing System 1A> Referring to Figure 11, the configuration of the information processing system 1A according to the second embodiment will be described. The overall configuration of the information processing system 1A and the configuration of the terminal device 2 are the same as in the first embodiment, so their explanation will be omitted.

[0087] As shown in Figure 11, the server 3A includes a control unit 31A, a communication unit 32, and a storage unit 33A. The communication unit 32 is an interface for sending and receiving information between the terminal device 2 and the server 3A via the network 4.

[0088] The control unit 31A includes an information receiving unit 311, a route search unit 312, an automatic vehicle dispatch unit 313, and a statistical information generation unit 314. Each part of the control unit 31A is implemented by a processor in the server 3A executing a predetermined program. At least a portion of each part of the control unit 31A may be implemented by hardware. The information receiving unit 311 and the route search unit 312 are the same as in the first embodiment, so their description is omitted.

[0089] The automatic dispatch unit 313 dispatches vehicles based on vehicle information stored in the vehicle database 334, which will be described later. Furthermore, the automatic dispatch unit 313 assigns passengers to each vehicle dispatched by the automatic dispatch unit 313 based on passenger information stored in the passenger database 335, which will be described later. Note that vehicle information is not limited to being stored in the vehicle database 334, but may also be stored in association with passengers stored in the passenger database 335.

[0090] Here, the automatic dispatching performed by the automatic dispatching unit 313 includes, for example, automatic dispatching to equalize the number of cases, automatic dispatching to equalize working hours, or automatic dispatching to calculate the required number of vehicles. Specifically, in automatic dispatching that equalizes the number of cases, if the number of travelers (traveling vehicles) is fixed, the scheduled cases are allocated equally to each traveler. In automatic dispatching that equalizes working time, the routes (first route or second route) on which travelers visit each point are calculated, and the points are allocated so that the time required to travel along the route is equal. In automatic dispatching that calculates the required number of vehicles, the cargo volume for each case is set as a precondition, and the cargo capacity that the traveling vehicles to be used and the working time per traveler are specified. Then, the optimal number of people to carry out deliveries that meet these preconditions is calculated and cases are allocated. Note that automatic dispatching by the automatic dispatching unit 313 may be performed by methods other than those described above.

[0091] The statistical information generation unit 314 statistically processes information stored in the travel cost information database 332 regarding the first route and / or second route previously explored by the route search unit 312. This generates statistical information related to the first route and / or second route. This statistical information includes, for example, the number of times (frequency) that the user used each of the first and second routes in the past month.

[0092] The storage unit 33A includes a location information database 331, a travel cost information database 332, a map information database 333, a vehicle database 334, and a traveler database 335. This storage unit 33A is composed of a storage device such as a hard disk or semiconductor memory (SSD, etc.). The storage unit 33A may store programs executed by the control unit 31A and data necessary for processing by said programs. The storage unit 33A may be provided on another server that is connected to the server 3A in a manner that allows communication. Furthermore, the location information database 331, the travel cost information database 332, and the map information database 333 are the same as in the first embodiment, so their description is omitted.

[0093] The vehicle database 334 is a database that stores vehicle information. The passenger database 335 is a database that stores information about passengers. A passenger is a person who travels by riding in a vehicle stored in the vehicle database 334. A passenger is, for example, a delivery person who collects and delivers cargo. In this case, the departure point, destination, or multiple intermediate points are delivery depots (warehouses, delivery centers, etc.) or vehicle depots where cargo is collected and delivered.

[0094] Next, an example of vehicle information stored in the vehicle database 334 will be described with reference to Figure 12. As shown in Figure 12, the vehicle information includes, for example, the vehicle ID, the vehicle status, the vehicle's load capacity, and the vehicle's size. The vehicle information may also include more detailed information, such as the vehicle's load capacity and the vehicle's weight. In Figure 12, the vehicle is a delivery vehicle (truck or trailer, etc.) used by a delivery company.

[0095] The vehicle ID is information used to identify a vehicle. In Figure 12, the vehicle ID is a serial number. The vehicle ID is not limited to this, as long as it is information that can identify the vehicle; for example, it could be the vehicle number (license plate number). The vehicle status is information about the current state of the vehicle. As shown in Figure 12, the vehicle status is information such as "Garage" indicating that the vehicle is parked in the garage, or "Delivery" indicating that the vehicle is in operation for cargo collection and delivery.

[0096] Load capacity refers to the number of cargo items that can be loaded if the vehicle is a delivery vehicle. Vehicle size refers to the physical dimensions of the vehicle. In addition to dimensions, vehicle size may also refer to the type of license, as shown in Figure 12. That is, for trucks with a gross vehicle weight of less than 8 tons, information such as "8-ton limited medium-sized" may be used as vehicle size, and for trucks with a gross vehicle weight of less than 11 tons, information such as "medium-sized" may be used. Note that, as shown in Figure 12, vehicle size may differ from vehicle to vehicle, or it may be the same.

[0097] Next, with reference to Figure 13, an example of traveler information stored in the traveler database 335 will be described. As shown in Figure 13, the traveler information includes, for example, the traveler ID, the traveler's experience with collection and delivery offices, and the traveler's licenses. Note that the traveler in Figure 13 is a collection and delivery worker.

[0098] The traveler ID is information used to identify a traveler. As shown in Figure 13, the traveler ID is a serial number. The traveler ID is not limited to this, as long as it can identify the traveler, it may also be an employee number or a personal name, for example.

[0099] Experience with a distribution center refers to information indicating whether or not a traveler has experience collecting or delivering goods at that center. For example, it may include identification information for distribution centers where the traveler has experience collecting or delivering goods. Because experienced travelers are familiar with the specifics of the distribution center (such as the location and size of the parking lot and the center's operating hours), they can carry out goods collection and delivery more quickly and efficiently.

[0100] The driver's license held by the traveler is the type of license the traveler actually possesses. As shown in Figure 13, the held license is the type of license, such as an 8-ton limited medium-sized vehicle license or a large vehicle license. In addition, the held license information may also include whether it is a Class 1 or Class 2 license to further understand the traveler's driving skills.

[0101] As shown in Figure 13, for example, traveler B0001 has experience at the collection and delivery stations at points P1, P2, and P3, and holds an 8-ton limited medium-sized vehicle license. Note that traveler information may be updated accordingly if there are any changes in traveler experience at collection and delivery stations or licenses held.

[0102] The automatic dispatching by the automatic dispatching unit 313 of the control unit 31A will be explained in detail. The automatic dispatching unit 313 can automatically dispatch vehicles according to various conditions (number and location of cargo, number and type of vehicles, etc.) by using the above-mentioned vehicle information and passenger information. Specifically, the automatic dispatching unit 313 can extract vehicles that are currently available for dispatch based on the vehicle status (garage / collection / delivery) and can calculate the number of cargo items that can be loaded based on the load capacity of the extracted vehicles. In addition, the automatic dispatching unit 313 can dispatch vehicles according to the road width and conditions based on the vehicle size. Furthermore, the automatic dispatching unit 313 may dispatch vehicles based on the experience and / or license held by the passenger (driver). Note that if all vehicles are the same size, the automatic dispatching unit 313 can dispatch vehicles without considering the vehicle size.

[0103] <Processing operation of Information Processing System 1A> Referring to the flowcharts in Figures 14A and 14B, an example of the processing operation of the information processing system 1A according to the second embodiment will be explained. This processing operation is an example where the person moving is a delivery person.

[0104] First, the information acquisition unit 211 of the terminal device 2 acquires location information (origin, destination, intermediate locations) and estimated departure and / or arrival times as route search conditions, and in addition, acquires information regarding the number of cargo items. The information acquisition unit 211 then transmits this information to the server 3 via the communication unit 22 (step S31). Similar to the first embodiment, the location information may be the address, telephone number, latitude and longitude, or name of the location. The number of cargo items is the total number of cargo items that the traveler must collect and deliver. In addition to the number of cargo items, the information acquisition unit 211 may also acquire information regarding the size and weight of the cargo items.

[0105] Next, the information receiving unit 311 of server 3 receives information regarding the location, departure time / estimated arrival time, and the number of cargo items. Subsequently, the automatic dispatch unit 313 refers to the vehicle database 334 and, based on the received information regarding the location, departure time / estimated arrival time, and the number of cargo items, dispatches vehicles for each collection and delivery point based on the number of cargo items (step S41). For example, the automatic dispatch unit 313 dispatches vehicles according to the number of cargo items by comparing the number of cargo items with the size of the vehicles, or by extracting available vehicles based on their operational status. In order to improve the efficiency of cargo collection and delivery, the automatic dispatch unit 313 may also dispatch vehicles to assign nearby collection and delivery points to the same vehicle.

[0106] In step S41, the automatic dispatching may be performed to equalize the number of cases, to equalize the working hours, or to calculate the required number of vehicles. For example, in the case of automatic dispatching to equalize the number of cases, as shown in Figure 15, cases are allocated so that the number of cases handled by vehicle A0001 and the number of cases handled by vehicle A0005 are equal. In this example, vehicle A0001 is assigned four cases (points P1 to P4), and vehicle A0005 is also assigned four cases (points P5 to P8).

[0107] Next, the route search unit 312 of server 3 refers to the location information database 331 and the travel cost information database 332 and obtains the inter-node cost between each location based on the received information on the location and departure / arrival time (step S42). Specifically, as shown in Figure 15, the route search unit 312 obtains the inter-node cost for combinations of two locations extracted from the locations (point S1, point G1, and points P1-P8). Similar to the first embodiment, the inter-node cost is obtained based on information about roads between points (e.g., road width, presence of construction / accidents, whether it is a toll road or a public road, regulations under the Road Traffic Act, etc.). The inter-node cost may also reflect changes over time based on departure time and / or arrival time information.

[0108] Next, the route search unit 312 of server 3 refers to the map information database 333 and searches for a first route for each vehicle based on the inter-node costs between the acquired points (step S43). As described above, Figure 15 shows an automated vehicle dispatch system that equalizes the number of cases, where vehicle A0001 is assigned (dispatched) to visit points P1, P2, P3, and P4, and vehicle A0005 is assigned (dispatched) to visit points P5, P6, P7, and P8. In this case, the route search unit 312 searches for a first route for each of vehicle A0001 and vehicle A0005 that optimizes the travel cost from point S1 to the final collection and delivery station.

[0109] In the example shown in Figure 15, two vehicles, A0001 and A0005, are shown patrolling the route, but the number of vehicles to be dispatched is not limited to two. That is, the automatic dispatch unit 313 dispatches vehicles appropriately, taking into account the number and size of vehicles, depending on the number of cargo and the number and location of collection and delivery points. For example, the automatic dispatch unit 313 dispatches vehicles so that at least one of the following is equal: the number of collection and delivery points to be passed through, the number of cargo to be collected and delivered, and the working time of the drivers.

[0110] In the example in Figure 15, the first route is shown when the automatic dispatch in step S41 is based on equal distribution of cases. However, automatic dispatch may also be performed by equalizing working hours or by calculating the required number of vehicles. In this case, the number of cases assigned to vehicles A0001 and A0005 may differ from that shown in Figure 15. That is, the first route for vehicles A0001 and A0005 may differ from the first route shown in Figure 15, depending on the method of automatic dispatch (equal distribution of cases, equal distribution of working hours, or allocation based on the calculation of the required number of vehicles).

[0111] Furthermore, the information relating to the first route searched in step S43 includes information for displaying the first route on a map, similar to the first embodiment. In addition, in step S43, the route search unit 312 may further search for a second route for each dispatched vehicle. In this case, the information relating to the second route includes information for displaying the second route on a map.

[0112] Next, the automatic dispatch unit 313 of server 3 refers to the passenger database 335, assigns passengers to each vehicle, and creates dispatch information (step S44). Specifically, the automatic dispatch unit 313 assigns passengers to each vehicle based on the passenger's experience and licenses stored in the passenger information shown in Figure 13. For example, the automatic dispatch unit 313 assigns a vehicle to a passenger who has the necessary license to drive that vehicle. Figure 16 is an example of dispatch information created by the automatic dispatch unit 313, where passengers are assigned to each vehicle.

[0113] Next, the route information for the first and second routes for each vehicle, which has been searched by the route search unit 312 of the server 3, and the dispatch information created by the automatic dispatch unit 313 are transmitted to the terminal device 2 via the communication unit 32 (step S45).

[0114] Next, the information output unit 212 of the terminal device 2 outputs route information related to the first and second routes for each received vehicle, as well as information related to vehicle dispatch (step S32). Step S32 completes one example of the processing operation of the information processing system 1A of this embodiment.

[0115] Here, with reference to Figures 15 and 16, an example of the display of information for showing route information related to the first and second routes for each vehicle, and information related to vehicle dispatch, as shown on the display unit 25 in step S32 will be explained.

[0116] Figure 15 shows an example of route information for vehicles A0001 and A0005 displayed on the display unit 25. As described above, the display unit 25 shows the case where vehicle A0001 is assigned to a route consisting of routes R7 to R10, and vehicle A0005 is assigned to a route consisting of routes R11 to R14. Points P1 to P8 each represent a collection and delivery station. In Figure 15, only the first route is displayed for each of vehicles A0001 and A0005, but a second route may also be displayed in addition to the first route.

[0117] Figure 16 shows an example where information assigning travelers to each vehicle is displayed on the display unit 25. As shown in Figure 16, the vehicle (vehicle ID), the travelers (traveler ID), the departure point, the destination, the collection / delivery point, and the total number of cargo items are associated and displayed.

[0118] For example, the first record (No. 1) indicates that vehicle A0001 is assigned to passenger B0001. Vehicle A0001's departure point is point S1, and its destination is point G1. Vehicle A0001 travels from its departure point to its destination via points P1 to P4. As shown in Figure 16, the number of cargo items collected and delivered in association with each collection and delivery point may also be displayed. Vehicle A0001 collects and delivers 30 items at point P1, 15 items at point P2, 25 items at point P3, and 30 items at point P4. Alternatively, the total number of cargo items collected and delivered at points P1 to P4 (30 + 15 + 25 + 30 = 100 items) may also be displayed. The second record (No. 2) shows similar information for vehicle A0005.

[0119] In the above explanation, vehicles were determined first, and then travelers were assigned to vehicles. However, this is not the only way; travelers may be determined first, and then vehicles may be assigned to them. In other words, vehicles may be linked to travelers, and then vehicles may be automatically dispatched by assigning travelers to these vehicles. In this case, server 3A may omit the vehicle database 334. Furthermore, the above explanation assumes the existence of a passenger database 335, as passengers are assigned to vehicles after the vehicles have been determined. However, this is not the only option. In other words, the passenger database 335 can be omitted by associating passengers with vehicles. In this case, step S44 is not performed.

[0120] As described above, the information processing system 1A according to the second embodiment further includes, in addition to the information processing system 1 of the first embodiment, a vehicle database 334 that stores vehicle information and an automatic dispatch unit 313 that dispatches vehicles based on the vehicle information. As a result, according to the second embodiment, in addition to the effects of the first embodiment, the user can understand the first route for each automatically dispatched vehicle.

[0121] Furthermore, the information processing system 1A also includes a passenger database 335, and the automatic dispatch unit 313 assigns passengers to each automatically dispatched vehicle based on the passenger database 335. This allows the automatic dispatch unit 313 to assign appropriate passengers to automatically dispatched vehicles based on passenger information (experience at the collection and delivery center, licenses held, etc.).

[0122] Furthermore, in this embodiment, the information processing system 1A outputs the number of cargo items to be collected and delivered at each transit point (delivery depot) as information related to vehicle dispatch. This allows the user to understand the number of cargo items to be collected and delivered at each delivery depot.

[0123] Two embodiments of the present invention have been described above. In either embodiment, the route from the starting point to the final transit point can be optimized.

[0124] Furthermore, in two embodiments of the present invention, the travel cost information database 332 may store information relating to the first and / or second routes previously searched by the route search unit 312, and the statistical information generation unit 314 may generate statistical information relating to the first and / or second routes by statistically processing the stored information. For example, the statistical information generation unit 314 may generate statistical information on the number of times (frequency) that the user used the first route and the second route during the past month. This statistical information makes it easy to understand whether the user used the first route and the second route. As another example, the statistical information generation unit 314 may calculate the total travel time from the starting point to the final destination of the first route used by the user over the past month, and the total travel time of the second route, and generate the difference as statistical information. This statistical information makes it easy to understand the amount of travel time saved by using the first route compared to the second route. The display unit 25 of the terminal device 2 may also display the above statistical information in a table or graph format. By displaying the statistical information on the display unit 25 in this way, the user can grasp the results of the generated statistical information at a glance.

[0125] Note that the configurations in Figures 1-3 and Figure 11 are examples, and at least some of the configuration requirements in servers 3 and 3A may be located within terminal device 2. For example, the control units 31 and 31A and storage units 33 and 33A in servers 3 and 3A may be located within terminal device 2 to configure an information processing or display device that can perform route searching and / or automatic vehicle dispatch using only terminal device 2 without communication. In this case, the information receiving unit 311 may be omitted.

[0126] At least a part of the information processing system described in the above-described embodiment may be configured with hardware or with software. If configured with software, a program that realizes at least a part of the functions of the information processing system may be stored on a recording medium such as a flexible disk or CD-ROM, loaded into a computer, and executed. The recording medium is not limited to removable ones such as magnetic disks or optical disks, but may also be a fixed recording medium such as a hard disk drive or memory.

[0127] Furthermore, programs that implement at least some of the functions of an information processing system may be distributed via communication lines such as the Internet (including wireless communication). In addition, such programs may be encrypted, modulated, or compressed and distributed via wired or wireless lines such as the Internet, or stored on a recording medium.

[0128] Furthermore, the information processing system may be made to function using one or more information processing devices. When multiple information processing devices are used, one of the information processing devices may be a computer, and the computer may execute a predetermined program to realize the function of at least one means of the information processing system.

[0129] Furthermore, in the invention of a method, all steps may be automatically controlled by a computer. Alternatively, each step may be performed by a computer while the progress between steps is controlled manually. Furthermore, at least a portion of all steps may be performed manually.

[0130] Based on the above description, those skilled in the art may conceive of additional effects and various modifications of the present invention, but the embodiments of the present invention are not limited to the individual embodiments described above. Various additions, modifications, and partial deletions are possible without departing from the conceptual idea and spirit of the present invention derived from the claims and their equivalents. [Explanation of Symbols]

[0131] 1. 1A Information Processing System 2 Terminal devices 21 Control Unit 211 Information Acquisition Department 212 Information Output Unit 22 Communications Department 23 Memory section 24 Operation Input Section 25 Display section 3, 3A Server 31, 31A Control Unit 311 Information Reception Department 312 Route Search Unit 313 Automated Dispatch Unit 314 Statistical information generation section 32 Communications Department 33, 33A storage section 331 Location Information Database 332 Travel Cost Information Database 333 Map Information Database 334 Vehicle Database 335 Mobile Person Database 4 Network E1, E11~14 Input windows Display windows W1-5, W32-32, W41-43, W51-54 WB1-4 Selection Button S1, G1, P1-8 points Routes R1-14

Claims

1. A route search means for a first route that goes from a starting point to a destination via multiple intermediate points, wherein the first route is arranged in an order that optimizes the travel cost between the starting point and the final intermediate point, Information output means for outputting information related to the first route, An information processing system characterized by comprising the following features.

2. The information processing system according to claim 1, characterized in that the information relating to the first route includes information for displaying the travel cost of the first route.

3. The information processing system according to claim 2, characterized in that the information relating to the first route includes information for displaying at least one of the estimated arrival time and estimated duration of arrival at the final waypoint.

4. The route search means further searches for a second route that optimizes the travel cost from the departure point to the destination point via the plurality of intermediate points. An information processing system according to any one of claims 1 to 3, characterized by the above.

5. The information processing system according to claim 4, characterized in that the information output means outputs information for displaying the first route and the second route in a comparable manner.

6. The information output means outputs information to display the difference in travel costs between the first route and the second route. The information processing system according to claim 5, characterized by the following:

7. The system further includes an automated dispatching mechanism that dispatches multiple vehicles based on vehicle information related to the vehicles. The route search means searches for a first route that optimizes the travel cost from the starting point to the final intermediate point, which is the last of several intermediate points, for each of the multiple vehicles that have been dispatched. An information processing system according to any one of claims 1 to 6, characterized by the above.

8. The first route searched for each of the multiple vehicles dispatched is a different route. The information processing system according to claim 7, characterized by the following:

9. Furthermore, it includes a passenger database that stores passenger information for multiple passengers traveling in a vehicle, The automatic dispatch means assigns a passenger to each of the multiple vehicles dispatched based on the passenger information. The information processing system according to claim 7 or 8, characterized by the above.

10. The aforementioned mobile operator is a delivery company that collects and delivers cargo, The aforementioned multiple transit points are collection and delivery centers for the cargo, The aforementioned traveler information includes at least one of the following: the type of driver's license held by the delivery company, and the experience related to the delivery station. The information processing system according to claim 9, characterized by the following:

11. The information processing system according to any one of claims 7 to 10, characterized in that the route search means further searches for a second route that optimizes the travel cost from the departure point to the destination, passing through the plurality of intermediate points, for each of the dispatched vehicles.

12. A travel cost information database that stores information relating to the first and / or second routes previously explored by the route search means, The system further comprises statistical information generation means that generates statistical information relating to the first route and / or the second route by statistically processing the accumulated information, An information processing system according to any one of claims 1 to 11, characterized by the above.

13. An information processing program executed on a terminal device that is connected to a server in a manner that enables communication, The server has a route search means that searches for a first route from a departure point to a destination via a plurality of intermediate points, the first route being arranged in an order that optimizes the travel cost from the departure point to the final intermediate point, among the plurality of intermediate points. The aforementioned information processing program is an information processing program that causes a computer to function as an information output means for outputting information related to the first path.

14. Computers, A route search means for a first route that goes from a starting point to a destination via multiple intermediate points, wherein the first route is arranged in an order that optimizes the travel cost between the starting point and the final intermediate point, which is the last intermediate point visited among the multiple intermediate points. An information processing program designed to function as such.

15. An information processing system comprising multiple computers connected in a communicative manner, A route search means for a first route that goes from a starting point to a destination via multiple intermediate points, wherein the first route is arranged in an order that optimizes the travel cost between the starting point and the final intermediate point, Information output means for outputting information related to the first route, In order to make an information processing system equipped with the following functions, An information processing program for causing at least one of the above-mentioned computers to function as at least one of the above-mentioned means.

16. To enable the information processing system described in any one of claims 1 to 12 to function using multiple computers connected in a communicative manner, An information processing program for causing one of the above-mentioned computers to function as at least one of the means in the information processing system described in any one of claims 1 to 12.

17. An information processing program for causing a computer to function as at least one of the means in the information processing system described in any one of claims 1 to 12.

18. Multiple information processing devices connected in a communicative manner, A route search means for a first route that goes from a starting point to a destination via multiple intermediate points, wherein the first route is arranged in an order that optimizes the travel cost between the starting point and the final intermediate point, Information output means for outputting information related to the first route, In order to configure an information processing system that includes, An information processing device characterized by comprising at least one of the above-described means.

19. Computers, A route search means for a first route from a starting point to a destination via multiple intermediate points, wherein the first route is arranged in an order that optimizes the travel cost between the starting point and the final intermediate point, and Information output means for outputting information related to the first route An information processing program designed to function as such.

20. A computer-based information processing method, The computer's route search means searches for a first route from a starting point to a destination via a plurality of intermediate points, the first route being arranged in an order that optimizes the travel cost between the starting point and the final intermediate point, The computer's information output means outputs information related to the first route, An information processing method characterized by comprising:

Images