A lot of Metaheuristics for solving dynamic combinatorial facility layout problems have been developed, but still require much computation time when the number of facilities or planning horizon is large. Dynamic facility layout should meet a dynamic change in both product mix and demand quantity of each product over a planning horizon by adjusting facility layout effectively under a given syste...

Linear layout of graphs/digraphs is one of the classical and important optimization problems that have many practical applications. Recently Tamaki proposed an O(mn)-time and O(n)space algorithm for testing whether the pathwidth (or vertex separation) of a given digraph with n vertices and m edges is at most k. In this paper, we show that linear layout of digraphs with an objective function suc...

In early 2008 a new testing branch of the network analysis software visone has been made publicly available [Baur et al., 2008]. This realease includes the ability to process dynamic networks. A central feature is a dedicated dynamic layout algorithm which we present here from a methological and application oriented point of view. We first describe this algorithm from an algorithmic perspective...

Layout problems belong to NP-Complete problems theoretically. They are concerned more and more in recent years and arise in a variety of application fields such as the layout design of spacecraft modules, plant equipments, platforms of marine drilling well, shipping, vehicle and robots. The algorithms based on swarm intelligence are relatively effective to solve these kind of problems. But usua...

Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on a line or a circle, on a twoor three-dimensional lattice, etc. The goal is usually to place all the vertices so as to optimize some specified objective function. We develop co...

This paper seeks to raise awareness of some negative phenomena in science. It happens more and more frequently that somebody carries out research in one field but finds that the results are not strong enough for publication and then submits them to be published in a related but not identical field as an application. The Quadratic Assignment Problem (QAP) is known as one of the most difficult pr...

sheet metal components design and manufacture need a great deal of experience and know-how. strip layout design is usually done with trial and error until best design for strip layout is finally achieved. knowledge for the system is formulated from plasticity theories, experimental results, and the empirical knowledge of field experts. in this paper, an algorithm which can automatically design ...

Both the quality of the results of TEX s formula layout algorithm and the complexity of its description in the TEXbook are hard to beat The algorithm is verbally described as an imperative program with very complex control ow and complicated manipulations of the data structures representing formulae In a forthcoming textbook we describe TEX s formula layout algorithm as a functional program tra...

According to [1], the material handling cost comprises about 20-50% of the total operating cost of the facility layout. Typical research on facility layout concentrate on static layout problems where from-to charts are used to evaluate the layout. These layouts are not flexible enough to accommodate any future changes in production. Research on dynamic facility layout also has used the concept ...