Replica Exchange Program Escaping Local Solutions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for solving combinatorial optimization problems, such as the simulated annealing and replica exchange methods, can be inefficient in escaping local solutions, leading to prolonged computation times.
Innovation Solution
A data processing program that uses a replica exchange method with multiple replicas at different temperature values to identify and escape local solutions by selecting replicas with small temperature differences and generating new states based on comparison with reference states.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the replica exchange method is used to solve combinatorial optimization problems, then the solution search can explore multiple states simultaneously, but the method may get stuck in local solutions and fail to escape efficiently
Solution Approach 1:
The patent implements feedback by monitoring the occurrence frequency of states in each replica and using this information to determine when to escape local solutions. When a state occurs excessively many times in a replica, the system triggers a escape mechanism that uses feedback from other replicas to generate new states, thereby resolving the contradiction between exploration efficiency and local optimum trapping
Solution Approach 2:
The patent introduces an intermediary mechanism where replicas serve as mediators for each other. When one replica is trapped in a local solution, other replicas provide alternative states through exchange operations. This intermediary interaction allows efficient escape from local solutions while maintaining the overall productivity of the parallel search process
2Loss of time
If multiple replicas are used to perform parallel solution search, then computation time can be reduced, but the complexity of managing and coordinating replicas increases
Solution Approach 1:
The patent applies segmentation by dividing the solution search into multiple independent replicas, each handling a portion of the search space. This segmentation allows parallel computation that reduces total time while managing complexity through modular, independent replica units that follow the same simplified escape protocol
Solution Approach 2:
The patent uses parameter changes by dynamically adjusting the number of state variables to flip when escaping local solutions. The system changes this parameter based on the occurrence frequency threshold, allowing efficient coordination of multiple replicas without complex management overhead
Data Source
AI summary
A recording medium storing a program for causing a computer to execute: selecting, in a solution search using replicas based on an evaluation function including multiple state variables, a number of replicas from the replicas by prioritizing a replica with a low difference in temperature value from a first temperature of a first replica; acquiring a second state to be compared with the first state, using a state acquired by the solution search; determining the number of state variables of which values are to be changed, using comparison between a first value of the evaluation in the first state and a second value of the evaluation function in the second state; generating a third state in which the values of the number of state variables among the multiple state variables in the first state are changed; and continuing the solution search in the first replica by the third state.