Optimal solutions for the double row layout problem

The double row layout problem is how to allocate a given set of n machines on both sides of a straight line corridor so that the total cost of transporting materials between machines is minimized. This is a very difficult combinatorial optimization problem with important applications in industry. We formulate the problem as a mixed‐integer program. Computational tests show that the proposed formulation presents a far superior performance than that of a previously published model.