“…It also resembles the mechanisms known from mixed integer programming (the branch and bound/cut algorithms). Furthermore, the decomposition reduces the amount of computational power required, as the length of each chromosome generated by the allocation algorithm is significantly shortened in comparison to previously utilised algorithms [12,13,30]. Therefore, a smaller size of population and less generations is required for the algorithm to converge to the neighbourhood of the solution.…”