A review of graph theory application to the facilities layout problem

On converting a dual graph into a block layout

“…I. Further details of the application of graph theory to the facilities layout problem can be found in Carrie et al (1978), Foulds (1983), Hassan and Hogg (1987) and Seppanen and Moore (1970). Steps (I) and (2) have been computerized; however, implementing the third step on the computer has been considered a difficult task (Giffin et al 1986).…”

An entropy-based algorithm to solve the facility layout design problem

“…Depending on the technique used for solving the layout problem, the solution can be graphically represented using the following models: topological [19], one-dimension geometric [20,21], twodimensional (the most common method referenced in the bibliography), multi-floor layout [22] based on genetic algorithms [23], and non-discrete models such as LOGIC [24] or MUSE [25].…”

A GRASP for graph planarization

“…A graph is said to be planar if it can be drawn on the Applications of graph planarization include graph plane in such a way that no two of its edges cross. Given drawing, such as in CASE tools [29], automated graphia graph G Å (V, E) with vertex set V and edge set E, the cal display systems, and numerous layout problems, such objective of graph planarization is to find a minimum as a circuit layout and a layout of industrial facilities cardinality subset of edges F ⊆ E such that the graph G [13]. A survey of some of these applications is given in Å (V, E"F) resulting from the removal of the edges F Mutzel [21].…”