There are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. These problems will cause overestimation of process time. Layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

This paper browses through some well-known meta-heuristic search strategies, and briefly discusses some of their recent applications to the VLSI layout design process. It starts with very brief description of the different phases of VLSI layout design, and a brief overview of Meta-Heuristic search strategies. Since most of the VLSI layout design problems are hard optimization problems, the conc...

Layout arrangement is important to achieve high productivity in flexible manufacturing system (FMS). This paper discusses the design of loop layout in FMS. The objective of the loop layout problem is the determination of the ordering of machines around a loop, to minimize the total number of loop traversals for a family of parts. This paper details the design, development and testing of particl...

Genetic Algorithms are widely used in many different optimization problems including layout design. The layout of the shelves play an important role in the total sales metrics for superstores since this affects the customers’ shopping behaviour. This paper employed a genetic algorithm based approach to design shelf layout of superstores. The layout design problem was tackled by using a novel ch...

This paper focuses on computer-based generative methods for layout problems in architecture and urban planning with special regard for the hierarchical structuring of layout elements. The generation of layouts takes place using evolutionary algorithms, which are used to optimize the arrangement of elements in terms of overlapping within a given boundary and the topological relations between the...

Research on the aesthetic layout of trees has been largely concerned with the special case of binary trees with small constant-sized nodes. Yet, without otherwise requiring the power of general graph-layout algorithms, many layout problems involve n-ary trees with variable-sized nodes. This paper addresses the general issue of the aesthetic layout of such trees. Two algorithms are presented for...

Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement...

the integration of an approximate model and a clonal selection algorithm (csa) is considered to one of the most effective ways to solve complex optimization design problems in engineering. in this study, first, a process for developing an approximate model and the principles of clonal selection algorithms were presented. then, a variotherm temperature injection mold used to produce a large liqu...