Within each decision group \(G\), selection probabilities are computed from
pheromone levels \(\phi\) as:
$$p_i = \frac{\phi_i}{\sum_{j \in G} \phi_j}$$
If prob_min is enabled and any calculated probability falls below this value,
the algorithm:
Sets all probabilities below prob_min to prob_min.
Redistributes the remaining probability mass proportionally among
the other nodes in the same group.
This acts as a probability smoothing mechanism, preventing premature
convergence by ensuring all nodes retain some chance of being explored.