Denso Corporation

Tohoku University

Kyoto University

Masayuki Ohzeki

Shuntaro Okada

Masayoshi Terabe

Akira Miki

A combinatorial optimization system includes an input unit to which a multivalued optimization problem is input, a halving unit configured to perform halving to select half of candidate solutions of the multivalued optimization problem, and an optimization control unit configured to obtain an optimal solution of the multivalued optimization problem by causing the halving unit to repeat the halving.

Combinatorial optimization system and combinatorial optimization method

A variable embedding method, for solving a large-scale problem using dedicated hardware by dividing variables of a problem graph into partial problems and by repeating an optimization process of the partial problems when an interaction of the variables of an optimization problem is expressed in the problem graph, includes: determining whether a duplicate allocation of the variables of the optimization problem to the vertices of the hardware graph is required when embedding at least a part of all the variables into the vertices of the hardware graph; and selecting one of the variables requiring no duplicate allocation and embedding selected variable in one of the vertices of the hardware graph without using another one of the variables requiring the duplicate allocation as one of the variables of the partial problem.

Variable embedding method and processing system

An optimum route of multiple mobile objects is estimated by: generating a time-series route candidate of a shortest route for each mobile object; generating a time-series route candidate of a detour route for each mobile object; calculating route assignment evaluation values for the shortest route and the detour route for each mobile object; calculating travel distance evaluation values for the shortest route and the detour route for each mobile object; calculating a route collision evaluation value of a combination for the shortest route and the detour route for each mobile object; and comparing a total value of the route assignment evaluation value, the travel distance evaluation value, and the route collision evaluation value for combinations of the time-series route candidates of the mobile objects, and estimating one of the combinations of the time-series route candidates of the mobile objects as the optimum route.

Route estimation system, route estimation method and non-transitory computer-readable storage medium for the same

A non-transitory computer-readable storage medium storing a nonlinear optimization program of a continuous value optimization problem, the program relating to an optimization problem, is provided. The program causes an optimization apparatus to execute repeatedly and alternately procedure comprising: updating a variable of an evaluation function, causing an equality constraint to be gradually approached while searching for a condition at which the evaluation function approaches an extreme value; and updating the variable of the equality constraint, causing a condition at which the evaluation function to become close to the extreme value while keeping the equality constraint satisfied is gradually approached.

Non-transitory computer-readable storage medium storing nonlinear optimization program of continuous value optimization problem, non-transitory computer-readable storage medium storing route search program, and route search apparatus

Growing community of inventors

Sendai, Japan

Masayuki Ohzeki