This paper addresses a DRAYAGE problem, which is motivated by the case study of a real carrier. Its trucks carry one or twocontainers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can beefficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arcformulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in anenlarged set of feasible routes and can increase savings w. r. t. the policy currently employed by the carrier.