OPTIMIZATION SYSTEM, OPTIMIZATION SUPPORT DEVICE, OPTIMIZATION SUPPORT METHOD, AND OPTIMIZATION SUPPORT PROGRAM

• Main Author: KUROKAWA TETSUAKI
• Format: Patent
• Language: English; Japanese
• Published: 18.03.2021
• Subjects: CALCULATING; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS; COMPUTING; CONTROL OR REGULATING SYSTEMS IN GENERAL; CONTROLLING; COUNTING; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS; PHYSICS; REGULATING

To provide an optimization system that can efficiently solve an aggregate division problem by a hybrid method that uses a general-purpose computer and a quantum computer properly.SOLUTION: An optimization system for finding an optimum solution of an aggregate division problem is configured as follows. A general-purpose computer transforms a set division problem into a dual problem, finds a solution to the dual problem, and creates a column generator problem that includes the solution of the dual problem and is represented by a binary variable; a quantum computer solves a column generator problem; when the solution of the column generator problem includes a solution that does not satisfy a convergence condition, the general-purpose computer adds the solution of the column generator problem to a subset family as a subset candidate; the general-purpose computer and the quantum computer repeat the generation and the solution of the column generator problem until the solution of the column generator problem does not include the solution that does not satisfy the convergence condition; the general-purpose computer outputs, when the solution of the column generator problem does not include the solution that does not satisfy the convergence condition, the subset family to the quantum computer; and the quantum computer finds and outputs, based on the input column set, an optimum solution.SELECTED DRAWING: Figure 1 【課題】汎用計算機と量子計算機とを使い分けるハイブリッド方式により集合分割問題を効率よく求解することができる最適化システムを提供する。【解決手段】集合分割問題の最適解を求める最適化システムを、汎用計算機が、集合分割問題を双対問題に変換し、双対問題の解を求め、双対問題の解を含み２値変数により表される列生成子問題を作成し、量子計算機が列生成子問題を求解し、汎用計算機が、列生成子問題の解に収束条件を満たさない解が含まれる場合、当該列生成子問題の解を部分集合の候補として部分集合族に追加し、汎用計算機および量子計算機は、列生成子問題の解に収束条件を満たさない解が含まれなくなるまで列生成子問題の生成および求解を繰り返し、汎用計算機が、列生成子問題の解に収束条件を満たさない解が含まれない場合、部分集合族を量子計算機に出力し、量子計算機は、入力された列集合に基づいて最適解を求解し出力するよう構成する。【選択図】図１