The double row layout problem

Abstract

This research explores the double row layout problem (DRLP) that deals with how to place departments or machines on both sides of a central corridor. This type of layout problem is commonly observed in production and service facilities. Over the last 40 years, researchers have extensively studied a similar problem called the single row layout problem (SRLP) or one dimensional space allocation problem (ODSAP); as a result, several practical approaches are currently available for the problem. However, the DRLP has not received much attention in the literature although it often provides a better structure for layout designers. In this research, we first develop an MIP model for the DRLP that involves more variables and constraints than existing formulations of the SRLP. In turn, conditions yielding a good solution are analysed based on the proposed model. Five heuristic algorithms are developed to provide a reasonably good initial solution and corresponding upper bound of the DRLP. The performance of these heuristic algorithms, as well as MIP solutions by CPLEX 10.2, is compared in a series of experiments.