Simulated annealing optimization algorithm for permutations. More...
#include <PolysemousTraining.h>
Public Member Functions | |
SimulatedAnnealingOptimizer (PermutationObjective *obj, const SimulatedAnnealingParameters &p) | |
logs values of the cost function | |
double | optimize (int *perm) |
double | run_optimization (int *best_perm) |
Public Attributes | |
PermutationObjective * | obj |
int | n |
size of the permutation | |
FILE * | logfile |
RandomGenerator * | rnd |
double | init_cost |
remember intial cost of optimization | |
![]() | |
double | init_temperature |
double | temperature_decay |
int | n_iter |
int | n_redo |
int | seed |
int | verbose |
bool | only_bit_flips |
bool | init_random |
Simulated annealing optimization algorithm for permutations.
Definition at line 98 of file PolysemousTraining.h.