In this paper, a parallel evolutionary multi-criteria optimization algorithm: DGA and DRMOGA are applied to block layout problems. The results are compared to the results of SGA and discussed. Because block layout problems are NP hard and can have several types of objectives, these problems are suitable to evolutionary multicriterion optimization algorithms. DRMOGA is a DGA model that can deriv...

Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...

Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approximating layout problems on random graphs Discrete Mathematics, 235, 2001, 245–253), we show that several well-known graph layout problems are approximable to within a factor arbitrarily close to 1 of the optimal with high probability for random graphs drawn from an ErdösRenyi distribution with appropriate sparsity conditions. ...

Genetic algorithm (GA) is proven to be a useful technique in solving optimization problems in engineering. Fixture design has a large solution space and requires a search tool to find the best design. Few researchers have used the GAs for fixture design and fixture layout problems. Either separately (Kulankara et al 2002) or along with FEM, GA has been used for fixture layout and clamping force...

In random geometric graphs, vertices are randomly distributed on [0, 1] and pairs of vertices are connected by edges whenever they are sufficiently close together. Layout problems seek a linear ordering of the vertices of a graph such that a certain measure is minimized. In this paper, we study several layout problems on random geometric graphs: Bandwidth, Minimum Linear Arrangement, Minimum Cu...