We de ̄ne a new model for adjacency subgraph selection for the facility layout problem based on proximity and present some heuristics for its solution. The new model presents a more realistic representation of the problem than previous ones in that departments which are nonadjacent yet \close" to each other are compensated in the determination of the optimal adjacency subgraph. Empirical results...

This paper presents an Iterative Heuristic Algorithm and Branch and Bound Algorithm for optimal location of clusters on different levels. The use of cluster analysis is proposed for grouping highly related departments for both the methods. The vertical location problem is formulated for optimal location problem. Results obtained by both the algorithms are presented and compared in terms of trav...

The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. (SRFLP) is the one-dimensional version of the facility layout problem that seeks to arrange rectangular facilities so as to minimize the ove...

This paper develops a new mathematical model that integrates layout design and production planning to prescribe efficient multi-bay manufacturing facilities. The model addresses the need to distribute department replicas throughout the facility and extends the use of product and process requirements as problem parameters in order to increase process routing flexibility. In addition, the model a...

Abstract Aiming at the problem of facility layout in intelligent workshops, a collaborative optimization method and AGV path planning based on discrete event simulation (DES) is proposed. This can increase production capacity workshop by solving open-field (OFLP). First, to simplify complex constraints OFLP, mathematical programming model established. Second, hybrid algorithm proposed solve opt...