Multi-bit Transition Logic for Combinatorial Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multi-bit transition processes for combinatorial optimization problems are complex to implement due to the difficulty in calculating change amounts of evaluation functions for multiple bits, leading to complications in data configuration and processing.
Innovation Solution
A data processing apparatus and method that acquires change amounts of evaluation functions for multiple state variables, updates local fields, and determines whether to accept changes in multiple bits based on cumulative values, allowing for easier implementation of multi-bit transitions by simplifying the circuit configuration and enabling efficient solution searching.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a multi-bit transition process is implemented to escape local solutions and widen search range, then solution searching efficiency is improved, but implementation complexity increases due to difficulty in calculating change amounts of evaluation functions for multiple bits
Solution Approach 1:
The patent segments the calculation of evaluation function change amounts into individual bit contributions. Instead of calculating the total change amount for multiple bits simultaneously, the system calculates the change amount for each bit separately and accumulates them. This segmentation simplifies the computational process and reduces implementation complexity while maintaining the multi-bit transition capability that improves solution searching efficiency.
Solution Approach 2:
The patent pre-calculates and stores the change amounts of evaluation functions for individual bit transitions before performing multi-bit transitions. By having these values prepared in advance, the system can quickly determine whether to accept multi-bit transitions without performing complex real-time calculations, thus improving solution searching efficiency while keeping the implementation straightforward.
2Adaptability or versatility
If multi-bit transitions are permitted to widen search range, then escape from local solutions is promoted, but calculation of change amounts for multiple bits becomes complex
Solution Approach 1:
The patent divides the evaluation function change amount calculation into separate contributions from each bit. By segmenting the calculation in this way, the system can easily compute the total change amount for any combination of bits by simply summing the pre-calculated individual bit contributions, thereby maintaining adaptability for multi-bit transitions while avoiding calculation complexity.
3Ease of manufacture
If single-bit transition process is used, then implementation is simpler, but escape from local solutions becomes difficult and search speed decreases
Solution Approach 1:
The patent pre-calculates the change amounts for individual bit transitions and stores them for quick retrieval. This preliminary action allows the system to efficiently evaluate multi-bit transitions by simply summing pre-computed values, thereby achieving both implementation simplicity and improved search speed through multi-bit transitions.
Solution Approach 2:
The system uses the same calculation mechanism for both single-bit and multi-bit transitions. By designing the evaluation function change amount calculation to work seamlessly for any number of bits, the system maintains implementation simplicity while enabling faster multi-bit transitions to escape local solutions, thus improving search speed without adding complexity.
Data Source
AI summary
A data processing apparatus configured to: acquire a change amount of a value of an evaluation function of a combinatorial optimization problem for each of a plurality of state variables included in the evaluation function, update, every time one of the plurality of state variables is changed, a value of a local field of the one of the plurality of state variables, acquire a cumulative value of the change amount, determine whether to accept a change in values of a first number, which is equal to or more than 2, of the plurality of state variables, based on the cumulative value, and when the change in values of the first number is not accepted, return the updated value of the local field to a value of a local field at the certain time point.