Annealing Calculation Device with Relaxation Solver for Accuracy Guarantee
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Annealing machines lack guaranteed accuracy in solving combinatorial optimization problems due to the approximate nature of their algorithms, leading to less accurate solutions for complex problems.
Innovation Solution
A solution accuracy guaranteeing annealing calculation device and method that combines an annealing machine with an integer programming solver to solve combinatorial optimization problems by generating relaxation problems, calculating lower or upper bounds to ensure solution accuracy through the first processing means and second processing means.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If annealing method is used to solve combinatorial optimization problems, then the device can handle complex constraints and find appropriate solutions, but the accuracy of the solutions is not guaranteed
Solution Approach 1:
The patent combines two different solving approaches: an annealing solver that handles complex constraints and an integer programming solver that guarantees solution accuracy. The system integrates both solvers to work on the same optimization problem, allowing the annealing component to explore the solution space under complex constraints while the integer programming component verifies and guarantees the optimality of the solution.
Solution Approach 2:
The patent introduces a relaxation problem as an intermediary between the original combinatorial optimization problem and the verification process. By solving a relaxed version of the problem (with relaxed constraints), the system obtains bounds that serve as intermediaries to verify the accuracy of the annealing solution without requiring direct comparison to the true optimal solution.
2Productivity
If annealing algorithm is used, then the method can provide approximate solutions for complex problems, but less accurate solutions may be obtained for complex problems
Solution Approach 1:
The patent performs preliminary action by solving a relaxation problem before finalizing the annealing solution. The relaxation problem is solved in advance to obtain lower bounds (for minimization problems) or upper bounds (for maximization problems) that will be used to verify the accuracy of the annealing solution, ensuring that the final solution meets the required accuracy standards.
Solution Approach 2:
The patent implements a feedback mechanism where the integer programming solver uses the bounds obtained from the relaxation problem to verify the annealing solution. If the annealing solution does not meet the accuracy requirements (i.e., the objective function value does not match the bounds within a tolerance), the system provides feedback to re-run the annealing process or adjust parameters, ensuring that the final output meets the desired precision.
Data Source
AI summary
A solution accuracy guaranteeing annealing calculation device includes a first solving unit which solves a combinatorial optimization problem by an annealing method, and a second solving unit which solves a relaxation problem, which is a problem generated by relaxing constraints imposed on the combinatorial optimization problem, wherein the second solving unit calculates, if the combinatorial optimization problem is a minimization problem, a lower bound of a minimization target in the minimization problem by solving the relaxation problem generated from the combinatorial optimization problem, and calculates, if the combinatorial optimization problem is a maximization problem, an upper bound of a maximization target in the maximization problem by solving the relaxation problem generated from the combinatorial optimization problem.