-
公开(公告)号：US20250053610A1
公开(公告)日：2025-02-13
申请号：US18594072
申请日：2024-03-04
Applicant: Hitachi, Ltd.
Inventor： Yusuke SUGITA
IPC: G06F17/11
Abstract: A simulation apparatus is an apparatus that obtains a solution of a combinatorial optimization problem by SA, in which a local optimal solution of an objective function is acquired by using a local search method of changing a temperature parameter, a statistic is calculated based on the local optimal solution and a probability distribution function of a variable included in the objective function, a maximum value (temperature parameter when a standard deviation related to a state of the local optimal solution is large) and a minimum value (temperature parameter when the standard deviation is small) as a search range for the temperature parameter are obtained based on the calculated statistic (standard deviation), and a good solution is obtained by executing the simulated annealing a plurality of times in the search range having the maximum value and the minimum value for the temperature parameter.
-
公开(公告)号：US20230153376A1
公开(公告)日：2023-05-18
申请号：US17895250
申请日：2022-08-25
Applicant: Hitachi, Ltd.
Inventor： Yusuke SUGITA , Takuya OKUYAMA
IPC: G06F17/18
CPC classification number: G06F17/18
Abstract: Provided are an optimization method, an information processing device, and an information processing system capable of efficiently performing a ground state search of a constrained binary quadratic model. The information processing device performs the ground state search for the constrained binary quadratic model by substituting the ground state search for the binary quadratic model in which the interaction relationship between variables has a complete bipartite graph structure. Here, this information processing device divides the variable group corresponding to the vertex set divided into two in the complete bipartite graph into a group capable of updating the state in which the constraint is satisfied. Then, this information processing device can update the group of each variable group in parallel based on the information of the energy function and the variable, and execute the process of searching the ground state.
-
公开(公告)号：US20220308837A1
公开(公告)日：2022-09-29
申请号：US17399091
申请日：2021-08-11
Applicant: Hitachi, Ltd.
Inventor： Yusuke SUGITA , Takuya OKUYAMA , Masanao YAMAOKA
Abstract: Provided is an optimization method including executing a ground state search for an interaction model by a ground state search in a surrogate interaction model including D (D is a natural number of three or more) variable groups each having N continuous variables by using an information processing apparatus, the interaction model having a third-order or higher-order energy function including N (N is a natural number) continuous variables and discrete variables. The ground state search is executed based on simulated annealing. An interaction relation of the surrogate interaction model has a complete D-part graph structure. A coupling is set between i-th variable pairs in the respective variable groups of the surrogate interaction model. The information processing apparatus is operated to simultaneously update all variables of one variable group from among the D variable groups when performing a state transition in the surrogate interaction model.
-
公开(公告)号：US20240232290A1
公开(公告)日：2024-07-11
申请号：US18368717
申请日：2023-09-15
Applicant: Hitachi, Ltd.
Inventor： Yusuke SUGITA , Nobuo BENIYAMA , Masanao YAMAOKA
Abstract: An object is to efficiently solve a quadratic programming problem having a k-hot constraint (k is a positive integer) for binary variables. A preferred aspect of the invention is an optimization method for, using an information processing apparatus, solving a quadratic programming problem in which one or more independent k-hot constraints are imposed on binary variables, the information processing apparatus including a processor, a storage device, an input device, and an output device. The information processing apparatus relaxes the binary variables into continuous values by adding correction values to a nonlinear coefficients of the binary variables on which the k-hot constraints are imposed, and the information processing apparatus executes a solution search while satisfying the k-hot constraints by executing a state transition such that a sum of a set of continuous variables on which the k-hot constraint is imposed is constant.
