Heuristics for a new model of facility layout

We define a new model for facility layout and present some heuristics for its solution. The model presents a more realistic representation of the problem than previous ones in that facilities which are nonadjacent yet “close” to each other are compensated in the determination of the optimal adjacency subgraph. Empirical results comparing the heuristics with the method of Leung [11] are also reported.