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

• Main Authors: ITO KUNIHARU, HIRANO KOJI, KOBAYASHI TAKAKAZU, KUROKAWA TETSUAKI
• Format: Patent
• Language: English; Japanese
• Published: 05.11.2020
• Subjects: CALCULATING; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS; COMPUTING; COUNTING; PHYSICS

To quickly solve an optimization problem.SOLUTION: An optimization support device 10 comprises: an input information acquisition unit 11 that acquires input information on an optimization problem; a decision variable setting unit 12 that sets a decision variable of the optimization problem; an objective function setting unit 13 that sets an objective function of a slave problem in which a partial constraint of the optimization problem is relaxed; an input unit 14 that decomposes the decision variable and inputs, to a quantum computer 20, a coefficient of the objective function as the value of a weight of association between nodes; a result acquisition unit 15 that acquires an optimal solution to the slave problem from the quantum computer 20 and determines an optimal value of the objective function of the slave problem; and an optimal solution determination unit 16 that, based on a relaxed solution obtained by binding the optimal solutions and a relaxed optimal value obtained by adding optimal values together, when provided with the partial constraint, takes the relaxed solution as the optimal solution to the original optimization problem, and when not provided with the partial constraint, takes an executable solution obtained by correcting a violation included in the relaxed solution as the optimal solution to the original optimization problem.SELECTED DRAWING: Figure 1 【課題】迅速に最適化問題を求解する。【解決手段】最適化支援装置１０は、最適化問題の入力情報を取得する入力情報取得部１１、最適化問題の決定変数を設定する決定変数設定部１２、最適化問題の一部の制約条件を緩和した子問題の目的関数を設定する目的関数設定部１３、分解した決定変数を変数、目的関数の係数をノード間の結合の重みの値として量子計算機２０に入力する入力部１４、量子計算機２０から子問題の最適解を取得し、子問題の目的関数の最適値を求める結果取得部１５、最適解を束ねた緩和解と、最適値を加え合わせた緩和最適値に基づき、前記一部の制約条件具備の場合、緩和解を元の最適化問題の最適解とし、前記一部の制約条件不備の場合、緩和解に含まれる違反を修正して得た実行可能解を元の最適化問題の最適解とする最適解決定部１６を備える。【選択図】 図１