This is a preliminary study in which we use a genetic algorithm (GA) to breed normalized postfix expressions for solving the facility layout problem (FLP). Our technique, initially developed for VLSI floorplanning, simultaneously places rectangles onto a planar site and optimizes area utilization by altering the shapes of facilities that have fixed area but flexible height and width dimensions....

The efficiency of desktop publishing is severely limited by the lack of sophisticated automatic document layout systems. State-of-the-art algorithms either require the input to be written in a description language such as HTML and LATEX, or to be a manually designed layout template. However, description languages are ill-suited to express layout problems with weak semantics and layout templates...

Semiconductor manufacturing is an important component of the U.S. manufacturing industry. Most of today’s fabrication facilities and those being designed for the near future use a bay layout configuration and an overhead monorail system for moving material between bays. These material handling systems are usually designed with a spine or perimeter type of configuration. This paper investigates ...

Small and medium industry engaged in fast food. Currently, the layout of facilities at production site is experiencing problems related to distance material movement. This study aims redesign facility make suggestions trade business minimize movement it more comfortable efficient. The method used process redesigning UD. ARSHAINDO use FTC (From To Chart) method. From Chart a that can help solve ...

Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...

This work deals with bounds on the cost of layout problems for lattice graphs and random lattice graphs. Our main result in this paper is a convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process. This result can be viewed as an analogue ...

This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function incremen...

As a typical discrete element dynamic system (DEDS), railway container hub scheduling system has the characteristic of high randomness, low flexibility, uncertainty of operation time and high coordination demand of facilities. In this paper, according to the analysis of layout, establishment, facility and operation procedure of railway container hub, we choose Multiagent systems (MAS) which hav...

One of the most difficult problems that face researchers experimenting with complex systems in real world applications is the Facility Layout Design Problem. It relies with the design and location of production lines, machinery and equipment, inventory storage and shipping facilities. In this work it is intended to address this problem through the use of Constraint Logic Programming (CLP) techn...

Spacecraft autonomy is becoming an increasingly important technology. Yet the very nature of autonomy − on-board decision making and largely unattended operation − makes it important that such systems be thoroughly tested and validated. We are developing software visualization tools to assist in the validation process. The tools, which are designed to facilitate human problem solving, combine g...