An Efficient Model for Layout Problems

This paper offers an approach that could be useful for mathematical n, programming of diverse types of layout problems or even area allocation problems. By this approach, there is no need to large number of discrete variables. So large-scale layout problems could be modeled only by few continues variables. So they could be solved in polynomial time. This result has come from dividing area into discrete and continuous dimensions. In addition, defining decision variables as starting and finishing point of departments in the area makes it possible to model layout problem so. This paper also provides new technique that models basic constraints of layout problems. Note to Practitioners: This paper provides a novel approach for designing facility layout and helps to select the most suitable layout for different production types and demands sizes. Therefore, a modeling approach proposed which designed the layout in a flexible way that discovers the near optimum solution for layout problem and omits other presumptions about layout planning.

Keywords:

Location , Facility layout problem , Large-scale optimization , Mathematical programming , area allocation ,