The block layout shortest loop design problem

The purpose of this article is to formulate and solve a shortest loop probl em associated with the design of material flow handling systems in factorie s. The problem is formulated as an Integer Linear Program (ILP) initially c ontaining a very large number of constraints. Several simplifications are p roposed in order to reduce the problem to a size amenable by standard ILP s olvers. Computational results confirm the efficiency and practicality of th e proposed approach.