The purpose of this article is to formulate and solve a shortest loop problem associated with the design of material flow handling systems in factories. The problem is formulated as an integer linear program (ILP) initially containing a very large number of constraints. Several simplifications are proposed in order to reduce the problem to a size amenable by standard ILP solvers. Computational results confirm the efficiency and practicality of the proposed approach.