search.search_simulated_annealing module¶
-
class
search.search_simulated_annealing.SimulatedAnnealing(settings)¶ Bases:
circa.stages.search.search.Search-
class
HEURISTIC¶ Bases:
objectHeuristic IDs.
-
AREA= 'area'¶
-
DEFAULT= 'area'¶
-
SUPPORTED= ['area']¶
-
-
class
CFG¶ Bases:
objectParser settings for the configuration file options.
-
T_MIN= {'mandatory': True, 'parameter': 'TMin'}¶
-
ALPHA= {'mandatory': True, 'parameter': 'Alpha'}¶
-
EQUILIBRIUM= {'mandatory': True, 'parameter': 'Equilibrium'}¶
-
HEURISTIC= {'mandatory': False, 'parameter': 'Heuristic'}¶
-
-
__init__(settings)¶ Extends
__init__of Search.Raises: RuntimeError– If a configuration option is missing or its value cannot be parsed or is not supported.
-
setup(gen_info, root_node)¶ Sets up the Search instance using a GeneralInformation instance. Provides a default implementation.
Parameters: - gen_info (
GeneralInformation) – The framework’s GeneralInformation instance. - root_node (
Node) – A Node instance which is the search space tree’s root.
- gen_info (
-
hasTerminated()¶ Returns whether the search is finished or not.
-
acceptanceProbability(node_new, node_old)¶
-
popNextNode()¶ Returns the Node that is to be validated next. Can return
Noneif no more nodes exist.Returns: - The next Node to be validated or
Noneif no such - Node exists.
Return type: Node- The next Node to be validated or
-
expandSearchSpace()¶ Expands the search space tree and returns a list of all new Nodes to be approximated.
Returns: - A list containing all Nodes that need to
- be approximated.
Return type: list of Node
-
evaluateNodes()¶ Uses search-specific heuristics and circuit stats to evaluate nodes for popNextNode.
-
class