|
solver
1.0
|
This namespace encapsulates various external variables related to the program settings. More...
Variables | |
| string | DATASET_FILE = DEFAULT_DATASET_FILE |
| Dataset with problems to be solved. | |
| bool | VERBOSE = DEFAULT_VERBOSE |
| Boolean flag determining verbosity of the program. | |
| uint32_t | NUMBER_OF_SEGMENTS = DEFAULT_NUMBER_OF_SEGMENTS |
| By how many segments (linear pieces) the energy function of the movement is approximated. | |
| uint32_t | NUMBER_OF_THREADS = max(1u, thread::hardware_concurrency()) |
| Maximal number of threads to be used. | |
| double | MAX_RUNTIME = DEFAULT_MAX_RUNTIME |
| Maximal run time of the solver. | |
| bool | USE_HEURISTICS = false |
| The variable indicates whether the heuristic should be used. | |
| bool | USE_EXACT_ALGORITHM = false |
| The variable indicates whether the exact algorithm should be used. | |
| string | RESULTS_DIRECTORY = DEFAULT_RESULTS_DIRECTORY |
| If not empty, then the optimization results will be written to this directory. | |
| double | ILP_RELATIVE_GAP = DEFAULT_ILP_RELATIVE_GAP |
| If a given relative gap from the best known lower bound is achieved, then the solver stops. | |
| bool | CALCULATE_LOWER_BOUND = DEFAULT_CALCULATE_LOWER_BOUND |
| Indicates whether a tight lower bound should be calculated. | |
| double | RUNTIME_OF_LOWER_BOUND = DEFAULT_RUNTIME_OF_LOWER_BOUND |
| Time limit for the tight lower bound. | |
| uint32_t | MAX_ELITE_SOLUTIONS = DEFAULT_MAX_ELITE_SOLUTIONS |
| The number of top solutions maintained by the heuristic. | |
| uint32_t | MAX_ALTERNATIVES = DEFAULT_MAX_ALTERNATIVES |
| The maximal number of alternative orders generated for each robot. | |
| uint32_t | MIN_ITERS_PER_TUPLE = DEFAULT_MIN_ITERS_PER_TUPLE |
| The minimal number of optimization iterations per each tuple. | |
This namespace encapsulates various external variables related to the program settings.
1.8.9.1