Abstract: A system for computing an optimal path includes an arithmetic unit. The arithmetic unit is configured to compute an objective moving path from one of a plurality of nodes to another one of the plurality of nodes. Each of a plurality of link variables corresponds to a path connecting any two adjacent nodes of the plurality of nodes. Each of the plurality of link variables has a value and a direction. Each of a plurality of loop variables corresponds to a closed path connecting at least any three nodes of the plurality of nodes. Each of the plurality of loop variables has a value and a direction. A reference path variable corresponds to any moving path and has a value and a direction. The arithmetic unit computes the plurality of link variables based on the reference path variable and the plurality of loop variables. The arithmetic unit uses the plurality link variables to compute a plurality of objective function values corresponding, respectively, to a plurality of moving paths.

Abstract: Disclosed is a loop-wise route optimization method including defining, by a loop variable designer, a loop as a set of links of a predetermined directionality including a clockwise direction or a counterclockwise direction in which a start node and an end node are the same in a graph including nodes and links; defining, by the loop variable designer, loop variables that are virtual variables each having a continuous value between a negative base route value and a positive base route value assigned in a predetermined directionality including a clockwise direction or a counterclockwise direction to the loop; defining, by a base route designer, a base route has a positive value and of which a travel direction is set in a direction from the origin node to the destination node; and formulating, by an effective route searcher, an effective route problem using the loop variables and the base route.