Group

individual_from_group_closest(
    inst,
    jointprobaA,
    jointprobaB
)
individual_from_group_closest(
    inst,
    jointprobaA,
    jointprobaB,
    percent_closest
)

Sequentially assign the modality of the individuals to that of the closest neighbor in the other base until the joint probability values are met

individual_from_group_optimal(
    inst,
    jointprobaA,
    jointprobaB
)
individual_from_group_optimal(
    inst,
    jointprobaA,
    jointprobaB,
    percent_closest
)

Solve an optimization problem to get the individual transport that minimizes total distance while satisfying the joint probability computed by the model by group

ot_group(inst)
ot_group(inst, percent_closest)
ot_group(inst, percent_closest, maxrelax)
ot_group(inst, percent_closest, maxrelax, indiv_method)
ot_group(
    inst,
    percent_closest,
    maxrelax,
    indiv_method,
    full_disp
)
ot_group(
    inst,
    percent_closest,
    maxrelax,
    indiv_method,
    full_disp,
    solver_disp
)

Model of group transport

• percent_closest: percent of closest neighbors taken in the computation of the costs
• maxrelax: maximum percentage of deviation from expected probability masses
• indiv_method: specifies the method used to get individual transport from group joint probabilities
• full_disp: if true, write the transported value of each individual; otherwise, juste write the number of missed transports
• solver_disp: if false, do not display the outputs of the solver