| partial_pb_tabu_search | R Documentation |
Finds a single grouped balance by tabu search over a partition of selected
parts. The search is carried out on groups of parts defined by lI,
using configurable neighbourhood moves.
partial_pb_tabu_search(
X,
lI = NULL,
min_parts = 2,
max_parts = NULL,
iter = 100,
tabu_size = length(lI),
ini = NULL,
remove_active = TRUE,
add_left = TRUE,
add_right = TRUE,
flip_side = FALSE,
swap_zero = FALSE,
swap_sides = FALSE,
debug = FALSE,
constrained.criterion = "variance"
)
X |
A numeric matrix with strictly positive finite entries. Rows are observations and columns are compositional parts. |
lI |
A list defining a partition of a subset of the columns of
|
min_parts |
Integer. Minimum number of active groups. |
max_parts |
Integer or |
iter |
Integer. Maximum number of tabu search iterations. |
tabu_size |
Integer. Maximum size of the tabu list. |
ini |
Initial grouped split. If |
remove_active |
Logical. Allow moves from |
add_left |
Logical. Allow moves from |
add_right |
Logical. Allow moves from |
flip_side |
Logical. Allow direct moves from |
swap_zero |
Logical. Allow swaps between one active group and one inactive group, preserving the active side. |
swap_sides |
Logical. Allow swaps between one left group and one right group. |
debug |
Logical. If |
constrained.criterion |
Criterion used to initialise the constrained
balance when |
When ini = NULL, the constrained grouped balance is adjusted greedily
so that the initial solution has exactly max_parts active groups.
A list with the selected balance, its variance criterion, the search
path, and a neighbourhoods element recording the active
neighbourhood types.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.