نتایج جستجو برای: facilities layout problems

تعداد نتایج: 674153  

Journal: :CoRR 2017
Hamide Ozlem Dalgic Erkan Bostanci Mehmet Serdar Güzel

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...

Journal: :AI EDAM 2012
Reinhard König Sven Schneider

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...

Journal: :Softw., Pract. Exper. 1993
Anthony Bloesch

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...

Journal: :SIAM J. Comput. 1999
Lenwood S. Heath Sriram V. Pemmaraju

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...

Journal: :international journal of advanced design and manufacturing technology 0
xiping li ningning gong tingwei ji

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...

Journal: :Computers & OR 2006
Alan R. McKendall Jin Shang

Today’s consumer market demands that manufacturers must be competitive. This requires the efficient operation of manufacturing plants and their ability to quickly respond to changes in product mix and demand. In addition, studies show that material handling cost make up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearrangin...

2000
Shinya Watanabe Tomoyuki Hiroyasu Mitsunori Miki

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...

2004
James Little Evgeny Selensky Christopher Beck

For manufacturing, management needs to make rapid, informed strategic decisions to react to changes in the market place. In many of these cases the decisions will give rise to a redesign of the manufacturing processes (layout, changes in product mix and volumes), which in turn changes the nature of the scheduling problems associated with the production facilities. However, the necessary skills ...

Journal: :CoRR 2017
Kevin K. H. Cheung Patrick D. Girardet

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. ...

Journal: :IJMR 2013
S. Selvakumar K. P. Arulshri K. P. Padmanaban

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید