#include <incop.h>
Inheritance diagram for OpProblem:
Public Member Functions | |
virtual void | move_execution (Configuration *configuration, Move *move) |
virtual void | incr_update_conflicts (IncrCSPConfiguration *configuration, Move *move) |
virtual void | fullincr_update_conflicts (FullincrCSPConfiguration *configuration, Move *move) |
virtual void | allocate_moves () |
virtual Move * | create_move () |
virtual void | adjust_parameters (Configuration *configuration, int &maxneighbors, int &minneighbors) |
virtual void | next_move (Configuration *configuration, Move *move, NeighborhoodSearch *nbhs) |
virtual void | random_configuration (Configuration *configuration) |
virtual void | best_config_analysis () |
virtual void | best_config_write () |
virtual void | best_config_verification () |
virtual void | init_population (Configuration **population, int populationsize) |
virtual Configuration * | create_configuration () |
virtual int | compute_conflict (Configuration *configuration, int var, int val) |
virtual int | config_evaluation (Configuration *configuration) |
virtual int | move_evaluation (Configuration *configuration, Move *move) |
virtual int | index2value (int index, int var) |
virtual int | value2index (int value, int var) |
virtual void | compute_var_conflict (Configuration *configuration) |
Public Attributes | |
Configuration * | best_config |
int | nbvar |
int | lower_bound |
Move * | currentmove |
Move * | firstmove |
Move * | bestmove |
|
adjustment of the neighborhood parameters (when the size of the actual neighborhood is greater than maxneighbors) Reimplemented in CSProblem, SwNqueen, and SwNiNqueen. |
|
creation of 3 Move objects (currentmove,bestmove,firstmove) |
|
analysis of the best configuration Reimplemented in ColorCSProblem, ImpasseColor, and CSProblem. |
|
verification of the best solution (its cost is recomputed) |
|
writing the best solution Reimplemented in CelarCSProblem, ColorCSProblem, ImpasseColor, and CSProblem. |
|
computation of the participation of (var,val) to the configuration evaluation Reimplemented in CelarCSProblem, ColorCSProblem, ExtensionBinaryCSProblem, and WeightExtensionBinaryCSProblem. |
|
compute the variables participating to a conflict in the configuration Reimplemented in CelarCSProblem, ImpasseColor, CSProblem, and SwNqueen. |
|
evaluation of a configuration Reimplemented in CelarCSProblem, ColorCSProblem, ImpasseColor, ExtensionBinaryCSProblem, CliqueProblem, Nqueen, SwNqueen, SwNiNqueen, and WeightExtensionBinaryCSProblem. |
|
create a configuration (the exact class depends on the problem and must defined in subclasses) Reimplemented in CelarCSProblem, ColorCSProblem, CSProblem, ExtensionBinaryCSProblem, CliqueProblem, Nqueen, SwNiNqueen, and WeightExtensionBinaryCSProblem. |
|
creation of 1 Move object (the class of the Move depends on the problem) : this method is implemented in subclasses Reimplemented in CSProblem, CliqueProblem, and SwNqueen. |
|
update of the conflict data structure (case FullincrCSPConfiguration) Reimplemented in CelarCSProblem, ColorCSProblem, ImpasseColor, ExtensionBinaryCSProblem, CliqueProblem, Nqueen, SwNqueen, and WeightExtensionBinaryCSProblem. |
|
update of the conflict data structure (case IncrCSPConfiguration) Reimplemented in CelarCSProblem, ColorCSProblem, ExtensionBinaryCSProblem, CliqueProblem, and WeightExtensionBinaryCSProblem. |
|
valueindex in the domain to value Reimplemented in CelarCSProblem. |
|
initialization of the population of size populationsize Reimplemented in CSProblem. |
|
evaluation of a configuration if the move is done Reimplemented in CelarCSProblem, CSProblem, CliqueProblem, SwNqueen, and SwNiNqueen. |
|
move execution (modification of the current configuration) Reimplemented in CelarCSProblem, ImpasseColor, CSProblem, CliqueProblem, and SwNqueen. |
|
next move to be tested (implemented in subclasses) Reimplemented in CSProblem, CliqueProblem, and SwNqueen. |
|
random assignment of the variables of a configuration Reimplemented in CelarCSProblem, ImpasseColor, CSProblem, CliqueProblem, and SwNqueen. |
|
valueindex of value in its domain Reimplemented in CelarCSProblem. |
|
the best configuration found |
|
the best move found in the neighborhood |
|
the current move being tested |
|
the first feasible move tried in the neighborhood |
|
given lower bound , is used as a stop condition when it is reached |
|
the number of variables |