Route search method and delivery planning device

Abstract

The present invention includes a prior search procedure for generating label data on the basis of road data and restriction data, and a route determination procedure for determining a route between points on the basis of the label data. The prior search procedure includes: a procedure for generating, on the basis of the road data, information pertaining to hubs composed of a plurality of nodes; and a procedure for retaining, as label data, a direction in which passage is possible in a hub if a route is set between each node and the hub, for each of the nodes on the basis of the road data and the restriction data. The route determination procedure includes a procedure for determining, as a route between points, a route corresponding to a combination in which there is no contradiction between the direction of passage in a hub, the direction in which passage is possible in the hub when entering the hub, and the direction in which passage is possible in the hub when exiting the hub, from among combinations of a hub, a route entering the hub, and a route exiting the hub.

Description

Route search method and delivery planning device Incorporation by Reference

[0001] This application claims priority from Japanese Patent Application No. 2023-209916, filed on December 13, 2023, the contents of which are incorporated herein by reference.

[0002] The present invention relates to a route search technology, and more particularly to a route search technology used when creating a delivery plan in a logistics business.

[0003] Known route search technologies in the field of logistics include those disclosed in, for example, Japanese Patent Laid-Open No. 2023-095005 (Patent Document 1) and US 2015 / 0347629 (Patent Document 2). Patent Document 1 states that "a delivery plan creation method for creating a circular route that minimizes an objective function that formulates the sum of the total travel distances of a vehicle from a delivery base, traveling the route distances between delivery destinations, and returning to the delivery base, calculates the objective function by, when delivering packages from one delivery base to N delivery destinations, excluding in advance, from N-1 routes from one delivery destination to the other N-1 delivery destinations, routes with an exclusion rate exceeding 0%, in descending order of distance, starting from the longest route."

[0004] Patent document 2 describes a hub labeling technology in which routes between any node and a hub are searched for in advance, and when the departure node and destination node are determined, a search is made for hubs for which routes between the respective nodes have already been searched.

[0005] Patent Document 1: JP 2023-095005 A Patent Document 2: US Patent Application Publication No. 2015 / 0347629

[0006] When creating a delivery plan in a logistics business, a route information matrix between logistics bases is required as an input for the plan. In this case, it is necessary to search for a number of routes close to the square of the number of bases. When deliveries to residential homes are also anticipated, any point on a map could be the delivery destination, making it difficult to search for routes between bases in advance. After the delivery destination is determined, it is necessary to search for multiple routes in a short period of time. Furthermore, when a vehicle needs to be refueled or charged near the delivery route, it is not clear when it is optimal to stop at a refueling or charging station. Therefore, it is necessary to search for routes between multiple bases, including the logistics bases mentioned above and nearby refueling or charging stations, which takes even more time.

[0007] According to Patent Document 1, the amount of calculation is reduced by excluding routes in advance based on the distance between base stations. However, in reality, there are cases where a route between distant base stations is optimal due to constraints such as delivery time, so it is desirable to shorten calculation time by speeding up route search between base stations without excluding routes based on distance.

[0008] According to the hub labeling technology described in Patent Document 2, instead of searching in advance for all combinations between arbitrary nodes, routes from an arbitrary node to a hub and routes from a hub to an arbitrary node are searched in advance. Then, once the departure node and destination node are determined, a hub is searched for in advance for routes from the determined departure node and routes to the determined departure node, and the route passing through the hub with the lowest cost becomes the shortest route. This reduces the calculation time after the departure node and destination node are determined.

[0009] However, as mentioned above, Hub Labeling is a method of dividing the route into sections before and after the hub and conducting a preliminary search, so if there are traffic restrictions across the hub, it is not possible to search for a route that corresponds to the traffic restrictions. For example, if there are traffic restrictions such as no right turns at an intersection that corresponds to a hub, it is not possible to determine which directions are passable from the hub unless it is known from which direction the hub was entered. For this reason, there are cases where the route searched by Hub Labeling is actually impassable.

[0010] In order to achieve at least one of the above objects, the present invention provides a route search method executed by a computer system having a processor and a storage device, wherein the storage device holds road data including information on a road network and regulation data including information on traffic regulations set on the road network, and the route search method includes a preliminary search step in which the processor generates label data based on the road data and the regulation data, and a route determination step in which the processor determines a route between points based on the label data, and the preliminary search step includes a first step in which the processor generates information on a hub consisting of a plurality of nodes of the road network based on the road data, and a second step in which the processor, based on the road data and the regulation data, stores as label data the direction of travel at the hub when a route is set between each node included in the road network and the hub, and the route determination step is characterized in that the processor determines, as the route between the points, a route corresponding to a combination of the hub, a route entering the hub, and a route exiting the hub, where the direction of travel at the hub is included in both the direction of travel at the hub when entering the hub and the direction of travel at the hub when exiting the hub.

[0011] According to one aspect of the present invention, it is possible to generate a route that reflects traffic regulations while reducing the time required for route search after the departure point and destination have been specified.

[0012] Other problems, configurations and effects will become apparent from the following description of the embodiments.

[0013] FIG. 1 is a functional block diagram showing an example of a configuration of a delivery planning device in an embodiment of the present invention. FIG. 2 is a block diagram showing an example of a hardware configuration for realizing the delivery planning device in an embodiment of the present invention. FIG. 3 is an explanatory diagram showing an example of road data and regulation data held by the delivery planning device in an embodiment of the present invention. FIG. 4 is an explanatory diagram showing an example of a data structure of road data held by the delivery planning device in an embodiment of the present invention. FIG. 5 is an explanatory diagram showing an example of a data structure of regulation data held by the delivery planning device in an embodiment of the present invention. FIG. 6 is an explanatory diagram showing an example of a hub set on a road network by the delivery planning device in an embodiment of the present invention. FIG. 7 is an explanatory diagram showing an example of a data structure of hub data held by the delivery planning device in an embodiment of the present invention. FIG. 8 is an explanatory diagram showing an example of a data structure of departure location side label data held by the delivery planning device in an embodiment of the present invention. FIG. 9 is an explanatory diagram showing an example of a data structure of destination location side label data held by the delivery planning device in an embodiment of the present invention. FIG. 1 is an explanatory diagram showing a specific example of generation of departure side label data by a preliminary search unit of a delivery planning device in an embodiment of the present invention. FIG. 2 is an explanatory diagram showing a specific example of generation of destination side label data by a preliminary search unit of a delivery planning device in an embodiment of the present invention. FIG. 3 is an explanatory diagram showing a specific example of generation of destination side label data by a preliminary search unit of a delivery planning device in an embodiment of the present invention. FIG. 4 is an explanatory diagram showing a specific example of generation of destination side label data by a preliminary search unit of a delivery planning device in an embodiment of the present invention. FIG. 5 is a flowchart showing an example of processing executed by a route determination unit of a delivery planning device in an embodiment of the present invention. FIG. 6 is a flowchart showing an example of processing executed by a route determination unit of a delivery planning device in an embodiment of the present invention. FIG. 7 is an explanatory diagram showing a specific example of processing for generating a route by a route determination unit of a delivery planning device in an embodiment of the present invention.FIG. 1 is an explanatory diagram showing a specific example of a process in which a route determination unit of a delivery planning device in an embodiment of the present invention generates a route. FIG. 2 is an explanatory diagram showing a specific example of a process in which a route determination unit of a delivery planning device in an embodiment of the present invention generates a route. FIG. 3 is an explanatory diagram showing a specific example of a process in which a route determination unit of a delivery planning device in an embodiment of the present invention generates a route. FIG. 4 is an explanatory diagram showing an example of a process performed by a delivery planning device in an embodiment of the present invention based on conditional traffic regulations.

[0014] Hereinafter, an embodiment of the present invention will be described with reference to the drawings.

[0015] FIG. 1 is a functional block diagram showing an example of the configuration of a delivery planning device according to an embodiment of the present invention.

[0016] The delivery planning device 100 of this embodiment includes a preliminary search unit 101, a route determination unit 102, a delivery planning unit 103, an input unit 104, a display unit 105, and a storage unit 106. The storage unit 106 stores road data 107, regulation data 108, and label data 109.

[0017] The preliminary search unit 101 performs a preliminary search for hub labeling based on the road data 107 and the regulation data 108, and stores the generated labels in the storage unit 106 as label data 109. Details of the road data 107, the regulation data 108, and the label data 109, as well as details of the processing by the preliminary search unit 101, will be described later.

[0018] When base information 110 including information specifying a departure point and a destination is input via the input unit 104, the route determination unit 102 determines a route from the departure point to the destination and generates inter-base route information 111. Details of the processing of the route determination unit 102 and details of the generated inter-base route information 111 will be described later.

[0019] The delivery plan unit 103 generates a delivery plan based on the generated inter-base route information 111 and displays it via the display unit 105. Since the delivery plan can be generated using known technology, detailed description thereof will be omitted.

[0020] FIG. 2 is a block diagram showing an example of a hardware configuration for realizing the delivery planning device 100 according to the embodiment of the present invention.

[0021] The delivery planning device 100 of this embodiment shown in Fig. 1 can be realized by a computer system, and Fig. 2 shows a computer system 200 as an example.

[0022] The computer system 200 includes a processor 201, a memory (main storage device) 202, an auxiliary storage device 203, an output device 204, an input device 205, and a communication interface (I / F) 206. The above components are connected to each other via a bus. The memory 202 and the auxiliary storage device 203 are storage devices that store programs and data used by the processor 201. The memory 202 and the auxiliary storage device 203 correspond to the storage unit 106 in FIG. 1 .

[0023] The memory 202 is configured, for example, by a semiconductor memory, and is mainly used to hold programs and data that are being executed. For example, programs and data stored in the auxiliary storage device 203 are loaded into the memory 202 at startup or when needed. The processor 201 executes various processes in accordance with the programs stored in the memory 202. The processor 201 operates in accordance with the programs to realize various functional units (for example, the advance search unit 101, route determination unit 102, delivery plan unit 103, input unit 104, and display unit 105 shown in FIG. 1 ).

[0024] The auxiliary storage device 203 is configured with a large-capacity storage device such as a hard disk drive or a solid state drive, and is used to store programs and data for a long period of time. For example, the auxiliary storage device 123 may store road data 107, regulation data 108, label data 109, base information 110, inter-base route information 111, and delivery plan 112.

[0025] Processor 201 may be comprised of a single processing unit or multiple processing units and may include single or multiple arithmetic units or multiple processing cores. Processor 201 may be implemented as one or more central processing units, microprocessors, microcomputers, microcontrollers, digital signal processors, state machines, logic circuits, graphics processing units, systems on a chip, and / or any device that manipulates signals based on control instructions.

[0026] The input device 205 is a hardware device through which a user inputs instructions, information, etc. The output device 204 is a hardware device that presents various images for input and output, such as a display device or a printing device. For example, a processor controls the input device 205 and the output device 204 according to a program, thereby realizing the functions of the input unit 104 and the output unit 105. The communication I / F 206 is an interface for connection to a communication network (not shown).

[0027] The computer system 200 may include two or more processors 201. Furthermore, the functions of the delivery planning device 100 can be implemented in multiple computer systems 200. In this case, the multiple computer systems 200 communicate with each other via a communication network. For example, some of the multiple functions of the system of this embodiment may be implemented in one computer system 200, and other parts may be implemented in other computer systems 200.

[0028] For example, the computer system 200 may be a PC owned by a user (e.g., a logistics company) of the delivery planning device 100 of this embodiment, or may be a server or the like that the user accesses via a communication network. In the latter case, the computer system 200 may be a so-called virtual server or the like on the cloud. In the latter case, the computer system 200 shown in FIG. 1 is realized by computer resources on the cloud.

[0029] Next, the road data 107 and the regulation data 108 will be described with reference to FIGS.

[0030] FIG. 3 is an explanatory diagram showing an example of the road data 107 and the regulation data 108 held by the delivery planning device 100 in the embodiment of the present invention.

[0031] FIG. 3 shows an example road network 300 for explaining this embodiment. In FIG. 3, circular shapes represent nodes, and lines connecting the nodes represent links. For example, nodes correspond to intersections, and links correspond to road sections connecting the intersections. Numbers written on the nodes are the node identification numbers (node ​​IDs). In the following explanation, a node identified by, for example, node ID "1" will be referred to as "node 1."

[0032] Among the links, those marked with an arrow are links that can only be traveled in the direction of the arrow (for example, links indicating one-way roads), and other links are links that can be traveled in both directions. The numbers displayed near each link are the cost of each link. The cost may represent, for example, the distance from the start point to the end point of each link, or the time required to travel from the start point to the end point of each link, or it may be a value calculated based on both of these, or it may be a value that reflects other parameters.

[0033] Furthermore, traffic restrictions are set in the road network 300 shown in Fig. 3. Specifically, the route that enters node 2 from node 5 and exits node 3, and the route that enters node 5 from node 8 and exits node 6 are not passable due to the restrictions.

[0034] FIG. 4 is an explanatory diagram showing an example of the data structure of the road data 107 held by the delivery planning device 100 in the embodiment of the present invention.

[0035] The road data 107 includes, for example, multiple records, each corresponding to a link. Each record includes a start node ID 401, an end node ID 402, a travel direction 403, and a cost 404. The start node ID 401 and the end node ID 402 indicate the identification numbers of the start and end nodes of each link, respectively. The travel direction 403 indicates the passable direction for each link. In this example, the direction from the start node to the end node is the "forward direction," and the opposite direction is the "reverse direction." The travel direction 403 for a link that is passable in either direction is "both directions," and the travel direction 403 for a link that is passable in either direction is "impassable." The cost 404 indicates the cost of each link.

[0036] 4 shows, as an example, a record indicating that a link starting from node 1 and ending at node 2 can be traveled in the forward direction, and that the cost is 12. Similarly, information is displayed regarding a link starting from node 4 and ending at node 5, and a link starting from node 7 and ending at node 8. Information regarding other links is omitted, but in reality, information regarding all of the links that make up the road network is included in the road data 107.

[0037] FIG. 5 is an explanatory diagram showing an example of the data structure of the regulation data 108 held by the delivery planning device 100 in the embodiment of the present invention.

[0038] The restriction data 108 includes, for example, a plurality of records, each corresponding to one restriction. Each record includes a node ID 501, an entrance node ID 502, and an exit node ID 503. The node ID 501 indicates the identification number of the node that is subject to restriction. The entrance node ID 502 and the exit node ID 503 indicate the direction of travel that is restricted at the node that is subject to restriction.

[0039] 5 indicates that the direction of travel from node 5 to node 2 and from node 3 to node 4 is restricted (specifically, travel in that direction is prohibited). The second record indicates that the direction of travel from node 8 to node 5 and from node 6 to node 6 is restricted.

[0040] In practice, traffic regulations may be set with conditions that limit time periods or vehicle types. In such cases, there may be regulation data 108 for each condition, such as time period or vehicle type, or the regulation data 108 may include information specifying the conditions, such as the applicable time period and vehicle type, in addition to the above data items.

[0041] Next, the label data 109 will be described with reference to Figures 6 to 9. The label data 109 includes hub data 700 shown in Figures 6 and 7, origin label data 800 shown in Figure 8, and destination label data 900 shown in Figure 9.

[0042] FIG. 6 is an explanatory diagram showing an example of a hub set on a road network by the delivery planning device 100 according to the embodiment of the present invention.

[0043] FIG. 6 shows an example of hubs set on the road network 300 shown in FIG. 3. In this example, three hubs (hereinafter referred to as "hub 1" to "hub 3") are set, identified by hub IDs "1" to "3," respectively. Hub 1 consists of nodes 1, 2, and 3 and two links connecting them. Hub 2 consists of nodes 4, 5, and 6 and two links connecting them. Hub 3 consists of nodes 7, 8, and 9 and two links connecting them.

[0044] Note that the start point and end point are predetermined for each hub. For example, for hub 1, node 1 is the start point and node 3 is the end point. In this case, of the traffic directions within hub 1, the direction from node 1, the start point, to node 3, the end point, is the forward direction, and the opposite direction is the reverse direction. Similarly, for hub 2, node 4 is the start point and node 6 is the end point, and for hub 3, node 7 is the start point and node 9 is the end point.

[0045] FIG. 7 is an explanatory diagram showing an example of the data structure of hub data 700 held by the delivery planning device 100 in the embodiment of the present invention.

[0046] The hub data 700 includes a hub ID 701 and a node ID 702. The hub ID 701 is the identification number of the set hub. The node ID 702 is the identification number of the node belonging to the set hub. Fig. 7 shows information defining hubs 1 to 3 shown in Fig. 6.

[0047] FIG. 8 is an explanatory diagram showing an example of the data structure of departure location label data 800 held by the delivery planning device 100 in the embodiment of the present invention.

[0048] The origin label data 800 holds labels indicating the results of a preliminary search for a route from a departure node to a hub for each combination of multiple departure nodes and multiple hubs. Each label includes a node ID 801, a hub ID 802, a connection point location 803, a cost to the connection point 804, and a travel direction 805.

[0049] The node ID 801 and hub ID 802 are identification numbers of the starting node and hub that are the targets of the route search. The connection point position 803 indicates the position in the hub of the node (hereinafter also referred to as the connection point) that the searched route connects to, among the nodes included in the hub that is the target of the route search. For example, in the hub to which the connection point belongs, the sum of the costs of the links on the route from the start point of the hub to the connection point is stored as the connection point position 803.

[0050] The cost to the connection point 804 indicates the cost from the start node of the searched route to the connection point. For example, the sum of the costs of the links on the route from the start node to the connection point is stored as the cost to the connection point 804.

[0051] The travel direction 805 indicates the direction in which a vehicle that has entered a connection point can travel from the connection point to another node in the same hub. This direction is based on the starting point in the hub described with reference to Figure 7, and can be either "forward," indicating that travel is permitted only in the forward direction, "backward," indicating that travel is permitted only in the backward direction, "both directions," indicating that travel is permitted in both the forward and backward directions, or "no travel," indicating that travel is prohibited in either the forward or backward direction. Examples of values ​​for each of these items will be described later (Figures 11A to 11C).

[0052] FIG. 9 is an explanatory diagram showing an example of the data structure of destination-side label data 900 held by the delivery planning device 100 in the embodiment of the present invention.

[0053] The destination label data 900 holds labels indicating the results of a preliminary search for a route from a hub to a destination node for each combination of multiple destination nodes and multiple hubs. Each label includes a node ID 901, a hub ID 902, a connection point location 903, a cost to the connection point 904, and a travel direction 905.

[0054] The node ID 901 and hub ID 902 are identification numbers of the destination node and hub that are the subject of the route search. The connection point position 903 indicates the position of the connection point in the hub that is the subject of the route search. The cost to connection point 904 indicates the cost from the connection point to the destination node on the searched route. The travel direction 905 indicates the direction that a vehicle can travel from the connection point to the outside of the hub, among the directions from another node in the hub to which the connection point belongs. The explanation of the values ​​of each of these items is the same as that given with reference to FIG. 8, and will therefore be omitted. Examples of the values ​​of each of these items will be described later (FIGS. 12A to 12C).

[0055] Next, the processing executed by the preliminary search unit 101 of the delivery planning device 100 will be described. The preliminary search unit 101 generates label data 109 before the starting point and destination for creating a delivery plan are determined. For example, the processing of the preliminary search unit 101 may be executed during a time when no deliveries are being made, such as at night. Once the label data is generated, it can be used for route determination by the route determination unit 102, which will be described later, without being generated again, unless the road data 107 and regulation data 108 are changed.

[0056] 10A and 10B are flowcharts showing an example of processing executed by the advance search unit 101 of the delivery planning device 100 according to the embodiment of the present invention.

[0057] First, the preliminary search unit 101 divides the road network into multiple hubs and adds the resulting hub data 700 to the label data 109 (step 1001). At this time, the preliminary search unit 101 performs the division so that each hub contains at least two nodes connected via links. If a hub contains three or more nodes, these nodes must be connected in series via links. For example, a hub is a continuous road section represented by multiple nodes connected by links.

[0058] The method for generating a hub is not limited. It is sufficient that the connection between the nodes that make up the hub forms the shortest path. For example, a hub may be generated by using node 1 as the starting point, setting the maximum number of nodes to 3, and generating the shortest path.

[0059] In the examples of FIGS. 6 and 7, the road network 300 is divided into a hub 1 consisting of nodes 1, 2, and 3, a hub 2 consisting of nodes 4, 5, and 6, and a hub 3 consisting of nodes 7, 8, and 9.

[0060] Next, the preliminary search unit 101 selects one hub (step 1002) and generates labels for the selected hub (step 1003). Specifically, the preliminary search unit 101 creates a departure-side shortest-path tree from the departure node to the selected hub, and adds the resulting departure-side label data 800 to the label data 109 (step 1011). Furthermore, the preliminary search unit 101 creates a destination-side shortest-path tree from the selected hub to the destination node, and adds the resulting destination-side label data 900 to the label data 109 (step 1011).

[0061] Next, the pre-search unit 101 determines whether all nodes of the selected hub have been processed (step 1004), and if there are unprocessed nodes (step 1004: No), executes step 1003 for those nodes. If all nodes of the selected hub have been processed (step 1004: Yes), the pre-search unit 101 determines whether all hubs have been processed (step 1005). If there are unprocessed hubs (step 1005: No), the pre-search unit 101 executes steps 1002 and 1003 for those hubs. If all hubs have been processed (step 1005: Yes), the pre-search unit 101 ends its processing.

[0062] 11A to 11C are explanatory diagrams showing a specific example of generation of departure location label data 800 by the advance search unit 101 of the delivery planning device 100 in the embodiment of the present invention.

[0063] 11A to 11C show an example of part of the processing executed in step 1011 when hub 2 is selected from the hubs set in the road network 300 in step 1002. FIG.

[0064] First, referring to Figure 11A, a route whose connection point is node 4 will be described. In this case, in step 1011, two routes are obtained as the shortest path tree to node 4, which is the connection point (i.e., a set of the shortest paths entering hub 2 from node 4, with each node on road network 300 as the starting node): a route from node 1 to node 4, and a route from node 9 to node 4 via node 8 and node 7 in this order. In this example, due to restrictions on travel direction, there is no route that starts from node 2 or node 3 and enters hub 2 from node 4.

[0065] In this example, node 4, which is the connection point, is the starting point of hub 2, so the connection point position 803 is "0." Furthermore, if node 8 is the starting node, the cost 804 to the connection point is the sum of the costs of the links on the route from node 8 to node 4, which is the connection point, i.e., "12," which is the sum of "8" and "13." A vehicle that enters node 4 from node 8 via node 7 can travel within hub 2 in the forward direction from node 4 (i.e., the direction to node 5), but cannot travel in the reverse direction. This is because there are no nodes upstream of node 4 within hub 2. In this case, the travel direction 805 is "forward." This information is recorded as label 811 shown in FIG. 8.

[0066] Although omitted in the example of Figure 8, similarly, when the departure node is node 1, node 7, or node 9, the cost from each departure node to the connection point is calculated, and the corresponding label is added to the departure side label data 800.

[0067] 11B, a description will be given of a route whose connection point is node 5. In this case, in step 1011, two shortest path trees are obtained to reach node 5, which is the connection point: a route from node 1 to node 5 via node 2, and a route from node 9 to node 5 via node 8. In this example, due to restrictions on travel direction, there is no route that starts from node 3 or node 7 and enters hub 2 from node 5.

[0068] In this example, the location 803 of the connection point is "6," which is the cost of the link from node 4, the starting point of hub 2, to node 5, the connection point. Furthermore, if node 8 is the starting node, the cost 804 to the connection point is the sum of the costs of the links on the route from node 8 to node 5, the connection point, i.e., "11." A vehicle that enters node 5 from node 8 can travel in the reverse direction within node 2 (i.e., toward node 4), but cannot travel in the forward direction (i.e., toward node 6). This is due to traffic restrictions set on the route from node 8 to node 5 and exiting node 6. In this case, the travel direction 805 is "reverse." These pieces of information are recorded as label 812 shown in FIG. 8 .

[0069] Although omitted in the example of Figure 8, similarly, when the departure node is node 1, node 2, or node 9, the cost from each departure node to the connection point is calculated, and the corresponding label is added to the departure side label data 800.

[0070] 11C, a description will be given of a route whose connection point is node 6. In this case, in step 1011, two shortest path trees are obtained to reach node 6, which is the connection point: a route from node 1 to node 6 via node 2 and node 3 in this order, and a route from node 9 to node 6. In this example, due to restrictions on travel direction, there is no route that starts from node 7 or node 8 and enters hub 2 from node 6.

[0071] In this example, as described above, there is no route from node 8 to node 6, so a label with node 8 as the starting node is not generated.

[0072] On the other hand, although omitted in the example of Figure 8, when the departure node is node 1, node 2, node 3, or node 9, the cost from each departure node to the connection point is calculated, and the corresponding label is added to the departure side label data 800.

[0073] 12A to 12C are explanatory diagrams showing specific examples of generation of destination-side label data 900 by the advance search unit 101 of the delivery planning device 100 in the embodiment of the present invention.

[0074] 12A to 12C show an example of part of the processing executed in step 1012 when hub 2 is selected from the hubs set in the road network 300 in step 1002. In FIG.

[0075] First, referring to Figure 12A, a route whose connection point is node 4 will be described. In this case, in step 1012, two shortest path trees (i.e., a set of shortest paths from node 4, which is the connection point, to hub 2, with each node on road network 300 as the destination node) are obtained: a path from node 4 to node 3 via node 1 and node 2 in this order, and a path from node 4 to node 7. In this example, due to restrictions on the travel direction of the link, no path exists from node 4 to node 8 or node 9. Note that in Figure 12A, the connection point nodes are shown shaded, and the shortest path trees are shown with thick solid lines. The same applies to Figures 12B and 12C, which will be described later.

[0076] In this example, node 4, which is the connection point, is the starting point of hub 2, so the connection point position 903 is "0." Furthermore, if node 3 is the destination node, the cost to the connection point 904 is the sum of the costs of the links on the route from node 4, which is the connection point, to node 3, i.e., the sum of "15," "12," and "8," which is "35." A vehicle can enter node 4 in the reverse direction (i.e., from node 5) and exit at node 1, but cannot enter node 4 in the forward direction and exit at node 1. This is because there is no node upstream of node 4 within hub 2. In this case, the travel direction 905 is "reverse." This information is recorded as label 911 shown in FIG. 9.

[0077] Although omitted in the example of Figure 9, similarly, when the destination node is node 1, node 2, or node 7, the cost from the connection point to each destination node is calculated, and the corresponding label is added to the destination side label data 900.

[0078] 12B, a path whose connection point is node 5 will be described. In this case, in step 1012, two paths are obtained as shortest path trees from node 5, which is the connection point: a path from node 5 to node 2, and a path from node 5 to node 7 via node 8. In this example, due to restrictions on the travel direction, there are no paths that exit hub 2 from node 5 to node 1, no paths that reach node 3, and no paths that reach node 9.

[0079] In this example, as described above, there is no route from node 5 to node 3, so a label with node 3 as the destination node is not generated.

[0080] On the other hand, although omitted in the example of Figure 9, when the destination node is node 2, node 8, or node 7, the cost from the connection point to each destination node is calculated, and the corresponding label is added to the destination side label data 900.

[0081] 12C, a path whose connection point is node 6 will be described. In this case, in step 1012, two shortest path trees are obtained from node 6, which is the connection point: a path from node 6 to node 3, and a path from node 6 to node 7 via node 9 and node 8 in this order. In this example, due to restrictions on the direction of travel of the link, there is no path from node 6 exiting hub 2 to node 1 or to node 2.

[0082] In this example, the location 903 of the connection point is "11," which is the sum of the costs of the links from node 4, the start point of hub 2, to node 6, the connection point. If node 3 is the destination node, the cost 904 to the connection point is the sum of the costs of the links on the route from node 6, the connection point, to node 3, i.e., "14." A vehicle can enter node 6 in the forward direction (i.e., from node 5) and exit at node 3, but cannot enter node 6 in the reverse direction and exit at node 3. This is because there is no node downstream of node 6 within hub 2. In this case, the travel direction 905 is "forward." This information is recorded as label 912 shown in FIG. 9.

[0083] Although omitted in the example of Figure 9, similarly, when the destination node is node 9, node 8, or node 7, the cost from the connection point to each destination node is calculated, and the corresponding label is added to the destination side label data 900.

[0084] Next, a description will be given of the processing executed by the route determination unit 102 of the delivery planning device 100. The processing of the route determination unit 102 is executed by referring to the label data 109 generated in advance after the starting point and the destination for creating a delivery plan have been specified.

[0085] 13A and 13B are flowcharts showing an example of processing executed by the route determination unit 102 of the delivery planning device 100 according to the embodiment of the present invention.

[0086] First, the route determination unit 102 refers to the hub data 700 in the label data 109 and selects one hub (step 1301).

[0087] Next, the route determination unit 102 selects one each of the origin-side and destination-side labels connected to the selected hub (step 1302). Specifically, one label whose hub ID 802 is the identification number of the hub selected in step 1301 is selected from the origin-side label data 800, and similarly, one label whose hub ID 902 is the identification number of the hub selected in step 1301 is selected from the destination-side label data 900. Hereinafter, the origin-side label and destination-side label selected in step 1302 will be referred to as label L1 and label L2, respectively.

[0088] Next, the route determination unit 102 compares the costs of the routes identified by the labels L1 and L2 (step 1303). The process in step 1303 will now be described with reference to Fig. 13B. The parameters referenced in the process in Fig. 13B are defined as follows:

[0089] p1: Value of the position 803 of the connection point of label L1 p2: Value of the position 903 of the connection point of label L2 c1: Value of the cost 804 to the connection point of label L1 c2: Value of the cost 904 to the connection point of label L2 d1: Value of the travel direction 805 of label L1 d2: Value of the travel direction 905 of label L2

[0090] First, the route determination unit 102 determines whether p2 is greater than p1 (step 1311). If p2 is greater than p1, this means that the destination connection point is downstream from the departure connection point, in other words, the direction of travel within the hub for a vehicle entering the hub from the departure connection point and exiting the hub from the destination connection point is the forward direction.

[0091] If p2 is greater than p1 (step 1311: Yes), the route determination unit 102 determines whether d1 is the forward direction or both directions and whether d2 is the forward direction or both directions (step 1312). If p2 is greater than p1, d1 is the forward direction or both directions, and d2 is the forward direction or both directions, this means that the travel direction of vehicles within the hub (i.e., the forward direction) is included in both the direction in which vehicles entering the hub can travel within the hub and the direction in which vehicles exiting the hub can travel within the hub. In other words, the travel direction of vehicles within the hub is not inconsistent with the direction in which vehicles entering the hub can travel within the hub and the direction in which vehicles exiting the hub can travel within the hub.

[0092] If d1 is forward or bidirectional and d2 is forward or bidirectional (step 1312: Yes), the route determination unit 102 calculates the cost of the route corresponding to the combination of the selected hub, the departure label, and the destination label, and checks whether the cost is smaller than the cost calculated so far (step 1313).

[0093] Here, the cost of the route is calculated by adding up the costs of all links included in the selected origin label L1 and the selected destination label L2, and if the route includes a link within the selected hub, adding up the costs of that link as well (this also applies to steps 1316 and 1317 described below). In step 1313, the cost of the route is calculated as c1 + c2 + p2 - p1.

[0094] If p2 is not greater than p1 (step 1311: No), the route determination unit 102 determines whether p1 is greater than p2 (step 1314). If p1 is greater than p2 (step 1314: Yes), the route determination unit 102 determines whether d1 is the reverse direction or both directions and whether d2 is the reverse direction or both directions (step 1315). If p1 is greater than p2, d1 is the reverse direction or both directions, and d2 is the reverse direction or both directions, this means that the travel direction of vehicles within the hub (i.e., the reverse direction) is included in both the direction in which vehicles entering the hub can travel within the hub and the direction in which vehicles exiting the hub can travel within the hub. In other words, there is no contradiction between the travel direction of vehicles within the hub, the direction in which vehicles entering the hub can travel within the hub, and the direction in which vehicles exiting the hub can travel within the hub.

[0095] If d1 is in the reverse direction or both directions and d2 is in the reverse direction or both directions (step 1315: Yes), the route determination unit 102 checks whether the cost calculated by c1 + c2 + p1 - p2 is smaller than the cost calculated so far (step 1316).

[0096] If p2 is not greater than p1 (step 1311: No) and p1 is not greater than p2 (step 1314: No), that is, if p1 and p2 are equal, the route determination unit 102 checks whether the cost calculated by c1 + c2 is smaller than the cost calculated so far (step 1317).

[0097] In the above description, in steps 1313, 1316, and 1317, it is confirmed whether the calculated cost is smaller than the costs calculated so far. Regardless of the results of the confirmations in these steps, the route determination unit 102 may retain the combination of the hub to be calculated, the origin label, and the destination label as a candidate for the route to be finally generated. In this case, in the processing described below, the route with the smallest cost among the retained candidates will be the route to be finally generated. Alternatively, the route determination unit 102 may retain the combination of the hub to be calculated, the origin label, and the destination label as a candidate for the route to be finally generated only if the newly calculated cost is smaller than the previously calculated cost, and discard the previously retained candidates. In this case, the candidate routes remaining after processing for all combinations of hubs and labels has been completed will be the route to be finally generated.

[0098] This completes the process of comparing the costs of the routes specified by the labels L1 and L2 (step 1303).

[0099] Next, the route determination unit 102 determines whether confirmation has been completed for all labels connected to the selected hub (step 1304). If there are labels that have not yet been confirmed (step 1304: No), the route determination unit 102 returns to step 1302, selects a label that has not yet been confirmed, and executes the processing from step 1303 onwards.

[0100] When the route determination unit 102 has finished checking all labels connected to the selected hub (step 1304: Yes), it determines whether checking has been completed for all hubs (step 1305). If there are hubs that have not yet been checked (step 1305: No), the route determination unit 102 returns to step 1301, selects a hub that has not yet been checked, and executes the processing from step 1302 onwards. When checking has been completed for all hubs (step 1305: Yes), the route determination unit 102 generates a route by combining the hub, departure label, and destination label that has the smallest cost calculated so far (step 1306).

[0101] This completes the processing of the route determination unit 102.

[0102] 14A to 14D are explanatory diagrams showing a specific example of a process in which the route determination unit 102 of the delivery planning device 100 generates a route in the embodiment of the present invention.

[0103] Here, as an example, a case will be described in which hub 2 is selected in step 1301 in road network 300. In this case, in step 1302, either the departure label 811 or 812 shown in FIG. 8 is selected as label L1, and either the destination label 911 or 912 is selected as label L2. Each combination of labels L1 and L2 will be described below. Note that in FIGS. 14A to 14D, the route of the departure label is shown with a thick, coarse dashed line, the route within the hub is shown with a thick, solid line, and the route of the destination label is shown with a thick, finely dotted line.

[0104] 14A shows a route when the departure label 811 is selected as label L1 and the destination label 911 is selected as label L2. In this example, a route is selected from node 8, which is the departure node, to node 3, which is the destination node, via nodes 7, 4, 1, and 2 in this order. The connection point on the departure side of this route is node 4, and the connection point on the destination side is also node 4.

[0105] In this case, p1 = p2 = 0 (i.e., step 1311: No, step 1314: No). In this case, the vehicle that entered from the connection point on the departure side does not travel through any links within hub 2 before exiting from the connection point on the destination side, so the determination of whether or not there is a conflict in the travel direction (steps 1312, 1315) is not performed. Then, the cost of the route is calculated as c1 + c2 = 21 + 35 = "56" (step 1317).

[0106] 14B shows a route when the departure label 812 is selected as label L1 and the destination label 911 is selected as label L2. In this example, a route is selected that starts from node 8, which is the departure node, and passes through nodes 5, 4, 1, and 2 in this order to reach node 3, which is the destination node. The connection point on the departure side of this route is node 5, and the connection point on the destination side is node 4.

[0107] In this case, p1 (= 6) > p2 (= 0) (i.e., step 1314: Yes), which indicates that the route includes a link within Hub 2, and the connection point on the destination side is upstream (i.e., closer to the start point of Hub 2) than the connection point on the departure side. This means that in order for a vehicle to travel along the route from the departure point to the destination, it must travel through the links within Hub 2 in the reverse direction (i.e., from downstream to upstream).

[0108] Furthermore, in this example, d1 = "reverse direction" and d2 = "reverse direction" (step 1315: Yes). d1 being "reverse direction" indicates that a vehicle that enters hub 2 from node 5 can travel within hub 2 in the reverse direction. d2 being "reverse direction" indicates that a vehicle can travel within hub 2 in the reverse direction to reach node 4 and exit hub 2 from node 4. Since these are not mutually contradictory, the route is determined to be passable, and the cost of the route is calculated as c1 + c2 + p1 - p2 = 11 + 35 + 6 = "52" (step 1316).

[0109] 14C shows a route when the departure label 812 is selected as label L1 and the destination label 912 is selected as label L2. In this example, a route is selected from node 8, which is the departure node, to node 3, which is the destination node, via nodes 5 and 6 in this order. The connection point on the departure side of this route is node 5, and the connection point on the destination side is node 6.

[0110] In this case, p1 (= 6) < p2 (= 11) (i.e., step 1311: Yes). This indicates that the route includes a link within Hub 2, and the connection point on the destination side is downstream (i.e., farther from the start point of Hub 2) than the connection point on the departure point side. This means that in order for a vehicle to travel along the route from the departure point to the destination, it must travel through the links within Hub 2 in the forward direction (i.e., from upstream to downstream).

[0111] Furthermore, in this example, d1 = "reverse direction" and d2 = "forward direction" (step 1312: No). d1 being "reverse direction" indicates that a vehicle that enters hub 2 from node 5 can travel in the reverse direction within hub 2, but cannot travel in the forward direction. d2 being "forward direction" indicates that a vehicle can travel in the forward direction within hub 2 to reach node 6 and exit hub 2 from node 6. In this case, there is a contradiction: while it is necessary to travel in the forward direction through the links within hub 2, a vehicle that entered hub 2 from node 5 cannot travel in the forward direction within hub 2 due to traffic restrictions. For this reason, the route is determined to be impassable, and the cost of the route is not calculated. If the cost of the route were calculated, it would be calculated as "30."

[0112] 14D shows a route when the departure label 811 is selected as label L1 and the destination label 912 is selected as label L2. In this example, a route is selected that starts from node 8, which is the departure node, and passes through nodes 7, 4, 5, and 6 in this order to reach node 3, which is the destination node. The connection point on the departure side of this route is node 4, and the connection point on the destination side is node 6.

[0113] In this case, p1 (= 0) < p2 (= 11) (i.e., step 1311: Yes). This indicates that the route includes a link within Hub 2, and the connection point on the destination side is downstream (i.e., closer to the end point of Hub 2) than the connection point on the departure side. This means that the vehicle needs to travel the links within Hub 2 in the forward direction to travel along the route from the departure point to the destination.

[0114] Furthermore, in this example, d1 = "forward" and d2 = "forward" (step 1312: Yes). d1 being "forward" indicates that a vehicle that enters hub 2 from node 4 can travel within hub 2 in the forward direction. d2 being "forward" indicates that a vehicle can travel within hub 2 in the forward direction, reach node 6, and exit hub 2 from node 6. Since these are not mutually contradictory, the route is determined to be passable, and the cost of the route is calculated as c1 + c2 + p2 - p1 = 21 + 14 + 11 = "46" (step 1313).

[0115] 14A to 14D, of the four combinations of origin labels and destination labels for hub 2, the combination shown in Fig. 14C has the smallest cost but is determined to be impassable. Of the remaining three passable combinations, the combination shown in Fig. 14D has the smallest cost, so the route for this combination is determined at least for hub 2.

[0116] The reason why the combined route shown in Figure 14C is not passable is that a vehicle needs to travel from node 5 to node 6 within hub 2 to reach node 6, which is the connection point on the destination side, but this travel is prohibited due to traffic regulations. This is based on the traffic regulations (see Figure 5) that prohibit travel in the direction of node 6 only when a vehicle enters node 5 from node 8. For example, as shown in Figure 14D, when a vehicle enters node 5 from node 4, it can travel from node 5 to node 6.

[0117] In this way, in this embodiment, even if traffic regulations are set that depend on the combination of the direction of travel within the hub and the route to or from the hub, it is possible to determine a route that reflects those traffic regulations.

[0118] FIG. 15 is an explanatory diagram showing an example of processing performed by the delivery planning device 100 according to the embodiment of the present invention based on conditional traffic regulations.

[0119] As described with reference to Fig. 5, there are cases where conditional traffic regulations are set that limit time periods or vehicle types. Fig. 15 describes the processing of the delivery planning device 100 when traffic regulations for each time period are set, which is an example of conditional traffic regulations.

[0120] Specifically, Figure 15 shows an example in which the regulation data 108 includes traffic restrictions 108A for the time period from 10:00 to 11:00, traffic restrictions 108B for the time period from 11:00 to 12:00, traffic restrictions 108C for the time period from 12:00 to 13:00, and traffic restrictions for other time periods (not shown).

[0121] In this example, the preliminary search unit 101 executes the processing shown in Figures 10A and 10B based on the road data 107 and the traffic regulations 108A for the time period from 10:00 to 11:00, thereby generating label data 1_109A corresponding to the time period and storing it in the memory unit 106 as part of the label data 109.

[0122] Similarly, the preliminary search unit 101 generates label data 2_109B corresponding to the time period from 11:00 to 12:00 based on the road data 107 and traffic regulations 108B for the time period from 11:00 to 12:00, and generates label data 3_109C corresponding to the time period based on the road data 107 and traffic regulations 108C for the time period from 12:00 to 13:00, and stores them in the memory unit 106 as part of the label data 109.

[0123] When the route determination unit 102 identifies the starting point and destination for the route search and executes the route search, it refers to the label data 109 corresponding to the time period of the delivery plan to be created and executes the processing shown in Figures 13A and 13B. For example, when creating a delivery plan for the time period from 12:00 to 13:00, the route determination unit 102 executes the route search by referring to label data 3_109C, and the delivery plan unit 103 creates the delivery plan based on the result.

[0124] Furthermore, the system according to the embodiment of the present invention may be configured as follows.

[0125] (1) A route search method executed by a computer system (e.g., a computer system 200 that realizes a delivery planning device 100) having a processor (e.g., a processor 201) and a storage device (e.g., a memory 202 and an auxiliary storage device 203), wherein the storage device holds road data (e.g., road data 107) including information on a road network, and regulation data (e.g., regulation data 108) including information on traffic regulations set on the road network, and the route search method includes a preliminary search procedure (e.g., processing by a preliminary search unit 101) in which the processor generates label data based on the road data and the regulation data, and a route determination procedure (e.g., processing by a route determination unit 102) in which the processor determines a route between points based on the label data, and the preliminary search procedure includes a step of generating label data based on the road data and the regulation data, and a step of determining a route between points based on the label data. The method includes a first procedure (e.g., step 1001) of generating information about a hub consisting of a plurality of nodes in a road network; and a second procedure (e.g., steps 1002 to 1005) of the processor storing, as the label data, the passable directions at the hub when a route is set between each node included in the road network and the hub based on the road data and the regulation data, and the route determination procedure includes a third procedure (e.g., Figures 13A and 13B) of the processor determining, as the route between the points, a route corresponding to a combination of the hub, a route entering the hub, and a route exiting the hub, where the passable direction at the hub is included in both the passable directions at the hub when entering the hub and the passable directions at the hub when exiting the hub.

[0126] This makes it possible to generate a route that reflects traffic regulations while reducing the time required for route search after the departure point and destination have been specified.

[0127] (2) In the route search method described in (1) above, the second step includes a step (e.g., step 1011) in which the processor generates, based on the road data and the regulation data, a departure label including a position of a connection point on the departure side indicating a node at which a route starting from each node in the road network connects to the hub and a travelable direction within the hub from the connection point on the departure side, and stores the information on the departure label in the label data (e.g., step 1012); and a step (e.g., step 1013) in which the processor generates, based on the road data and the regulation data, a destination label including a position of a connection point on the destination side indicating a node at which a route starting from the hub connects to the hub and a travelable direction within the hub to the connection point on the destination side, and stores the information on the destination label in the label data (e.g., step 1014). The third procedure includes a procedure (e.g., steps 1301 and 1302) in which, when a departure node and a destination node have been determined, the processor selects, based on the label data, a combination of the departure label of a route from the departure node to the hub and the destination label of a route from the hub to the destination node; and a procedure (e.g., steps 1303 and 1306) in which, when the travel direction from the departure connection point to the destination connection point in the selected combination is included in both a direction in which travel is possible within the hub from the departure connection point and a direction in which travel is possible within the hub to the destination connection point.

[0128] This makes it possible to generate a route that reflects traffic regulations while reducing the time required for route search after the departure point and destination have been specified.

[0129] (3) In the route search method described in (2) above, in the second step, the processor calculates the cost of the route starting from each node to the hub and the cost of the route starting from the hub to each node, and stores these costs in the label data by including them in the origin label and the destination label, respectively; in the third step, the processor determines, as the route from the origin node to the destination node, the route corresponding to the combination in which the sum of the cost of the route from the origin connection point within the hub to the destination connection point, the cost of the route corresponding to the origin label, and the cost of the route corresponding to the destination label is the smallest, among combinations in which the direction of travel from the origin connection point to the destination connection point is included in both the direction in which travel is possible within the hub from the origin connection point and the direction in which travel is possible within the hub to the destination connection point (e.g., step 1306).

[0130] This allows the route with the lowest cost to be selected from among the routes that are passable in accordance with the traffic regulations.

[0131] (4) In the route search method described in (1) above, the hub is a road section represented by a plurality of nodes connected by links.

[0132] This eliminates routes that cannot be traveled due to traffic restrictions corresponding to the traffic direction within the hub at the hub connection point.

[0133] (5) In the route search method described in (1) above, the restriction data includes information (e.g., information shown in Figure 5) that associates a combination of a target node, an entry node that is an adjacent node on the side entering the target node, and an exit node that is an adjacent node on the side exiting the target node, with restrictions on passage from the entry node to the target node and exiting to the exit node.

[0134] This eliminates routes that cannot be traveled due to traffic restrictions corresponding to the traffic direction within the hub at the hub connection point.

[0135] (6) The route search method described in (1) above, wherein the regulation data includes information on traffic regulations set in the road network for each condition (e.g., traffic regulations 108A to 108C), and in the preliminary search procedure, the processor generates the label data for each condition (e.g., label data 1_109A to label data 3_109C), and in the route determination procedure, the processor determines a route based on the label data that matches the conditions of the target of the route search.

[0136] This makes it possible to identify a route that meets the conditions even if traffic regulations differ depending on the conditions.

[0137] (7) In the route search method described in (6) above, the conditions include at least one of a time period and a type of vehicle passing through.

[0138] This makes it possible to identify routes that are suitable for different traffic regulations depending on the time of day or vehicle type.

[0139] The present invention is not limited to the above-described embodiments, but includes various modifications. For example, the above-described embodiments have been described in detail to provide a better understanding of the present invention, and the present invention is not necessarily limited to those including all of the described configurations. Furthermore, it is possible to replace part of the configuration of one embodiment with the configuration of another embodiment, or to add the configuration of another embodiment to the configuration of one embodiment. Furthermore, it is possible to add, delete, or replace part of the configuration of each embodiment with other configurations.

[0140] Furthermore, the above-described configurations, functions, processing units, processing means, etc. may be partially or entirely implemented in hardware, for example, by designing them as integrated circuits. The above-described configurations, functions, etc. may also be implemented in software, with a processor interpreting and executing a program that implements each function. Information such as programs, tables, and files that implement each function can be stored in storage devices such as nonvolatile semiconductor memory, hard disk drives, and solid-state drives (SSDs), or in computer-readable, non-transitory data storage media such as IC cards, SD cards, and DVDs.

[0141] In addition, the control lines and information lines shown are those that are considered necessary for the explanation, and not all control lines and information lines in the product are necessarily shown. In reality, it can be considered that almost all components are interconnected.

Claims

1. A route search method executed by a computer system having a processor and a storage device, wherein the storage device holds road data including information on a road network, and regulation data including information on traffic regulations set on the road network, and the route search method includes a pre-search step in which the processor generates label data based on the road data and the regulation data, and a route determination step in which the processor determines a route between points based on the label data, and the pre-search step includes a first step in which the processor generates information on a hub consisting of a plurality of nodes of the road network based on the road data, and a second step in which the processor holds, for each node included in the road network, a passable direction at the hub when a route is set between each node and the hub based on the road data and the regulation data, and the route determination step includes A route search method characterized in that the processor determines, as a route between the points, a route corresponding to a combination of the hub, a route entering the hub, and a route exiting the hub, where the direction of travel at the hub is included in both the directions that can be traveled at the hub when entering the hub and the directions that can be traveled at the hub when exiting the hub.

2. A route search method according to claim 1, wherein the second step includes a step in which the processor generates, based on the road data and the regulation data, a departure label including the position of a departure connection point indicating a node at which a route starting from each node in the road network connects to the hub and a travelable direction within the hub from the departure connection point, and includes and retains the information of the departure label in the label data; and a step in which the processor generates, based on the road data and the regulation data, a destination label including the position of a destination connection point indicating a node at which a route starting from the hub connects to the hub and reaches each node in the road network, and a travelable direction within the hub to the destination connection point, and includes and retains the information of the destination label in the label data; and the third step includes a step in which the processor generates, based on the road data and the regulation data, a destination label including the position of a destination connection point indicating a node at which a route starting from the hub connects to the hub and reaches each node in the road network, and a travelable direction within the hub to the destination connection point, and a step of the processor selecting, when the departure node and the destination node have been determined, a combination of the departure label of the route from the departure node to the hub and the destination label of the route from the hub to the destination node based on the label data; and a step of the processor determining, when the selected combination includes a direction of travel from the departure connection point to the destination connection point, either a direction in which travel is possible from the departure connection point through the hub or a direction in which travel is possible through the hub to the destination connection point.

3. A route search method as described in claim 2, wherein in the second step, the processor calculates the cost of the route starting from each of the nodes to the hub, and the cost of the route starting from the hub to each of the nodes, and stores these in the label data by including them in the departure label and the destination label, respectively; and in the third step, the processor determines, as the route from the departure node to the destination node, the route corresponding to the combination in which the sum of the cost of the route from the departure connection point in the hub to the destination connection point, the cost of the route corresponding to the departure label, and the cost of the route corresponding to the destination label is the smallest, among combinations in which the travel direction from the departure connection point to the destination connection point is included in both the direction in which travel is possible from the departure connection point within the hub and the direction in which travel is possible within the hub to the destination connection point.

4. A route search method according to claim 1, characterized in that the hub is a road section represented by a plurality of nodes connected by links.

5. A route search method as described in claim 1, characterized in that the restriction data includes information that corresponds a combination of a target node, an entry node which is an adjacent node on the side entering the target node, and an exit node which is an adjacent node on the side exiting the target node, with restrictions on passage from the entry node to the target node and exiting to the exit node.

6. A route search method as described in claim 1, wherein the regulation data includes information on traffic regulations set on the road network for each condition, in the preliminary search step, the processor generates the label data for each condition, and in the route determination step, the processor determines a route based on the label data that matches the conditions that are the subject of the route search.

7. A route search method according to claim 6, wherein the conditions include at least one of a time period and a type of vehicle passing through.

8. A delivery planning device having a processor and a storage device, wherein the storage device holds road data including information on a road network and regulation data including information on traffic regulations set on the road network, and the processor executes a preliminary search procedure of generating label data based on the road data and the regulation data, and a route determination procedure of determining a route between points based on the label data, wherein in the preliminary search procedure, the processor executes a first procedure of generating information on a hub consisting of a plurality of nodes of the road network based on the road data, and a second procedure of retaining, for each node included in the road network, a direction that is passable at the hub when a route is set between each node and the hub based on the road data and the regulation data, as the label data, and in the route determination procedure, the processor executes: a third step of determining, as a route between the points, a route corresponding to a combination of the hub, a route entering the hub, and a route exiting the hub, in which the traffic direction at the hub is included in both a direction available at the hub when entering the hub and a direction available at the hub when exiting the hub.

9. A delivery planning device as claimed in claim 8, wherein in the second step, the processor: generates, based on the road data and the regulation data, a departure label including a position of a departure connection point indicating a node at which a route starting from each node in the road network to the hub connects to the hub, and a travelable direction within the hub from the departure connection point, and stores the information of the departure label in the label data; generates, based on the road data and the regulation data, a destination label including a position of a destination connection point indicating a node at which a route starting from the hub to each node in the road network connects to the hub, and a travelable direction within the hub to the destination connection point, and stores the information of the destination label in the label data; and in the third step, when the departure node and destination node have been determined, selects, based on the label data, a combination of the departure label of the route from the departure node to the hub and the destination label of the route from the hub to the destination node, A delivery planning device characterized in that, in the selected combination, when the travel direction from the connection point on the departure side to the connection point on the destination side is included in both a direction in which travel is possible from the connection point on the departure side through the hub and a direction in which travel is possible through the hub to the connection point on the destination side, a route corresponding to the combination of the hub, the departure side label, and the destination side label is determined as the route from the departure node to the destination node.

10. A delivery planning device as described in claim 9, wherein in the second step, the processor calculates the cost of the route starting from each of the nodes to the hub, and the cost of the route starting from the hub to each of the nodes, and includes these in the departure label and destination label, respectively, and stores them in the label data; and in the third step, the processor determines, as the route from the departure node to the destination node, the route corresponding to the combination in which the sum of the route cost from the departure connection point in the hub to the destination connection point, the route cost corresponding to the departure label, and the route cost corresponding to the destination label is the smallest, among combinations in which the travel direction from the departure connection point to the destination connection point is included in both the direction in which travel is possible from the departure connection point within the hub and the direction in which travel is possible within the hub to the destination connection point.

11. A delivery planning device according to claim 8, wherein the hub is a road section represented by a plurality of nodes connected by links.

12. A delivery planning device as described in claim 8, characterized in that the restriction data includes information that corresponds a combination of a target node, an entry node which is an adjacent node on the side entering the target node, and an exit node which is an adjacent node on the side exiting the target node, and restrictions on passage entering the target node from the entry node and exiting to the exit node.

13. A delivery planning device as described in claim 8, wherein the regulation data includes information on traffic regulations set on the road network for each condition, in the preliminary search procedure, the processor generates the label data for each condition, and in the route determination procedure, the processor determines a route based on the label data that matches the conditions that are the subject of the route search.

14. A delivery planning device according to claim 8, wherein the conditions include at least one of a time period and a type of passing vehicle.

Images