Tour calculation device, tour calculation method, and tour calculation program

Optimizing interconnected tours in infrastructure networks using network flow theory and integer programming enhances efficiency and connectivity, addressing the inefficiencies of manual design methods.

JP7954258B1Active Publication Date: 2026-11-19NTT WEST INC
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
JP2025146329
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2025-09-03
Publication Date
2026-11-19
Estimated Expiration
2045-09-03

AI Technical Summary

Technical Problem

Existing methods for designing multiple interconnected circuits in infrastructure networks, such as communication networks and power grids, are inefficient and lack optimality due to manual design based on experience, making it difficult to accommodate large-scale networks and ensure connectivity.

Method used

A method using mathematical programming models based on network flow theory, incorporating the Haversine formula for spherical distances and integer programming, to optimize multiple interconnected tours, with visual display of optimized routes.

Benefits of technology

This approach reduces network maintenance costs and improves work efficiency by optimizing interconnected tours, ensuring connectivity and reducing computational time through solver-assisted calculations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007954258000001_ABST
    Figure 0007954258000001_ABST
Patent Text Reader

Abstract

Optimize multiple interconnected circuits. [Solution] The tour calculation device 1 comprises: a distance calculation unit 12 that calculates the distance of each link connecting multiple bases; a model construction unit 13 that constructs a mathematical programming model for calculating the combination of links that minimizes the total travel distance for each tour using the distances of each link; a model calculation unit 14 that calculates multiple tours by connecting the combination of links that minimizes the total travel distance using the mathematical programming model; and a calculation result display unit 15 that displays the multiple tours. The mathematical programming model includes a first constraint condition for forming the tours and a second constraint condition to ensure that flows from one base reach all other bases and to ensure the existence of bases shared among multiple tours.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical Field]

[0001] The present invention relates to a tour route calculation device, a tour route calculation method, and a tour route calculation program. [Background technology]

[0002] Techniques for optimizing the circuit are known (see Patent Documents 1-4). [Prior art documents] [Patent Documents]

[0003] [Patent Document 1] Japanese Patent Publication No. 2024-146863 [Patent Document 2] Japanese Patent Publication No. 2023-183292 [Patent Document 3] Patent No. 7283549 [Patent Document 4] Japanese Patent Publication No. 2002-288624 [Overview of the Initiative] [Problems that the invention aims to solve]

[0004] However, we were unable to optimize the multiple interconnected circuits.

[0005] The present invention has been made in view of the above, and aims to provide a technology that can optimize multiple interconnected circuits. [Means for solving the problem]

[0006] A patrol route calculation device according to one aspect of the present invention includes a distance calculation unit that calculates the distance of each link connecting a plurality of bases, a model construction unit that uses the distance of each of the links to construct a mathematical programming model for calculating, for each patrol route, a combination of links that minimizes the total travel distance, a model calculation unit that uses the mathematical programming model to calculate a plurality of patrol routes each formed by connecting the links in the combination that minimizes the total travel distance, and a calculation result display unit that displays the plurality of patrol routes, wherein the mathematical programming model includes a first constraint condition for forming a patrol route, and a second constraint condition for ensuring that a flow from one base reaches all other bases and ensuring the existence of a base shared among the plurality of patrol routes.

[0007] A patrol route calculation method according to one aspect of the present invention is a patrol route calculation method performed by a patrol route calculation device, the method including a step of calculating the distance of each link connecting a plurality of bases, a step of using the distance of each of the links to construct a mathematical programming model for calculating, for each patrol route, a combination of links that minimizes the total travel distance, a step of using the mathematical programming model to calculate a plurality of patrol routes each formed by connecting the links in the combination that minimizes the total travel distance, and a step of displaying the plurality of patrol routes, wherein the mathematical programming model includes a first constraint condition for forming a patrol route, and a second constraint condition for ensuring that a flow from one base reaches all other bases and ensuring the existence of a base shared among the plurality of patrol routes.

[0008] A patrol route calculation program according to one aspect of the present invention causes a computer to function as the patrol route calculation device described above. [Advantageous Effects of Invention]

[0009] According to the present invention, a plurality of connected patrol routes can be optimized. [Brief Description of Drawings]

[0010] [Figure 1] Figure 1 is a diagram illustrating an example of functions of the patrol route calculation device. [Figure 2] Figure 2 is a diagram illustrating an example of operation of the patrol route calculation device. [Figure 3] Figure 3 shows a specific example of node information. [Figure 4] Figure 4 shows a specific example of edge information. [Figure 5] Figure 5 shows a concrete example of source code. [Figure 6] Figure 6 shows an image of the decision variables, etc. [Figure 7] Figure 7 shows a concrete example of source code. [Figure 8] Figure 8 shows a concrete example of source code. [Figure 9] Figure 9 shows a concrete example of source code. [Figure 10] Figure 10 shows an image of the flow. [Figure 11] Figure 11 shows an image of the flow. [Figure 12] Figure 12 is a diagram illustrating the flow. [Figure 13] Figure 13 shows a specific example of a tour route. [Figure 14] Figure 14 shows a specific example of a tour route. [Figure 15] Figure 15 shows an example of a tour route visualization. [Figure 16] Figure 16 shows an example of the hardware configuration of a circuit calculation device. [Modes for carrying out the invention]

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

[0012] [overview] In infrastructure design work such as communication networks, power grids, and water pipeline networks, designing efficient routes to visit multiple locations is crucial.

[0013] In particular, for tasks such as maintenance, inspection, and troubleshooting, workers are divided into multiple patrol routes, but these routes need to be interconnected. This is to allow for coordination between workers, equipment handover, and emergency support systems.

[0014] Traditionally, the design of multiple circuits with such connectivity constraints was done manually based on the experience and intuition of skilled engineers. This made it difficult to guarantee optimality and accommodate large-scale networks.

[0015] Therefore, this embodiment discloses a method for efficiently solving the optimization problem of multiple tours with connection constraints. Specifically, the following features 1 to 4 are disclosed.

[0016] (Feature 1) This project aims to construct mathematical programming models based on network flow theory. Specifically, it involves efficiently formulating connectivity constraints using network flow variables. In other words, it constructs mathematical programming models that include flow constraints to guarantee the connectivity of multiple circuits. By using mathematical programming models that include flow constraints, complex network design problems with connectivity constraints can be optimized. Furthermore, it can lead to reduced network maintenance costs and improved work efficiency.

[0017] (Feature 2) We introduce the Haversine formula for calculating great-circle distances between geographical coordinates. By using the Haversine formula, we can design realistic tours that take into account spherical distances on the Earth's surface.

[0018] (Feature 3) We will implement an exact solution method using integer programming. In other words, we will have a solver compute the integer programming model. By having a solver compute the integer programming model, we can efficiently compute the circuit. This will reduce the time required for design work that was previously done manually.

[0019] (Feature 4) The optimized routes and their interconnection structure are visually displayed. By visually displaying the routes and their interconnection structure, even non-experts can easily understand the route optimization results.

[0020] [Configuration of the circuit calculation system] Figure 1 shows an example of the functions of the tour calculation device 1. The tour calculation device 1 comprises a data acquisition unit 11, a distance calculation unit 12, a model construction unit 13, a model calculation unit 14, a calculation result display unit 15, and a calculation result output unit 16.

[0021] The data acquisition unit 11 has the function of acquiring various data for calculating the tour. These various data include, for example, location information for each location, link information between two locations, and optimization parameters (for example, the maximum length of each specified tour, and specified connection points).

[0022] The distance calculation unit 12 has the function of calculating the distance on the Earth's surface for each link between two locations included in the link information, using the Haversine formula. In other words, the distance calculation unit 12 calculates the great circle distance between two locations based on spherical trigonometry.

[0023] The model building unit 13 has the function of building a mathematical programming model based on network flow theory. In other words, the model building unit 13 builds an optimization model to optimize (minimize) the distance of the circuit using various data and the actual distance of each link, based on network flow theory.

[0024] Specifically, the model building unit 13 handles each link (x i、j Distance (c i,j Using ), find the link (x) that minimizes the total travel distance. i、j We construct an optimization model to calculate the combination of ) for each tour.

[0025] The optimization model includes a first constraint for forming the tours and a second constraint (flow constraint) based on network flow theory. The second constraint includes a constraint that ensures that flows from a base station reach all other stations, and a constraint that ensures the existence of stations shared among multiple tours.

[0026] The model calculation unit 14 uses an optimization model to determine the combination of links (x) that minimizes the total travel distance. i、j It has the function to calculate multiple tours that are linked together. In particular, the model calculation unit 14 calls a solver and has the solver calculate an optimization model to obtain the optimal solution for multiple tours with linking constraints.

[0027] The calculation result display unit 15 has a function to display multiple tours. In other words, the calculation result display unit 15 visualizes the optimal solution for the tour.

[0028] The calculation result output unit 16 has the function of outputting the optimal solution for the circuit.

[0029] [Operation of the Circuit Calculator] Figure 2 shows an example of the operation of the circuit calculation device 1. In this example, locations are referred to as nodes and links as edges.

[0030] Step S1; The data acquisition unit 11 acquires node information, edge information, and optimization parameters.

[0031] Node information (V), as shown in Figure 3, is information related to a node where communication equipment, etc., is installed. Node information includes the node ID, node name, postal code, address, latitude, and longitude.

[0032] Edge information (E), as shown in Figure 4, is information that associates two nodes to be connected with each other. The edge information includes the two nodes to be connected, row by row.

[0033] The optimization parameters are, for example, the maximum length of each designated patrol route.

[0034] Maximum length L of patrol route max refers to the maximum distance of the patrol route. The maximum length of the patrol route is used to adjust the balance between the solution quality of the optimization model and the calculation load.

[0035] That is, in step S1, the data acquisition unit 11 acquires the set of nodes V, the set of edges E, and the maximum length L of each patrol route k max . However, acquisition of the maximum length L of each patrol route k max is optional.

[0036] For reference, a specific example of source code for converting an edge between any two nodes (u, v) into a directed graph is shown in FIG. 5.

[0037] Step S2; The distance calculation unit 12 calculates the distance of edge E as a cost using the latitude and longitude information of each site included in the node information. Specifically, the distance calculation unit 12 calculates each cost c from each node i to each node j i,j respectively. c i,j is a cost matrix.

[0038] At this time, the distance calculation unit 12 calculates the great-circle distance of edge E using the Haversine formula. Since the Haversine formula takes into account the curved surface of the Earth's surface, the cost c that reflects the distance of the curved surface of the Earth's surface i,j can be calculated. Thereby, the cost c i、j can be calculated accurately, and the optimization of the patrol route can be further optimized.

[0039] Step S3; The model construction unit 13 constructs an optimization model for performing optimization calculation of the cost of the patrol route, that is, for performing minimization calculation of the total cost. Specifically, the model construction unit 13 defines decision variables and sets an objective function and constraint conditions as described below.

[0040] (Definition of decision variable) As shown in Figure 6, the model building unit 13 has an edge x between node i and node j. i、j And, edge y with circuit k as an element. i,j,k And the amount of flow f from node i to node j. i,j Let and be the decision variables. i、j This is the cost between node i and node j calculated in step S2.

[0041] Edge x i、j Edge x i、j x is a binary variable that indicates whether or not to use it. i、j The region is ∈{0,1}. Edge x i、j The edge variable x is 1 if it is used in any of the tours k, and 0 if it is not used. i、j A concrete example of the source code is shown in Figure 7(a).

[0042] edge y i,j,k Edge x i、j A binary variable y indicates whether or not it is included in the circuit k. i,j,k The region is ∈{0,1}. Edge y i,j,k This value is 1 if it is included in the circuit k, and 0 otherwise. A concrete example of the source code for the circuit k is shown in Figure 7(b). In this source code, the circuit is referred to as a cycle.

[0043] Flow rate f i,j Edge x i、j A flow quantity f is any logical or physical quantity that flows through the system and is an auxiliary variable used to satisfy the constraints. i,j This is a variable that takes real values ​​within the range of 0 to "|V|-1" (where |V| is the total number of nodes), and edge x i、j The flow variable f can take on different values ​​each time. i,j A concrete example of the source code is shown in Figure 7(c).

[0044] (Setting the objective function and constraints) The model building unit 13 is edge x i、j and cost c i、jWe construct an objective function to calculate the minimum value of the sum of the cumulative values.

[0045]

number

[0046] Equation (1) is an example of an objective function. By calculating Equation (1), we can find the combination of nodes (i,j) that minimizes the total travel cost. In other words, the edge x that minimizes the total travel cost. i、j The combinations are calculated for each tour. A concrete example of the source code for the objective function is shown in Figure 8(a).

[0047] The model building unit 13 constructs the constraints from equations (2) to (10) for the objective function of equation (1). Equations (2) to (7) are the first constraints for forming the circuit. Equations (8) to (10) are the second constraints (flow constraints) based on network flow theory.

[0048] By combining the constraints in equations (8) to (10), we can ensure that flows from a reference node reach all other nodes and guarantee the existence of nodes shared among multiple tours. In other words, equations (8) to (10) include flow preservation constraints, flow capacity constraints, and inter-tour connectivity constraints.

[0049]

number

[0050] Equation (2) is a constraint that each node must have the same number of in-degrees and out-degrees. A concrete example of the source code for equation (2) is shown in Figure 8(b). Degree refers to the number of edges connected to a node. In-degree and out-degree refer to the number of in- and out-degree edges, respectively.

[0051]

number

[0052] Equation (3) is a constraint that each node must have at least one in-degree. A concrete example of the source code for equation (3) is shown in Figure 8(c).

[0053]

number

[0054] Equation (4) is a constraint that each node must have at least one out-degree. A concrete example of the source code for equation (4) is shown in Figure 8(c).

[0055]

number

[0056] Equation (5) is a constraint that determines whether each edge belongs to a single tour k or is not used as part of tour k. A concrete example of the source code for equation (5) is shown in Figure 8(d).

[0057]

number

[0058] Equation (6) is a constraint condition for matching the input and output order for each node in each tour k. A concrete example of the source code for equation (6) is shown in Figure 8(e).

[0059]

number

[0060] Equation (7) shows that the cost of each circuit k is equal to the maximum length L of each circuit k. max The following are the constraints. A concrete example of the source code for equation (7) is shown in Figure 8(f).

[0061] The cost of each circuit k is the maximum length L maxBy doing the following, it is possible to calculate a practical circuit that does not result in excessive network latency. Furthermore, it is possible to approximate the network configuration intended by the network designer.

[0062] Note that in step S1, the maximum length L of each circuit k is determined. max If it is not obtained, formula (7) is not used.

[0063]

number

[0064] Equation (8) is a constraint that allows any reference node s∈V to send flows to all other nodes j. In other words, equation (8) is a flow preservation constraint for each node. A concrete example of the source code for equation (8) is shown in Figure 9(a).

[0065]

number

[0066] Equation (9) is a constraint that other nodes i ∈ V receive only 1 flow. Equation (9) is also a flow preservation constraint for each node. A concrete example of the source code for equation (9) is shown in Figure 9(a).

[0067]

number

[0068] Equation (10) is a constraint that allows flow only when an edge is selected. In other words, equation (10) is a flow capacity constraint. A concrete example of the source code for equation (10) is shown in Figure 9(b).

[0069] (Flow preservation constraint) The flow preservation constraints in equations (8) and (9) will be explained.

[0070] Since the flow must pass through all nodes, the flow originating from any reference node s must reach all nodes. Therefore, in equation (8), the flow rate is set so that |V|-1 bottles of water that spring from the starting reference node s can be drained one by one to |V|-1 other nodes i.

[0071] The first term on the left side of equation (8) is "Σf s,j " is the sum of the flow amounts flowing out from the reference node s (see Figure 10(a)). The second term on the left side of equation (8) is "Σf j,s This is the sum of the flow volumes flowing into the reference node s (see Figure 10(b)).

[0072] The equation "Sum of flow volumes flowing out of reference node s - Sum of flow volumes flowing into reference node s = |V|-1" guarantees that "|V|-1" flows, excluding reference node s, will be sent to "|V|-1" other nodes i.

[0073] However, equation (8) alone does not tell us whether "|V|-1" flows always reach all other nodes i. Therefore, equation (9) imposes a condition that exactly one flow must flow into each other node i.

[0074] The first term on the left side of equation (9) is "Σf j,i " is the sum of the flow amounts flowing into node i (see Figure 11(a)). The second term on the left side of equation (9) is "Σf i,j This is the total amount of flow out of node i (see Figure 11(b)).

[0075] The condition "Total amount of flow entering node i - Total amount of flow leaving node i = 1" guarantees that node i will consume one of the multiple flows that enter it.

[0076] By combining the constraints in equations (8) and (9), a tour that passes through all nodes can be formed. In other words, partial tours (subtours) can be eliminated.

[0077] (Flow capacity constraints) Let's explain the flow capacity constraint in equation (10).

[0078] Edge x i、j If it is 1 (edge ​​x i、j When using f i、j Let ≤(|V|-1) (see Figure 12(a)). That is, edge x i、j Flow amount f i、j This guarantees that the flow rate will be less than or equal to the maximum value of "|V|-1".

[0079] Edge x i、j If =0 (edge ​​x) i、j If you do not use f i、j ≤ 0, and flow f i、j The quantity is always 0 (see Figure 12(b)).

[0080] (Connection constraints between circuits) The constraints on connectivity between tours are met by combining equations (8) to (10). Equations (8) and (9) guarantee that all other nodes receive the flow sent by the reference node. Also, from equation (10), the edges (x) where no tour exists are met. i、j Flow cannot flow to edges (x = 0), and a circuit exists on the edge (x i、j =1) guarantees that a flow can pass through it. In other words, all circuits can be connected via a flow.

[0081] The user may specify any of the multiple nodes as a connection point for the tour, or the tour calculation device 1 may automatically determine it.

[0082] Step S4; The model calculation unit 14 calculates the objective function in equation (1) under the constraints in equations (2) to (10).

[0083] At this point, the model calculation unit 14 calls a solver, has the solver calculate an optimized model, and obtains the optimal solution for the tour from the solver. The optimal solution for the tour obtained here is a set of connected tours with minimized cost (optimized).

[0084] A solver is an algorithm for solving optimization problems. When an objective function to be minimized and constraints are input, it uses methods such as differential calculus and numerical techniques to calculate a mathematical solution or an approximate solution. Various solvers exist depending on the application. In this embodiment, for example, Gurobi, which solves integer computation problems, can be used.

[0085] By having the solver calculate the optimization model, the model calculation unit 14 can perform the calculation more efficiently than if it were to do it itself, reducing the computational load and enabling optimization of calculation parameters according to the problem size.

[0086] Here, we will explain an example of a tour.

[0087] Figure 13 shows a specific example of a circuit, specifically showing a path that satisfies each of the constraints in equations (8) to (10). Nine flows emerge from the reference node i=1, and all other nodes i each drain one flow, forming a path in which all nodes are connected.

[0088] Figure 14 shows a specific example of a circuit, specifically example 2. It illustrates a case where multiple circuits can coexist within the same circuit k. Two circuits (i=1→2→4→3, i=7→8→10→9) are formed within the circuit k=0. One circuit (i=4→5→7→6) is formed within the circuit k=1. Nodes i=4 and i=7 are connection points. Note that k=0 and k=1 are in any order.

[0089] Step S5; The calculation result display unit 15 visually displays the optimal solution for the tour route on the display device screen. For example, as shown in Figure 15, the calculation result display unit 15 superimposes the tour route onto a map on the screen and highlights the connection points between multiple tour routes. The calculation result display unit 15 may also display multiple tour routes in different colors and show the order in which the base stations are visited.

[0090] Step S6; The calculation result output unit 16 associates the base information and the order of access between bases for each tour route, sends the tour information report to the worker's terminal, and outputs it to a printable medium or the like.

[0091] [effect] According to this embodiment, the system includes a distance calculation unit 12 that calculates the distance of each link connecting multiple locations, a model construction unit 13 that constructs a mathematical programming model (optimization model) for calculating the combination of links that minimizes the total travel distance for each tour using the distances of each link, a model calculation unit 14 that calculates multiple tours by connecting the link combinations that minimize the total travel distance using the mathematical programming model, and a calculation result display unit 15 that displays the multiple tours. The mathematical programming model includes a second constraint condition to ensure that the flow from one location reaches all other locations and to ensure the existence of locations shared among the multiple tours, thereby optimizing the multiple connected tours.

[0092] According to this embodiment, the distance calculation unit 12 calculates the great circle distance of each link, so that the multiple interconnected circuits can be further optimized.

[0093] According to this embodiment, the first constraint condition includes the maximum value of the tour, so that multiple connected tours can be further optimized.

[0094] According to this embodiment, the model calculation unit 14 causes the solver to calculate the mathematical programming model, so the optimization calculation of the tour can be performed efficiently.

[0095] According to this embodiment, the calculation result display unit 15 superimposes the multiple tours onto a map on the screen, making it easy to understand the optimized multiple tours.

[0096] [others] The circuit calculation device 1 of this embodiment described above can be realized using a general-purpose computer system, for example, as shown in Figure 16, which includes a CPU 901, a memory 902, a storage 903, a communication device 904, an input device 905, and an output device 906. The memory 902 and the storage 903 are storage devices. In this computer system, the CPU 901 executes a predetermined program loaded onto the memory 902, thereby realizing each function of the circuit calculation device 1.

[0097] The tour calculation device 1 may be implemented on a single computer. The tour calculation device 1 may be implemented on multiple computers. The tour calculation device 1 may also be a virtual machine implemented on a computer.

[0098] The program for the circuit calculation device 1 can be stored on a computer-readable recording medium such as an HDD, SSD, USB memory, CD, or DVD. A computer-readable recording medium is, for example, a non-transitory recording medium. The program for the circuit calculation device 1 can also be distributed via a communication network.

[0099] The functionality of each element of this disclosure may be implemented using circuits or processing circuits that include general-purpose processors, special-purpose processors, integrated circuits, ASICs (Application Specific Integrated Circuits), FPGAs (Field Programmable Gate Arrays), general circuits, and / or combinations thereof, which are programmed using one or more programs stored in one or more memories, or otherwise configured to perform the disclosed functionality.

[0100] A processor is considered a circuit or processing circuit because it includes transistors and other circuits. A processor may be a programmed processor that executes a program stored in memory. In this disclosure, a circuit, unit, or means is hardware that performs the enumerated functions, or hardware programmed to perform the enumerated functions. Hardware may be any hardware of this disclosure that is programmed or configured to perform the enumerated functions.

[0101] Memory stores computer programs, including computer instructions. These computer instructions provide logic and routines that enable hardware (e.g., circuits or processing circuits) to perform the methods of this disclosure. This computer program can be implemented in common forms, such as computer-readable storage media, computer program products, memory devices, recording media such as CD-ROMs and DVDs, and / or memory of FPGAs or ASICs. [Explanation of symbols]

[0102] 1 Circuit calculation device 11 Data Acquisition Unit 12 Distance calculation section 13 Model Building Department 14. Model Calculation Unit 15 Calculation result display section 16 Calculation result output section 901 CPU 902 memory 903 Storage 904 Communication equipment 905 Input device 906 Output device

Claims

1. A distance calculation unit that calculates the distance of each link connecting multiple locations, A model building unit constructs a mathematical programming model for calculating the combination of links that minimizes the total travel distance for each tour, using the distances of each link. A model calculation unit that uses the aforementioned mathematical programming model to calculate multiple tours by connecting links in combinations that minimize the total travel distance, The system includes a calculation result display unit that displays the plurality of circuits, The aforementioned mathematical programming model is The determination variables include a first variable indicating whether each link is used, a second variable indicating whether each link is included in a particular tour, and a third variable indicating the amount of flow between locations; an objective function that minimizes the sum of the product values ​​of the distance of each selected link and the first variable; a first constraint for forming a tour; and a second constraint to ensure that the flow from one location reaches all other locations and to ensure the existence of locations shared among multiple tours. The first constraint is, This includes constraints that each location must have the same number of in-degrees and out-degrees, constraints that each location must have one or more in-degrees, constraints that each location must have one or more out-degrees, constraints that define whether each link belongs to a particular tour or is unused, and constraints that ensure the in-degrees for each location are consistent for each tour. The second constraint is, A network flow calculation device that includes constraints that guarantee that the flow amount reaches all other locations from a predetermined reference location, constraints that specify that each other location receives one unit of the flow amount, and constraints that specify that the flow amount flows only when the link is selected.

2. The distance calculation unit, The circuit calculation device according to claim 1, which calculates the great circle distance of each of the aforementioned links.

3. The first constraint is, A tour calculation device according to claim 1, which includes the maximum value of the tour.

4. The aforementioned model calculation unit, The circuit calculation device according to claim 1, which causes a solver to calculate the mathematical programming model.

5. The calculation result display unit is, The tour calculation device according to claim 1, which superimposes the plurality of tours onto a map on the screen.

6. In a tour calculation method performed by a tour calculation device, The steps include calculating the distance of each link connecting multiple locations, The steps include constructing a mathematical programming model to calculate the combination of links that minimizes the total travel distance for each tour, using the distances of each link, The steps include: using the mathematical programming model described above, calculating multiple tours by connecting links in combinations that minimize the total travel distance; The step of displaying the plurality of circuits is included, The aforementioned mathematical programming model is The determination variables include a first variable indicating whether each link is used, a second variable indicating whether each link is included in a particular tour, and a third variable indicating the amount of flow between locations; an objective function that minimizes the sum of the product values ​​of the distance of each selected link and the first variable; a first constraint for forming a tour; and a second constraint to ensure that the flow from one location reaches all other locations and to ensure the existence of locations shared among multiple tours. The first constraint is, This includes constraints that each location must have the same number of in-degrees and out-degrees, constraints that each location must have one or more in-degrees, constraints that each location must have one or more out-degrees, constraints that define whether each link belongs to a particular tour or is unused, and constraints that ensure the in-degrees for each location are consistent for each tour. The second constraint is, A circuit calculation method based on network flow theory, including constraints that guarantee that the flow amount reaches all other locations from a predetermined reference location, constraints that specify that each other location receives one unit of the flow amount, and constraints that specify that the flow amount flows only when the link is selected.

7. A tour calculation program that causes a computer to function as a tour calculation device according to any one of claims 1 to 5.

Citation Information

Patent Citations

  • Route optimization program, route-optimizing method and route-optimizing device

    JP2002288624A

  • Route calculation program, route optimization system, and route calculation method

    JP2021111237A

  • Cost specifying apparatus, path finding apparatus, cost specifying method, path finding method, cost specifying program, and cost specifying system

    JP2023183292A

  • Local-search based solution of combinatorial optimization problem using annealer-based solver

    JP2024146863A

  • Network design device, network design method, and program

    JP7283549B2