Solver Algorithms Options

Rapido de agenta baskulado

Agordas la probablecon por individuo elekti la strategion Diferenca Evoluado.

Assume variables as non negative

Mark to force variables to be positive only.

DE: transkruca probablo

Defines the probability of the individual being combined with the globally best point. If crossover is not used, the point is assembled from the own memory of the individual.

DE: Skala faktoro

Dum transkruco, la skala faktoro decidos pri la "rapido" de moviĝo.

Lernaj cikloj

Defines the number of iterations, the algorithm should take. In each iteration, all individuals make a guess on the best solution and share their knowledge.

PS: Kogna konstanto

Sets the importance of the own memory (in particular the best reached point so far).

PS: Kuntira koeficiento

Defines the speed at which the particles/individuals move towards each other.

PS: Probablo de mutacio

Defines the probability, that instead of moving a component of the particle towards the best point, it randomly chooses a new value from the valid range for that variable.

PS: Socia konstanto

Sets the importance of the global best point between all particles/individuals.

Show Enhanced Solver Status

If enabled, an additional dialog is shown during the solving process which gives information about the current progress, the level of stagnation, the currently best known solution as well as the possibility, to stop or resume the solver.

Size of Swarm

Defines the number of individuals to participate in the learning process. Each individual finds its own solutions and contributes to the overall knowledge.

Stagnation Limit

If this number of individuals found solutions within a close range, the iteration is stopped and the best of these values is chosen as optimal.

Stagnation Tolerance

Defines in what range solutions are considered “similar”.

Use ACR Comparator

Se malŝaltita (apriore), la BCH-Komparilo estos uzata. Ĝi komparos du individuojn, unue konsiderante iliajn malobservojn de limigoj, kaj nur se ili estas egalaj, ĝi mezuras ilian aktualan solvon.

Se ŝaltita, la ACR-Komparilo estos uzata. Ĝi komparos du individuojn dependajn de la aktuala iteracio kaj ĝi mezuras ilian bonecon kun scio pri la plej malbonaj solvoj en la bibliotekoj (konsiderante iliajn malobservojn de limigoj).

Uzi hazardan komencan punkton

Se ŝaltita, simple plenigas la bibliotekon per hazarde elektitaj punktoj.

Se malŝaltita,enmetas en la bibliotekon, kiel referencan punkton, la aktuale ĉeestantajn valorojn (donitajn de la uzanto).

Variable Bounds Guessing

If enabled (default), the algorithm tries to find variable bounds by looking at the starting values.

Variable Bounds Threshold

When guessing variable bounds, this threshold specifies, how the initial values are shifted to build the bounds. For an example how these values are calculated, please refer to the Manual in the Wiki.

Assume variables as non negative

Mark to force variables to be positive only.

Lernaj cikloj

Defines the number of iterations, the algorithm should take. In each iteration, all individuals make a guess on the best solution and share their knowledge.

Show Enhanced Solver Status

If enabled, an additional dialog is shown during the solving process which gives information about the current progress, the level of stagnation, the currently best known solution as well as the possibility, to stop or resume the solver.

Grando de biblioteko

Defines the amount of information to store in the public library. Each individual stores knowledge there and asks for information.

Size of Swarm

Defines the number of individuals to participate in the learning process. Each individual finds its own solutions and contributes to the overall knowledge.

Stagnation Limit

If this number of individuals found solutions within a close range, the iteration is stopped and the best of these values is chosen as optimal.

Stagnation Tolerance

Defines in what range solutions are considered “similar”.

Use ACR Comparator

Variable Bounds Guessing

If enabled (default), the algorithm tries to find variable bounds by looking at the starting values.

Variable Bounds Threshold

When guessing variable bounds, this threshold specifies, how the initial values are shifted to build the bounds. For an example how these values are calculated, please refer to the Manual in the Wiki.

Assume variables as integers

Mark to force variables to be integers only.

Assume variables as non negative

Mark to force variables to be positive only.

Epsilon level

Epsilon level. Valid values are in range 0 (very tight) to 3 (very loose). Epsilon is the tolerance for rounding values to zero.

Limigi branĉ-kaj-liman profundon

Specifies the maximum branch-and-bound depth. A positive value means that the depth is absolute. A negative value means a relative branch-and-bound depth limit.

Solver time limit

Sets the maximum time for the algorithm to converge to a solution.

Assume variables as integers

Mark to force variables to be integers only.

Assume variables as non negative

Mark to force variables to be positive only.

Solver time limit

Sets the maximum time for the algorithm to converge to a solution.

Swarm algorithm

Set the swarm algorithm. 0 for differential evolution and 1 for particle swarm optimization. Default is 0.