optimality, a branch-and-cut algorithm has been developed and implemented. Extensive numerical experiments have been conducted in … order to evaluate the algorithm and to gain insights into the problem structure. The corresponding results show that the … algorithm is able to solve instances with up to 50 locations to optimality and that it reduces the computing time by 87 …

a delivery section and a pickup section and (ii) loading at the long side. A hybrid algorithm is proposed for the 3L …

iterated local search algorithm is designed for the simultaneous solution of the subproblems. By means of extensive numerical …